-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbarber_exercise.out
122 lines (88 loc) · 3.48 KB
/
barber_exercise.out
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
============================== Prover9 ===============================
Prover9 (64) version 2009-11A, November 2009.
Process 64782 was started by qwang on grid01,
Fri May 31 17:38:09 2019
The command was "prover9 -f barber_exercise.in".
============================== end of head ===========================
============================== INPUT =================================
% Reading from file barber_exercise.in
formulas(sos).
-B(x) | S(y,y) | S(x,y).
-B(x) | -S(y,y) | -S(x,y).
B(c1).
end_of_list.
formulas(goals).
end_of_list.
============================== end of input ==========================
============================== PROCESS NON-CLAUSAL FORMULAS ==========
% Formulas that are not ordinary clauses:
============================== end of process non-clausal formulas ===
============================== PROCESS INITIAL CLAUSES ===============
% Clauses before input processing:
formulas(usable).
end_of_list.
formulas(sos).
-B(x) | S(y,y) | S(x,y). [assumption].
-B(x) | -S(y,y) | -S(x,y). [assumption].
B(c1). [assumption].
end_of_list.
formulas(demodulators).
end_of_list.
============================== PREDICATE ELIMINATION =================
Eliminating B/1
1 B(c1). [assumption].
2 -B(x) | S(y,y) | S(x,y). [assumption].
3 -B(x) | -S(y,y) | -S(x,y). [assumption].
Derived: S(x,x) | S(c1,x). [resolve(1,a,2,a)].
Derived: -S(x,x) | -S(c1,x). [resolve(1,a,3,a)].
============================== end predicate elimination =============
Auto_denials: (non-Horn, no changes).
Term ordering decisions:
Predicate symbol precedence: predicate_order([ S ]).
Function symbol precedence: function_order([ c1 ]).
After inverse_order: (no changes).
Unfolding symbols: (none).
Auto_inference settings:
% set(binary_resolution). % (non-Horn)
% set(neg_ur_resolution). % (non-Horn, less than 100 clauses)
Auto_process settings:
% set(factor). % (non-Horn)
% set(unit_deletion). % (non-Horn)
kept: 4 S(x,x) | S(c1,x). [resolve(1,a,2,a)].
kept: 5 -S(x,x) | -S(c1,x). [resolve(1,a,3,a)].
kept: 6 S(c1,c1). [factor(4,a,b)].
-------- Proof 1 --------
============================== PROOF =================================
% Proof 1 at 0.00 (+ 0.00) seconds.
% Length of proof is 7.
% Level of proof is 3.
% Maximum clause weight is 6.000.
% Given clauses 0.
1 B(c1). [assumption].
2 -B(x) | S(y,y) | S(x,y). [assumption].
3 -B(x) | -S(y,y) | -S(x,y). [assumption].
4 S(x,x) | S(c1,x). [resolve(1,a,2,a)].
5 -S(x,x) | -S(c1,x). [resolve(1,a,3,a)].
6 S(c1,c1). [factor(4,a,b)].
7 $F. [factor(5,a,b),unit_del(a,6)].
============================== end of proof ==========================
============================== STATISTICS ============================
Given=0. Generated=4. Kept=3. proofs=1.
Usable=0. Sos=1. Demods=0. Limbo=2, Disabled=5. Hints=0.
Kept_by_rule=0, Deleted_by_rule=0.
Forward_subsumed=0. Back_subsumed=0.
Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0.
New_demodulators=0 (0 lex), Back_demodulated=0. Back_unit_deleted=0.
Demod_attempts=0. Demod_rewrites=0.
Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=1.
Megabytes=0.03.
User_CPU=0.00, System_CPU=0.00, Wall_clock=0.
============================== end of statistics =====================
============================== end of search =========================
THEOREM PROVED
THEOREM PROVED
Exiting with 1 proof.
------ process 64782 exit (max_proofs) ------
Process 64782 exit (max_proofs) Fri May 31 17:38:09 2019