%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL027-2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 02:04:00 PM UTC 2026
% Result : Unsatisfiable 3.73s 1.16s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of clauses : 69 ( 63 unt; 0 nHn; 16 RR)
% Number of literals : 75 ( 74 equ; 12 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 84 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_top_12) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(goals_15,negated_conjecture,
( join(meet(complement(composition(sk1,top)),one),meet(complement(sk1),one)) != meet(complement(sk1),one)
| join(meet(complement(sk1),one),meet(complement(composition(sk1,top)),one)) != meet(complement(composition(sk1,top)),one) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_15) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(goals_14,negated_conjecture,
join(sk1,one) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).
cnf(c_0_14,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_15,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_16,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_18,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_19,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_20,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_21,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_23,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_24,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_25,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_26,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_28,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_30,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_31,plain,
join(top,zero) = top,
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_32,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_33,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]),c_0_29]) ).
cnf(c_0_34,plain,
join(top,join(zero,X1)) = join(top,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_22]),c_0_26]),c_0_24]) ).
cnf(c_0_36,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_37,plain,
join(top,complement(complement(X1))) = join(top,X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_22]),c_0_24]) ).
cnf(c_0_39,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_40,plain,
join(top,X1) = top,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_42,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_36,c_0_40]) ).
cnf(c_0_43,plain,
join(converse(top),X1) = converse(top),
inference(spm,[status(thm)],[c_0_41,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( join(meet(complement(composition(sk1,top)),one),meet(complement(sk1),one)) != meet(complement(sk1),one)
| join(meet(complement(sk1),one),meet(complement(composition(sk1,top)),one)) != meet(complement(composition(sk1,top)),one) ),
inference(fof_simplification,[status(thm)],[goals_15]) ).
cnf(c_0_45,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_46,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_47,negated_conjecture,
join(sk1,one) = one,
goals_14 ).
cnf(c_0_48,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_49,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( join(meet(complement(composition(sk1,top)),one),meet(complement(sk1),one)) != meet(complement(sk1),one)
| join(meet(complement(sk1),one),meet(complement(composition(sk1,top)),one)) != meet(complement(composition(sk1,top)),one) ),
c_0_44 ).
cnf(c_0_51,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_30,c_0_45]) ).
cnf(c_0_52,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[c_0_46,c_0_29]) ).
cnf(c_0_53,negated_conjecture,
join(one,sk1) = one,
inference(rw,[status(thm)],[c_0_47,c_0_24]) ).
cnf(c_0_54,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_22]),c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( join(complement(join(complement(complement(sk1)),complement(one))),complement(join(complement(complement(composition(sk1,top))),complement(one)))) != complement(join(complement(complement(composition(sk1,top))),complement(one)))
| join(complement(join(complement(complement(composition(sk1,top))),complement(one))),complement(join(complement(complement(sk1)),complement(one)))) != complement(join(complement(complement(sk1)),complement(one))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_56,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_35]) ).
cnf(c_0_57,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_30]) ).
cnf(c_0_58,negated_conjecture,
join(X1,composition(sk1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_29]) ).
cnf(c_0_59,plain,
join(X1,composition(converse(complement(one)),X1)) = composition(top,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_54]),c_0_25]) ).
cnf(c_0_60,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_61,negated_conjecture,
( join(complement(join(complement(one),complement(complement(sk1)))),complement(join(complement(one),complement(complement(composition(sk1,top)))))) != complement(join(complement(one),complement(complement(sk1))))
| join(complement(join(complement(one),complement(complement(sk1)))),complement(join(complement(one),complement(complement(composition(sk1,top)))))) != complement(join(complement(one),complement(complement(composition(sk1,top))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_62,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_56]) ).
cnf(c_0_63,negated_conjecture,
join(X1,join(X2,composition(sk1,X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
join(X1,composition(X1,complement(one))) = composition(X1,top),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_59]),c_0_60]),c_0_49]),c_0_14]),c_0_15]) ).
cnf(c_0_65,negated_conjecture,
( join(complement(join(sk1,complement(one))),complement(join(complement(one),composition(sk1,top)))) != complement(join(sk1,complement(one)))
| join(complement(join(sk1,complement(one))),complement(join(complement(one),composition(sk1,top)))) != complement(join(complement(one),composition(sk1,top))) ),
inference(rw,[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_61,c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_66,negated_conjecture,
join(complement(one),composition(sk1,top)) = join(sk1,complement(one)),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_66]),c_0_66]),c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL027-2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n026.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 04:05:07 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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
% 3.73/1.16 % Version: 3.5.1
% 3.73/1.16 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.73/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.73/1.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.73/1.16 % Starting new_bool_3 with 300s (1) cores
% 3.73/1.16 % Starting new_bool_1 with 300s (1) cores
% 3.73/1.16 % Starting sh5l with 300s (1) cores
% 3.73/1.16 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1328723 completed with status 0
% 3.73/1.16 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.73/1.16 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.73/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.73/1.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.73/1.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.73/1.16 % No SInE strategy applied
% 3.73/1.16 % Search class: FUHPM-FFSF21-DFFFFFNN
% 3.73/1.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.73/1.16 % Starting SubtermCWHack with 136s (1) cores
% 3.73/1.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.73/1.16 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 3.73/1.16 % Starting new_bool_3 with 136s (1) cores
% 3.73/1.16 % Starting new_bool_1 with 136s (1) cores
% 3.73/1.16 % new_bool_1 with pid 1328734 completed with status 0
% 3.73/1.16 % Result found by new_bool_1
% 3.73/1.16 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.73/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.73/1.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.73/1.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.73/1.16 % No SInE strategy applied
% 3.73/1.16 % Search class: FUHPM-FFSF21-DFFFFFNN
% 3.73/1.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.73/1.16 % Starting SubtermCWHack with 136s (1) cores
% 3.73/1.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.73/1.16 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 3.73/1.16 % Starting new_bool_3 with 136s (1) cores
% 3.73/1.16 % Starting new_bool_1 with 136s (1) cores
% 3.73/1.16 % Preprocessing time : 0.002 s
% 3.73/1.16 % Presaturation interreduction done
% 3.73/1.16
% 3.73/1.16 % Proof found!
% 3.73/1.16 % SZS status Unsatisfiable
% 3.73/1.16 % SZS output start CNFRefutation
% See solution above
% 3.73/1.16 % Parsed axioms : 15
% 3.73/1.16 % Removed by relevancy pruning/SinE : 0
% 3.73/1.16 % Initial clauses : 15
% 3.73/1.16 % Removed in clause preprocessing : 1
% 3.73/1.16 % Initial clauses in saturation : 14
% 3.73/1.16 % Processed clauses : 1775
% 3.73/1.16 % ...of these trivial : 1070
% 3.73/1.16 % ...subsumed : 188
% 3.73/1.16 % ...remaining for further processing : 517
% 3.73/1.16 % Other redundant clauses eliminated : 0
% 3.73/1.16 % Clauses deleted for lack of memory : 0
% 3.73/1.16 % Backward-subsumed : 0
% 3.73/1.16 % Backward-rewritten : 87
% 3.73/1.16 % Generated clauses : 33393
% 3.73/1.16 % ...of the previous two non-redundant : 15125
% 3.73/1.16 % ...aggressively subsumed : 0
% 3.73/1.16 % Contextual simplify-reflections : 0
% 3.73/1.16 % Paramodulations : 33393
% 3.73/1.16 % Factorizations : 0
% 3.73/1.16 % NegExts : 0
% 3.73/1.16 % Equation resolutions : 0
% 3.73/1.16 % Disequality decompositions : 0
% 3.73/1.16 % Total rewrite steps : 61139
% 3.73/1.16 % ...of those cached : 52433
% 3.73/1.16 % Propositional unsat checks : 0
% 3.73/1.16 % Propositional check models : 0
% 3.73/1.16 % Propositional check unsatisfiable : 0
% 3.73/1.16 % Propositional clauses : 0
% 3.73/1.16 % Propositional clauses after purity: 0
% 3.73/1.16 % Propositional unsat core size : 0
% 3.73/1.16 % Propositional preprocessing time : 0.000
% 3.73/1.16 % Propositional encoding time : 0.000
% 3.73/1.16 % Propositional solver time : 0.000
% 3.73/1.16 % Success case prop preproc time : 0.000
% 3.73/1.16 % Success case prop encoding time : 0.000
% 3.73/1.16 % Success case prop solver time : 0.000
% 3.73/1.16 % Current number of processed clauses : 416
% 3.73/1.16 % Positive orientable unit clauses : 409
% 3.73/1.16 % Positive unorientable unit clauses: 6
% 3.73/1.16 % Negative unit clauses : 0
% 3.73/1.16 % Non-unit-clauses : 1
% 3.73/1.16 % Current number of unprocessed clauses: 13167
% 3.73/1.16 % ...number of literals in the above : 13167
% 3.73/1.16 % Current number of archived formulas : 0
% 3.73/1.16 % Current number of archived clauses : 102
% 3.73/1.16 % Clause-clause subsumption calls (NU) : 2
% 3.73/1.16 % Rec. Clause-clause subsumption calls : 2
% 3.73/1.16 % Non-unit clause-clause subsumptions : 1
% 3.73/1.16 % Unit Clause-clause subsumption calls : 35
% 3.73/1.16 % Rewrite failures with RHS unbound : 0
% 3.73/1.16 % BW rewrite match attempts : 1880
% 3.73/1.16 % BW rewrite match successes : 347
% 3.73/1.16 % Condensation attempts : 0
% 3.73/1.16 % Condensation successes : 0
% 3.73/1.16 % Termbank termtop insertions : 384861
% 3.73/1.16 % Search garbage collected termcells : 5
% 3.73/1.16
% 3.73/1.16 % -------------------------------------------------
% 3.73/1.16 % User time : 0.514 s
% 3.73/1.16 % System time : 0.024 s
% 3.73/1.16 % Total time : 0.538 s
% 3.73/1.16 % Maximum resident set size: 3644 pages
% 3.73/1.16
% 3.73/1.16 % -------------------------------------------------
% 3.73/1.16 % User time : 1.995 s
% 3.73/1.16 % System time : 0.116 s
% 3.73/1.16 % Total time : 2.111 s
% 3.73/1.16 % Maximum resident set size: 4608 pages
% 3.73/1.16 % E exiting
%------------------------------------------------------------------------------