%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL304-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:12:23 PM UTC 2026
% Result : Unsatisfiable 21.06s 3.74s
% Output : CNFRefutation 21.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of clauses : 76 ( 35 unt; 0 nHn; 38 RR)
% Number of literals : 133 ( 7 equ; 66 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 12 ( 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 : 151 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(implies(p,q),equivalent(q,or(p,q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_11,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_18,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_21,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_23,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_24,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_26,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_28,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_23,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_29,plain,
( ~ axiom(or(X1,or(not(X3),X2)))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_30,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_31,plain,
( ~ axiom(or(X1,or(or(X1,X2),X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_32,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
~ theorem(equivalent(implies(p,q),equivalent(q,or(p,q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_35,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_36,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_37,plain,
( ~ theorem(X2)
| theorem(or(not(or(X1,not(X2))),X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_39,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ theorem(equivalent(implies(p,q),equivalent(q,or(p,q)))),
c_0_34 ).
cnf(c_0_42,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_35,c_0_13]),c_0_13]),c_0_36]) ).
cnf(c_0_43,plain,
( ~ theorem(X2)
| ~ theorem(or(X1,not(X2)))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_44,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( ~ axiom(or(X2,or(not(X4),X3)))
| ~ theorem(or(X1,X4))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_40,c_0_24]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_13]),c_0_42]),c_0_42]) ).
cnf(c_0_47,plain,
( ~ theorem(X2)
| ~ theorem(X1)
| theorem(not(or(not(X1),not(X2)))) ),
inference(spm,[status(thm)],[c_0_43,c_0_37]) ).
cnf(c_0_48,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_40,c_0_44]) ).
cnf(c_0_49,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_50,negated_conjecture,
( ~ theorem(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))
| ~ theorem(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( ~ theorem(or(X2,X1))
| theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_52,plain,
( ~ theorem(X3)
| ~ theorem(or(X1,or(X2,not(X3))))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_37]) ).
cnf(c_0_53,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(not(or(X2,not(X3))),X2))) ),
inference(spm,[status(thm)],[c_0_45,c_0_30]) ).
cnf(c_0_54,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_49,c_0_44]) ).
cnf(c_0_55,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_56,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X1,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
cnf(c_0_57,negated_conjecture,
( ~ theorem(or(or(not(p),q),or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))
| ~ theorem(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,plain,
( ~ theorem(X2)
| ~ theorem(or(X1,X3))
| theorem(or(X1,not(or(not(X2),not(X3))))) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_21,c_0_54]) ).
cnf(c_0_60,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_55]) ).
cnf(c_0_61,plain,
( ~ theorem(or(X1,X2))
| ~ theorem(or(not(X3),X4))
| theorem(or(X1,or(not(or(not(X2),X3)),X4))) ),
inference(spm,[status(thm)],[c_0_40,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( ~ theorem(or(not(or(not(p),q)),or(not(or(p,q)),q)))
| ~ theorem(or(or(not(p),q),or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_63,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_60]) ).
cnf(c_0_64,plain,
( ~ theorem(or(X4,X1))
| ~ theorem(or(not(X2),X3))
| theorem(or(or(not(or(not(X1),X2)),X3),X4)) ),
inference(spm,[status(thm)],[c_0_38,c_0_61]) ).
cnf(c_0_65,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_21,c_0_39]) ).
cnf(c_0_66,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_16]) ).
cnf(c_0_67,negated_conjecture,
( ~ theorem(or(or(not(p),q),not(or(not(or(p,q)),q))))
| ~ theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))) ),
inference(spm,[status(thm)],[c_0_62,c_0_60]) ).
cnf(c_0_68,plain,
( ~ theorem(or(X3,X1))
| ~ theorem(or(not(X2),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,plain,
theorem(or(or(not(or(X1,X2)),X2),X1)),
inference(spm,[status(thm)],[c_0_38,c_0_65]) ).
cnf(c_0_70,plain,
( ~ theorem(or(X3,X1))
| theorem(or(not(or(not(X1),X2)),or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_71,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_66,c_0_30]) ).
cnf(c_0_72,negated_conjecture,
~ theorem(or(or(not(p),q),not(or(not(or(p,q)),q)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_59]),c_0_69])]) ).
cnf(c_0_73,plain,
( ~ theorem(or(X1,X3))
| theorem(or(or(X1,X2),not(or(not(X3),X2)))) ),
inference(spm,[status(thm)],[c_0_38,c_0_70]) ).
cnf(c_0_74,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_71,c_0_59]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL304-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.51 % Computer : n018.cluster.edu
% 0.19/0.51 % Model : x86_64 x86_64
% 0.19/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.51 % Memory : 8046.5625MB
% 0.19/0.51 % OS : Linux 6.8.0-71-generic
% 0.19/0.51 % CPULimit : 300
% 0.19/0.51 % WCLimit : 300
% 0.19/0.51 % DateTime : Mon Sep 21 00:21:43 UTC 2026
% 0.19/0.52 % CPUTime :
% 0.19/0.52 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.59 Running first-order theorem proving
% 0.19/0.59 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 21.06/3.74 % Version: 3.5.1
% 21.06/3.74 % Preprocessing class: FSSSSMSSSSSNFFN.
% 21.06/3.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.06/3.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 21.06/3.74 % Starting new_bool_3 with 300s (1) cores
% 21.06/3.74 % Starting new_bool_1 with 300s (1) cores
% 21.06/3.74 % Starting sh5l with 300s (1) cores
% 21.06/3.74 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 568552 completed with status 0
% 21.06/3.74 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 21.06/3.74 % Preprocessing class: FSSSSMSSSSSNFFN.
% 21.06/3.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.06/3.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 21.06/3.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 21.06/3.74 % No SInE strategy applied
% 21.06/3.74 % Search class: FHUNM-FFSF21-DFFFFFNN
% 21.06/3.74 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 21.06/3.74 % Starting SubtermCWHack with 151s (1) cores
% 21.06/3.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 21.06/3.74 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 21.06/3.74 % Starting new_bool_3 with 329s (1) cores
% 21.06/3.74 % Starting new_bool_1 with 291s (1) cores
% 21.06/3.74 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 568557 completed with status 0
% 21.06/3.74 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 21.06/3.74 % Preprocessing class: FSSSSMSSSSSNFFN.
% 21.06/3.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.06/3.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 21.06/3.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 21.06/3.74 % No SInE strategy applied
% 21.06/3.74 % Search class: FHUNM-FFSF21-DFFFFFNN
% 21.06/3.74 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 21.06/3.74 % Starting SubtermCWHack with 151s (1) cores
% 21.06/3.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 21.06/3.74 % Preprocessing time : 0.076 s
% 21.06/3.74
% 21.06/3.74 % Proof found!
% 21.06/3.74 % SZS status Unsatisfiable
% 21.06/3.74 % SZS output start CNFRefutation
% See solution above
% 21.06/3.74 % Parsed axioms : 11
% 21.06/3.74 % Removed by relevancy pruning/SinE : 0
% 21.06/3.74 % Initial clauses : 11
% 21.06/3.74 % Removed in clause preprocessing : 3
% 21.06/3.74 % Initial clauses in saturation : 8
% 21.06/3.74 % Processed clauses : 6392
% 21.06/3.74 % ...of these trivial : 26
% 21.06/3.74 % ...subsumed : 3639
% 21.06/3.74 % ...remaining for further processing : 2727
% 21.06/3.74 % Other redundant clauses eliminated : 0
% 21.06/3.74 % Clauses deleted for lack of memory : 0
% 21.06/3.74 % Backward-subsumed : 1071
% 21.06/3.74 % Backward-rewritten : 69
% 21.06/3.74 % Generated clauses : 99485
% 21.06/3.74 % ...of the previous two non-redundant : 98795
% 21.06/3.74 % ...aggressively subsumed : 0
% 21.06/3.74 % Contextual simplify-reflections : 55
% 21.06/3.74 % Paramodulations : 99485
% 21.06/3.74 % Factorizations : 0
% 21.06/3.74 % NegExts : 0
% 21.06/3.74 % Equation resolutions : 0
% 21.06/3.74 % Disequality decompositions : 0
% 21.06/3.74 % Total rewrite steps : 989
% 21.06/3.74 % ...of those cached : 855
% 21.06/3.74 % Propositional unsat checks : 0
% 21.06/3.74 % Propositional check models : 0
% 21.06/3.74 % Propositional check unsatisfiable : 0
% 21.06/3.74 % Propositional clauses : 0
% 21.06/3.74 % Propositional clauses after purity: 0
% 21.06/3.74 % Propositional unsat core size : 0
% 21.06/3.74 % Propositional preprocessing time : 0.000
% 21.06/3.74 % Propositional encoding time : 0.000
% 21.06/3.74 % Propositional solver time : 0.000
% 21.06/3.74 % Success case prop preproc time : 0.000
% 21.06/3.74 % Success case prop encoding time : 0.000
% 21.06/3.74 % Success case prop solver time : 0.000
% 21.06/3.74 % Current number of processed clauses : 1587
% 21.06/3.74 % Positive orientable unit clauses : 35
% 21.06/3.74 % Positive unorientable unit clauses: 0
% 21.06/3.74 % Negative unit clauses : 74
% 21.06/3.74 % Non-unit-clauses : 1478
% 21.06/3.74 % Current number of unprocessed clauses: 91766
% 21.06/3.74 % ...number of literals in the above : 364069
% 21.06/3.74 % Current number of archived formulas : 0
% 21.06/3.74 % Current number of archived clauses : 1143
% 21.06/3.74 % Clause-clause subsumption calls (NU) : 886881
% 21.06/3.74 % Rec. Clause-clause subsumption calls : 622500
% 21.06/3.74 % Non-unit clause-clause subsumptions : 3220
% 21.06/3.74 % Unit Clause-clause subsumption calls : 22380
% 21.06/3.74 % Rewrite failures with RHS unbound : 0
% 21.06/3.74 % BW rewrite match attempts : 2192
% 21.06/3.74 % BW rewrite match successes : 4
% 21.06/3.74 % Condensation attempts : 0
% 21.06/3.74 % Condensation successes : 0
% 21.06/3.74 % Termbank termtop insertions : 2144363
% 21.06/3.74 % Search garbage collected termcells : 11
% 21.06/3.74
% 21.06/3.74 % -------------------------------------------------
% 21.06/3.74 % User time : 2.907 s
% 21.06/3.74 % System time : 0.110 s
% 21.06/3.74 % Total time : 3.017 s
% 21.06/3.74 % Maximum resident set size: 3644 pages
% 21.06/3.74
% 21.06/3.74 % -------------------------------------------------
% 21.06/3.74 % User time : 14.455 s
% 21.06/3.74 % System time : 0.563 s
% 21.06/3.74 % Total time : 15.018 s
% 21.06/3.74 % Maximum resident set size: 4864 pages
% 21.06/3.74 % E exiting
%------------------------------------------------------------------------------