%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ001+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:01:19 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 44 ( 17 unt; 0 def)
% Number of atoms : 202 ( 49 equ)
% Maximal formula atoms : 40 ( 4 avg)
% Number of connectives : 229 ( 71 ~; 75 |; 63 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-4 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-3 aty)
% Number of variables : 130 ( 16 sgn 48 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(background,axiom,
? [X1,X2,X3] :
( 'AuntAgatha' != 'Butler'
& ! [X26] :
( $true
=> ~ ! [X27] :
( $true
=> ? [X28] : predicate2(X28,hate,X26,X27) ) )
& ! [X23,X24] :
( ( predicate2(X24,hate,'AuntAgatha',X23)
& $true )
=> ? [X25] : predicate2(X25,hate,'Butler',X23) )
& ! [X20] :
( ( ~ ? [X21] :
( X20 = X21
& property2(X21,rich,comp_than,'AuntAgatha') )
& $true )
=> ? [X22] : predicate2(X22,hate,'Butler',X20) )
& ! [X18] :
( ( X18 != 'Butler'
& $true )
=> ? [X19] : predicate2(X19,hate,'AuntAgatha',X18) )
& ~ ? [X17] : predicate2(X17,hate,'AuntAgatha','Butler')
& ! [X14,X15] :
( ( predicate2(X15,hate,'AuntAgatha',X14)
& $true )
=> ~ ? [X16] : predicate2(X16,hate,'Charles',X14) )
& ! [X10] :
( $true
=> ~ ? [X11,X12,X13] :
( X10 = X13
& property2(X13,rich,comp_than,X11)
& predicate2(X12,kill,X10,X11)
& $true ) )
& ! [X6] :
( $true
=> ! [X7,X8] :
( ( predicate2(X8,kill,X6,X7)
& $true )
=> ? [X9] : predicate2(X9,hate,X6,X7) ) )
& ! [X4,X5] :
( ( modifier_pp(X5,in,'DreadburyMansion')
& predicate1(X5,live,X4)
& $true )
=> ( X4 = 'Charles'
| X4 = 'Butler'
| X4 = 'AuntAgatha' ) )
& predicate2(X3,kill,X1,'AuntAgatha')
& modifier_pp(X2,in,'DreadburyMansion')
& predicate1(X2,live,X1)
& $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',background) ).
fof(prove,conjecture,
? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
fof(c_0_2,plain,
? [X1,X2,X3] :
( 'AuntAgatha' != 'Butler'
& ! [X26] :
( $true
=> ~ ! [X27] :
( $true
=> ? [X28] : predicate2(X28,hate,X26,X27) ) )
& ! [X23,X24] :
( ( predicate2(X24,hate,'AuntAgatha',X23)
& $true )
=> ? [X25] : predicate2(X25,hate,'Butler',X23) )
& ! [X20] :
( ( ~ ? [X21] :
( X20 = X21
& property2(X21,rich,comp_than,'AuntAgatha') )
& $true )
=> ? [X22] : predicate2(X22,hate,'Butler',X20) )
& ! [X18] :
( ( X18 != 'Butler'
& $true )
=> ? [X19] : predicate2(X19,hate,'AuntAgatha',X18) )
& ~ ? [X17] : predicate2(X17,hate,'AuntAgatha','Butler')
& ! [X14,X15] :
( ( predicate2(X15,hate,'AuntAgatha',X14)
& $true )
=> ~ ? [X16] : predicate2(X16,hate,'Charles',X14) )
& ! [X10] :
( $true
=> ~ ? [X11,X12,X13] :
( X10 = X13
& property2(X13,rich,comp_than,X11)
& predicate2(X12,kill,X10,X11)
& $true ) )
& ! [X6] :
( $true
=> ! [X7,X8] :
( ( predicate2(X8,kill,X6,X7)
& $true )
=> ? [X9] : predicate2(X9,hate,X6,X7) ) )
& ! [X4,X5] :
( ( modifier_pp(X5,in,'DreadburyMansion')
& predicate1(X5,live,X4)
& $true )
=> ( X4 = 'Charles'
| X4 = 'Butler'
| X4 = 'AuntAgatha' ) )
& predicate2(X3,kill,X1,'AuntAgatha')
& modifier_pp(X2,in,'DreadburyMansion')
& predicate1(X2,live,X1)
& $true ),
inference(fof_simplification,[status(thm)],[background]) ).
fof(c_0_3,plain,
! [X33,X34,X35,X36,X37,X39,X40,X41,X42,X43,X44,X45,X46,X47,X49,X52,X53,X55,X57] :
( 'AuntAgatha' != 'Butler'
& ( ~ $true
| ~ predicate2(X57,hate,X55,esk9_1(X55)) )
& ( ~ $true
| $true )
& ( predicate2(esk8_2(X52,X53),hate,'Butler',X52)
| ~ predicate2(X53,hate,'AuntAgatha',X52)
| ~ $true )
& ( predicate2(esk7_1(X49),hate,'Butler',X49)
| ~ $true
| X49 = esk6_1(X49) )
& ( predicate2(esk7_1(X49),hate,'Butler',X49)
| ~ $true
| property2(esk6_1(X49),rich,comp_than,'AuntAgatha') )
& ( predicate2(esk5_1(X47),hate,'AuntAgatha',X47)
| X47 = 'Butler'
| ~ $true )
& ~ predicate2(X46,hate,'AuntAgatha','Butler')
& ( ~ predicate2(X45,hate,'Charles',X43)
| ~ predicate2(X44,hate,'AuntAgatha',X43)
| ~ $true )
& ( X39 != X42
| ~ property2(X42,rich,comp_than,X40)
| ~ predicate2(X41,kill,X39,X40)
| ~ $true
| ~ $true )
& ( predicate2(esk4_3(X35,X36,X37),hate,X35,X36)
| ~ predicate2(X37,kill,X35,X36)
| ~ $true
| ~ $true )
& ( X33 = 'Charles'
| X33 = 'Butler'
| X33 = 'AuntAgatha'
| ~ modifier_pp(X34,in,'DreadburyMansion')
| ~ predicate1(X34,live,X33)
| ~ $true )
& predicate2(esk3_0,kill,esk1_0,'AuntAgatha')
& modifier_pp(esk2_0,in,'DreadburyMansion')
& predicate1(esk2_0,live,esk1_0)
& $true ),
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_2])])])])])]) ).
cnf(c_0_4,plain,
( ~ predicate2(X3,hate,'Charles',X2)
| ~ predicate2(X1,hate,'AuntAgatha',X2)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
( ~ predicate2(X1,kill,X2,X3)
| $false
| $false
| predicate2(esk4_3(X2,X3,X1),hate,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( ~ modifier_pp(X1,in,'DreadburyMansion')
| ~ predicate1(X1,live,X2)
| $false
| X2 = 'Charles'
| X2 = 'Butler'
| X2 = 'AuntAgatha' ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( $false
| ~ predicate2(X1,hate,X2,esk9_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( $false
| predicate2(esk7_1(X1),hate,'Butler',X1)
| X1 = esk6_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( ~ predicate2(X1,hate,'AuntAgatha',X2)
| $false
| predicate2(esk8_2(X2,X1),hate,'Butler',X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,plain,
( ~ predicate2(X1,hate,'AuntAgatha',X2)
| ~ predicate2(X3,hate,'Charles',X2) ),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( ~ predicate2(X1,kill,X2,X3)
| predicate2(esk4_3(X2,X3,X1),hate,X2,X3) ),
inference(cn,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( $false
| predicate2(esk5_1(X1),hate,'AuntAgatha',X1)
| X1 = 'Butler' ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,plain,
( ~ modifier_pp(X1,in,'DreadburyMansion')
| ~ predicate1(X1,live,X2)
| X2 = 'Charles'
| X2 = 'Butler'
| X2 = 'AuntAgatha' ),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
modifier_pp(esk2_0,in,'DreadburyMansion'),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,plain,
( $false
| predicate2(esk7_1(X1),hate,'Butler',X1)
| property2(esk6_1(X1),rich,comp_than,'AuntAgatha') ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,plain,
~ predicate2(X1,hate,X2,esk9_1(X2)),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( predicate2(esk7_1(X1),hate,'Butler',X1)
| X1 = esk6_1(X1) ),
inference(cn,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( ~ predicate2(X1,hate,'AuntAgatha',X2)
| predicate2(esk8_2(X2,X1),hate,'Butler',X2) ),
inference(cn,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( ~ predicate2(X3,kill,'Charles',X2)
| ~ predicate2(X1,hate,'AuntAgatha',X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_20,plain,
( predicate2(esk5_1(X1),hate,'AuntAgatha',X1)
| X1 = 'Butler' ),
inference(cn,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( ~ predicate1(esk2_0,live,X1)
| X1 = 'Charles'
| X1 = 'Butler'
| X1 = 'AuntAgatha' ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
predicate1(esk2_0,live,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_23,plain,
( X2 != X4
| ~ property2(X4,rich,comp_than,X3)
| ~ predicate2(X1,kill,X2,X3)
| $false
| $false ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_24,plain,
( property2(esk6_1(X1),rich,comp_than,'AuntAgatha')
| predicate2(esk7_1(X1),hate,'Butler',X1) ),
inference(cn,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
esk6_1(esk9_1('Butler')) = esk9_1('Butler'),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,plain,
~ predicate2(X1,hate,'AuntAgatha',esk9_1('Butler')),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_27,plain,
( ~ predicate2(X2,kill,'Charles',X1)
| X1 = 'Butler' ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
( esk1_0 = 'AuntAgatha'
| esk1_0 = 'Butler'
| 'Charles' = esk1_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ property2(X4,rich,comp_than,X3)
| ~ predicate2(X1,kill,X2,X3)
| X2 != X4 ),
inference(cn,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
property2(esk9_1('Butler'),rich,comp_than,'AuntAgatha'),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_24]),c_0_25]) ).
cnf(c_0_31,plain,
esk9_1('Butler') = 'Butler',
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_32,plain,
( ~ predicate2(X2,kill,esk1_0,X1)
| X1 = 'Butler'
| esk1_0 = 'Butler'
| esk1_0 = 'AuntAgatha' ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
predicate2(esk3_0,kill,esk1_0,'AuntAgatha'),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_34,plain,
'AuntAgatha' != 'Butler',
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_35,plain,
( ~ predicate2(X3,kill,X1,X2)
| ~ property2(X1,rich,comp_than,X2) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
property2('Butler',rich,comp_than,'AuntAgatha'),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_37,negated_conjecture,
~ ? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
inference(assume_negation,[status(cth)],[prove]) ).
cnf(c_0_38,plain,
( esk1_0 = 'AuntAgatha'
| esk1_0 = 'Butler' ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_39,plain,
~ predicate2(X1,kill,'Butler','AuntAgatha'),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_40,negated_conjecture,
! [X29] : ~ predicate2(X29,kill,'AuntAgatha','AuntAgatha'),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])]) ).
cnf(c_0_41,plain,
esk1_0 = 'AuntAgatha',
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
~ predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ001+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n016.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 03:49:09 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % sh5l with pid 1479275 completed with status 0
% 0.12/0.44 % Result found by sh5l
% 0.12/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.44 % Search class: FGHSF-FFSS31-SFFFFFNN
% 0.12/0.44 % partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.44 % SubtermCWHack with pid 1479282 completed with status 0
% 0.12/0.44 % Result found by SubtermCWHack
% 0.12/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.44 % Search class: FGHSF-FFSS31-SFFFFFNN
% 0.12/0.44 % partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Theorem
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 2
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 17
% 0.12/0.44 % Removed in clause preprocessing : 2
% 0.12/0.44 % Initial clauses in saturation : 15
% 0.12/0.44 % Processed clauses : 45
% 0.12/0.44 % ...of these trivial : 1
% 0.12/0.44 % ...subsumed : 7
% 0.12/0.44 % ...remaining for further processing : 37
% 0.12/0.44 % Other redundant clauses eliminated : 1
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 2
% 0.12/0.44 % Backward-rewritten : 6
% 0.12/0.44 % Generated clauses : 31
% 0.12/0.44 % ...of the previous two non-redundant : 33
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 29
% 0.12/0.44 % Factorizations : 1
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 1
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 9
% 0.12/0.44 % ...of those cached : 4
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 28
% 0.12/0.44 % Positive orientable unit clauses : 6
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 9
% 0.12/0.44 % Non-unit-clauses : 13
% 0.12/0.44 % Current number of unprocessed clauses: 1
% 0.12/0.44 % ...number of literals in the above : 2
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 8
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 17
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 13
% 0.12/0.44 % Non-unit clause-clause subsumptions : 2
% 0.12/0.44 % Unit Clause-clause subsumption calls : 16
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 2
% 0.12/0.44 % BW rewrite match successes : 2
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 1862
% 0.12/0.44 % Search garbage collected termcells : 370
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.006 s
% 0.12/0.44 % System time : 0.002 s
% 0.12/0.44 % Total time : 0.008 s
% 0.12/0.44 % Maximum resident set size: 3600 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.007 s
% 0.12/0.44 % System time : 0.005 s
% 0.12/0.44 % Total time : 0.012 s
% 0.12/0.44 % Maximum resident set size: 4608 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------