%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET711+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:18:01 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 5 unt; 0 def)
% Number of atoms : 174 ( 11 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 212 ( 72 ~; 91 |; 37 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-4 aty)
% Number of variables : 130 ( 0 sgn 65 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII03a,conjecture,
! [X6,X10,X9,X1,X2] :
( ( inverse_predicate(X9,X6,X1,X2)
& inverse_predicate(X10,X6,X1,X2)
& one_to_one(X6,X1,X2)
& maps(X6,X1,X2) )
=> equal_maps(X10,X9,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII03a) ).
fof(injective,axiom,
! [X6,X1,X2] :
( injective(X6,X1,X2)
<=> ! [X13,X14,X5] :
( ( member(X5,X2)
& member(X14,X1)
& member(X13,X1) )
=> ( ( apply(X6,X14,X5)
& apply(X6,X13,X5) )
=> X13 = X14 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',injective) ).
fof(one_to_one,axiom,
! [X6,X1,X2] :
( one_to_one(X6,X1,X2)
<=> ( surjective(X6,X1,X2)
& injective(X6,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',one_to_one) ).
fof(inverse_predicate,axiom,
! [X10,X6,X1,X2] :
( inverse_predicate(X10,X6,X1,X2)
<=> ! [X3,X5] :
( ( member(X5,X2)
& member(X3,X1) )
=> ( apply(X6,X3,X5)
<=> apply(X10,X5,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',inverse_predicate) ).
fof(equal_maps,axiom,
! [X6,X10,X1,X2] :
( equal_maps(X6,X10,X1,X2)
<=> ! [X3,X7,X8] :
( ( member(X8,X2)
& member(X7,X2)
& member(X3,X1) )
=> ( ( apply(X10,X3,X8)
& apply(X6,X3,X7) )
=> X7 = X8 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',equal_maps) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X10,X9,X1,X2] :
( ( inverse_predicate(X9,X6,X1,X2)
& inverse_predicate(X10,X6,X1,X2)
& one_to_one(X6,X1,X2)
& maps(X6,X1,X2) )
=> equal_maps(X10,X9,X2,X1) ),
inference(assume_negation,[status(cth)],[thII03a]) ).
fof(c_0_6,plain,
! [X95,X96,X97,X98,X99,X100,X101,X102,X103] :
( ( injective(X101,X102,X103)
| esk22_3(X101,X102,X103) != esk23_3(X101,X102,X103) )
& ( injective(X101,X102,X103)
| apply(X101,esk23_3(X101,X102,X103),esk24_3(X101,X102,X103)) )
& ( injective(X101,X102,X103)
| apply(X101,esk22_3(X101,X102,X103),esk24_3(X101,X102,X103)) )
& ( injective(X101,X102,X103)
| member(esk24_3(X101,X102,X103),X103) )
& ( injective(X101,X102,X103)
| member(esk23_3(X101,X102,X103),X102) )
& ( injective(X101,X102,X103)
| member(esk22_3(X101,X102,X103),X102) )
& ( X98 = X99
| ~ apply(X95,X99,X100)
| ~ apply(X95,X98,X100)
| ~ member(X100,X97)
| ~ member(X99,X96)
| ~ member(X98,X96)
| ~ injective(X95,X96,X97) ) ),
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)],[injective])])])])])])]) ).
fof(c_0_7,plain,
! [X48,X49,X50] :
( ( one_to_one(X48,X49,X50)
| ~ surjective(X48,X49,X50)
| ~ injective(X48,X49,X50) )
& ( ~ one_to_one(X48,X49,X50)
| surjective(X48,X49,X50) )
& ( ~ one_to_one(X48,X49,X50)
| injective(X48,X49,X50) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_to_one])])])]) ).
fof(c_0_8,plain,
! [X36,X37,X38,X39,X40,X41,X42,X43,X44,X45] :
( ( inverse_predicate(X42,X43,X44,X45)
| apply(X42,esk10_4(X42,X43,X44,X45),esk9_4(X42,X43,X44,X45))
| apply(X43,esk9_4(X42,X43,X44,X45),esk10_4(X42,X43,X44,X45)) )
& ( inverse_predicate(X42,X43,X44,X45)
| ~ apply(X42,esk10_4(X42,X43,X44,X45),esk9_4(X42,X43,X44,X45))
| ~ apply(X43,esk9_4(X42,X43,X44,X45),esk10_4(X42,X43,X44,X45)) )
& ( inverse_predicate(X42,X43,X44,X45)
| member(esk10_4(X42,X43,X44,X45),X45) )
& ( inverse_predicate(X42,X43,X44,X45)
| member(esk9_4(X42,X43,X44,X45),X44) )
& ( ~ inverse_predicate(X36,X37,X38,X39)
| ~ member(X41,X39)
| ~ member(X40,X38)
| apply(X37,X40,X41)
| ~ apply(X36,X41,X40) )
& ( ~ inverse_predicate(X36,X37,X38,X39)
| ~ member(X41,X39)
| ~ member(X40,X38)
| apply(X36,X41,X40)
| ~ apply(X37,X40,X41) ) ),
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)],[inverse_predicate])])])])])])]) ).
fof(c_0_9,negated_conjecture,
( ~ equal_maps(esk2_0,esk3_0,esk5_0,esk4_0)
& inverse_predicate(esk3_0,esk1_0,esk4_0,esk5_0)
& inverse_predicate(esk2_0,esk1_0,esk4_0,esk5_0)
& one_to_one(esk1_0,esk4_0,esk5_0)
& maps(esk1_0,esk4_0,esk5_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_10,plain,
( ~ apply(X1,X5,X6)
| ~ apply(X1,X4,X6)
| ~ member(X6,X3)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ injective(X1,X2,X3)
| X4 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ one_to_one(X1,X2,X3)
| injective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ inverse_predicate(X1,X4,X5,X6)
| ~ member(X2,X6)
| ~ member(X3,X5)
| ~ apply(X1,X2,X3)
| apply(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
inverse_predicate(esk3_0,esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32] :
( ( equal_maps(X29,X30,X31,X32)
| esk7_4(X29,X30,X31,X32) != esk8_4(X29,X30,X31,X32) )
& ( equal_maps(X29,X30,X31,X32)
| apply(X30,esk6_4(X29,X30,X31,X32),esk8_4(X29,X30,X31,X32)) )
& ( equal_maps(X29,X30,X31,X32)
| apply(X29,esk6_4(X29,X30,X31,X32),esk7_4(X29,X30,X31,X32)) )
& ( equal_maps(X29,X30,X31,X32)
| member(esk8_4(X29,X30,X31,X32),X32) )
& ( equal_maps(X29,X30,X31,X32)
| member(esk7_4(X29,X30,X31,X32),X32) )
& ( equal_maps(X29,X30,X31,X32)
| member(esk6_4(X29,X30,X31,X32),X31) )
& ( X27 = X28
| ~ apply(X23,X26,X28)
| ~ apply(X22,X26,X27)
| ~ member(X28,X25)
| ~ member(X27,X25)
| ~ member(X26,X24)
| ~ equal_maps(X22,X23,X24,X25) ) ),
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)],[equal_maps])])])])])])]) ).
cnf(c_0_15,plain,
( ~ member(X1,X4)
| ~ member(X2,X4)
| ~ member(X6,X5)
| ~ apply(X3,X1,X6)
| ~ apply(X3,X2,X6)
| ~ one_to_one(X3,X4,X5)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
one_to_one(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ member(X2,esk5_0)
| ~ member(X1,esk4_0)
| ~ apply(esk3_0,X2,X1)
| apply(esk1_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( equal_maps(X2,X1,X3,X4)
| apply(X1,esk6_4(X2,X1,X3,X4),esk8_4(X2,X1,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
inverse_predicate(esk2_0,esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(X1,esk4_0)
| ~ member(X2,esk4_0)
| ~ member(X3,esk5_0)
| ~ apply(esk1_0,X1,X3)
| ~ apply(esk1_0,X2,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( ~ member(esk6_4(X1,esk3_0,X2,X3),esk5_0)
| ~ member(esk8_4(X1,esk3_0,X2,X3),esk4_0)
| apply(esk1_0,esk8_4(X1,esk3_0,X2,X3),esk6_4(X1,esk3_0,X2,X3))
| equal_maps(X1,esk3_0,X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ member(X2,esk5_0)
| ~ member(X1,esk4_0)
| ~ apply(esk2_0,X2,X1)
| apply(esk1_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_23,plain,
( equal_maps(X1,X2,X3,X4)
| apply(X1,esk6_4(X1,X2,X3,X4),esk7_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( ~ member(X1,esk4_0)
| ~ member(esk8_4(X2,esk3_0,X3,X4),esk4_0)
| ~ member(esk6_4(X2,esk3_0,X3,X4),esk5_0)
| ~ apply(esk1_0,X1,esk6_4(X2,esk3_0,X3,X4))
| equal_maps(X2,esk3_0,X3,X4)
| X1 = esk8_4(X2,esk3_0,X3,X4) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(esk6_4(esk2_0,X1,X2,X3),esk5_0)
| ~ member(esk7_4(esk2_0,X1,X2,X3),esk4_0)
| apply(esk1_0,esk7_4(esk2_0,X1,X2,X3),esk6_4(esk2_0,X1,X2,X3))
| equal_maps(esk2_0,X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( esk7_4(X1,X2,X3,X4) != esk8_4(X1,X2,X3,X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(esk7_4(esk2_0,esk3_0,X1,X2),esk4_0)
| ~ member(esk8_4(esk2_0,esk3_0,X1,X2),esk4_0)
| ~ member(esk6_4(esk2_0,esk3_0,X1,X2),esk5_0)
| equal_maps(esk2_0,esk3_0,X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_28,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk8_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk7_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(esk6_4(esk2_0,esk3_0,X1,esk4_0),esk5_0)
| equal_maps(esk2_0,esk3_0,X1,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_31,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk6_4(X1,X2,X3,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,negated_conjecture,
~ equal_maps(esk2_0,esk3_0,esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET711+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n018.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.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 05:35:14 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.11/0.46 % Version: 3.5.1
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46 % Starting sh5l with 300s (1) cores
% 0.11/0.46 % sh5l with pid 1068535 completed with status 0
% 0.11/0.46 % Result found by sh5l
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46 % Starting sh5l with 300s (1) cores
% 0.11/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.46 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.11/0.46 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.11/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.46 % SubtermCWHack with pid 1068538 completed with status 0
% 0.11/0.46 % Result found by SubtermCWHack
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46 % Starting sh5l with 300s (1) cores
% 0.11/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.46 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.11/0.46 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.11/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.46 % Preprocessing time : 0.001 s
% 0.11/0.46
% 0.11/0.46 % Proof found!
% 0.11/0.46 % SZS status Theorem
% 0.11/0.46 % SZS output start CNFRefutation
% See solution above
% 0.11/0.46 % Parsed axioms : 29
% 0.11/0.46 % Removed by relevancy pruning/SinE : 21
% 0.11/0.46 % Initial clauses : 59
% 0.11/0.46 % Removed in clause preprocessing : 0
% 0.11/0.46 % Initial clauses in saturation : 59
% 0.11/0.46 % Processed clauses : 335
% 0.11/0.46 % ...of these trivial : 0
% 0.11/0.46 % ...subsumed : 102
% 0.11/0.46 % ...remaining for further processing : 233
% 0.11/0.46 % Other redundant clauses eliminated : 0
% 0.11/0.46 % Clauses deleted for lack of memory : 0
% 0.11/0.46 % Backward-subsumed : 7
% 0.11/0.46 % Backward-rewritten : 2
% 0.11/0.46 % Generated clauses : 977
% 0.11/0.46 % ...of the previous two non-redundant : 954
% 0.11/0.46 % ...aggressively subsumed : 0
% 0.11/0.46 % Contextual simplify-reflections : 8
% 0.11/0.46 % Paramodulations : 977
% 0.11/0.46 % Factorizations : 0
% 0.11/0.46 % NegExts : 0
% 0.11/0.46 % Equation resolutions : 0
% 0.11/0.46 % Disequality decompositions : 0
% 0.11/0.46 % Total rewrite steps : 11
% 0.11/0.46 % ...of those cached : 6
% 0.11/0.46 % Propositional unsat checks : 0
% 0.11/0.46 % Propositional check models : 0
% 0.11/0.46 % Propositional check unsatisfiable : 0
% 0.11/0.46 % Propositional clauses : 0
% 0.11/0.46 % Propositional clauses after purity: 0
% 0.11/0.46 % Propositional unsat core size : 0
% 0.11/0.46 % Propositional preprocessing time : 0.000
% 0.11/0.46 % Propositional encoding time : 0.000
% 0.11/0.46 % Propositional solver time : 0.000
% 0.11/0.46 % Success case prop preproc time : 0.000
% 0.11/0.46 % Success case prop encoding time : 0.000
% 0.11/0.46 % Success case prop solver time : 0.000
% 0.11/0.46 % Current number of processed clauses : 224
% 0.11/0.46 % Positive orientable unit clauses : 9
% 0.11/0.46 % Positive unorientable unit clauses: 0
% 0.11/0.46 % Negative unit clauses : 1
% 0.11/0.46 % Non-unit-clauses : 214
% 0.11/0.46 % Current number of unprocessed clauses: 675
% 0.11/0.46 % ...number of literals in the above : 5378
% 0.11/0.46 % Current number of archived formulas : 0
% 0.11/0.46 % Current number of archived clauses : 9
% 0.11/0.46 % Clause-clause subsumption calls (NU) : 13064
% 0.11/0.46 % Rec. Clause-clause subsumption calls : 948
% 0.11/0.46 % Non-unit clause-clause subsumptions : 117
% 0.11/0.46 % Unit Clause-clause subsumption calls : 35
% 0.11/0.46 % Rewrite failures with RHS unbound : 0
% 0.11/0.46 % BW rewrite match attempts : 8
% 0.11/0.46 % BW rewrite match successes : 2
% 0.11/0.46 % Condensation attempts : 0
% 0.11/0.46 % Condensation successes : 0
% 0.11/0.46 % Termbank termtop insertions : 37939
% 0.11/0.46 % Search garbage collected termcells : 1562
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.037 s
% 0.11/0.46 % System time : 0.001 s
% 0.11/0.46 % Total time : 0.038 s
% 0.11/0.46 % Maximum resident set size: 3692 pages
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.038 s
% 0.11/0.46 % System time : 0.005 s
% 0.11/0.46 % Total time : 0.042 s
% 0.11/0.46 % Maximum resident set size: 4864 pages
% 0.11/0.46 % E exiting
%------------------------------------------------------------------------------