%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW948+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:11:26 PM UTC 2026
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 63 ( 34 unt; 0 def)
% Number of atoms : 101 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 32 ~; 28 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 2 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax106,axiom,
! [X40] :
( pred_attacker(tuple_R_in_2(X40,constr_h(constr_xor(constr_xor(name_r0x30,X40),name_k))))
=> pred_attacker(tuple_R_out_4(name_objective_R)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax106) ).
fof(ax68,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(ax67,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax67) ).
fof(ax88,axiom,
! [X27,X28] :
( ( pred_attacker(X28)
& pred_attacker(X27) )
=> pred_attacker(tuple_R_in_2(X27,X28)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax88) ).
fof(ax69,axiom,
! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(ax66,axiom,
! [X1] : constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax66) ).
fof(ax87,axiom,
! [X26] :
( pred_attacker(tuple_R_out_1(X26))
=> pred_attacker(X26) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax87) ).
fof(ax76,axiom,
! [X16,X17] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
=> pred_attacker(X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax76) ).
fof(ax102,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax102) ).
fof(ax70,axiom,
! [X8,X9] :
( ( pred_attacker(X9)
& pred_attacker(X8) )
=> pred_attacker(constr_xor(X8,X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax70) ).
fof(ax104,axiom,
pred_attacker(tuple_R_out_1(name_r0x30)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax104) ).
fof(ax75,axiom,
! [X14,X15] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X14,X15))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax75) ).
fof(ax78,axiom,
! [X19] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X19))
=> pred_attacker(X19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(co0,conjecture,
pred_attacker(name_objective_R),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax101,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax101) ).
fof(ax83,axiom,
! [X22] :
( pred_attacker(tuple_R_out_4(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(c_0_16,plain,
! [X80] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X80,constr_h(constr_xor(constr_xor(name_r0x30,X80),name_k)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax106])])]) ).
fof(c_0_17,plain,
! [X43,X44] : constr_xor(X43,X44) = constr_xor(X44,X43),
inference(variable_rename,[status(thm)],[ax68]) ).
fof(c_0_18,plain,
! [X42] : constr_xor(X42,constr_ZERO) = X42,
inference(variable_rename,[status(thm)],[ax67]) ).
cnf(c_0_19,plain,
( ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(constr_xor(name_r0x30,X1),name_k))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X67,X68] :
( pred_attacker(tuple_R_in_2(X67,X68))
| ~ pred_attacker(X68)
| ~ pred_attacker(X67) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax88])])]) ).
fof(c_0_22,plain,
! [X45,X46,X47] : constr_xor(X45,constr_xor(X46,X47)) = constr_xor(constr_xor(X45,X46),X47),
inference(variable_rename,[status(thm)],[ax69]) ).
fof(c_0_23,plain,
! [X41] : constr_xor(X41,X41) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax66]) ).
cnf(c_0_24,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1)))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_R_in_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
fof(c_0_30,plain,
! [X66] :
( pred_attacker(X66)
| ~ pred_attacker(tuple_R_out_1(X66)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax87])])]) ).
fof(c_0_31,plain,
! [X56,X57] :
( pred_attacker(X57)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X56,X57)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax76])])]) ).
cnf(c_0_32,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
inference(split_conjunct,[status(thm)],[ax102]) ).
cnf(c_0_33,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
fof(c_0_35,plain,
! [X48,X49] :
( pred_attacker(constr_xor(X48,X49))
| ~ pred_attacker(X49)
| ~ pred_attacker(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax70])])]) ).
cnf(c_0_36,plain,
( ~ pred_attacker(tuple_R_out_1(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
inference(split_conjunct,[status(thm)],[ax104]) ).
cnf(c_0_38,plain,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2))
| pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(name_r0x30_from_1st,constr_xor(name_k,name_r1_from_1st))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_27]),c_0_20]) ).
cnf(c_0_40,plain,
( ~ pred_attacker(constr_xor(name_r0x30,X1))
| ~ pred_attacker(constr_h(constr_xor(name_k,X1)))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(constr_xor(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
pred_attacker(name_r0x30),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
pred_attacker(constr_h(constr_xor(name_r0x30_from_1st,constr_xor(name_k,name_r1_from_1st)))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X3,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
fof(c_0_45,plain,
! [X54,X55] :
( pred_attacker(X54)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X54,X55)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax75])])]) ).
fof(c_0_46,plain,
! [X59] :
( pred_attacker(X59)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X59)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])])]) ).
fof(c_0_47,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_48,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(constr_h(constr_xor(name_k,X1)))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_49,plain,
pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_20]) ).
cnf(c_0_50,plain,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,plain,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
inference(split_conjunct,[status(thm)],[ax101]) ).
fof(c_0_53,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(fof_simplification,[status(thm)],[c_0_47]) ).
fof(c_0_54,plain,
! [X62] :
( pred_attacker(X62)
| ~ pred_attacker(tuple_R_out_4(X62)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])]) ).
cnf(c_0_55,plain,
( ~ pred_attacker(constr_xor(name_r0x30_from_1st,name_r1_from_1st))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
pred_attacker(name_r1_from_1st),
inference(spm,[status(thm)],[c_0_50,c_0_39]) ).
cnf(c_0_57,plain,
pred_attacker(name_r0x30_from_1st),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
fof(c_0_58,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(fof_nnf,[status(thm)],[c_0_53]) ).
cnf(c_0_59,plain,
( ~ pred_attacker(tuple_R_out_4(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,plain,
pred_attacker(tuple_R_out_4(name_objective_R)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_41]),c_0_56]),c_0_57])]) ).
cnf(c_0_61,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_62,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW948+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n005.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:20:02 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3209553 completed with status 0
% 0.15/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FHUSM-FFMM21-DFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.44 % Starting sh3 with 271s (1) cores
% 0.15/0.44 % Starting ho_unfolding_3 with 271s (1) cores
% 0.15/0.44 % Starting new_ho_10_cnf2 with 271s (1) cores
% 0.15/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3209563 completed with status 0
% 0.15/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FHUSM-FFMM21-DFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44 % Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Theorem
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 108
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 108
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 108
% 0.15/0.44 % Processed clauses : 350
% 0.15/0.44 % ...of these trivial : 6
% 0.15/0.44 % ...subsumed : 88
% 0.15/0.44 % ...remaining for further processing : 256
% 0.15/0.44 % Other redundant clauses eliminated : 0
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 0
% 0.15/0.44 % Backward-rewritten : 21
% 0.15/0.44 % Generated clauses : 425
% 0.15/0.44 % ...of the previous two non-redundant : 343
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 0
% 0.15/0.44 % Paramodulations : 425
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 0
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 308
% 0.15/0.44 % ...of those cached : 233
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 127
% 0.15/0.44 % Positive orientable unit clauses : 28
% 0.15/0.44 % Positive unorientable unit clauses: 3
% 0.15/0.44 % Negative unit clauses : 67
% 0.15/0.44 % Non-unit-clauses : 29
% 0.15/0.44 % Current number of unprocessed clauses: 205
% 0.15/0.44 % ...number of literals in the above : 439
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 129
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 2581
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 2470
% 0.15/0.44 % Non-unit clause-clause subsumptions : 77
% 0.15/0.44 % Unit Clause-clause subsumption calls : 1495
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 60
% 0.15/0.44 % BW rewrite match successes : 40
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 7833
% 0.15/0.44 % Search garbage collected termcells : 520
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.012 s
% 0.15/0.44 % System time : 0.005 s
% 0.15/0.44 % Total time : 0.017 s
% 0.15/0.44 % Maximum resident set size: 3460 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.047 s
% 0.15/0.44 % System time : 0.019 s
% 0.15/0.44 % Total time : 0.066 s
% 0.15/0.44 % Maximum resident set size: 4608 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------