%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PRO011+3 : 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 : n002.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 01:59:43 PM UTC 2026
% Result : Theorem 0.16s 0.65s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 12 unt; 0 def)
% Number of atoms : 176 ( 10 equ)
% Maximal formula atoms : 49 ( 4 avg)
% Number of connectives : 194 ( 61 ~; 74 |; 46 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 69 ( 12 sgn 28 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( ( occurrence_of(X168,tptp2)
=> ~ ? [X170] :
( min_precedes(X167,X170,tptp0)
& subactivity_occurrence(X170,X166)
& occurrence_of(X170,tptp1) ) )
& ( occurrence_of(X168,tptp1)
=> ~ ? [X169] :
( min_precedes(X167,X169,tptp0)
& subactivity_occurrence(X169,X166)
& occurrence_of(X169,tptp2) ) )
& leaf_occ(X168,X166) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_46,axiom,
! [X149,X150,X151] :
( min_precedes(X149,X150,X151)
=> arboreal(X149) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_46) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X7)
& occurrence_of(X5,X6) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( occurrence_of(X3,X4)
& activity(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity_occurrence(X2)
& activity(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(sos_49,axiom,
! [X162] :
( occurrence_of(X162,tptp0)
=> ? [X163,X164,X165] :
( leaf_occ(X165,X162)
& next_subocc(X164,X165,tptp0)
& ( occurrence_of(X165,tptp2)
| occurrence_of(X165,tptp1) )
& next_subocc(X163,X164,tptp0)
& occurrence_of(X164,tptp4)
& root_occ(X163,X162)
& occurrence_of(X163,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).
fof(sos_61,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_61) ).
fof(sos_51,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_51) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(c_0_9,negated_conjecture,
~ ! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( ( occurrence_of(X168,tptp2)
=> ~ ? [X170] :
( min_precedes(X167,X170,tptp0)
& subactivity_occurrence(X170,X166)
& occurrence_of(X170,tptp1) ) )
& ( occurrence_of(X168,tptp1)
=> ~ ? [X169] :
( min_precedes(X167,X169,tptp0)
& subactivity_occurrence(X169,X166)
& occurrence_of(X169,tptp2) ) )
& leaf_occ(X168,X166) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_10,plain,
! [X336,X337,X338] :
( arboreal(X336)
| ~ min_precedes(X336,X337,X338) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_46])])]) ).
fof(c_0_11,negated_conjecture,
! [X354,X355] :
( ( ~ leaf_occ(X355,esk20_0)
| min_precedes(X354,esk21_2(X354,X355),tptp0)
| min_precedes(X354,esk22_2(X354,X355),tptp0) )
& ( ~ leaf_occ(X355,esk20_0)
| min_precedes(X354,esk21_2(X354,X355),tptp0)
| subactivity_occurrence(esk22_2(X354,X355),esk20_0) )
& ( ~ leaf_occ(X355,esk20_0)
| min_precedes(X354,esk21_2(X354,X355),tptp0)
| occurrence_of(esk22_2(X354,X355),tptp1) )
& ( ~ leaf_occ(X355,esk20_0)
| min_precedes(X354,esk21_2(X354,X355),tptp0)
| occurrence_of(X355,tptp2) )
& ( ~ leaf_occ(X355,esk20_0)
| subactivity_occurrence(esk21_2(X354,X355),esk20_0)
| min_precedes(X354,esk22_2(X354,X355),tptp0) )
& ( ~ leaf_occ(X355,esk20_0)
| subactivity_occurrence(esk21_2(X354,X355),esk20_0)
| subactivity_occurrence(esk22_2(X354,X355),esk20_0) )
& ( ~ leaf_occ(X355,esk20_0)
| subactivity_occurrence(esk21_2(X354,X355),esk20_0)
| occurrence_of(esk22_2(X354,X355),tptp1) )
& ( ~ leaf_occ(X355,esk20_0)
| subactivity_occurrence(esk21_2(X354,X355),esk20_0)
| occurrence_of(X355,tptp2) )
& ( ~ leaf_occ(X355,esk20_0)
| occurrence_of(esk21_2(X354,X355),tptp2)
| min_precedes(X354,esk22_2(X354,X355),tptp0) )
& ( ~ leaf_occ(X355,esk20_0)
| occurrence_of(esk21_2(X354,X355),tptp2)
| subactivity_occurrence(esk22_2(X354,X355),esk20_0) )
& ( ~ leaf_occ(X355,esk20_0)
| occurrence_of(esk21_2(X354,X355),tptp2)
| occurrence_of(esk22_2(X354,X355),tptp1) )
& ( ~ leaf_occ(X355,esk20_0)
| occurrence_of(esk21_2(X354,X355),tptp2)
| occurrence_of(X355,tptp2) )
& ( ~ leaf_occ(X355,esk20_0)
| occurrence_of(X355,tptp1)
| min_precedes(X354,esk22_2(X354,X355),tptp0) )
& ( ~ leaf_occ(X355,esk20_0)
| occurrence_of(X355,tptp1)
| subactivity_occurrence(esk22_2(X354,X355),esk20_0) )
& ( ~ leaf_occ(X355,esk20_0)
| occurrence_of(X355,tptp1)
| occurrence_of(esk22_2(X354,X355),tptp1) )
& ( ~ leaf_occ(X355,esk20_0)
| occurrence_of(X355,tptp1)
| occurrence_of(X355,tptp2) )
& occurrence_of(esk20_0,tptp0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
fof(c_0_12,plain,
! [X175,X176,X177] :
( X176 = X177
| ~ occurrence_of(X175,X177)
| ~ occurrence_of(X175,X176) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_13,plain,
! [X173] :
( ( ~ activity_occurrence(X173)
| occurrence_of(X173,esk1_1(X173)) )
& ( ~ activity_occurrence(X173)
| activity(esk1_1(X173)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])])]) ).
fof(c_0_14,plain,
! [X171,X172] :
( ( ~ occurrence_of(X172,X171)
| activity_occurrence(X172) )
& ( ~ occurrence_of(X172,X171)
| activity(X171) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
cnf(c_0_15,plain,
( ~ min_precedes(X1,X2,X3)
| arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ leaf_occ(X2,esk20_0)
| occurrence_of(X2,tptp1)
| min_precedes(X1,esk22_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X349] :
( ( ~ occurrence_of(X349,tptp0)
| leaf_occ(esk19_1(X349),X349) )
& ( ~ occurrence_of(X349,tptp0)
| next_subocc(esk18_1(X349),esk19_1(X349),tptp0) )
& ( ~ occurrence_of(X349,tptp0)
| occurrence_of(esk19_1(X349),tptp2)
| occurrence_of(esk19_1(X349),tptp1) )
& ( ~ occurrence_of(X349,tptp0)
| next_subocc(esk17_1(X349),esk18_1(X349),tptp0) )
& ( ~ occurrence_of(X349,tptp0)
| occurrence_of(esk18_1(X349),tptp4) )
& ( ~ occurrence_of(X349,tptp0)
| root_occ(esk17_1(X349),X349) )
& ( ~ occurrence_of(X349,tptp0)
| occurrence_of(esk17_1(X349),tptp3) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_49])])])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ leaf_occ(X1,esk20_0)
| min_precedes(X2,esk21_2(X2,X1),tptp0)
| occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( ~ leaf_occ(X2,esk20_0)
| occurrence_of(X2,tptp1)
| arboreal(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk19_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
occurrence_of(esk20_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( ~ leaf_occ(X2,esk20_0)
| occurrence_of(X2,tptp2)
| arboreal(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
fof(c_0_26,plain,
tptp1 != tptp2,
inference(fof_simplification,[status(thm)],[sos_61]) ).
fof(c_0_27,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_51]) ).
cnf(c_0_28,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk1_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( occurrence_of(esk19_1(esk20_0),tptp1)
| arboreal(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,negated_conjecture,
( occurrence_of(esk19_1(esk20_0),tptp2)
| arboreal(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24])]) ).
fof(c_0_31,plain,
tptp1 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X187,X188] :
( ( ~ occurrence_of(X187,X188)
| arboreal(X187)
| ~ atomic(X188) )
& ( ~ occurrence_of(X187,X188)
| atomic(X188)
| ~ arboreal(X187) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
fof(c_0_33,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( arboreal(X1)
| esk1_1(esk19_1(esk20_0)) = tptp1 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( arboreal(X1)
| esk1_1(esk19_1(esk20_0)) = tptp2 ),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
cnf(c_0_36,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( ~ occurrence_of(X1,X2)
| ~ arboreal(X1)
| atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( arboreal(X2)
| arboreal(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
~ arboreal(esk20_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_24]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
arboreal(X1),
inference(ef,[status(thm)],[c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO011+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.57 % Computer : n002.cluster.edu
% 0.12/0.57 % Model : x86_64 x86_64
% 0.12/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.57 % Memory : 8046.5625MB
% 0.12/0.57 % OS : Linux 6.8.0-71-generic
% 0.12/0.57 % CPULimit : 300
% 0.12/0.57 % WCLimit : 300
% 0.12/0.57 % DateTime : Mon Sep 21 03:45:18 UTC 2026
% 0.12/0.57 % CPUTime :
% 0.12/0.57 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.61 Running first-order theorem proving
% 0.12/0.61 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.16/0.65 % Version: 3.5.1
% 0.16/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.65 % Starting sh5l with 300s (1) cores
% 0.16/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2349522 completed with status 0
% 0.16/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.65 % No SInE strategy applied
% 0.16/0.65 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.16/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.16/0.65 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.16/0.65 % SubtermCWHack with pid 2349528 completed with status 0
% 0.16/0.65 % Result found by SubtermCWHack
% 0.16/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.65 % No SInE strategy applied
% 0.16/0.65 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.16/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.65 % Preprocessing time : 0.002 s
% 0.16/0.65
% 0.16/0.65 % Proof found!
% 0.16/0.65 % SZS status Theorem
% 0.16/0.65 % SZS output start CNFRefutation
% See solution above
% 0.16/0.65 % Parsed axioms : 63
% 0.16/0.65 % Removed by relevancy pruning/SinE : 0
% 0.16/0.65 % Initial clauses : 118
% 0.16/0.65 % Removed in clause preprocessing : 0
% 0.16/0.65 % Initial clauses in saturation : 118
% 0.16/0.65 % Processed clauses : 400
% 0.16/0.65 % ...of these trivial : 6
% 0.16/0.65 % ...subsumed : 119
% 0.16/0.65 % ...remaining for further processing : 275
% 0.16/0.65 % Other redundant clauses eliminated : 0
% 0.16/0.65 % Clauses deleted for lack of memory : 0
% 0.16/0.65 % Backward-subsumed : 15
% 0.16/0.65 % Backward-rewritten : 51
% 0.16/0.65 % Generated clauses : 876
% 0.16/0.65 % ...of the previous two non-redundant : 598
% 0.16/0.65 % ...aggressively subsumed : 0
% 0.16/0.65 % Contextual simplify-reflections : 5
% 0.16/0.65 % Paramodulations : 872
% 0.16/0.65 % Factorizations : 4
% 0.16/0.65 % NegExts : 0
% 0.16/0.65 % Equation resolutions : 0
% 0.16/0.65 % Disequality decompositions : 0
% 0.16/0.65 % Total rewrite steps : 461
% 0.16/0.65 % ...of those cached : 426
% 0.16/0.65 % Propositional unsat checks : 0
% 0.16/0.65 % Propositional check models : 0
% 0.16/0.65 % Propositional check unsatisfiable : 0
% 0.16/0.65 % Propositional clauses : 0
% 0.16/0.65 % Propositional clauses after purity: 0
% 0.16/0.65 % Propositional unsat core size : 0
% 0.16/0.65 % Propositional preprocessing time : 0.000
% 0.16/0.65 % Propositional encoding time : 0.000
% 0.16/0.65 % Propositional solver time : 0.000
% 0.16/0.65 % Success case prop preproc time : 0.000
% 0.16/0.65 % Success case prop encoding time : 0.000
% 0.16/0.65 % Success case prop solver time : 0.000
% 0.16/0.65 % Current number of processed clauses : 209
% 0.16/0.65 % Positive orientable unit clauses : 25
% 0.16/0.65 % Positive unorientable unit clauses: 0
% 0.16/0.65 % Negative unit clauses : 14
% 0.16/0.65 % Non-unit-clauses : 170
% 0.16/0.65 % Current number of unprocessed clauses: 305
% 0.16/0.65 % ...number of literals in the above : 985
% 0.16/0.65 % Current number of archived formulas : 0
% 0.16/0.65 % Current number of archived clauses : 66
% 0.16/0.65 % Clause-clause subsumption calls (NU) : 10526
% 0.16/0.65 % Rec. Clause-clause subsumption calls : 9148
% 0.16/0.65 % Non-unit clause-clause subsumptions : 99
% 0.16/0.65 % Unit Clause-clause subsumption calls : 600
% 0.16/0.65 % Rewrite failures with RHS unbound : 0
% 0.16/0.65 % BW rewrite match attempts : 18
% 0.16/0.65 % BW rewrite match successes : 18
% 0.16/0.65 % Condensation attempts : 0
% 0.16/0.65 % Condensation successes : 0
% 0.16/0.65 % Termbank termtop insertions : 16729
% 0.16/0.65 % Search garbage collected termcells : 1962
% 0.16/0.65
% 0.16/0.65 % -------------------------------------------------
% 0.16/0.65 % User time : 0.022 s
% 0.16/0.65 % System time : 0.004 s
% 0.16/0.65 % Total time : 0.026 s
% 0.16/0.65 % Maximum resident set size: 4068 pages
% 0.16/0.65
% 0.16/0.65 % -------------------------------------------------
% 0.16/0.65 % User time : 0.081 s
% 0.16/0.65 % System time : 0.018 s
% 0.16/0.65 % Total time : 0.099 s
% 0.16/0.65 % Maximum resident set size: 4864 pages
% 0.16/0.65 % E exiting
%------------------------------------------------------------------------------