%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWC003-2 : 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 : 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 12:45:52 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.45s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 45 ( 29 unt; 0 nHn; 23 RR)
% Number of literals : 64 ( 11 equ; 27 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-10 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-8 aty)
% Number of variables : 136 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(inverter_test,axiom,
( ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),add_inverter(X9,inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8))),make_reverse_list(list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverter_test) ).
cnf(make_reverse_list_definition2,axiom,
make_reverse_list(X1) = end,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',make_reverse_list_definition2) ).
cnf(add_inverter_definition2,axiom,
add_inverter(X1,X2) = list(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_inverter_definition2) ).
cnf(create_test,axiom,
( ~ test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10)
| basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',create_test) ).
cnf(input3,negated_conjecture,
output(n0,n1,n0,n1,n0,n1,n0,n1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',input3) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',not_definition1) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',not_definition2) ).
cnf(basic_output_definition,axiom,
( ~ basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',basic_output_definition) ).
cnf(prove_cannot_construct_this,negated_conjecture,
( ~ output(n1,n0,n1,n0,n1,n0,n1,n0,X1)
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,X1)
| ~ output(n1,n1,n1,n1,n0,n0,n0,n0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cannot_construct_this) ).
cnf(add_inverter_definition1,axiom,
add_inverter(list(X1,X2),X3) = list(X1,add_inverter(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_inverter_definition1) ).
cnf(input2,negated_conjecture,
output(n0,n0,n1,n1,n0,n0,n1,n1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',input2) ).
cnf(input1,negated_conjecture,
output(n0,n0,n0,n0,n1,n1,n1,n1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',input1) ).
cnf(c_0_12,plain,
( ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),add_inverter(X9,inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8))),make_reverse_list(list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9))) ),
inference(fof_simplification,[status(thm)],[inverter_test]) ).
cnf(c_0_13,plain,
( ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),add_inverter(X9,inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8))),make_reverse_list(list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9))) ),
c_0_12 ).
cnf(c_0_14,axiom,
make_reverse_list(X1) = end,
make_reverse_list_definition2 ).
cnf(c_0_15,axiom,
add_inverter(X1,X2) = list(X2,X1),
add_inverter_definition2 ).
cnf(c_0_16,plain,
( ~ test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10)
| basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
inference(fof_simplification,[status(thm)],[create_test]) ).
cnf(c_0_17,plain,
( ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9),end) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
output(n0,n1,n0,n1,n0,n1,n0,n1,X1),
input3 ).
cnf(c_0_19,axiom,
not(n0) = n1,
not_definition1 ).
cnf(c_0_20,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_21,plain,
( ~ basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
inference(fof_simplification,[status(thm)],[basic_output_definition]) ).
cnf(c_0_22,plain,
( ~ test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10)
| basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
c_0_16 ).
cnf(c_0_23,negated_conjecture,
test(n1,n0,n1,n0,n1,n0,n1,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1),end),
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(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_17,c_0_18]),c_0_19]),c_0_20]),c_0_19]),c_0_20]),c_0_19]),c_0_20]),c_0_19]),c_0_20]),c_0_19]),c_0_20]),c_0_19]),c_0_20]),c_0_19]),c_0_20]),c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ output(n1,n0,n1,n0,n1,n0,n1,n0,X1)
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,X1)
| ~ output(n1,n1,n1,n1,n0,n0,n0,n0,X1) ),
inference(fof_simplification,[status(thm)],[prove_cannot_construct_this]) ).
cnf(c_0_25,plain,
( ~ basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
basic_output(n1,n0,n1,n0,n1,n0,n1,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( ~ output(n1,n0,n1,n0,n1,n0,n1,n0,X1)
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,X1)
| ~ output(n1,n1,n1,n1,n0,n0,n0,n0,X1) ),
c_0_24 ).
cnf(c_0_28,negated_conjecture,
output(n1,n0,n1,n0,n1,n0,n1,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
add_inverter(list(X1,X2),X3) = list(X1,add_inverter(X2,X3)),
add_inverter_definition1 ).
cnf(c_0_30,negated_conjecture,
output(n0,n0,n1,n1,n0,n0,n1,n1,X1),
input2 ).
cnf(c_0_31,negated_conjecture,
( ~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1))
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
list(X1,list(X3,X2)) = list(X3,list(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_15]),c_0_15]) ).
cnf(c_0_33,negated_conjecture,
test(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),X1),end),
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(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_17,c_0_30]),c_0_19]),c_0_19]),c_0_20]),c_0_20]),c_0_19]),c_0_19]),c_0_20]),c_0_20]),c_0_19]),c_0_19]),c_0_20]),c_0_20]),c_0_19]),c_0_19]),c_0_20]),c_0_20]) ).
cnf(c_0_34,negated_conjecture,
( ~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(X1,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2)))
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,list(X1,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
basic_output(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),X1)),
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
output(n0,n0,n0,n0,n1,n1,n1,n1,X1),
input1 ).
cnf(c_0_37,negated_conjecture,
( ~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(X1,list(X2,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X3))))
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,list(X1,list(X2,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X3)))) ),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
output(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
test(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),X1),end),
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(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_17,c_0_36]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_20]),c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_40,negated_conjecture,
~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),list(X1,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2)))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
basic_output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),X1)),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(X1,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2)))),
inference(spm,[status(thm)],[c_0_40,c_0_32]) ).
cnf(c_0_43,negated_conjecture,
output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_42,c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWC003-2 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n004.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 20:46:51 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/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
% 0.09/0.45 % Version: 3.5.1
% 0.09/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.09/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.45 % Starting sh5l with 300s (1) cores
% 0.09/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1463891 completed with status 0
% 0.09/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.09/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.09/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.45 % No SInE strategy applied
% 0.09/0.45 % Search class: FHHSM-FFMF32-DFFFFFNN
% 0.09/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.09/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.09/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.45 % new_bool_3 with pid 1463899 completed with status 0
% 0.09/0.45 % Result found by new_bool_3
% 0.09/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.09/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.45 % No SInE strategy applied
% 0.09/0.45 % Search class: FHHSM-FFMF32-DFFFFFNN
% 0.09/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.09/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.09/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.45 % Preprocessing time : 0.001 s
% 0.09/0.45 % Presaturation interreduction done
% 0.09/0.45
% 0.09/0.45 % Proof found!
% 0.09/0.45 % SZS status Unsatisfiable
% 0.09/0.45 % SZS output start CNFRefutation
% See solution above
% 0.09/0.45 % Parsed axioms : 25
% 0.09/0.45 % Removed by relevancy pruning/SinE : 0
% 0.09/0.45 % Initial clauses : 25
% 0.09/0.45 % Removed in clause preprocessing : 2
% 0.09/0.45 % Initial clauses in saturation : 23
% 0.09/0.45 % Processed clauses : 89
% 0.09/0.45 % ...of these trivial : 4
% 0.09/0.45 % ...subsumed : 12
% 0.09/0.45 % ...remaining for further processing : 73
% 0.09/0.45 % Other redundant clauses eliminated : 0
% 0.09/0.45 % Clauses deleted for lack of memory : 0
% 0.09/0.45 % Backward-subsumed : 0
% 0.09/0.45 % Backward-rewritten : 0
% 0.09/0.45 % Generated clauses : 396
% 0.09/0.45 % ...of the previous two non-redundant : 325
% 0.09/0.45 % ...aggressively subsumed : 0
% 0.09/0.45 % Contextual simplify-reflections : 0
% 0.09/0.45 % Paramodulations : 396
% 0.09/0.45 % Factorizations : 0
% 0.09/0.45 % NegExts : 0
% 0.09/0.45 % Equation resolutions : 0
% 0.09/0.45 % Disequality decompositions : 0
% 0.09/0.45 % Total rewrite steps : 347
% 0.09/0.45 % ...of those cached : 188
% 0.09/0.45 % Propositional unsat checks : 0
% 0.09/0.45 % Propositional check models : 0
% 0.09/0.45 % Propositional check unsatisfiable : 0
% 0.09/0.45 % Propositional clauses : 0
% 0.09/0.45 % Propositional clauses after purity: 0
% 0.09/0.45 % Propositional unsat core size : 0
% 0.09/0.45 % Propositional preprocessing time : 0.000
% 0.09/0.45 % Propositional encoding time : 0.000
% 0.09/0.45 % Propositional solver time : 0.000
% 0.09/0.45 % Success case prop preproc time : 0.000
% 0.09/0.45 % Success case prop encoding time : 0.000
% 0.09/0.45 % Success case prop solver time : 0.000
% 0.09/0.45 % Current number of processed clauses : 50
% 0.09/0.45 % Positive orientable unit clauses : 36
% 0.09/0.45 % Positive unorientable unit clauses: 2
% 0.09/0.45 % Negative unit clauses : 3
% 0.09/0.45 % Non-unit-clauses : 9
% 0.09/0.45 % Current number of unprocessed clauses: 278
% 0.09/0.45 % ...number of literals in the above : 286
% 0.09/0.45 % Current number of archived formulas : 0
% 0.09/0.45 % Current number of archived clauses : 25
% 0.09/0.45 % Clause-clause subsumption calls (NU) : 46
% 0.09/0.45 % Rec. Clause-clause subsumption calls : 41
% 0.09/0.45 % Non-unit clause-clause subsumptions : 8
% 0.09/0.45 % Unit Clause-clause subsumption calls : 19
% 0.09/0.45 % Rewrite failures with RHS unbound : 0
% 0.09/0.45 % BW rewrite match attempts : 39
% 0.09/0.45 % BW rewrite match successes : 8
% 0.09/0.45 % Condensation attempts : 0
% 0.09/0.45 % Condensation successes : 0
% 0.09/0.45 % Termbank termtop insertions : 13498
% 0.09/0.45 % Search garbage collected termcells : 23
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.009 s
% 0.09/0.45 % System time : 0.002 s
% 0.09/0.45 % Total time : 0.011 s
% 0.09/0.45 % Maximum resident set size: 3676 pages
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.044 s
% 0.09/0.45 % System time : 0.014 s
% 0.09/0.45 % Total time : 0.058 s
% 0.09/0.45 % Maximum resident set size: 4608 pages
% 0.09/0.45 % E exiting
%------------------------------------------------------------------------------