%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL042-2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 02:04:07 PM UTC 2026
% Result : Unsatisfiable 1.05s 0.73s
% Output : CNFRefutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 14
% Syntax : Number of clauses : 76 ( 76 unt; 0 nHn; 8 RR)
% Number of literals : 76 ( 75 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 111 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
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/sandbox2/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(dedekind_law_14,axiom,
join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))) = composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-1.ax',dedekind_law_14) ).
cnf(goals_17,negated_conjecture,
meet(composition(sk1,X1),composition(sk1,complement(X1))) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
cnf(goals_18,negated_conjecture,
join(composition(converse(sk1),sk1),one) != one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_18) ).
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,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_19,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_20,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_21,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_22,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_23,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_27,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_28,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_20]) ).
cnf(c_0_29,plain,
join(meet(X1,X2),meet(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_22]) ).
cnf(c_0_30,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23]),c_0_26]) ).
cnf(c_0_31,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_32,plain,
meet(meet(X1,X2),join(complement(X1),complement(X2))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_28]) ).
cnf(c_0_33,plain,
join(zero,meet(X1,complement(complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_34,plain,
complement(complement(X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_35,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_22]) ).
cnf(c_0_36,plain,
join(meet(X1,X2),complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_37,plain,
meet(meet(X1,X1),complement(X1)) = zero,
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_38,plain,
join(zero,meet(X1,meet(X1,X1))) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
join(X1,X1) = composition(join(one,one),X1),
inference(spm,[status(thm)],[c_0_35,c_0_26]) ).
cnf(c_0_40,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_20]),c_0_38]) ).
cnf(c_0_41,plain,
composition(join(one,one),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_42,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_40]) ).
cnf(c_0_43,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_44,plain,
composition(join(one,one),X1) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_30]),c_0_27]) ).
cnf(c_0_46,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_22]),c_0_43]) ).
cnf(c_0_47,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_39,c_0_44]) ).
cnf(c_0_48,plain,
join(zero,meet(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_34]) ).
cnf(c_0_49,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_43]),c_0_47]) ).
cnf(c_0_50,plain,
join(meet(X1,X2),meet(complement(X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_51,plain,
join(zero,X1) = X1,
inference(rw,[status(thm)],[c_0_48,c_0_40]) ).
cnf(c_0_52,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_22]) ).
cnf(c_0_53,plain,
join(meet(X1,X2),meet(complement(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_50,c_0_28]) ).
cnf(c_0_54,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
meet(complement(zero),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_51]) ).
cnf(c_0_56,plain,
join(complement(zero),X1) = complement(zero),
inference(spm,[status(thm)],[c_0_52,c_0_55]) ).
cnf(c_0_57,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_58,plain,
composition(join(X1,one),zero) = composition(X1,zero),
inference(spm,[status(thm)],[c_0_35,c_0_51]) ).
cnf(c_0_59,plain,
composition(join(X1,one),complement(zero)) = complement(zero),
inference(spm,[status(thm)],[c_0_35,c_0_56]) ).
cnf(c_0_60,plain,
converse(join(X1,one)) = join(one,converse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_23]),c_0_22]) ).
cnf(c_0_61,plain,
composition(join(one,X1),zero) = composition(X1,zero),
inference(spm,[status(thm)],[c_0_58,c_0_22]) ).
cnf(c_0_62,axiom,
join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))) = composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),
dedekind_law_14 ).
cnf(c_0_63,negated_conjecture,
meet(composition(sk1,X1),composition(sk1,complement(X1))) = zero,
goals_17 ).
cnf(c_0_64,plain,
composition(converse(X1),zero) = zero,
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)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_59]),c_0_42]),c_0_60]),c_0_42]),c_0_61]),c_0_35]),c_0_22]),c_0_61]),c_0_42]) ).
cnf(c_0_65,negated_conjecture,
join(composition(converse(sk1),sk1),one) != one,
inference(fof_simplification,[status(thm)],[goals_18]) ).
cnf(c_0_66,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_43,c_0_52]) ).
cnf(c_0_67,plain,
join(meet(composition(converse(X1),X2),X3),composition(meet(converse(X1),composition(X3,converse(X2))),meet(X2,composition(X1,X3)))) = composition(meet(converse(X1),composition(X3,converse(X2))),meet(X2,composition(X1,X3))),
inference(spm,[status(thm)],[c_0_62,c_0_15]) ).
cnf(c_0_68,negated_conjecture,
meet(sk1,composition(sk1,complement(one))) = zero,
inference(spm,[status(thm)],[c_0_63,c_0_17]) ).
cnf(c_0_69,plain,
composition(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_64,c_0_15]) ).
cnf(c_0_70,plain,
join(X1,zero) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_40]),c_0_27]) ).
cnf(c_0_71,negated_conjecture,
join(composition(converse(sk1),sk1),one) != one,
c_0_65 ).
cnf(c_0_72,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_66,c_0_53]) ).
cnf(c_0_73,negated_conjecture,
meet(complement(one),composition(converse(sk1),sk1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_69]),c_0_28]) ).
cnf(c_0_74,negated_conjecture,
join(one,composition(converse(sk1),sk1)) != one,
inference(rw,[status(thm)],[c_0_71,c_0_22]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_70]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL042-2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n001.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 04:13:13 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.53 Running first-order theorem proving
% 0.19/0.53 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
% 1.05/0.73 % Version: 3.5.1
% 1.05/0.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.05/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.05/0.73 % Starting new_bool_3 with 300s (1) cores
% 1.05/0.73 % Starting new_bool_1 with 300s (1) cores
% 1.05/0.73 % Starting sh5l with 300s (1) cores
% 1.05/0.73 % sh5l with pid 2160734 completed with status 0
% 1.05/0.73 % Result found by sh5l
% 1.05/0.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.05/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.05/0.73 % Starting new_bool_3 with 300s (1) cores
% 1.05/0.73 % Starting new_bool_1 with 300s (1) cores
% 1.05/0.73 % Starting sh5l with 300s (1) cores
% 1.05/0.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.05/0.73 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.05/0.73 % Search class: FUUPM-FFMF21-DFFFFFNN
% 1.05/0.73 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.05/0.73 % Starting SubtermCWHack with 28s (1) cores
% 1.05/0.73 % SubtermCWHack with pid 2160739 completed with status 0
% 1.05/0.73 % Result found by SubtermCWHack
% 1.05/0.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.05/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.05/0.73 % Starting new_bool_3 with 300s (1) cores
% 1.05/0.73 % Starting new_bool_1 with 300s (1) cores
% 1.05/0.73 % Starting sh5l with 300s (1) cores
% 1.05/0.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.05/0.73 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.05/0.73 % Search class: FUUPM-FFMF21-DFFFFFNN
% 1.05/0.73 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.05/0.73 % Starting SubtermCWHack with 28s (1) cores
% 1.05/0.73 % Preprocessing time : 0.001 s
% 1.05/0.73
% 1.05/0.73 % Proof found!
% 1.05/0.73 % SZS status Unsatisfiable
% 1.05/0.73 % SZS output start CNFRefutation
% See solution above
% 1.05/0.73 % Parsed axioms : 18
% 1.05/0.73 % Removed by relevancy pruning/SinE : 1
% 1.05/0.73 % Initial clauses : 17
% 1.05/0.73 % Removed in clause preprocessing : 0
% 1.05/0.73 % Initial clauses in saturation : 17
% 1.05/0.73 % Processed clauses : 1453
% 1.05/0.73 % ...of these trivial : 890
% 1.05/0.73 % ...subsumed : 214
% 1.05/0.73 % ...remaining for further processing : 349
% 1.05/0.73 % Other redundant clauses eliminated : 0
% 1.05/0.73 % Clauses deleted for lack of memory : 0
% 1.05/0.73 % Backward-subsumed : 0
% 1.05/0.73 % Backward-rewritten : 97
% 1.05/0.73 % Generated clauses : 22376
% 1.05/0.73 % ...of the previous two non-redundant : 9290
% 1.05/0.73 % ...aggressively subsumed : 0
% 1.05/0.73 % Contextual simplify-reflections : 0
% 1.05/0.73 % Paramodulations : 22376
% 1.05/0.73 % Factorizations : 0
% 1.05/0.73 % NegExts : 0
% 1.05/0.73 % Equation resolutions : 0
% 1.05/0.73 % Disequality decompositions : 0
% 1.05/0.73 % Total rewrite steps : 32653
% 1.05/0.73 % ...of those cached : 26541
% 1.05/0.73 % Propositional unsat checks : 0
% 1.05/0.73 % Propositional check models : 0
% 1.05/0.73 % Propositional check unsatisfiable : 0
% 1.05/0.73 % Propositional clauses : 0
% 1.05/0.73 % Propositional clauses after purity: 0
% 1.05/0.73 % Propositional unsat core size : 0
% 1.05/0.73 % Propositional preprocessing time : 0.000
% 1.05/0.73 % Propositional encoding time : 0.000
% 1.05/0.73 % Propositional solver time : 0.000
% 1.05/0.73 % Success case prop preproc time : 0.000
% 1.05/0.73 % Success case prop encoding time : 0.000
% 1.05/0.73 % Success case prop solver time : 0.000
% 1.05/0.73 % Current number of processed clauses : 252
% 1.05/0.73 % Positive orientable unit clauses : 246
% 1.05/0.73 % Positive unorientable unit clauses: 5
% 1.05/0.73 % Negative unit clauses : 1
% 1.05/0.73 % Non-unit-clauses : 0
% 1.05/0.73 % Current number of unprocessed clauses: 7527
% 1.05/0.73 % ...number of literals in the above : 7527
% 1.05/0.73 % Current number of archived formulas : 0
% 1.05/0.73 % Current number of archived clauses : 97
% 1.05/0.73 % Clause-clause subsumption calls (NU) : 0
% 1.05/0.73 % Rec. Clause-clause subsumption calls : 0
% 1.05/0.73 % Non-unit clause-clause subsumptions : 0
% 1.05/0.73 % Unit Clause-clause subsumption calls : 11
% 1.05/0.73 % Rewrite failures with RHS unbound : 0
% 1.05/0.73 % BW rewrite match attempts : 645
% 1.05/0.73 % BW rewrite match successes : 108
% 1.05/0.73 % Condensation attempts : 0
% 1.05/0.73 % Condensation successes : 0
% 1.05/0.73 % Termbank termtop insertions : 216692
% 1.05/0.73 % Search garbage collected termcells : 5
% 1.05/0.73
% 1.05/0.73 % -------------------------------------------------
% 1.05/0.73 % User time : 0.150 s
% 1.05/0.73 % System time : 0.013 s
% 1.05/0.73 % Total time : 0.163 s
% 1.05/0.73 % Maximum resident set size: 3648 pages
% 1.05/0.73
% 1.05/0.73 % -------------------------------------------------
% 1.05/0.73 % User time : 0.151 s
% 1.05/0.73 % System time : 0.018 s
% 1.05/0.73 % Total time : 0.169 s
% 1.05/0.73 % Maximum resident set size: 4864 pages
% 1.05/0.73 % E exiting
%------------------------------------------------------------------------------