%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN686-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 03:35:31 PM UTC 2026
% Result : Unsatisfiable 2.17s 0.73s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 17
% Syntax : Number of clauses : 79 ( 42 unt; 0 nHn; 57 RR)
% Number of literals : 140 ( 0 equ; 64 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 120 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p3_28,negated_conjecture,
( ~ p3(X3,X2)
| ~ p3(X3,X1)
| p3(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_28) ).
cnf(p3_6,negated_conjecture,
p3(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_6) ).
cnf(p3_18,negated_conjecture,
p3(c42,f7(c33,c34)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_18) ).
cnf(p4_50,negated_conjecture,
( ~ p3(X2,X4)
| ~ p2(X1,X3)
| p4(f5(X1,X2),f5(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_50) ).
cnf(p3_17,negated_conjecture,
p3(c36,f7(c33,c34)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_17) ).
cnf(p4_27,negated_conjecture,
( ~ p4(X3,X2)
| ~ p4(X3,X1)
| p4(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_27) ).
cnf(p2_12,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_12) ).
cnf(p4_19,negated_conjecture,
p4(f5(c32,c36),c37),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_19) ).
cnf(p8_51,negated_conjecture,
( ~ p3(X2,X4)
| ~ p11(X1,X3)
| p8(f12(X1,X2),f12(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_51) ).
cnf(p9_41,negated_conjecture,
( ~ p8(X1,X3)
| ~ p4(X2,X4)
| p9(f10(X1,X2),f10(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_41) ).
cnf(p4_20,negated_conjecture,
p4(f5(c32,f7(c33,c34)),c35),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_20) ).
cnf(p11_1,negated_conjecture,
p11(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_1) ).
cnf(p8_3,negated_conjecture,
p8(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_3) ).
cnf(p4_5,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_5) ).
cnf(p30_39,negated_conjecture,
( ~ p30(X4,X3)
| ~ p9(X4,X1)
| ~ p4(X3,X2)
| p30(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p30_39) ).
cnf(p30_21,negated_conjecture,
p30(f10(f12(c39,c36),c37),c41),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p30_21) ).
cnf(not_p30_22,negated_conjecture,
~ p30(f10(f12(c39,f7(c33,c34)),c35),c41),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p30_22) ).
cnf(c_0_17,negated_conjecture,
( ~ p3(X3,X2)
| ~ p3(X3,X1)
| p3(X1,X2) ),
inference(fof_simplification,[status(thm)],[p3_28]) ).
cnf(c_0_18,negated_conjecture,
( ~ p3(X3,X2)
| ~ p3(X3,X1)
| p3(X1,X2) ),
c_0_17 ).
cnf(c_0_19,negated_conjecture,
p3(X1,X1),
p3_6 ).
cnf(c_0_20,negated_conjecture,
( ~ p3(X2,X1)
| p3(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
p3(c42,f7(c33,c34)),
p3_18 ).
cnf(c_0_22,negated_conjecture,
( ~ p3(X2,X4)
| ~ p2(X1,X3)
| p4(f5(X1,X2),f5(X3,X4)) ),
inference(fof_simplification,[status(thm)],[p4_50]) ).
cnf(c_0_23,negated_conjecture,
p3(f7(c33,c34),c42),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
p3(c36,f7(c33,c34)),
p3_17 ).
cnf(c_0_25,negated_conjecture,
( ~ p4(X3,X2)
| ~ p4(X3,X1)
| p4(X1,X2) ),
inference(fof_simplification,[status(thm)],[p4_27]) ).
cnf(c_0_26,negated_conjecture,
( ~ p3(X2,X4)
| ~ p2(X1,X3)
| p4(f5(X1,X2),f5(X3,X4)) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
p2(X1,X1),
p2_12 ).
cnf(c_0_28,negated_conjecture,
( ~ p3(f7(c33,c34),X1)
| p3(X1,c42) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
p3(f7(c33,c34),c36),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ p4(X3,X2)
| ~ p4(X3,X1)
| p4(X1,X2) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
p4(f5(c32,c36),c37),
p4_19 ).
cnf(c_0_32,negated_conjecture,
( ~ p3(X2,X3)
| p4(f5(X1,X2),f5(X1,X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
p3(c36,c42),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( ~ p4(f5(c32,c36),X1)
| p4(X1,c37) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
p4(f5(X1,c36),f5(X1,c42)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
p4(f5(c32,c42),c37),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( ~ p3(X2,X4)
| ~ p11(X1,X3)
| p8(f12(X1,X2),f12(X3,X4)) ),
inference(fof_simplification,[status(thm)],[p8_51]) ).
cnf(c_0_38,negated_conjecture,
( ~ p8(X1,X3)
| ~ p4(X2,X4)
| p9(f10(X1,X2),f10(X3,X4)) ),
inference(fof_simplification,[status(thm)],[p9_41]) ).
cnf(c_0_39,negated_conjecture,
p4(f5(c32,f7(c33,c34)),c35),
p4_20 ).
cnf(c_0_40,negated_conjecture,
( ~ p4(f5(c32,c42),X1)
| p4(X1,c37) ),
inference(spm,[status(thm)],[c_0_30,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
p4(f5(X1,c42),f5(X1,f7(c33,c34))),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_42,negated_conjecture,
( ~ p3(X2,X4)
| ~ p11(X1,X3)
| p8(f12(X1,X2),f12(X3,X4)) ),
c_0_37 ).
cnf(c_0_43,negated_conjecture,
p11(X1,X1),
p11_1 ).
cnf(c_0_44,negated_conjecture,
( ~ p8(X1,X3)
| ~ p4(X2,X4)
| p9(f10(X1,X2),f10(X3,X4)) ),
c_0_38 ).
cnf(c_0_45,negated_conjecture,
p8(X1,X1),
p8_3 ).
cnf(c_0_46,negated_conjecture,
( ~ p4(f5(c32,f7(c33,c34)),X1)
| p4(X1,c35) ),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
p4(f5(c32,f7(c33,c34)),c37),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( ~ p3(X2,X3)
| p8(f12(X1,X2),f12(X1,X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
p4(X1,X1),
p4_5 ).
cnf(c_0_50,negated_conjecture,
( ~ p30(X4,X3)
| ~ p9(X4,X1)
| ~ p4(X3,X2)
| p30(X1,X2) ),
inference(fof_simplification,[status(thm)],[p30_39]) ).
cnf(c_0_51,negated_conjecture,
( ~ p4(X2,X3)
| p9(f10(X1,X2),f10(X1,X3)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
p4(c37,c35),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
p8(f12(X1,c36),f12(X1,c42)),
inference(spm,[status(thm)],[c_0_48,c_0_33]) ).
cnf(c_0_54,negated_conjecture,
( ~ p4(X2,X1)
| p4(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( ~ p30(X4,X3)
| ~ p9(X4,X1)
| ~ p4(X3,X2)
| p30(X1,X2) ),
c_0_50 ).
cnf(c_0_56,negated_conjecture,
p9(f10(X1,c37),f10(X1,c35)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( ~ p4(X2,X3)
| p9(f10(f12(X1,c36),X2),f10(f12(X1,c42),X3)) ),
inference(spm,[status(thm)],[c_0_44,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
p4(c35,c37),
inference(spm,[status(thm)],[c_0_54,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( ~ p4(X3,X2)
| ~ p30(f10(X1,c37),X3)
| p30(f10(X1,c35),X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
p30(f10(f12(c39,c36),c37),c41),
p30_21 ).
cnf(c_0_61,negated_conjecture,
p9(f10(f12(X1,c36),c35),f10(f12(X1,c42),c37)),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( ~ p4(c41,X1)
| p30(f10(f12(c39,c36),c35),X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
( ~ p4(X3,X2)
| ~ p30(f10(f12(X1,c36),c35),X3)
| p30(f10(f12(X1,c42),c37),X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
p30(f10(f12(c39,c36),c35),c41),
inference(spm,[status(thm)],[c_0_62,c_0_49]) ).
cnf(c_0_65,negated_conjecture,
p8(f12(X1,c42),f12(X1,f7(c33,c34))),
inference(spm,[status(thm)],[c_0_48,c_0_21]) ).
cnf(c_0_66,negated_conjecture,
( ~ p4(c41,X1)
| p30(f10(f12(c39,c42),c37),X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( ~ p4(X2,X3)
| p9(f10(f12(X1,c42),X2),f10(f12(X1,f7(c33,c34)),X3)) ),
inference(spm,[status(thm)],[c_0_44,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
p30(f10(f12(c39,c42),c37),c41),
inference(spm,[status(thm)],[c_0_66,c_0_49]) ).
cnf(c_0_69,negated_conjecture,
p9(f10(f12(X1,c42),c35),f10(f12(X1,f7(c33,c34)),c37)),
inference(spm,[status(thm)],[c_0_67,c_0_58]) ).
cnf(c_0_70,negated_conjecture,
( ~ p4(c41,X1)
| p30(f10(f12(c39,c42),c35),X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
( ~ p4(X3,X2)
| ~ p30(f10(f12(X1,c42),c35),X3)
| p30(f10(f12(X1,f7(c33,c34)),c37),X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
p30(f10(f12(c39,c42),c35),c41),
inference(spm,[status(thm)],[c_0_70,c_0_49]) ).
cnf(c_0_73,negated_conjecture,
( ~ p4(c41,X1)
| p30(f10(f12(c39,f7(c33,c34)),c37),X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,negated_conjecture,
p30(f10(f12(c39,f7(c33,c34)),c37),c41),
inference(spm,[status(thm)],[c_0_73,c_0_49]) ).
cnf(c_0_75,negated_conjecture,
~ p30(f10(f12(c39,f7(c33,c34)),c35),c41),
inference(fof_simplification,[status(thm)],[not_p30_22]) ).
cnf(c_0_76,negated_conjecture,
( ~ p4(c41,X1)
| p30(f10(f12(c39,f7(c33,c34)),c35),X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
~ p30(f10(f12(c39,f7(c33,c34)),c35),c41),
c_0_75 ).
cnf(c_0_78,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_49]),c_0_77]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN686-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n004.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.38 % DateTime : Mon Sep 21 11:12:05 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 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
% 2.17/0.73 % Version: 3.5.1
% 2.17/0.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.17/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.17/0.73 % Starting new_bool_3 with 300s (1) cores
% 2.17/0.73 % Starting new_bool_1 with 300s (1) cores
% 2.17/0.73 % Starting sh5l with 300s (1) cores
% 2.17/0.73 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2995828 completed with status 0
% 2.17/0.73 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.17/0.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.17/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.17/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.17/0.73 % No SInE strategy applied
% 2.17/0.73 % Search class: FGUNM-FFMS22-MFFFFFNN
% 2.17/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.17/0.73 % Starting SubtermCWHack with 136s (1) cores
% 2.17/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.17/0.73 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 2.17/0.73 % Starting new_bool_3 with 136s (1) cores
% 2.17/0.73 % Starting new_bool_1 with 136s (1) cores
% 2.17/0.73 % new_bool_1 with pid 2995838 completed with status 0
% 2.17/0.73 % Result found by new_bool_1
% 2.17/0.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.17/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.17/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.17/0.73 % No SInE strategy applied
% 2.17/0.73 % Search class: FGUNM-FFMS22-MFFFFFNN
% 2.17/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.17/0.73 % Starting SubtermCWHack with 136s (1) cores
% 2.17/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.17/0.73 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 2.17/0.73 % Starting new_bool_3 with 136s (1) cores
% 2.17/0.73 % Starting new_bool_1 with 136s (1) cores
% 2.17/0.73 % Preprocessing time : 0.002 s
% 2.17/0.73 % Presaturation interreduction done
% 2.17/0.73
% 2.17/0.73 % Proof found!
% 2.17/0.73 % SZS status Unsatisfiable
% 2.17/0.73 % SZS output start CNFRefutation
% See solution above
% 2.17/0.73 % Parsed axioms : 58
% 2.17/0.73 % Removed by relevancy pruning/SinE : 0
% 2.17/0.73 % Initial clauses : 58
% 2.17/0.73 % Removed in clause preprocessing : 0
% 2.17/0.73 % Initial clauses in saturation : 58
% 2.17/0.73 % Processed clauses : 2790
% 2.17/0.73 % ...of these trivial : 837
% 2.17/0.73 % ...subsumed : 165
% 2.17/0.73 % ...remaining for further processing : 1788
% 2.17/0.73 % Other redundant clauses eliminated : 0
% 2.17/0.73 % Clauses deleted for lack of memory : 0
% 2.17/0.73 % Backward-subsumed : 21
% 2.17/0.73 % Backward-rewritten : 39
% 2.17/0.73 % Generated clauses : 35871
% 2.17/0.73 % ...of the previous two non-redundant : 29664
% 2.17/0.73 % ...aggressively subsumed : 0
% 2.17/0.73 % Contextual simplify-reflections : 0
% 2.17/0.73 % Paramodulations : 35871
% 2.17/0.73 % Factorizations : 0
% 2.17/0.73 % NegExts : 0
% 2.17/0.73 % Equation resolutions : 0
% 2.17/0.73 % Disequality decompositions : 0
% 2.17/0.73 % Total rewrite steps : 7090
% 2.17/0.73 % ...of those cached : 5772
% 2.17/0.73 % Propositional unsat checks : 0
% 2.17/0.73 % Propositional check models : 0
% 2.17/0.73 % Propositional check unsatisfiable : 0
% 2.17/0.73 % Propositional clauses : 0
% 2.17/0.73 % Propositional clauses after purity: 0
% 2.17/0.73 % Propositional unsat core size : 0
% 2.17/0.73 % Propositional preprocessing time : 0.000
% 2.17/0.73 % Propositional encoding time : 0.000
% 2.17/0.73 % Propositional solver time : 0.000
% 2.17/0.73 % Success case prop preproc time : 0.000
% 2.17/0.73 % Success case prop encoding time : 0.000
% 2.17/0.73 % Success case prop solver time : 0.000
% 2.17/0.73 % Current number of processed clauses : 1670
% 2.17/0.73 % Positive orientable unit clauses : 746
% 2.17/0.73 % Positive unorientable unit clauses: 0
% 2.17/0.73 % Negative unit clauses : 1
% 2.17/0.73 % Non-unit-clauses : 923
% 2.17/0.73 % Current number of unprocessed clauses: 26926
% 2.17/0.73 % ...number of literals in the above : 27627
% 2.17/0.73 % Current number of archived formulas : 0
% 2.17/0.73 % Current number of archived clauses : 118
% 2.17/0.73 % Clause-clause subsumption calls (NU) : 63061
% 2.17/0.73 % Rec. Clause-clause subsumption calls : 57846
% 2.17/0.73 % Non-unit clause-clause subsumptions : 186
% 2.17/0.73 % Unit Clause-clause subsumption calls : 6308
% 2.17/0.73 % Rewrite failures with RHS unbound : 0
% 2.17/0.73 % BW rewrite match attempts : 2869
% 2.17/0.73 % BW rewrite match successes : 28
% 2.17/0.73 % Condensation attempts : 0
% 2.17/0.73 % Condensation successes : 0
% 2.17/0.73 % Termbank termtop insertions : 741111
% 2.17/0.73 % Search garbage collected termcells : 189
% 2.17/0.73
% 2.17/0.73 % -------------------------------------------------
% 2.17/0.73 % User time : 0.250 s
% 2.17/0.73 % System time : 0.017 s
% 2.17/0.73 % Total time : 0.267 s
% 2.17/0.73 % Maximum resident set size: 3440 pages
% 2.17/0.73
% 2.17/0.73 % -------------------------------------------------
% 2.17/0.73 % User time : 1.288 s
% 2.17/0.73 % System time : 0.076 s
% 2.17/0.73 % Total time : 1.364 s
% 2.17/0.73 % Maximum resident set size: 4864 pages
% 2.17/0.73 % E exiting
%------------------------------------------------------------------------------