%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT005-4 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:04:00 PM UTC 2026
% Result : Unsatisfiable 7.03s 1.48s
% Output : CNFRefutation 7.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of clauses : 81 ( 77 unt; 0 nHn; 27 RR)
% Number of literals : 85 ( 84 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 112 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(modular,axiom,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',modular) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(x_meet_0,axiom,
meet(X1,n0) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',x_meet_0) ).
cnf(r1_complement_join_a_b_2,negated_conjecture,
meet(r1,join(a,b)) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r1_complement_join_a_b_2) ).
cnf(define_a2,negated_conjecture,
join(r1,meet(b,r2)) = a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',define_a2) ).
cnf(x_join_0,axiom,
join(X1,n0) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',x_join_0) ).
cnf(define_b2,negated_conjecture,
join(r1,meet(a,r2)) = b2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',define_b2) ).
cnf(r2_complement_meet_a_b_2,negated_conjecture,
meet(r2,meet(a,b)) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r2_complement_meet_a_b_2) ).
cnf(prove_SAMs_lemma,negated_conjecture,
meet(a2,b2) != r1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_SAMs_lemma) ).
cnf(c_0_15,plain,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
inference(fof_simplification,[status(thm)],[modular]) ).
cnf(c_0_16,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_17,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_18,plain,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
c_0_15 ).
cnf(c_0_19,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_20,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_21,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_22,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_23,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_25,plain,
( meet(X3,X1) != X1
| join(X1,meet(X2,X3)) = meet(X3,join(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,axiom,
meet(X1,n0) = n0,
x_meet_0 ).
cnf(c_0_28,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_29,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_20]) ).
cnf(c_0_30,plain,
meet(X1,X2) = meet(X2,X1),
c_0_19 ).
cnf(c_0_31,plain,
join(X1,X2) = join(X2,X1),
c_0_17 ).
cnf(c_0_32,plain,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
c_0_20 ).
cnf(c_0_33,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
c_0_24 ).
cnf(c_0_34,plain,
join(meet(X1,X2),meet(X3,X1)) = meet(X1,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
meet(r1,join(a,b)) = n0,
r1_complement_join_a_b_2 ).
cnf(c_0_36,plain,
meet(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_37,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_38,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_16]),c_0_24]) ).
cnf(c_0_39,plain,
join(meet(X1,X2),meet(X3,X2)) = meet(X2,join(meet(X1,X2),X3)),
inference(ar,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_29]),c_0_30,c_0_31,c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(meet(X2,X3),X1)),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
meet(r1,meet(join(a,b),X1)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_35]),c_0_36]) ).
cnf(c_0_42,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_37]) ).
cnf(c_0_43,negated_conjecture,
join(r1,meet(b,r2)) = a2,
define_a2 ).
cnf(c_0_44,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(meet(X3,X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_19]),c_0_40]) ).
cnf(c_0_45,negated_conjecture,
meet(r1,meet(X1,join(a,b))) = n0,
inference(spm,[status(thm)],[c_0_41,c_0_19]) ).
cnf(c_0_46,axiom,
join(X1,n0) = X1,
x_join_0 ).
cnf(c_0_47,negated_conjecture,
join(b,a2) = join(b,r1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
join(X1,meet(X2,join(X3,X1))) = meet(join(X3,X1),join(X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_49,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,meet(X3,X1))),
inference(spm,[status(thm)],[c_0_44,c_0_17]) ).
cnf(c_0_50,negated_conjecture,
meet(b,r1) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_23]),c_0_19]) ).
cnf(c_0_51,plain,
join(n0,X1) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_17]) ).
cnf(c_0_52,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_20]) ).
cnf(c_0_53,negated_conjecture,
meet(a2,join(b,r1)) = a2,
inference(spm,[status(thm)],[c_0_23,c_0_47]) ).
cnf(c_0_54,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_55,negated_conjecture,
meet(join(a,b),join(b,r1)) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_35]),c_0_46]) ).
cnf(c_0_56,negated_conjecture,
meet(b,join(r1,meet(X1,b))) = meet(b,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_57,negated_conjecture,
join(r1,meet(a,r2)) = b2,
define_b2 ).
cnf(c_0_58,negated_conjecture,
meet(a2,meet(X1,join(b,r1))) = meet(X1,a2),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
meet(a,join(b,r1)) = meet(a,b),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_61,negated_conjecture,
meet(b,join(r1,meet(b,X1))) = meet(b,X1),
inference(spm,[status(thm)],[c_0_56,c_0_19]) ).
cnf(c_0_62,negated_conjecture,
meet(b,meet(r2,a2)) = meet(b,r2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_43]),c_0_20]) ).
cnf(c_0_63,negated_conjecture,
meet(r2,meet(a,b)) = n0,
r2_complement_meet_a_b_2 ).
cnf(c_0_64,negated_conjecture,
meet(r1,b2) = r1,
inference(spm,[status(thm)],[c_0_16,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
meet(a,meet(b,a2)) = meet(a,a2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_19]),c_0_52]) ).
cnf(c_0_66,negated_conjecture,
meet(b,a2) = meet(b,r2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_43]) ).
cnf(c_0_67,negated_conjecture,
meet(a,meet(b,r2)) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_63]),c_0_27]),c_0_20]) ).
cnf(c_0_68,negated_conjecture,
join(a,b2) = join(a,r1),
inference(spm,[status(thm)],[c_0_42,c_0_57]) ).
cnf(c_0_69,negated_conjecture,
meet(a2,b2) != r1,
inference(fof_simplification,[status(thm)],[prove_SAMs_lemma]) ).
cnf(c_0_70,negated_conjecture,
join(r1,meet(X1,b2)) = meet(b2,join(r1,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_64]) ).
cnf(c_0_71,negated_conjecture,
meet(a,a2) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_72,negated_conjecture,
meet(r1,a2) = r1,
inference(spm,[status(thm)],[c_0_16,c_0_43]) ).
cnf(c_0_73,negated_conjecture,
meet(b2,join(a,r1)) = b2,
inference(spm,[status(thm)],[c_0_23,c_0_68]) ).
cnf(c_0_74,negated_conjecture,
meet(a2,b2) != r1,
c_0_69 ).
cnf(c_0_75,negated_conjecture,
join(r1,meet(X1,meet(X2,b2))) = meet(b2,join(r1,meet(X1,X2))),
inference(spm,[status(thm)],[c_0_70,c_0_20]) ).
cnf(c_0_76,negated_conjecture,
meet(a,meet(a2,X1)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_71]),c_0_36]) ).
cnf(c_0_77,negated_conjecture,
join(r1,meet(X1,a2)) = meet(a2,join(r1,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_72]) ).
cnf(c_0_78,negated_conjecture,
meet(b2,meet(X1,join(a,r1))) = meet(X1,b2),
inference(spm,[status(thm)],[c_0_52,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
meet(b2,a2) != r1,
inference(rw,[status(thm)],[c_0_74,c_0_19]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(sr,[status(thm)],[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_75,c_0_76]),c_0_46]),c_0_77]),c_0_17]),c_0_78]),c_0_19]),c_0_79]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT005-4 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n005.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 : Sun Sep 20 23:04:49 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 7.03/1.48 % Version: 3.5.1
% 7.03/1.48 % Preprocessing class: FSMSSMSMSSSNFFN.
% 7.03/1.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.03/1.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 7.03/1.48 % Starting new_bool_3 with 300s (1) cores
% 7.03/1.48 % Starting new_bool_1 with 300s (1) cores
% 7.03/1.48 % Starting sh5l with 300s (1) cores
% 7.03/1.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1954169 completed with status 0
% 7.03/1.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 7.03/1.48 % Preprocessing class: FSMSSMSMSSSNFFN.
% 7.03/1.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.03/1.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 7.03/1.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.03/1.48 % No SInE strategy applied
% 7.03/1.48 % Search class: FHUPM-FFSM22-SFFFFFNN
% 7.03/1.48 % partial match(2): FHUSM-FFSF22-SFFFFFNN
% 7.03/1.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.03/1.48 % Starting SubtermCWHack with 136s (1) cores
% 7.03/1.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 7.03/1.48 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 7.03/1.48 % Starting new_bool_3 with 136s (1) cores
% 7.03/1.48 % Starting new_bool_1 with 136s (1) cores
% 7.03/1.48 % H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with pid 1954177 completed with status 0
% 7.03/1.48 % Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S
% 7.03/1.48 % Preprocessing class: FSMSSMSMSSSNFFN.
% 7.03/1.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.03/1.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 7.03/1.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.03/1.48 % No SInE strategy applied
% 7.03/1.48 % Search class: FHUPM-FFSM22-SFFFFFNN
% 7.03/1.48 % partial match(2): FHUSM-FFSF22-SFFFFFNN
% 7.03/1.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.03/1.48 % Starting SubtermCWHack with 136s (1) cores
% 7.03/1.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 7.03/1.48 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 7.03/1.48 % Preprocessing time : 0.001 s
% 7.03/1.48 % Presaturation interreduction done
% 7.03/1.48
% 7.03/1.48 % Proof found!
% 7.03/1.48 % SZS status Unsatisfiable
% 7.03/1.48 % SZS output start CNFRefutation
% See solution above
% 7.03/1.48 % Parsed axioms : 20
% 7.03/1.48 % Removed by relevancy pruning/SinE : 0
% 7.03/1.48 % Initial clauses : 20
% 7.03/1.48 % Removed in clause preprocessing : 0
% 7.03/1.48 % Initial clauses in saturation : 20
% 7.03/1.48 % Processed clauses : 6341
% 7.03/1.48 % ...of these trivial : 2046
% 7.03/1.48 % ...subsumed : 3488
% 7.03/1.48 % ...remaining for further processing : 807
% 7.03/1.48 % Other redundant clauses eliminated : 0
% 7.03/1.48 % Clauses deleted for lack of memory : 0
% 7.03/1.48 % Backward-subsumed : 2
% 7.03/1.48 % Backward-rewritten : 97
% 7.03/1.48 % Generated clauses : 72577
% 7.03/1.48 % ...of the previous two non-redundant : 42149
% 7.03/1.48 % ...aggressively subsumed : 0
% 7.03/1.48 % Contextual simplify-reflections : 0
% 7.03/1.48 % Paramodulations : 72575
% 7.03/1.48 % Factorizations : 0
% 7.03/1.48 % NegExts : 0
% 7.03/1.48 % Equation resolutions : 2
% 7.03/1.48 % Disequality decompositions : 0
% 7.03/1.48 % Total rewrite steps : 129437
% 7.03/1.48 % ...of those cached : 111939
% 7.03/1.48 % Propositional unsat checks : 0
% 7.03/1.48 % Propositional check models : 0
% 7.03/1.48 % Propositional check unsatisfiable : 0
% 7.03/1.48 % Propositional clauses : 0
% 7.03/1.48 % Propositional clauses after purity: 0
% 7.03/1.48 % Propositional unsat core size : 0
% 7.03/1.48 % Propositional preprocessing time : 0.000
% 7.03/1.48 % Propositional encoding time : 0.000
% 7.03/1.48 % Propositional solver time : 0.000
% 7.03/1.48 % Success case prop preproc time : 0.000
% 7.03/1.48 % Success case prop encoding time : 0.000
% 7.03/1.48 % Success case prop solver time : 0.000
% 7.03/1.48 % Current number of processed clauses : 688
% 7.03/1.48 % Positive orientable unit clauses : 379
% 7.03/1.48 % Positive unorientable unit clauses: 7
% 7.03/1.48 % Negative unit clauses : 1
% 7.03/1.48 % Non-unit-clauses : 301
% 7.03/1.48 % Current number of unprocessed clauses: 35303
% 7.03/1.48 % ...number of literals in the above : 53167
% 7.03/1.48 % Current number of archived formulas : 0
% 7.03/1.48 % Current number of archived clauses : 119
% 7.03/1.48 % Clause-clause subsumption calls (NU) : 21546
% 7.03/1.48 % Rec. Clause-clause subsumption calls : 21545
% 7.03/1.48 % Non-unit clause-clause subsumptions : 2453
% 7.03/1.48 % Unit Clause-clause subsumption calls : 414
% 7.03/1.48 % Rewrite failures with RHS unbound : 0
% 7.03/1.48 % BW rewrite match attempts : 1623
% 7.03/1.48 % BW rewrite match successes : 591
% 7.03/1.48 % Condensation attempts : 0
% 7.03/1.48 % Condensation successes : 0
% 7.03/1.48 % Termbank termtop insertions : 842115
% 7.03/1.48 % Search garbage collected termcells : 5
% 7.03/1.48
% 7.03/1.48 % -------------------------------------------------
% 7.03/1.48 % User time : 0.707 s
% 7.03/1.48 % System time : 0.033 s
% 7.03/1.48 % Total time : 0.739 s
% 7.03/1.48 % Maximum resident set size: 3588 pages
% 7.03/1.48
% 7.03/1.48 % -------------------------------------------------
% 7.03/1.48 % User time : 4.248 s
% 7.03/1.48 % System time : 0.206 s
% 7.03/1.48 % Total time : 4.454 s
% 7.03/1.48 % Maximum resident set size: 4864 pages
% 7.03/1.48 % E exiting
%------------------------------------------------------------------------------