%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR104+3 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 12:16:54 PM UTC 2026
% Result : Theorem 0.26s 28.81s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 24 unt; 0 def)
% Number of atoms : 152 ( 14 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 176 ( 71 ~; 72 |; 22 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 58 ( 8 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_32603,axiom,
! [X137,X12,X136] :
( X12 = s__UnionFn(X136,X137)
<=> ! [X1138,X34,X1139] :
( ( s__instance(X137,s__SetOrClass)
& s__instance(X12,s__SetOrClass)
& s__instance(X136,s__SetOrClass) )
=> ( ( s__instance(X1139,X12)
& s__instance(X34,X137)
& s__instance(X1138,X136) )
=> ( ( s__instance(X1139,X137)
| s__instance(X1139,X136) )
& s__instance(X34,X12)
& s__instance(X1138,X12) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
fof(kb_SUMO_28026,axiom,
! [X851] :
( s__instance(X851,s__TimeInterval)
=> ~ s__during(X851,X851) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_28026) ).
fof(local_5,axiom,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_5) ).
fof(kb_SUMO_26636,axiom,
! [X1,X15,X13] :
( ( s__instance(X1,s__SetOrClass)
& s__instance(X15,s__SetOrClass) )
=> ( ( s__instance(X13,X1)
& s__subclass(X1,X15) )
=> s__instance(X13,X15) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26636) ).
fof(local_2,axiom,
s__instance(s__TimeInterval35_1,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(kb_SUMO_27781,axiom,
s__subclass(s__TimePoint,s__TimePosition),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27781) ).
fof(prove_from_ALL,conjecture,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_28419,axiom,
! [X1034,X1035,X1097] :
( ( s__instance(X1034,s__TimePosition)
& s__instance(X1035,s__TimePosition)
& s__instance(X1097,s__TimePosition) )
=> ( ( s__temporalPart(X1035,X1097)
& s__temporalPart(X1034,X1035) )
=> s__temporalPart(X1034,X1097) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_28419) ).
fof(local_1,axiom,
s__instance(s__TimePoint35_1,s__TimePoint),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(kb_SUMO_26696,axiom,
! [X548,X550] :
( ( s__instance(X548,s__TimeInterval)
& s__instance(X550,s__TimeInterval) )
=> ( s__during(X548,X550)
=> s__temporalPart(X548,X550) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26696) ).
fof(local_4,axiom,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_4) ).
fof(local_3,axiom,
s__instance(s__TimeInterval35_2,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).
fof(kb_SUMO_27777,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27777) ).
fof(c_0_13,plain,
! [X2432,X2433,X2434,X2435,X2436,X2437,X2438,X2439,X2440] :
( ( X2439 = s__UnionFn(X2440,X2438)
| ~ s__instance(esk8_3(X2438,X2439,X2440),X2439)
| ~ s__instance(esk7_3(X2438,X2439,X2440),X2439)
| ~ s__instance(esk9_3(X2438,X2439,X2440),X2438) )
& ( X2439 = s__UnionFn(X2440,X2438)
| ~ s__instance(esk8_3(X2438,X2439,X2440),X2439)
| ~ s__instance(esk7_3(X2438,X2439,X2440),X2439)
| ~ s__instance(esk9_3(X2438,X2439,X2440),X2440) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(esk9_3(X2438,X2439,X2440),X2439) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(esk8_3(X2438,X2439,X2440),X2438) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(esk7_3(X2438,X2439,X2440),X2440) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(X2438,s__SetOrClass) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(X2439,s__SetOrClass) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(X2440,s__SetOrClass) )
& ( X2433 != s__UnionFn(X2434,X2432)
| ~ s__instance(X2432,s__SetOrClass)
| ~ s__instance(X2433,s__SetOrClass)
| ~ s__instance(X2434,s__SetOrClass)
| ~ s__instance(X2437,X2433)
| ~ s__instance(X2436,X2432)
| ~ s__instance(X2435,X2434)
| s__instance(X2437,X2432)
| s__instance(X2437,X2434) )
& ( X2433 != s__UnionFn(X2434,X2432)
| ~ s__instance(X2432,s__SetOrClass)
| ~ s__instance(X2433,s__SetOrClass)
| ~ s__instance(X2434,s__SetOrClass)
| ~ s__instance(X2437,X2433)
| ~ s__instance(X2436,X2432)
| ~ s__instance(X2435,X2434)
| s__instance(X2436,X2433) )
& ( X2433 != s__UnionFn(X2434,X2432)
| ~ s__instance(X2432,s__SetOrClass)
| ~ s__instance(X2433,s__SetOrClass)
| ~ s__instance(X2434,s__SetOrClass)
| ~ s__instance(X2437,X2433)
| ~ s__instance(X2436,X2432)
| ~ s__instance(X2435,X2434)
| s__instance(X2435,X2433) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_32603])])])])])])]) ).
fof(c_0_14,plain,
! [X851] :
( s__instance(X851,s__TimeInterval)
=> ~ s__during(X851,X851) ),
inference(fof_simplification,[status(thm)],[kb_SUMO_28026]) ).
cnf(c_0_15,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X2446] :
( ~ s__during(X2446,X2446)
| ~ s__instance(X2446,s__TimeInterval) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_17,plain,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_18,plain,
( s__instance(X3,s__SetOrClass)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
fof(c_0_19,plain,
! [X2417,X2418,X2419] :
( s__instance(X2419,X2418)
| ~ s__instance(X2419,X2417)
| ~ s__subclass(X2417,X2418)
| ~ s__instance(X2417,s__SetOrClass)
| ~ s__instance(X2418,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
cnf(c_0_20,plain,
( ~ s__during(X1,X1)
| ~ s__instance(X1,s__TimeInterval) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( s__instance(X2,s__SetOrClass)
| s__during(s__TimeInterval35_1,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
s__instance(s__TimeInterval35_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_23,plain,
( ~ s__instance(X3,X2)
| ~ s__subclass(X2,X1)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| s__instance(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
s__instance(X1,s__SetOrClass),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3)
| s__instance(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24])]) ).
cnf(c_0_26,plain,
s__subclass(s__TimePoint,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_27781]) ).
fof(c_0_27,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_28,plain,
! [X2378,X2379,X2380] :
( s__temporalPart(X2378,X2380)
| ~ s__temporalPart(X2379,X2380)
| ~ s__temporalPart(X2378,X2379)
| ~ s__instance(X2378,s__TimePosition)
| ~ s__instance(X2379,s__TimePosition)
| ~ s__instance(X2380,s__TimePosition) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28419])])]) ).
cnf(c_0_29,plain,
( ~ s__instance(X1,s__TimePoint)
| s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
s__instance(s__TimePoint35_1,s__TimePoint),
inference(split_conjunct,[status(thm)],[local_1]) ).
fof(c_0_31,plain,
! [X2369,X2370] :
( s__temporalPart(X2369,X2370)
| ~ s__during(X2369,X2370)
| ~ s__instance(X2369,s__TimeInterval)
| ~ s__instance(X2370,s__TimeInterval) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26696])])]) ).
fof(c_0_32,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_simplification,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
( ~ s__temporalPart(X2,X1)
| ~ s__temporalPart(X3,X2)
| ~ s__instance(X3,s__TimePosition)
| ~ s__instance(X2,s__TimePosition)
| ~ s__instance(X1,s__TimePosition)
| s__temporalPart(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_35,plain,
s__instance(s__TimePoint35_1,s__TimePosition),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( ~ s__during(X2,X1)
| ~ s__instance(X2,s__TimeInterval)
| ~ s__instance(X1,s__TimeInterval)
| s__temporalPart(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
s__instance(s__TimeInterval35_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
fof(c_0_38,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_nnf,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( ~ s__instance(X1,s__TimePosition)
| ~ s__instance(s__TimeInterval35_1,s__TimePosition)
| ~ s__temporalPart(s__TimeInterval35_1,X1)
| s__temporalPart(s__TimePoint35_1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,plain,
s__temporalPart(s__TimeInterval35_1,s__TimeInterval35_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_17]),c_0_22]),c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
s__subclass(s__TimeInterval,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_27777]) ).
cnf(c_0_43,plain,
( ~ s__instance(s__TimeInterval35_2,s__TimePosition)
| ~ s__instance(s__TimeInterval35_1,s__TimePosition) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,plain,
( ~ s__instance(X1,s__TimeInterval)
| s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_25,c_0_42]) ).
cnf(c_0_45,plain,
~ s__instance(s__TimeInterval35_1,s__TimePosition),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_37])]) ).
cnf(c_0_46,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_44]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR104+3 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/15.44 % Computer : n002.cluster.edu
% 0.15/15.44 % Model : x86_64 x86_64
% 0.15/15.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/15.44 % Memory : 8046.5625MB
% 0.15/15.44 % OS : Linux 6.8.0-71-generic
% 0.15/15.44 % CPULimit : 300
% 0.15/15.44 % WCLimit : 300
% 0.15/15.44 % DateTime : Mon Sep 21 15:02:33 UTC 2026
% 0.15/15.45 % CPUTime :
% 0.15/15.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/15.52 Running first-order theorem proving
% 0.20/15.52 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.26/28.81 % Version: 3.5.1
% 0.26/28.81 % Preprocessing class: FLLLSMSLSSSNFFN.
% 0.26/28.81 % Scheduled 4 strats onto 8 cores with 291 seconds (2328 total)
% 0.26/28.81 % Starting G-E--_300_C01_S5PRR_S00 with 1455s (5) cores
% 0.26/28.81 % Starting new_bool_3 with 291s (1) cores
% 0.26/28.81 % Starting new_bool_1 with 291s (1) cores
% 0.26/28.81 % Starting sh5l with 291s (1) cores
% 0.26/28.81 % new_bool_3 with pid 3555247 completed with status 0
% 0.26/28.81 % Result found by new_bool_3
% 0.26/28.81 % Preprocessing class: FLLLSMSLSSSNFFN.
% 0.26/28.81 % Scheduled 4 strats onto 8 cores with 291 seconds (2328 total)
% 0.26/28.81 % Starting G-E--_300_C01_S5PRR_S00 with 1455s (5) cores
% 0.26/28.81 % Starting new_bool_3 with 291s (1) cores
% 0.26/28.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/28.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/28.81 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.26/28.81 % Scheduled 12 strats onto 1 cores with 291 seconds (291 total)
% 0.26/28.81 % Starting SubtermCWHack with 27s (1) cores
% 0.26/28.81 % SubtermCWHack with pid 3555255 completed with status 0
% 0.26/28.81 % Result found by SubtermCWHack
% 0.26/28.81 % Preprocessing class: FLLLSMSLSSSNFFN.
% 0.26/28.81 % Scheduled 4 strats onto 8 cores with 291 seconds (2328 total)
% 0.26/28.81 % Starting G-E--_300_C01_S5PRR_S00 with 1455s (5) cores
% 0.26/28.81 % Starting new_bool_3 with 291s (1) cores
% 0.26/28.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/28.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/28.81 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.26/28.81 % Scheduled 12 strats onto 1 cores with 291 seconds (291 total)
% 0.26/28.81 % Starting SubtermCWHack with 27s (1) cores
% 0.26/28.81 % Preprocessing time : 0.053 s
% 0.26/28.81
% 0.26/28.81 % Proof found!
% 0.26/28.81 % SZS status Theorem
% 0.26/28.81 % SZS output start CNFRefutation
% See solution above
% 0.26/28.81 % Parsed axioms : 145107
% 0.26/28.81 % Removed by relevancy pruning/SinE : 144612
% 0.26/28.81 % Initial clauses : 624
% 0.26/28.81 % Removed in clause preprocessing : 18
% 0.26/28.81 % Initial clauses in saturation : 606
% 0.26/28.81 % Processed clauses : 6382
% 0.26/28.81 % ...of these trivial : 281
% 0.26/28.81 % ...subsumed : 1768
% 0.26/28.81 % ...remaining for further processing : 4333
% 0.26/28.81 % Other redundant clauses eliminated : 36
% 0.26/28.81 % Clauses deleted for lack of memory : 0
% 0.26/28.81 % Backward-subsumed : 13
% 0.26/28.81 % Backward-rewritten : 88
% 0.26/28.81 % Generated clauses : 31368
% 0.26/28.81 % ...of the previous two non-redundant : 30859
% 0.26/28.81 % ...aggressively subsumed : 0
% 0.26/28.81 % Contextual simplify-reflections : 111
% 0.26/28.81 % Paramodulations : 31331
% 0.26/28.81 % Factorizations : 0
% 0.26/28.81 % NegExts : 0
% 0.26/28.81 % Equation resolutions : 37
% 0.26/28.81 % Disequality decompositions : 0
% 0.26/28.81 % Total rewrite steps : 1456
% 0.26/28.81 % ...of those cached : 1143
% 0.26/28.81 % Propositional unsat checks : 0
% 0.26/28.81 % Propositional check models : 0
% 0.26/28.81 % Propositional check unsatisfiable : 0
% 0.26/28.81 % Propositional clauses : 0
% 0.26/28.81 % Propositional clauses after purity: 0
% 0.26/28.81 % Propositional unsat core size : 0
% 0.26/28.81 % Propositional preprocessing time : 0.000
% 0.26/28.81 % Propositional encoding time : 0.000
% 0.26/28.81 % Propositional solver time : 0.000
% 0.26/28.81 % Success case prop preproc time : 0.000
% 0.26/28.81 % Success case prop encoding time : 0.000
% 0.26/28.81 % Success case prop solver time : 0.000
% 0.26/28.81 % Current number of processed clauses : 4196
% 0.26/28.81 % Positive orientable unit clauses : 316
% 0.26/28.81 % Positive unorientable unit clauses: 0
% 0.26/28.81 % Negative unit clauses : 2
% 0.26/28.81 % Non-unit-clauses : 3878
% 0.26/28.81 % Current number of unprocessed clauses: 23642
% 0.26/28.81 % ...number of literals in the above : 72508
% 0.26/28.81 % Current number of archived formulas : 0
% 0.26/28.81 % Current number of archived clauses : 101
% 0.26/28.81 % Clause-clause subsumption calls (NU) : 1206969
% 0.26/28.81 % Rec. Clause-clause subsumption calls : 1051660
% 0.26/28.81 % Non-unit clause-clause subsumptions : 1885
% 0.26/28.81 % Unit Clause-clause subsumption calls : 2563
% 0.26/28.81 % Rewrite failures with RHS unbound : 0
% 0.26/28.81 % BW rewrite match attempts : 261
% 0.26/28.81 % BW rewrite match successes : 77
% 0.26/28.81 % Condensation attempts : 0
% 0.26/28.81 % Condensation successes : 0
% 0.26/28.81 % Termbank termtop insertions : 1349520
% 0.26/28.81 % Search garbage collected termcells : 464597
% 0.26/28.81
% 0.26/28.81 % -------------------------------------------------
% 0.26/28.81 % User time : 2.377 s
% 0.26/28.81 % System time : 0.556 s
% 0.26/28.81 % Total time : 2.933 s
% 0.26/28.81 % Maximum resident set size: 178160 pages
% 0.26/28.81
% 0.26/28.81 % -------------------------------------------------
% 0.26/28.81 % User time : 12.139 s
% 0.26/28.81 % System time : 0.853 s
% 0.26/28.81 % Total time : 12.992 s
% 0.26/28.81 % Maximum resident set size: 104448 pages
% 0.26/28.81 % E exiting
%------------------------------------------------------------------------------