TSTP Solution File: LCL300-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL300-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:45:56 EDT 2024
% Result : Unsatisfiable 8.24s 1.61s
% Output : CNFRefutation 8.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of clauses : 75 ( 31 unt; 0 nHn; 41 RR)
% Number of literals : 135 ( 7 equ; 70 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 136 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(implies(not(p),not(q)),or(p,not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_18,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_20,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_22,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_23,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_24,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_25,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_26,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_27,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_28,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_32,plain,
( theorem(or(not(or(X1,X2)),X1))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_33,plain,
( theorem(or(X1,X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_35,negated_conjecture,
~ theorem(equivalent(implies(not(p),not(q)),or(p,not(q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_36,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_37,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_38,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_39,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
cnf(c_0_40,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_41,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_42,negated_conjecture,
~ theorem(equivalent(implies(not(p),not(q)),or(p,not(q)))),
c_0_35 ).
cnf(c_0_43,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_13]),c_0_13]),c_0_37]) ).
cnf(c_0_44,plain,
( theorem(X1)
| ~ theorem(or(X1,X2))
| ~ theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_45,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_39,c_0_16]) ).
cnf(c_0_46,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_40]) ).
cnf(c_0_47,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_30,c_0_41]) ).
cnf(c_0_48,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_49,negated_conjecture,
~ theorem(not(or(not(or(not(or(not(not(p)),not(q))),or(p,not(q)))),not(or(not(or(p,not(q))),or(not(not(p)),not(q))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_13]),c_0_43]) ).
cnf(c_0_50,plain,
( theorem(not(or(X1,X2)))
| ~ theorem(or(not(X2),X1))
| ~ theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_32]) ).
cnf(c_0_51,plain,
( theorem(or(not(X1),X2))
| ~ theorem(not(or(X3,X1))) ),
inference(spm,[status(thm)],[c_0_45,c_0_28]) ).
cnf(c_0_52,plain,
( theorem(not(or(not(X1),not(X1))))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_26]) ).
cnf(c_0_53,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_47]) ).
cnf(c_0_54,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_48,c_0_13]) ).
cnf(c_0_55,negated_conjecture,
( ~ theorem(or(not(not(or(not(or(p,not(q))),or(not(not(p)),not(q))))),not(or(not(or(not(not(p)),not(q))),or(p,not(q))))))
| ~ theorem(not(not(or(not(or(not(not(p)),not(q))),or(p,not(q)))))) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_57,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
( theorem(not(not(X1)))
| ~ theorem(or(not(X2),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_53]) ).
cnf(c_0_59,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( ~ theorem(not(not(or(not(or(not(not(p)),not(q))),or(p,not(q))))))
| ~ theorem(not(not(or(not(or(p,not(q))),or(not(not(p)),not(q)))))) ),
inference(spm,[status(thm)],[c_0_55,c_0_33]) ).
cnf(c_0_61,plain,
( theorem(not(not(X1)))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
( theorem(not(not(X1)))
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_16]) ).
cnf(c_0_63,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_59,c_0_16]) ).
cnf(c_0_64,negated_conjecture,
( ~ theorem(not(not(or(not(or(p,not(q))),or(not(not(p)),not(q))))))
| ~ theorem(or(not(or(not(not(p)),not(q))),or(p,not(q)))) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
( theorem(not(not(or(X1,or(X2,X3)))))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_62,c_0_54]) ).
cnf(c_0_66,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
( ~ theorem(or(not(or(not(not(p)),not(q))),or(p,not(q))))
| ~ theorem(or(not(not(p)),or(not(or(p,not(q))),not(q)))) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X2)))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_66,c_0_19]) ).
cnf(c_0_69,negated_conjecture,
~ theorem(or(not(not(p)),or(not(or(p,not(q))),not(q)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_47])]) ).
cnf(c_0_70,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_53]) ).
cnf(c_0_71,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_59,c_0_20]) ).
cnf(c_0_72,negated_conjecture,
~ theorem(or(or(not(or(p,not(q))),not(q)),p)),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
( theorem(or(or(not(or(X1,X2)),X3),X1))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL300-3 : TPTP v8.2.0. Released v2.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 00:58:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.24/1.61 # Version: 3.1.0
% 8.24/1.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.24/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.24/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.24/1.61 # Starting new_bool_3 with 300s (1) cores
% 8.24/1.61 # Starting new_bool_1 with 300s (1) cores
% 8.24/1.61 # Starting sh5l with 300s (1) cores
% 8.24/1.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20999 completed with status 0
% 8.24/1.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.24/1.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.24/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.24/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.24/1.61 # No SInE strategy applied
% 8.24/1.61 # Search class: FHUNM-FFSF21-DFFFFFNN
% 8.24/1.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.24/1.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 8.24/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.24/1.61 # Starting new_bool_3 with 296s (1) cores
% 8.24/1.61 # Starting new_bool_1 with 291s (1) cores
% 8.24/1.61 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 8.24/1.61 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 21010 completed with status 0
% 8.24/1.61 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.24/1.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.24/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.24/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.24/1.61 # No SInE strategy applied
% 8.24/1.61 # Search class: FHUNM-FFSF21-DFFFFFNN
% 8.24/1.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.24/1.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 8.24/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.24/1.61 # Starting new_bool_3 with 296s (1) cores
% 8.24/1.61 # Starting new_bool_1 with 291s (1) cores
% 8.24/1.61 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 8.24/1.61 # Preprocessing time : 0.001 s
% 8.24/1.61 # Presaturation interreduction done
% 8.24/1.61
% 8.24/1.61 # Proof found!
% 8.24/1.61 # SZS status Unsatisfiable
% 8.24/1.61 # SZS output start CNFRefutation
% See solution above
% 8.24/1.61 # Parsed axioms : 11
% 8.24/1.61 # Removed by relevancy pruning/SinE : 0
% 8.24/1.61 # Initial clauses : 11
% 8.24/1.61 # Removed in clause preprocessing : 3
% 8.24/1.61 # Initial clauses in saturation : 8
% 8.24/1.61 # Processed clauses : 12699
% 8.24/1.61 # ...of these trivial : 175
% 8.24/1.61 # ...subsumed : 10566
% 8.24/1.61 # ...remaining for further processing : 1958
% 8.24/1.61 # Other redundant clauses eliminated : 0
% 8.24/1.61 # Clauses deleted for lack of memory : 0
% 8.24/1.61 # Backward-subsumed : 229
% 8.24/1.61 # Backward-rewritten : 14
% 8.24/1.61 # Generated clauses : 94667
% 8.24/1.61 # ...of the previous two non-redundant : 89980
% 8.24/1.61 # ...aggressively subsumed : 0
% 8.24/1.61 # Contextual simplify-reflections : 13
% 8.24/1.61 # Paramodulations : 94667
% 8.24/1.61 # Factorizations : 0
% 8.24/1.61 # NegExts : 0
% 8.24/1.61 # Equation resolutions : 0
% 8.24/1.61 # Disequality decompositions : 0
% 8.24/1.61 # Total rewrite steps : 4874
% 8.24/1.61 # ...of those cached : 4339
% 8.24/1.61 # Propositional unsat checks : 0
% 8.24/1.61 # Propositional check models : 0
% 8.24/1.61 # Propositional check unsatisfiable : 0
% 8.24/1.61 # Propositional clauses : 0
% 8.24/1.61 # Propositional clauses after purity: 0
% 8.24/1.61 # Propositional unsat core size : 0
% 8.24/1.61 # Propositional preprocessing time : 0.000
% 8.24/1.61 # Propositional encoding time : 0.000
% 8.24/1.61 # Propositional solver time : 0.000
% 8.24/1.61 # Success case prop preproc time : 0.000
% 8.24/1.61 # Success case prop encoding time : 0.000
% 8.24/1.61 # Success case prop solver time : 0.000
% 8.24/1.61 # Current number of processed clauses : 1707
% 8.24/1.61 # Positive orientable unit clauses : 112
% 8.24/1.61 # Positive unorientable unit clauses: 0
% 8.24/1.61 # Negative unit clauses : 66
% 8.24/1.61 # Non-unit-clauses : 1529
% 8.24/1.61 # Current number of unprocessed clauses: 76245
% 8.24/1.61 # ...number of literals in the above : 210694
% 8.24/1.61 # Current number of archived formulas : 0
% 8.24/1.61 # Current number of archived clauses : 254
% 8.24/1.61 # Clause-clause subsumption calls (NU) : 458171
% 8.24/1.61 # Rec. Clause-clause subsumption calls : 424704
% 8.24/1.61 # Non-unit clause-clause subsumptions : 10176
% 8.24/1.61 # Unit Clause-clause subsumption calls : 4164
% 8.24/1.61 # Rewrite failures with RHS unbound : 0
% 8.24/1.61 # BW rewrite match attempts : 6202
% 8.24/1.61 # BW rewrite match successes : 14
% 8.24/1.61 # Condensation attempts : 0
% 8.24/1.61 # Condensation successes : 0
% 8.24/1.61 # Termbank termtop insertions : 1448316
% 8.24/1.61 # Search garbage collected termcells : 11
% 8.24/1.61
% 8.24/1.61 # -------------------------------------------------
% 8.24/1.61 # User time : 0.998 s
% 8.24/1.61 # System time : 0.039 s
% 8.24/1.61 # Total time : 1.037 s
% 8.24/1.61 # Maximum resident set size: 1660 pages
% 8.24/1.61
% 8.24/1.61 # -------------------------------------------------
% 8.24/1.61 # User time : 4.975 s
% 8.24/1.61 # System time : 0.115 s
% 8.24/1.61 # Total time : 5.090 s
% 8.24/1.61 # Maximum resident set size: 1716 pages
% 8.24/1.61 % E---3.1 exiting
% 8.24/1.61 % E exiting
%------------------------------------------------------------------------------