%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL494+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 : n016.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:54 PM UTC 2026
% Result : Theorem 0.14s 15.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 65 ( 35 unt; 0 def)
% Number of atoms : 114 ( 22 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 85 ( 36 ~; 32 |; 7 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 80 ( 4 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_and) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
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(hilbert_equivalence_2,conjecture,
equivalence_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_equivalence_2) ).
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(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r3) ).
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(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_and) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
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(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(equivalence_2,axiom,
( equivalence_2
<=> ! [X1,X2] : is_a_theorem(implies(equiv(X1,X2),implies(X2,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',equivalence_2) ).
fof(principia_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_equiv) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(c_0_18,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_19,plain,
! [X119,X120] :
( and(X119,X120) = not(or(not(X119),not(X120)))
| ~ op_and ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])])]) ).
cnf(c_0_20,plain,
( ~ op_implies_or
| implies(X1,X2) = or(not(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_22,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])])])]) ).
fof(c_0_23,negated_conjecture,
~ equivalence_2,
inference(assume_negation,[status(cth)],[hilbert_equivalence_2]) ).
fof(c_0_24,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_25,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])])])])]) ).
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_and
| and(X1,X2) = not(or(not(X1),not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_29,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
cnf(c_0_30,plain,
( ~ op_implies_and
| implies(X1,X2) = not(and(X1,not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_32,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])])])]) ).
fof(c_0_33,negated_conjecture,
~ equivalence_2,
inference(fof_simplification,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| ~ modus_ponens
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_36,plain,
( ~ r3
| is_a_theorem(implies(or(X1,X2),or(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
cnf(c_0_38,plain,
( ~ op_or
| or(X1,X2) = not(and(not(X1),not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
and(X1,X2) = not(implies(X1,not(X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_40,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_41,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
fof(c_0_42,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_43,plain,
! [X63,X64] :
( ( equivalence_2
| ~ is_a_theorem(implies(equiv(esk29_0,esk30_0),implies(esk30_0,esk29_0))) )
& ( is_a_theorem(implies(equiv(X63,X64),implies(X64,X63)))
| ~ equivalence_2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equivalence_2])])])])]) ).
cnf(c_0_44,plain,
( ~ op_equiv
| equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[principia_op_equiv]) ).
fof(c_0_46,negated_conjecture,
~ equivalence_2,
inference(fof_nnf,[status(thm)],[c_0_33]) ).
cnf(c_0_47,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_34,c_0_35])]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_49,plain,
not(not(implies(not(X1),not(not(X2))))) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_50,plain,
not(not(implies(X1,not(not(X2))))) = implies(X1,X2),
inference(rw,[status(thm)],[c_0_41,c_0_39]) ).
cnf(c_0_51,plain,
( ~ r2
| is_a_theorem(implies(X1,or(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_52,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
cnf(c_0_53,plain,
( ~ is_a_theorem(implies(equiv(esk29_0,esk30_0),implies(esk30_0,esk29_0)))
| equivalence_2 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_54,plain,
equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_55,negated_conjecture,
~ equivalence_2,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_56,plain,
( ~ is_a_theorem(or(X2,X1))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_57,plain,
implies(not(X1),X2) = or(X1,X2),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_59,plain,
~ is_a_theorem(implies(and(implies(esk29_0,esk30_0),implies(esk30_0,esk29_0)),implies(esk30_0,esk29_0))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_60,plain,
( ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_58,c_0_28]) ).
cnf(c_0_62,plain,
~ is_a_theorem(or(implies(implies(esk29_0,esk30_0),not(implies(esk30_0,esk29_0))),implies(esk30_0,esk29_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_39]),c_0_57]) ).
cnf(c_0_63,plain,
is_a_theorem(or(implies(X1,not(X2)),X2)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL494+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.11/15.39 % Computer : n016.cluster.edu
% 0.11/15.39 % Model : x86_64 x86_64
% 0.11/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.39 % Memory : 8046.5625MB
% 0.11/15.39 % OS : Linux 6.8.0-71-generic
% 0.11/15.39 % CPULimit : 300
% 0.11/15.39 % WCLimit : 300
% 0.11/15.39 % DateTime : Mon Sep 21 00:41:23 UTC 2026
% 0.11/15.39 % CPUTime :
% 0.11/15.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/15.44 Running first-order theorem proving
% 0.14/15.44 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
% 0.14/15.48 % Version: 3.5.1
% 0.14/15.48 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/15.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/15.48 % Starting new_bool_3 with 300s (1) cores
% 0.14/15.48 % Starting new_bool_1 with 300s (1) cores
% 0.14/15.48 % Starting sh5l with 300s (1) cores
% 0.14/15.48 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 1200245 completed with status 0
% 0.14/15.48 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.14/15.48 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/15.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/15.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/15.48 % No SInE strategy applied
% 0.14/15.48 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.14/15.48 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/15.48 % Starting SubtermCWHack with 151s (1) cores
% 0.14/15.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.14/15.48 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.14/15.48 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.14/15.48 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/15.48 % G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 1200258 completed with status 0
% 0.14/15.48 % Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.14/15.48 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/15.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/15.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/15.48 % No SInE strategy applied
% 0.14/15.48 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.14/15.48 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/15.48 % Starting SubtermCWHack with 151s (1) cores
% 0.14/15.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.14/15.48 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.14/15.48 % Preprocessing time : 0.003 s
% 0.14/15.48 % Presaturation interreduction done
% 0.14/15.48
% 0.14/15.48 % Proof found!
% 0.14/15.48 % SZS status Theorem
% 0.14/15.48 % SZS output start CNFRefutation
% See solution above
% 0.14/15.48 % Parsed axioms : 45
% 0.14/15.48 % Removed by relevancy pruning/SinE : 0
% 0.14/15.48 % Initial clauses : 74
% 0.14/15.48 % Removed in clause preprocessing : 0
% 0.14/15.48 % Initial clauses in saturation : 74
% 0.14/15.48 % Processed clauses : 186
% 0.14/15.48 % ...of these trivial : 12
% 0.14/15.48 % ...subsumed : 15
% 0.14/15.48 % ...remaining for further processing : 159
% 0.14/15.48 % Other redundant clauses eliminated : 0
% 0.14/15.48 % Clauses deleted for lack of memory : 0
% 0.14/15.48 % Backward-subsumed : 0
% 0.14/15.48 % Backward-rewritten : 16
% 0.14/15.48 % Generated clauses : 134
% 0.14/15.48 % ...of the previous two non-redundant : 131
% 0.14/15.48 % ...aggressively subsumed : 0
% 0.14/15.48 % Contextual simplify-reflections : 0
% 0.14/15.48 % Paramodulations : 134
% 0.14/15.48 % Factorizations : 0
% 0.14/15.48 % NegExts : 0
% 0.14/15.48 % Equation resolutions : 0
% 0.14/15.48 % Disequality decompositions : 0
% 0.14/15.48 % Total rewrite steps : 88
% 0.14/15.48 % ...of those cached : 21
% 0.14/15.48 % Propositional unsat checks : 0
% 0.14/15.48 % Propositional check models : 0
% 0.14/15.48 % Propositional check unsatisfiable : 0
% 0.14/15.48 % Propositional clauses : 0
% 0.14/15.48 % Propositional clauses after purity: 0
% 0.14/15.48 % Propositional unsat core size : 0
% 0.14/15.48 % Propositional preprocessing time : 0.000
% 0.14/15.48 % Propositional encoding time : 0.000
% 0.14/15.48 % Propositional solver time : 0.000
% 0.14/15.48 % Success case prop preproc time : 0.000
% 0.14/15.48 % Success case prop encoding time : 0.000
% 0.14/15.48 % Success case prop solver time : 0.000
% 0.14/15.48 % Current number of processed clauses : 82
% 0.14/15.48 % Positive orientable unit clauses : 29
% 0.14/15.48 % Positive unorientable unit clauses: 1
% 0.14/15.48 % Negative unit clauses : 5
% 0.14/15.48 % Non-unit-clauses : 47
% 0.14/15.48 % Current number of unprocessed clauses: 77
% 0.14/15.48 % ...number of literals in the above : 119
% 0.14/15.48 % Current number of archived formulas : 0
% 0.14/15.48 % Current number of archived clauses : 77
% 0.14/15.48 % Clause-clause subsumption calls (NU) : 233
% 0.14/15.48 % Rec. Clause-clause subsumption calls : 232
% 0.14/15.48 % Non-unit clause-clause subsumptions : 14
% 0.14/15.48 % Unit Clause-clause subsumption calls : 111
% 0.14/15.48 % Rewrite failures with RHS unbound : 0
% 0.14/15.48 % BW rewrite match attempts : 58
% 0.14/15.48 % BW rewrite match successes : 18
% 0.14/15.48 % Condensation attempts : 0
% 0.14/15.48 % Condensation successes : 0
% 0.14/15.48 % Termbank termtop insertions : 6580
% 0.14/15.48 % Search garbage collected termcells : 1092
% 0.14/15.48
% 0.14/15.48 % -------------------------------------------------
% 0.14/15.48 % User time : 0.018 s
% 0.14/15.48 % System time : 0.004 s
% 0.14/15.48 % Total time : 0.022 s
% 0.14/15.48 % Maximum resident set size: 3688 pages
% 0.14/15.48
% 0.14/15.48 % -------------------------------------------------
% 0.14/15.48 % User time : 0.072 s
% 0.14/15.48 % System time : 0.021 s
% 0.14/15.48 % Total time : 0.093 s
% 0.14/15.48 % Maximum resident set size: 4864 pages
% 0.14/15.48 % E exiting
%------------------------------------------------------------------------------