%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL448+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:48 PM UTC 2026
% Result : Theorem 11.48s 2.78s
% Output : CNFRefutation 11.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 61 ( 30 unt; 0 def)
% Number of atoms : 118 ( 4 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 101 ( 44 ~; 40 |; 9 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 13 con; 0-2 aty)
% Number of variables : 94 ( 9 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(r5,axiom,
( r5
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r5) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(implies(X1,X2))
& is_a_theorem(X1) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(principia_r5,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r5) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(r1,axiom,
( r1
<=> ! [X4] : is_a_theorem(implies(or(X4,X4),X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r1) ).
fof(principia_r4,conjecture,
r4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r4) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).
fof(principia_r1,axiom,
r1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r1) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(r4,axiom,
( r4
<=> ! [X4,X5,X6] : is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r4) ).
fof(c_0_14,plain,
! [X111,X112,X113] :
( ( r5
| ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0)))) )
& ( is_a_theorem(implies(implies(X112,X113),implies(or(X111,X112),or(X111,X113))))
| ~ r5 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])])]) ).
fof(c_0_15,plain,
! [X123,X124] :
( implies(X123,X124) = or(not(X123),X124)
| ~ op_implies_or ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])])]) ).
fof(c_0_16,plain,
! [X7,X8] :
( ( modus_ponens
| ~ is_a_theorem(esk2_0) )
& ( modus_ponens
| is_a_theorem(implies(esk1_0,esk2_0)) )
& ( modus_ponens
| is_a_theorem(esk1_0) )
& ( is_a_theorem(X8)
| ~ is_a_theorem(implies(X7,X8))
| ~ is_a_theorem(X7)
| ~ modus_ponens ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])])]) ).
cnf(c_0_17,plain,
( ~ r5
| is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
r5,
inference(split_conjunct,[status(thm)],[principia_r5]) ).
cnf(c_0_19,plain,
( ~ op_implies_or
| implies(X1,X2) = or(not(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| ~ modus_ponens
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_24,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
fof(c_0_27,plain,
! [X101,X102] :
( ( r3
| ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))) )
& ( is_a_theorem(implies(or(X101,X102),or(X102,X101)))
| ~ r3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])])]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_29,plain,
! [X95] :
( ( r1
| ~ is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0)) )
& ( is_a_theorem(implies(or(X95,X95),X95))
| ~ r1 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r1])])])])]) ).
fof(c_0_30,negated_conjecture,
~ r4,
inference(assume_negation,[status(cth)],[principia_r4]) ).
cnf(c_0_31,plain,
( ~ r3
| is_a_theorem(implies(or(X1,X2),or(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(or(X1,X2),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_35,plain,
( ~ r1
| is_a_theorem(implies(or(X1,X1),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
r1,
inference(split_conjunct,[status(thm)],[principia_r1]) ).
fof(c_0_37,plain,
! [X97,X98] :
( ( r2
| ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0))) )
& ( is_a_theorem(implies(X98,or(X97,X98)))
| ~ r2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r2])])])])]) ).
fof(c_0_38,negated_conjecture,
~ r4,
inference(fof_simplification,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_40,plain,
( ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(or(X1,X4),X3))
| is_a_theorem(implies(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_42,plain,
( ~ r2
| is_a_theorem(implies(X1,or(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
fof(c_0_44,plain,
! [X105,X106,X107] :
( ( r4
| ~ is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0)))) )
& ( is_a_theorem(implies(or(X105,or(X106,X107)),or(X106,or(X105,X107))))
| ~ r4 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r4])])])])]) ).
fof(c_0_45,negated_conjecture,
~ r4,
inference(fof_nnf,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
( ~ is_a_theorem(implies(or(X2,X1),X3))
| is_a_theorem(implies(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_33,c_0_39]) ).
cnf(c_0_47,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(implies(or(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_49,plain,
( ~ is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))
| r4 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,negated_conjecture,
~ r4,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( ~ is_a_theorem(implies(or(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_48]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(or(X1,X2),or(X3,or(X2,X1)))),
inference(spm,[status(thm)],[c_0_46,c_0_48]) ).
cnf(c_0_54,plain,
~ is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0)))),
inference(sr,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_40,c_0_51]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(X1,or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
~ is_a_theorem(implies(or(esk51_0,esk52_0),or(esk51_0,or(esk50_0,esk52_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(X1,or(X2,or(X3,X1)))),
inference(spm,[status(thm)],[c_0_52,c_0_48]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(spm,[status(thm)],[c_0_52,c_0_39]) ).
cnf(c_0_60,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_58]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL448+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 00:33:39 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.44 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
% 11.48/2.78 % Version: 3.5.1
% 11.48/2.78 % Preprocessing class: FSMSSLSSSSSNFFN.
% 11.48/2.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.48/2.78 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 11.48/2.78 % Starting new_bool_3 with 300s (1) cores
% 11.48/2.78 % Starting new_bool_1 with 300s (1) cores
% 11.48/2.78 % Starting sh5l with 300s (1) cores
% 11.48/2.78 % new_bool_3 with pid 3970873 completed with status 9
% 11.48/2.78 % sh5l with pid 3970875 completed with status 9
% 11.48/2.78 % new_bool_1 with pid 3970874 completed with status 9
% 11.48/2.78 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 3970872 completed with status 0
% 11.48/2.78 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 11.48/2.78 % Preprocessing class: FSMSSLSSSSSNFFN.
% 11.48/2.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.48/2.78 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 11.48/2.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.48/2.78 % No SInE strategy applied
% 11.48/2.78 % Search class: FGUSF-FFMM21-MFFFFFNN
% 11.48/2.78 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.48/2.78 % Starting SubtermCWHack with 151s (1) cores
% 11.48/2.78 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 11.48/2.78 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 11.48/2.78 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 11.48/2.78 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.48/2.78 % U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3970887 completed with status 0
% 11.48/2.78 % Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 11.48/2.78 % Preprocessing class: FSMSSLSSSSSNFFN.
% 11.48/2.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.48/2.78 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 11.48/2.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.48/2.78 % No SInE strategy applied
% 11.48/2.78 % Search class: FGUSF-FFMM21-MFFFFFNN
% 11.48/2.78 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.48/2.78 % Starting SubtermCWHack with 151s (1) cores
% 11.48/2.78 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 11.48/2.78 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 11.48/2.78 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 11.48/2.78 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.48/2.78 % Preprocessing time : 0.003 s
% 11.48/2.78 % Presaturation interreduction done
% 11.48/2.78
% 11.48/2.78 % Proof found!
% 11.48/2.78 % SZS status Theorem
% 11.48/2.78 % SZS output start CNFRefutation
% See solution above
% 11.48/2.78 % Parsed axioms : 41
% 11.48/2.78 % Removed by relevancy pruning/SinE : 0
% 11.48/2.78 % Initial clauses : 70
% 11.48/2.78 % Removed in clause preprocessing : 0
% 11.48/2.78 % Initial clauses in saturation : 70
% 11.48/2.78 % Processed clauses : 7511
% 11.48/2.78 % ...of these trivial : 1267
% 11.48/2.78 % ...subsumed : 3952
% 11.48/2.78 % ...remaining for further processing : 2292
% 11.48/2.78 % Other redundant clauses eliminated : 0
% 11.48/2.78 % Clauses deleted for lack of memory : 0
% 11.48/2.78 % Backward-subsumed : 11
% 11.48/2.78 % Backward-rewritten : 105
% 11.48/2.78 % Generated clauses : 98946
% 11.48/2.78 % ...of the previous two non-redundant : 74767
% 11.48/2.78 % ...aggressively subsumed : 0
% 11.48/2.78 % Contextual simplify-reflections : 0
% 11.48/2.78 % Paramodulations : 98946
% 11.48/2.78 % Factorizations : 0
% 11.48/2.78 % NegExts : 0
% 11.48/2.78 % Equation resolutions : 0
% 11.48/2.78 % Disequality decompositions : 0
% 11.48/2.78 % Total rewrite steps : 34874
% 11.48/2.78 % ...of those cached : 30840
% 11.48/2.78 % Propositional unsat checks : 0
% 11.48/2.78 % Propositional check models : 0
% 11.48/2.78 % Propositional check unsatisfiable : 0
% 11.48/2.78 % Propositional clauses : 0
% 11.48/2.78 % Propositional clauses after purity: 0
% 11.48/2.78 % Propositional unsat core size : 0
% 11.48/2.78 % Propositional preprocessing time : 0.000
% 11.48/2.78 % Propositional encoding time : 0.000
% 11.48/2.78 % Propositional solver time : 0.000
% 11.48/2.78 % Success case prop preproc time : 0.000
% 11.48/2.78 % Success case prop encoding time : 0.000
% 11.48/2.78 % Success case prop solver time : 0.000
% 11.48/2.78 % Current number of processed clauses : 2117
% 11.48/2.78 % Positive orientable unit clauses : 1260
% 11.48/2.78 % Positive unorientable unit clauses: 0
% 11.48/2.78 % Negative unit clauses : 18
% 11.48/2.78 % Non-unit-clauses : 839
% 11.48/2.78 % Current number of unprocessed clauses: 67258
% 11.48/2.78 % ...number of literals in the above : 114254
% 11.48/2.78 % Current number of archived formulas : 0
% 11.48/2.78 % Current number of archived clauses : 175
% 11.48/2.78 % Clause-clause subsumption calls (NU) : 103558
% 11.48/2.78 % Rec. Clause-clause subsumption calls : 103325
% 11.48/2.78 % Non-unit clause-clause subsumptions : 3918
% 11.48/2.78 % Unit Clause-clause subsumption calls : 23351
% 11.48/2.78 % Rewrite failures with RHS unbound : 0
% 11.48/2.78 % BW rewrite match attempts : 92502
% 11.48/2.78 % BW rewrite match successes : 78
% 11.48/2.78 % Condensation attempts : 0
% 11.48/2.78 % Condensation successes : 0
% 11.48/2.78 % Termbank termtop insertions : 1301659
% 11.48/2.78 % Search garbage collected termcells : 1092
% 11.48/2.78
% 11.48/2.78 % -------------------------------------------------
% 11.48/2.78 % User time : 2.179 s
% 11.48/2.78 % System time : 0.090 s
% 11.48/2.78 % Total time : 2.269 s
% 11.48/2.78 % Maximum resident set size: 3940 pages
% 11.48/2.78
% 11.48/2.78 % -------------------------------------------------
% 11.48/2.78 % User time : 11.047 s
% 11.48/2.78 % System time : 0.576 s
% 11.48/2.78 % Total time : 11.623 s
% 11.48/2.78 % Maximum resident set size: 4608 pages
% 11.48/2.78 % E exiting
%------------------------------------------------------------------------------