%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL466+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:51 PM UTC 2026
% Result : Theorem 159.65s 32.85s
% Output : CNFRefutation 159.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 18
% Syntax : Number of formulae : 167 ( 78 unt; 0 def)
% Number of atoms : 307 ( 41 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 261 ( 121 ~; 119 |; 10 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 339 ( 72 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(cn1,axiom,
( cn1
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn1) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(luka_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_modus_ponens) ).
fof(luka_cn1,axiom,
cn1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_cn1) ).
fof(cn2,axiom,
( cn2
<=> ! [X4,X5] : is_a_theorem(implies(X4,implies(not(X4),X5))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn2) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(luka_cn2,axiom,
cn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_cn2) ).
fof(luka_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_op_or) ).
fof(cn3,axiom,
( cn3
<=> ! [X4] : is_a_theorem(implies(implies(not(X4),X4),X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn3) ).
fof(luka_cn3,axiom,
cn3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_cn3) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(luka_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_op_equiv) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(use_substitution_of_equivalents,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',use_substitution_of_equivalents) ).
fof(hilbert_and_1,conjecture,
and_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(and_1,axiom,
( and_1
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_1) ).
fof(c_0_18,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])])])])])]) ).
fof(c_0_19,plain,
! [X83,X84,X85] :
( ( cn1
| ~ is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0)))) )
& ( is_a_theorem(implies(implies(X83,X84),implies(implies(X84,X85),implies(X83,X85))))
| ~ cn1 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn1])])])])]) ).
fof(c_0_20,plain,
! [X121,X122] :
( implies(X121,X122) = not(and(X121,not(X122)))
| ~ op_implies_and ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])]) ).
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_18]) ).
cnf(c_0_22,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[luka_modus_ponens]) ).
cnf(c_0_23,plain,
( ~ cn1
| is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
cn1,
inference(split_conjunct,[status(thm)],[luka_cn1]) ).
fof(c_0_25,plain,
! [X89,X90] :
( ( cn2
| ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))) )
& ( is_a_theorem(implies(X89,implies(not(X89),X90)))
| ~ cn2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn2])])])])]) ).
fof(c_0_26,plain,
! [X117,X118] :
( or(X117,X118) = not(and(not(X117),not(X118)))
| ~ op_or ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])]) ).
cnf(c_0_27,plain,
( ~ op_implies_and
| implies(X1,X2) = not(and(X1,not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_29,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_30,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_31,plain,
( ~ cn2
| is_a_theorem(implies(X1,implies(not(X1),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
cn2,
inference(split_conjunct,[status(thm)],[luka_cn2]) ).
cnf(c_0_33,plain,
( ~ op_or
| or(X1,X2) = not(and(not(X1),not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_35,plain,
op_or,
inference(split_conjunct,[status(thm)],[luka_op_or]) ).
fof(c_0_36,plain,
! [X93] :
( ( cn3
| ~ is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0)) )
& ( is_a_theorem(implies(implies(not(X93),X93),X93))
| ~ cn3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn3])])])])]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_39,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,plain,
( ~ cn3
| is_a_theorem(implies(implies(not(X1),X1),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
cn3,
inference(split_conjunct,[status(thm)],[luka_cn3]) ).
cnf(c_0_42,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_37]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_45,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(spm,[status(thm)],[c_0_44,c_0_39]) ).
cnf(c_0_47,plain,
( ~ is_a_theorem(or(X3,X2))
| ~ is_a_theorem(implies(X1,not(X3)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_39]) ).
cnf(c_0_48,plain,
( ~ is_a_theorem(implies(X4,X2))
| ~ is_a_theorem(implies(X1,X4))
| is_a_theorem(implies(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_42,c_0_45]) ).
cnf(c_0_49,plain,
( ~ is_a_theorem(implies(X1,or(X2,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_46]) ).
cnf(c_0_50,plain,
( ~ is_a_theorem(or(X3,X2))
| ~ is_a_theorem(or(X1,not(X3)))
| is_a_theorem(or(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_39]),c_0_39]) ).
cnf(c_0_51,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_52,plain,
( ~ is_a_theorem(implies(or(X1,X4),X2))
| is_a_theorem(implies(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_49,c_0_43]) ).
cnf(c_0_54,plain,
( ~ is_a_theorem(or(X3,X1))
| is_a_theorem(implies(implies(X1,X2),or(X3,X2))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_39]),c_0_39]) ).
cnf(c_0_55,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_56,plain,
( ~ is_a_theorem(implies(implies(X3,X4),X2))
| ~ is_a_theorem(or(X1,implies(X3,X4)))
| is_a_theorem(or(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_34]),c_0_51]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(X1,or(or(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
( ~ is_a_theorem(or(X2,X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_54]) ).
cnf(c_0_59,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(or(X1,X2)) ),
inference(rw,[status(thm)],[c_0_55,c_0_39]) ).
cnf(c_0_60,plain,
( ~ is_a_theorem(implies(or(X3,X4),X2))
| ~ is_a_theorem(or(X1,or(X3,X4)))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_56,c_0_39]) ).
cnf(c_0_61,plain,
is_a_theorem(or(X1,or(or(not(X1),X2),X3))),
inference(spm,[status(thm)],[c_0_57,c_0_39]) ).
cnf(c_0_62,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
( ~ is_a_theorem(implies(or(or(not(X1),X3),X4),X2))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_62,c_0_39]) ).
cnf(c_0_65,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_66,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_58,c_0_65]) ).
cnf(c_0_67,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,or(X2,X2)),X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_66]) ).
fof(c_0_68,plain,
! [X125,X126] :
( equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125))
| ~ op_equiv ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])])]) ).
cnf(c_0_69,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,or(X1,X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_67]) ).
cnf(c_0_70,plain,
( ~ op_equiv
| equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_71,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[luka_op_equiv]) ).
cnf(c_0_72,plain,
( ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_54]) ).
cnf(c_0_73,plain,
( ~ is_a_theorem(or(X1,X2))
| is_a_theorem(or(X1,or(X2,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_39]) ).
cnf(c_0_74,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_34,c_0_34]) ).
cnf(c_0_75,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
fof(c_0_76,plain,
! [X11,X12] :
( ( substitution_of_equivalents
| esk3_0 != esk4_0 )
& ( substitution_of_equivalents
| is_a_theorem(equiv(esk3_0,esk4_0)) )
& ( X11 = X12
| ~ is_a_theorem(equiv(X11,X12))
| ~ substitution_of_equivalents ) ),
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)],[substitution_of_equivalents])])])])])]) ).
cnf(c_0_77,plain,
( ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(or(X2,X3),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,plain,
( ~ is_a_theorem(not(X1))
| is_a_theorem(implies(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_66,c_0_39]) ).
cnf(c_0_79,plain,
implies(implies(X1,X2),and(X2,not(X1))) = not(equiv(X1,X2)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_80,plain,
( ~ is_a_theorem(equiv(X1,X2))
| ~ substitution_of_equivalents
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_81,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents]) ).
cnf(c_0_82,plain,
( ~ is_a_theorem(not(X2))
| ~ is_a_theorem(or(X1,X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_83,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(or(equiv(X1,X2),and(X2,not(X1)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_79]),c_0_39]) ).
cnf(c_0_84,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_66]) ).
cnf(c_0_85,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_39]),c_0_39]) ).
cnf(c_0_86,plain,
implies(X1,and(not(X2),not(X3))) = not(and(X1,or(X2,X3))),
inference(spm,[status(thm)],[c_0_74,c_0_39]) ).
cnf(c_0_87,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_45]) ).
cnf(c_0_88,plain,
( ~ is_a_theorem(equiv(X1,X2))
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]) ).
cnf(c_0_89,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(equiv(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_34]) ).
cnf(c_0_90,plain,
( ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(or(X1,X2),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_91,plain,
is_a_theorem(implies(X1,not(and(not(X1),or(X2,X3))))),
inference(spm,[status(thm)],[c_0_38,c_0_86]) ).
cnf(c_0_92,plain,
( ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2))
| is_a_theorem(or(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_87,c_0_37]) ).
cnf(c_0_93,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_94,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(implies(or(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_90]) ).
cnf(c_0_95,plain,
( ~ is_a_theorem(or(and(not(X1),or(X3,X4)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_91]) ).
cnf(c_0_96,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(implies(X4,X1))
| is_a_theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_87,c_0_45]) ).
cnf(c_0_97,plain,
( ~ is_a_theorem(implies(X1,or(X2,X2)))
| is_a_theorem(or(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_92,c_0_46]) ).
cnf(c_0_98,plain,
( ~ is_a_theorem(implies(X2,X1))
| or(X1,X2) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_43])]) ).
cnf(c_0_99,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_95,c_0_65]) ).
cnf(c_0_100,plain,
( ~ is_a_theorem(or(X1,X1))
| is_a_theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_96,c_0_46]) ).
cnf(c_0_101,plain,
is_a_theorem(or(implies(X1,X1),X2)),
inference(spm,[status(thm)],[c_0_97,c_0_43]) ).
cnf(c_0_102,plain,
is_a_theorem(implies(or(or(X1,X1),or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_103,plain,
( ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_104,plain,
( ~ is_a_theorem(or(X2,X1))
| or(X1,not(X2)) = X1 ),
inference(spm,[status(thm)],[c_0_98,c_0_39]) ).
cnf(c_0_105,plain,
is_a_theorem(or(implies(or(or(X1,X1),or(X1,X1)),X1),X2)),
inference(spm,[status(thm)],[c_0_97,c_0_46]) ).
cnf(c_0_106,plain,
or(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_46]),c_0_43])]) ).
cnf(c_0_107,plain,
( ~ is_a_theorem(or(X2,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_99]) ).
cnf(c_0_108,plain,
is_a_theorem(or(or(implies(X1,X1),X2),X3)),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_109,plain,
is_a_theorem(implies(or(X1,X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_52,c_0_102]) ).
cnf(c_0_110,plain,
( ~ is_a_theorem(implies(X3,implies(X2,X4)))
| is_a_theorem(implies(or(X1,X2),implies(X3,or(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_103,c_0_85]) ).
cnf(c_0_111,plain,
or(X1,not(implies(X2,X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]),c_0_106]) ).
cnf(c_0_112,plain,
is_a_theorem(implies(X1,or(implies(X2,X2),X3))),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_113,plain,
( ~ is_a_theorem(implies(X1,or(X2,X2)))
| is_a_theorem(implies(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_42,c_0_109]) ).
cnf(c_0_114,plain,
is_a_theorem(implies(implies(implies(X1,X2),and(X1,not(X2))),and(X1,not(X2)))),
inference(spm,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_115,plain,
implies(implies(X1,and(X2,not(X3))),X4) = or(and(X1,implies(X2,X3)),X4),
inference(spm,[status(thm)],[c_0_51,c_0_34]) ).
cnf(c_0_116,plain,
is_a_theorem(implies(X1,implies(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_39]),c_0_112])]) ).
cnf(c_0_117,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_93,c_0_99]) ).
cnf(c_0_118,plain,
is_a_theorem(implies(or(or(X1,X1),or(X1,X1)),or(X1,X2))),
inference(spm,[status(thm)],[c_0_113,c_0_46]) ).
cnf(c_0_119,plain,
( ~ is_a_theorem(or(X1,X3))
| ~ is_a_theorem(implies(or(X3,X4),X2))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_60,c_0_73]) ).
cnf(c_0_120,plain,
is_a_theorem(or(and(implies(X1,X2),implies(X1,X2)),and(X1,not(X2)))),
inference(rw,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_121,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,implies(X1,X2)))
| implies(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_93,c_0_66]) ).
cnf(c_0_122,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_116,c_0_111]) ).
cnf(c_0_123,plain,
( ~ is_a_theorem(X1)
| or(X1,X2) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_106]),c_0_106]),c_0_106]),c_0_106]) ).
cnf(c_0_124,plain,
( ~ is_a_theorem(not(X3))
| ~ is_a_theorem(or(X1,X3))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_119,c_0_78]) ).
cnf(c_0_125,plain,
is_a_theorem(or(equiv(X1,X1),and(X1,not(X1)))),
inference(spm,[status(thm)],[c_0_120,c_0_75]) ).
cnf(c_0_126,plain,
is_a_theorem(or(X1,or(not(X1),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_39]) ).
cnf(c_0_127,plain,
( ~ is_a_theorem(X1)
| implies(X1,X2) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_122])]) ).
cnf(c_0_128,plain,
is_a_theorem(or(or(or(implies(X1,X1),X2),X3),X4)),
inference(spm,[status(thm)],[c_0_100,c_0_108]) ).
cnf(c_0_129,plain,
or(implies(X1,X1),X2) = implies(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_46]),c_0_106]),c_0_106]) ).
cnf(c_0_130,plain,
is_a_theorem(or(equiv(X1,X1),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_34]),c_0_53])]) ).
cnf(c_0_131,plain,
( ~ is_a_theorem(or(X1,X3))
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_54]) ).
cnf(c_0_132,plain,
is_a_theorem(implies(implies(or(not(X1),X2),X1),X1)),
inference(spm,[status(thm)],[c_0_58,c_0_126]) ).
cnf(c_0_133,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(or(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_134,plain,
implies(implies(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129]),c_0_129]),c_0_129]) ).
cnf(c_0_135,plain,
is_a_theorem(implies(X1,equiv(X2,X2))),
inference(spm,[status(thm)],[c_0_107,c_0_130]) ).
cnf(c_0_136,plain,
( ~ is_a_theorem(or(X1,implies(or(not(X2),X3),X2)))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_137,plain,
is_a_theorem(or(X1,implies(or(X1,X2),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_134]),c_0_39]) ).
cnf(c_0_138,plain,
is_a_theorem(or(or(X1,not(X1)),X2)),
inference(spm,[status(thm)],[c_0_101,c_0_39]) ).
cnf(c_0_139,plain,
( ~ is_a_theorem(X1)
| X1 = equiv(X2,X2) ),
inference(spm,[status(thm)],[c_0_117,c_0_135]) ).
cnf(c_0_140,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_117,c_0_99]) ).
cnf(c_0_141,plain,
is_a_theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_142,plain,
( ~ is_a_theorem(or(X1,X1))
| is_a_theorem(or(or(or(X1,X2),X3),X4)) ),
inference(spm,[status(thm)],[c_0_96,c_0_109]) ).
cnf(c_0_143,plain,
is_a_theorem(or(or(or(X1,not(X1)),X2),X3)),
inference(spm,[status(thm)],[c_0_100,c_0_138]) ).
cnf(c_0_144,plain,
implies(X1,X1) = equiv(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_46]),c_0_106]) ).
fof(c_0_145,negated_conjecture,
~ and_1,
inference(assume_negation,[status(cth)],[hilbert_and_1]) ).
cnf(c_0_146,plain,
( ~ is_a_theorem(or(X3,not(X1)))
| is_a_theorem(implies(or(X1,X2),or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_54,c_0_39]) ).
cnf(c_0_147,plain,
( ~ is_a_theorem(X2)
| or(not(X1),X1) = X2 ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_148,plain,
is_a_theorem(or(or(or(or(or(X1,not(X1)),X2),X3),X4),X5)),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_149,plain,
or(X1,not(X1)) = implies(esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_144]),c_0_144]) ).
fof(c_0_150,negated_conjecture,
~ and_1,
inference(fof_simplification,[status(thm)],[c_0_145]) ).
cnf(c_0_151,plain,
is_a_theorem(implies(and(X1,not(X2)),implies(implies(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_152,plain,
( ~ is_a_theorem(or(X2,not(X1)))
| is_a_theorem(implies(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_146]) ).
cnf(c_0_153,plain,
or(not(X1),X1) = implies(esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_149]),c_0_129]),c_0_129]),c_0_129]),c_0_129]) ).
cnf(c_0_154,plain,
or(X1,not(not(X1))) = X1,
inference(spm,[status(thm)],[c_0_104,c_0_141]) ).
fof(c_0_155,plain,
! [X33,X34] :
( ( and_1
| ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0)) )
& ( is_a_theorem(implies(and(X33,X34),X33))
| ~ and_1 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_1])])])])]) ).
fof(c_0_156,negated_conjecture,
~ and_1,
inference(fof_nnf,[status(thm)],[c_0_150]) ).
cnf(c_0_157,plain,
( ~ is_a_theorem(implies(X1,implies(or(not(X2),X3),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_132]) ).
cnf(c_0_158,plain,
is_a_theorem(implies(and(not(X1),not(X2)),implies(or(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_151,c_0_39]) ).
cnf(c_0_159,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_154]),c_0_53])]) ).
cnf(c_0_160,plain,
( ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))
| and_1 ),
inference(split_conjunct,[status(thm)],[c_0_155]) ).
cnf(c_0_161,negated_conjecture,
~ and_1,
inference(split_conjunct,[status(thm)],[c_0_156]) ).
cnf(c_0_162,plain,
is_a_theorem(implies(and(not(not(X1)),not(X2)),X1)),
inference(spm,[status(thm)],[c_0_157,c_0_158]) ).
cnf(c_0_163,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_159]),c_0_39]),c_0_153]),c_0_53])]) ).
cnf(c_0_164,plain,
~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0)),
inference(sr,[status(thm)],[c_0_160,c_0_161]) ).
cnf(c_0_165,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_163]) ).
cnf(c_0_166,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_165])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL466+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 00:33:21 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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
% 159.65/32.85 % Version: 3.5.1
% 159.65/32.85 % Preprocessing class: FSMSSLSSSSSNFFN.
% 159.65/32.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 159.65/32.85 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 159.65/32.85 % Starting new_bool_3 with 300s (1) cores
% 159.65/32.85 % Starting new_bool_1 with 300s (1) cores
% 159.65/32.85 % Starting sh5l with 300s (1) cores
% 159.65/32.85 % new_bool_1 with pid 3974995 completed with status 9
% 159.65/32.85 % new_bool_3 with pid 3974994 completed with status 9
% 159.65/32.85 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 3974993 completed with status 0
% 159.65/32.85 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 159.65/32.85 % Preprocessing class: FSMSSLSSSSSNFFN.
% 159.65/32.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 159.65/32.85 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 159.65/32.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 159.65/32.85 % No SInE strategy applied
% 159.65/32.85 % Search class: FGUSF-FFMM21-MFFFFFNN
% 159.65/32.85 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 159.65/32.85 % Starting SubtermCWHack with 151s (1) cores
% 159.65/32.85 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 159.65/32.85 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 159.65/32.85 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 159.65/32.85 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 159.65/32.85 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 3975005 completed with status 0
% 159.65/32.85 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 159.65/32.85 % Preprocessing class: FSMSSLSSSSSNFFN.
% 159.65/32.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 159.65/32.85 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 159.65/32.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 159.65/32.85 % No SInE strategy applied
% 159.65/32.85 % Search class: FGUSF-FFMM21-MFFFFFNN
% 159.65/32.85 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 159.65/32.85 % Starting SubtermCWHack with 151s (1) cores
% 159.65/32.85 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 159.65/32.85 % Preprocessing time : 0.003 s
% 159.65/32.85 % Presaturation interreduction done
% 159.65/32.85
% 159.65/32.85 % Proof found!
% 159.65/32.85 % SZS status Theorem
% 159.65/32.85 % SZS output start CNFRefutation
% See solution above
% 159.65/32.85 % Parsed axioms : 43
% 159.65/32.85 % Removed by relevancy pruning/SinE : 0
% 159.65/32.85 % Initial clauses : 72
% 159.65/32.85 % Removed in clause preprocessing : 0
% 159.65/32.85 % Initial clauses in saturation : 72
% 159.65/32.85 % Processed clauses : 63389
% 159.65/32.85 % ...of these trivial : 1553
% 159.65/32.85 % ...subsumed : 54699
% 159.65/32.85 % ...remaining for further processing : 7137
% 159.65/32.85 % Other redundant clauses eliminated : 0
% 159.65/32.85 % Clauses deleted for lack of memory : 0
% 159.65/32.85 % Backward-subsumed : 1214
% 159.65/32.85 % Backward-rewritten : 1148
% 159.65/32.85 % Generated clauses : 1197151
% 159.65/32.85 % ...of the previous two non-redundant : 1050637
% 159.65/32.85 % ...aggressively subsumed : 0
% 159.65/32.85 % Contextual simplify-reflections : 9
% 159.65/32.85 % Paramodulations : 1197151
% 159.65/32.85 % Factorizations : 0
% 159.65/32.85 % NegExts : 0
% 159.65/32.85 % Equation resolutions : 0
% 159.65/32.85 % Disequality decompositions : 0
% 159.65/32.85 % Total rewrite steps : 736679
% 159.65/32.85 % ...of those cached : 711109
% 159.65/32.85 % Propositional unsat checks : 1
% 159.65/32.85 % Propositional check models : 0
% 159.65/32.85 % Propositional check unsatisfiable : 0
% 159.65/32.85 % Propositional clauses : 0
% 159.65/32.85 % Propositional clauses after purity: 0
% 159.65/32.85 % Propositional unsat core size : 0
% 159.65/32.85 % Propositional preprocessing time : 0.000
% 159.65/32.85 % Propositional encoding time : 1.588
% 159.65/32.85 % Propositional solver time : 0.878
% 159.65/32.85 % Success case prop preproc time : 0.000
% 159.65/32.85 % Success case prop encoding time : 0.000
% 159.65/32.85 % Success case prop solver time : 0.000
% 159.65/32.85 % Current number of processed clauses : 4715
% 159.65/32.85 % Positive orientable unit clauses : 452
% 159.65/32.85 % Positive unorientable unit clauses: 2
% 159.65/32.85 % Negative unit clauses : 3
% 159.65/32.85 % Non-unit-clauses : 4258
% 159.65/32.85 % Current number of unprocessed clauses: 977220
% 159.65/32.85 % ...number of literals in the above : 2346288
% 159.65/32.85 % Current number of archived formulas : 0
% 159.65/32.85 % Current number of archived clauses : 2422
% 159.65/32.85 % Clause-clause subsumption calls (NU) : 1992519
% 159.65/32.85 % Rec. Clause-clause subsumption calls : 1830430
% 159.65/32.85 % Non-unit clause-clause subsumptions : 53533
% 159.65/32.85 % Unit Clause-clause subsumption calls : 41724
% 159.65/32.85 % Rewrite failures with RHS unbound : 0
% 159.65/32.85 % BW rewrite match attempts : 36835
% 159.65/32.85 % BW rewrite match successes : 331
% 159.65/32.85 % Condensation attempts : 0
% 159.65/32.85 % Condensation successes : 0
% 159.65/32.85 % Termbank termtop insertions : 22023010
% 159.65/32.85 % Search garbage collected termcells : 1092
% 159.65/32.85
% 159.65/32.85 % -------------------------------------------------
% 159.65/32.85 % User time : 30.997 s
% 159.65/32.85 % System time : 1.004 s
% 159.65/32.85 % Total time : 32.001 s
% 159.65/32.85 % Maximum resident set size: 3688 pages
% 159.65/32.85
% 159.65/32.85 % -------------------------------------------------
% 159.65/32.85 % User time : 154.335 s
% 159.65/32.85 % System time : 5.366 s
% 159.65/32.85 % Total time : 159.701 s
% 159.65/32.85 % Maximum resident set size: 4864 pages
% 159.65/32.85 % E exiting
%------------------------------------------------------------------------------