%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV379+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:54:36 PM UTC 2026
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 10 unt; 0 def)
% Number of atoms : 117 ( 41 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 112 ( 42 ~; 40 |; 16 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 103 ( 18 sgn 69 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(ax48,axiom,
! [X1,X2,X3,X4] :
( ( strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( ~ contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(l15_co,conjecture,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l15_co) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(ax49,axiom,
! [X1,X2,X3,X4] :
( ( less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(ax46,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax46) ).
fof(c_0_9,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_10,plain,
! [X1,X2,X3,X4] :
( ( strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax48]) ).
fof(c_0_11,plain,
! [X12,X13] :
( ( strictly_less_than(X12,X13)
| less_than(X13,X12)
| ~ less_than(X12,X13) )
& ( ~ strictly_less_than(X12,X13)
| ~ less_than(X13,X12) )
& ( ~ strictly_less_than(X12,X13)
| less_than(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_12,plain,
! [X9,X10] :
( less_than(X10,X9)
| less_than(X9,X10) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_13,plain,
! [X1,X2,X3,X4] :
( ( ~ contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax47]) ).
fof(c_0_14,plain,
! [X80,X81] :
( ( ok(triple(X80,X81,bad))
| $true )
& ( ~ $true
| ~ ok(triple(X80,X81,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
fof(c_0_15,plain,
! [X106,X107,X108] :
( findmin_cpq_eff(triple(X106,X107,X108)) = triple(X106,update_slb(X107,findmin_pqp_res(X106)),bad)
| ~ strictly_less_than(findmin_pqp_res(X106),lookup_slb(X107,findmin_pqp_res(X106)))
| ~ contains_slb(X107,findmin_pqp_res(X106))
| X107 = create_slb ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_16,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X103,X104,X105] :
( findmin_cpq_eff(triple(X103,X104,X105)) = triple(X103,update_slb(X104,findmin_pqp_res(X103)),bad)
| contains_slb(X104,findmin_pqp_res(X103))
| X104 = create_slb ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_13])])]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l15_co]) ).
cnf(c_0_20,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2)))
| ~ contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| contains_slb(X1,findmin_pqp_res(X2))
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_25,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[ax41]) ).
fof(c_0_26,plain,
! [X1,X2,X3,X4] :
( ( less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
inference(fof_simplification,[status(thm)],[ax49]) ).
cnf(c_0_27,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| X2 = create_slb
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
fof(c_0_29,negated_conjecture,
( ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ~ ok(triple(esk1_0,esk2_0,esk3_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
fof(c_0_30,plain,
! [X82,X83,X84] :
( X84 = bad
| ok(triple(X82,X83,X84)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])]) ).
fof(c_0_31,plain,
! [X109,X110,X111] :
( findmin_cpq_eff(triple(X109,X110,X111)) = triple(X109,update_slb(X110,findmin_pqp_res(X109)),X111)
| ~ less_than(lookup_slb(X110,findmin_pqp_res(X109)),findmin_pqp_res(X109))
| ~ contains_slb(X110,findmin_pqp_res(X109))
| X110 = create_slb ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_26])])])]) ).
cnf(c_0_32,plain,
( ~ ok(findmin_cpq_eff(triple(X2,X1,X3)))
| less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| X1 = create_slb ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
( ~ ok(findmin_cpq_eff(triple(X2,X1,X3)))
| contains_slb(X1,findmin_pqp_res(X2))
| X1 = create_slb ),
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_35,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( X3 = bad
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
( ~ less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| ~ contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3)
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| esk2_0 = create_slb ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| esk2_0 = create_slb ),
inference(spm,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
esk3_0 = bad,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( esk2_0 = create_slb
| triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad))),
inference(spm,[status(thm)],[c_0_33,c_0_40]) ).
fof(c_0_43,plain,
! [X101,X102] : findmin_cpq_eff(triple(X101,create_slb,X102)) = triple(X101,create_slb,bad),
inference(variable_rename,[status(thm)],[ax46]) ).
cnf(c_0_44,negated_conjecture,
esk2_0 = create_slb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_41]),c_0_42])]) ).
cnf(c_0_45,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_44]),c_0_40]),c_0_45]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV379+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.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.37 % DateTime : Mon Sep 21 08:39:12 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.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1924441 completed with status 0
% 0.15/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.45 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 1924449 completed with status 0
% 0.15/0.45 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.45 % Preprocessing time : 0.002 s
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Theorem
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 42
% 0.15/0.45 % Removed by relevancy pruning/SinE : 0
% 0.15/0.45 % Initial clauses : 54
% 0.15/0.45 % Removed in clause preprocessing : 4
% 0.15/0.45 % Initial clauses in saturation : 50
% 0.15/0.45 % Processed clauses : 141
% 0.15/0.45 % ...of these trivial : 1
% 0.15/0.45 % ...subsumed : 18
% 0.15/0.45 % ...remaining for further processing : 122
% 0.15/0.45 % Other redundant clauses eliminated : 3
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 5
% 0.15/0.45 % Backward-rewritten : 8
% 0.15/0.45 % Generated clauses : 524
% 0.15/0.45 % ...of the previous two non-redundant : 468
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 3
% 0.15/0.45 % Paramodulations : 514
% 0.15/0.45 % Factorizations : 8
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 3
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 84
% 0.15/0.45 % ...of those cached : 48
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 107
% 0.15/0.45 % Positive orientable unit clauses : 20
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 13
% 0.15/0.45 % Non-unit-clauses : 74
% 0.15/0.45 % Current number of unprocessed clauses: 374
% 0.15/0.45 % ...number of literals in the above : 1580
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 15
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 893
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 418
% 0.15/0.45 % Non-unit clause-clause subsumptions : 18
% 0.15/0.45 % Unit Clause-clause subsumption calls : 254
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 11
% 0.15/0.45 % BW rewrite match successes : 1
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 13587
% 0.15/0.45 % Search garbage collected termcells : 571
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.015 s
% 0.15/0.45 % System time : 0.006 s
% 0.15/0.45 % Total time : 0.021 s
% 0.15/0.45 % Maximum resident set size: 3636 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.066 s
% 0.15/0.45 % System time : 0.022 s
% 0.15/0.45 % Total time : 0.088 s
% 0.15/0.45 % Maximum resident set size: 4608 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------