%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT002-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:03:59 PM UTC 2026
% Result : Unsatisfiable 247.70s 36.99s
% Output : CNFRefutation 247.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of clauses : 79 ( 66 unt; 0 nHn; 26 RR)
% Number of literals : 95 ( 78 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 132 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(modular,axiom,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-1.ax',modular) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(complement_join,axiom,
( ~ complement(X1,X2)
| join(X1,X2) = n1 ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-2.ax',complement_join) ).
cnf(x_meet_1,axiom,
meet(X1,n1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-1.ax',x_meet_1) ).
cnf(complement_meet,axiom,
( ~ complement(X1,X2)
| meet(X1,X2) = n0 ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-2.ax',complement_meet) ).
cnf(complement_of_a_meet_b,hypothesis,
complement(r2,meet(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_a_meet_b) ).
cnf(complement_of_a_join_b,hypothesis,
complement(r1,join(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_a_join_b) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(x_join_0,axiom,
join(X1,n0) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-1.ax',x_join_0) ).
cnf(meet_join_complement,axiom,
( join(X1,X2) != n1
| meet(X1,X2) != n0
| complement(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-2.ax',meet_join_complement) ).
cnf(prove_complememt_exists,negated_conjecture,
~ complement(a,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_complememt_exists) ).
cnf(x_meet_0,axiom,
meet(X1,n0) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-1.ax',x_meet_0) ).
cnf(x_join_1,axiom,
join(X1,n1) = n1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-1.ax',x_join_1) ).
cnf(c_0_18,plain,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
inference(fof_simplification,[status(thm)],[modular]) ).
cnf(c_0_19,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_20,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_21,plain,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
c_0_18 ).
cnf(c_0_22,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_24,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_25,plain,
join(X1,meet(X2,join(X3,X1))) = meet(join(X3,X1),join(X1,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
join(meet(X1,X2),meet(X3,X1)) = meet(X1,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_28,plain,
( ~ complement(X1,X2)
| join(X1,X2) = n1 ),
inference(fof_simplification,[status(thm)],[complement_join]) ).
cnf(c_0_29,axiom,
meet(X1,n1) = X1,
x_meet_1 ).
cnf(c_0_30,plain,
( ~ complement(X1,X2)
| meet(X1,X2) = n0 ),
inference(fof_simplification,[status(thm)],[complement_meet]) ).
cnf(c_0_31,plain,
join(meet(X1,X2),meet(X3,X2)) = meet(X2,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(meet(X2,X3),X1)),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_33,plain,
( ~ complement(X1,X2)
| join(X1,X2) = n1 ),
c_0_28 ).
cnf(c_0_34,hypothesis,
complement(r2,meet(a,b)),
complement_of_a_meet_b ).
cnf(c_0_35,plain,
meet(n1,X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_36,plain,
( ~ complement(X1,X2)
| meet(X1,X2) = n0 ),
c_0_30 ).
cnf(c_0_37,hypothesis,
complement(r1,join(a,b)),
complement_of_a_join_b ).
cnf(c_0_38,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_31,c_0_24]),c_0_32]) ).
cnf(c_0_39,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_40,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_41,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_42,hypothesis,
join(r2,meet(a,b)) = n1,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,plain,
join(n1,X1) = n1,
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
cnf(c_0_44,hypothesis,
meet(r1,join(a,b)) = n0,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,axiom,
join(X1,n0) = X1,
x_join_0 ).
cnf(c_0_46,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,meet(X3,X1))),
inference(spm,[status(thm)],[c_0_38,c_0_20]) ).
cnf(c_0_47,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_39]) ).
cnf(c_0_48,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,hypothesis,
join(r2,join(meet(a,b),X1)) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_50,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_39,c_0_19]) ).
cnf(c_0_51,hypothesis,
meet(join(a,b),join(b,r1)) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_44]),c_0_45]) ).
cnf(c_0_52,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_53,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_41]) ).
cnf(c_0_54,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,meet(X3,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_46]),c_0_31]),c_0_48]) ).
cnf(c_0_55,hypothesis,
join(r2,join(X1,meet(a,b))) = n1,
inference(spm,[status(thm)],[c_0_49,c_0_20]) ).
cnf(c_0_56,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_57,plain,
( join(X1,X2) != n1
| meet(X1,X2) != n0
| complement(X1,X2) ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_58,hypothesis,
meet(a,join(b,r1)) = meet(a,b),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
~ complement(a,X1),
inference(fof_simplification,[status(thm)],[prove_complememt_exists]) ).
cnf(c_0_60,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_52]) ).
cnf(c_0_61,plain,
join(meet(X1,X2),meet(X3,X2)) = meet(X2,join(X1,meet(X3,X2))),
inference(rw,[status(thm)],[c_0_31,c_0_54]) ).
cnf(c_0_62,hypothesis,
join(r2,meet(a,join(b,meet(a,X1)))) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_20]) ).
cnf(c_0_63,plain,
join(X1,meet(X2,join(X1,X3))) = meet(join(X1,X3),join(X1,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_64,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_47]),c_0_50]) ).
cnf(c_0_65,plain,
( join(X1,X2) != n1
| meet(X1,X2) != n0
| complement(X1,X2) ),
c_0_57 ).
cnf(c_0_66,hypothesis,
meet(a,meet(join(b,r1),X1)) = meet(a,meet(b,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_58]),c_0_39]) ).
cnf(c_0_67,negated_conjecture,
~ complement(a,X1),
c_0_59 ).
cnf(c_0_68,hypothesis,
meet(r2,meet(a,b)) = n0,
inference(spm,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_69,axiom,
meet(X1,n0) = n0,
x_meet_0 ).
cnf(c_0_70,plain,
join(X1,meet(X2,join(X3,meet(X1,X2)))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_71,hypothesis,
join(r2,meet(a,join(b,X1))) = n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_20]),c_0_64]) ).
cnf(c_0_72,hypothesis,
join(r1,join(a,b)) = n1,
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_73,axiom,
join(X1,n1) = n1,
x_join_1 ).
cnf(c_0_74,hypothesis,
( meet(a,meet(b,X1)) != n0
| join(a,meet(join(b,r1),X1)) != n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_75,hypothesis,
meet(a,meet(b,r2)) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_68]),c_0_69]),c_0_39]) ).
cnf(c_0_76,hypothesis,
join(a,meet(r2,join(b,X1))) = join(a,join(b,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_29]) ).
cnf(c_0_77,hypothesis,
join(a,join(b,r1)) = n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_72]),c_0_73]),c_0_41]) ).
cnf(c_0_78,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_24]),c_0_76]),c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n001.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 : Sun Sep 20 23:08:28 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.40 Running first-order theorem proving
% 0.09/0.40 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
% 247.70/36.99 % Version: 3.5.1
% 247.70/36.99 % Preprocessing class: FSMSSMSSSSSNFFN.
% 247.70/36.99 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 247.70/36.99 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 247.70/36.99 % Starting new_bool_3 with 300s (1) cores
% 247.70/36.99 % Starting new_bool_1 with 300s (1) cores
% 247.70/36.99 % Starting sh5l with 300s (1) cores
% 247.70/36.99 % sh5l with pid 1608138 completed with status 0
% 247.70/36.99 % Result found by sh5l
% 247.70/36.99 % Preprocessing class: FSMSSMSSSSSNFFN.
% 247.70/36.99 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 247.70/36.99 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 247.70/36.99 % Starting new_bool_3 with 300s (1) cores
% 247.70/36.99 % Starting new_bool_1 with 300s (1) cores
% 247.70/36.99 % Starting sh5l with 300s (1) cores
% 247.70/36.99 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 247.70/36.99 % SinE strategy is gf500_gu_R04_F100_L20000
% 247.70/36.99 % Search class: FHUSM-FFSF22-SFFFFFNN
% 247.70/36.99 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 247.70/36.99 % Starting SubtermCWHack with 31s (1) cores
% 247.70/36.99 % SubtermCWHack with pid 1608145 completed with status 8
% 247.70/36.99 % Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 247.70/36.99 % G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 1608180 completed with status 0
% 247.70/36.99 % Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 247.70/36.99 % Preprocessing class: FSMSSMSSSSSNFFN.
% 247.70/36.99 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 247.70/36.99 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 247.70/36.99 % Starting new_bool_3 with 300s (1) cores
% 247.70/36.99 % Starting new_bool_1 with 300s (1) cores
% 247.70/36.99 % Starting sh5l with 300s (1) cores
% 247.70/36.99 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 247.70/36.99 % SinE strategy is gf500_gu_R04_F100_L20000
% 247.70/36.99 % Search class: FHUSM-FFSF22-SFFFFFNN
% 247.70/36.99 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 247.70/36.99 % Starting SubtermCWHack with 31s (1) cores
% 247.70/36.99 % SubtermCWHack with pid 1608145 completed with status 8
% 247.70/36.99 % Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 247.70/36.99 % Preprocessing time : 0.001 s
% 247.70/36.99 % Presaturation interreduction done
% 247.70/36.99
% 247.70/36.99 % Proof found!
% 247.70/36.99 % SZS status Unsatisfiable
% 247.70/36.99 % SZS output start CNFRefutation
% See solution above
% 247.70/36.99 % Parsed axioms : 19
% 247.70/36.99 % Removed by relevancy pruning/SinE : 0
% 247.70/36.99 % Initial clauses : 19
% 247.70/36.99 % Removed in clause preprocessing : 0
% 247.70/36.99 % Initial clauses in saturation : 19
% 247.70/36.99 % Processed clauses : 21125
% 247.70/36.99 % ...of these trivial : 6757
% 247.70/36.99 % ...subsumed : 13368
% 247.70/36.99 % ...remaining for further processing : 999
% 247.70/36.99 % Other redundant clauses eliminated : 0
% 247.70/36.99 % Clauses deleted for lack of memory : 0
% 247.70/36.99 % Backward-subsumed : 29
% 247.70/36.99 % Backward-rewritten : 101
% 247.70/36.99 % Generated clauses : 282797
% 247.70/36.99 % ...of the previous two non-redundant : 180263
% 247.70/36.99 % ...aggressively subsumed : 0
% 247.70/36.99 % Contextual simplify-reflections : 0
% 247.70/36.99 % Paramodulations : 282775
% 247.70/36.99 % Factorizations : 0
% 247.70/36.99 % NegExts : 0
% 247.70/36.99 % Equation resolutions : 22
% 247.70/36.99 % Disequality decompositions : 0
% 247.70/36.99 % Total rewrite steps : 584241
% 247.70/36.99 % ...of those cached : 485004
% 247.70/36.99 % Propositional unsat checks : 0
% 247.70/36.99 % Propositional check models : 0
% 247.70/36.99 % Propositional check unsatisfiable : 0
% 247.70/36.99 % Propositional clauses : 0
% 247.70/36.99 % Propositional clauses after purity: 0
% 247.70/36.99 % Propositional unsat core size : 0
% 247.70/36.99 % Propositional preprocessing time : 0.000
% 247.70/36.99 % Propositional encoding time : 0.000
% 247.70/36.99 % Propositional solver time : 0.000
% 247.70/36.99 % Success case prop preproc time : 0.000
% 247.70/36.99 % Success case prop encoding time : 0.000
% 247.70/36.99 % Success case prop solver time : 0.000
% 247.70/36.99 % Current number of processed clauses : 850
% 247.70/36.99 % Positive orientable unit clauses : 522
% 247.70/36.99 % Positive unorientable unit clauses: 22
% 247.70/36.99 % Negative unit clauses : 51
% 247.70/36.99 % Non-unit-clauses : 255
% 247.70/36.99 % Current number of unprocessed clauses: 158098
% 247.70/36.99 % ...number of literals in the above : 205500
% 247.70/36.99 % Current number of archived formulas : 0
% 247.70/36.99 % Current number of archived clauses : 149
% 247.70/36.99 % Clause-clause subsumption calls (NU) : 20761
% 247.70/36.99 % Rec. Clause-clause subsumption calls : 20662
% 247.70/36.99 % Non-unit clause-clause subsumptions : 5385
% 247.70/36.99 % Unit Clause-clause subsumption calls : 1982
% 247.70/36.99 % Rewrite failures with RHS unbound : 0
% 247.70/36.99 % BW rewrite match attempts : 7014
% 247.70/36.99 % BW rewrite match successes : 1549
% 247.70/36.99 % Condensation attempts : 0
% 247.70/36.99 % Condensation successes : 0
% 247.70/36.99 % Termbank termtop insertions : 4120548
% 247.70/36.99 % Search garbage collected termcells : 12
% 247.70/36.99
% 247.70/36.99 % -------------------------------------------------
% 247.70/36.99 % User time : 33.870 s
% 247.70/36.99 % System time : 1.181 s
% 247.70/36.99 % Total time : 35.051 s
% 247.70/36.99 % Maximum resident set size: 3644 pages
% 247.70/36.99
% 247.70/36.99 % -------------------------------------------------
% 247.70/36.99 % User time : 33.871 s
% 247.70/36.99 % System time : 1.189 s
% 247.70/36.99 % Total time : 35.060 s
% 247.70/36.99 % Maximum resident set size: 4864 pages
% 247.70/36.99 % E exiting
%------------------------------------------------------------------------------