%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PHI013+1 : TPTP v9.3.1. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:58:24 PM UTC 2026
% Result : Theorem 0.04s 0.42s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 51 ( 22 unt; 0 def)
% Number of atoms : 168 ( 5 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 193 ( 76 ~; 78 |; 25 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 49 ( 4 sgn 18 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(description_theorem_2,axiom,
! [X1] :
( property(X1)
=> ( ? [X2] :
( is_the(X2,X1)
& object(X2) )
=> ! [X3] :
( object(X3)
=> ( is_the(X3,X1)
=> exemplifies_property(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_theorem_2) ).
fof(description_is_property_and_described_is_object,axiom,
! [X5,X1] :
( is_the(X5,X1)
=> ( object(X5)
& property(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
fof(lemma_2,axiom,
( ? [X5] :
( exemplifies_property(none_greater,X5)
& object(X5) )
=> ? [X5] :
( ! [X2] :
( object(X2)
=> ( exemplifies_property(none_greater,X2)
=> X2 = X5 ) )
& exemplifies_property(none_greater,X5)
& object(X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_2) ).
fof(premise_1,axiom,
? [X5] :
( exemplifies_property(none_greater,X5)
& object(X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_1) ).
fof(definition_god,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_god) ).
fof(god_exists,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',god_exists) ).
fof(premise_2,axiom,
! [X5] :
( object(X5)
=> ( ( ~ exemplifies_property(existence,X5)
& is_the(X5,none_greater) )
=> ? [X2] :
( exemplifies_property(conceivable,X2)
& exemplifies_relation(greater_than,X2,X5)
& object(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_2) ).
fof(definition_none_greater,axiom,
! [X5] :
( object(X5)
=> ( exemplifies_property(none_greater,X5)
<=> ( ~ ? [X2] :
( exemplifies_property(conceivable,X2)
& exemplifies_relation(greater_than,X2,X5)
& object(X2) )
& exemplifies_property(conceivable,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_none_greater) ).
fof(c_0_8,plain,
! [X10,X11,X12] :
( exemplifies_property(X10,X12)
| ~ is_the(X12,X10)
| ~ object(X12)
| ~ is_the(X11,X10)
| ~ object(X11)
| ~ property(X10) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_theorem_2])])])]) ).
fof(c_0_9,plain,
! [X13,X14] :
( ( ~ is_the(X13,X14)
| object(X13) )
& ( ~ is_the(X13,X14)
| property(X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_is_property_and_described_is_object])])])]) ).
cnf(c_0_10,plain,
( ~ is_the(X3,X1)
| ~ object(X3)
| ~ is_the(X2,X1)
| ~ object(X2)
| ~ property(X1)
| exemplifies_property(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ~ is_the(X2,X1)
| property(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ is_the(X1,X2)
| object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X19,X21] :
( ( ~ exemplifies_property(none_greater,X19)
| ~ object(X19)
| X21 = esk5_0
| ~ exemplifies_property(none_greater,X21)
| ~ object(X21) )
& ( ~ exemplifies_property(none_greater,X19)
| ~ object(X19)
| exemplifies_property(none_greater,esk5_0) )
& ( ~ exemplifies_property(none_greater,X19)
| ~ object(X19)
| object(esk5_0) ) ),
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)],[lemma_2])])])])])]) ).
fof(c_0_14,plain,
( exemplifies_property(none_greater,esk4_0)
& object(esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[premise_1])]) ).
cnf(c_0_15,plain,
( ~ is_the(X3,X1)
| ~ is_the(X2,X1)
| exemplifies_property(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_12]) ).
cnf(c_0_16,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
fof(c_0_17,negated_conjecture,
~ exemplifies_property(existence,god),
inference(assume_negation,[status(cth)],[god_exists]) ).
fof(c_0_18,plain,
! [X5] :
( object(X5)
=> ( ( ~ exemplifies_property(existence,X5)
& is_the(X5,none_greater) )
=> ? [X2] :
( exemplifies_property(conceivable,X2)
& exemplifies_relation(greater_than,X2,X5)
& object(X2) ) ) ),
inference(fof_simplification,[status(thm)],[premise_2]) ).
cnf(c_0_19,plain,
( ~ exemplifies_property(none_greater,X2)
| ~ object(X2)
| ~ exemplifies_property(none_greater,X1)
| ~ object(X1)
| X1 = esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
exemplifies_property(none_greater,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
object(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(none_greater,god) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_23,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X22] :
( ( ~ object(X22)
| exemplifies_property(existence,X22)
| ~ is_the(X22,none_greater)
| exemplifies_property(conceivable,esk6_1(X22)) )
& ( ~ object(X22)
| exemplifies_property(existence,X22)
| ~ is_the(X22,none_greater)
| exemplifies_relation(greater_than,esk6_1(X22),X22) )
& ( ~ object(X22)
| exemplifies_property(existence,X22)
| ~ is_the(X22,none_greater)
| object(esk6_1(X22)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
cnf(c_0_25,plain,
( ~ object(X1)
| ~ exemplifies_property(none_greater,X1)
| X1 = esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
exemplifies_property(none_greater,god),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_27,plain,
object(god),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
fof(c_0_28,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( ~ object(X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ~ object(X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| object(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( ~ object(X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
god = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk6_1(X1)) ),
inference(csr,[status(thm)],[c_0_29,c_0_12]) ).
cnf(c_0_35,plain,
( ~ is_the(X1,none_greater)
| object(esk6_1(X1))
| exemplifies_property(existence,X1) ),
inference(csr,[status(thm)],[c_0_30,c_0_12]) ).
fof(c_0_36,plain,
! [X15,X16] :
( ( ~ object(X15)
| exemplifies_property(none_greater,X15)
| ~ exemplifies_property(conceivable,X15)
| exemplifies_property(conceivable,esk3_1(X15)) )
& ( ~ object(X15)
| exemplifies_property(none_greater,X15)
| ~ exemplifies_property(conceivable,X15)
| exemplifies_relation(greater_than,esk3_1(X15),X15) )
& ( ~ object(X15)
| exemplifies_property(none_greater,X15)
| ~ exemplifies_property(conceivable,X15)
| object(esk3_1(X15)) )
& ( ~ object(X15)
| ~ exemplifies_property(none_greater,X15)
| ~ exemplifies_property(conceivable,X16)
| ~ exemplifies_relation(greater_than,X16,X15)
| ~ object(X16) )
& ( ~ object(X15)
| ~ exemplifies_property(none_greater,X15)
| exemplifies_property(conceivable,X15) ) ),
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)],[definition_none_greater])])])])])]) ).
cnf(c_0_37,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk6_1(X1),X1) ),
inference(csr,[status(thm)],[c_0_31,c_0_12]) ).
cnf(c_0_38,plain,
is_the(esk5_0,none_greater),
inference(rw,[status(thm)],[c_0_16,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
~ exemplifies_property(existence,esk5_0),
inference(rw,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_40,plain,
( ~ exemplifies_property(none_greater,X1)
| ~ object(X1)
| exemplifies_property(none_greater,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,plain,
exemplifies_property(conceivable,esk6_1(god)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_16]),c_0_33]) ).
cnf(c_0_42,plain,
( ~ exemplifies_property(none_greater,X1)
| ~ object(X1)
| object(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,plain,
object(esk6_1(god)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_16]),c_0_33]) ).
cnf(c_0_44,plain,
( ~ object(X2)
| ~ exemplifies_property(none_greater,X2)
| ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_relation(greater_than,X1,X2)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
exemplifies_relation(greater_than,esk6_1(esk5_0),esk5_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_46,plain,
exemplifies_property(none_greater,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_20]),c_0_21])]) ).
cnf(c_0_47,plain,
exemplifies_property(conceivable,esk6_1(esk5_0)),
inference(spm,[status(thm)],[c_0_41,c_0_32]) ).
cnf(c_0_48,plain,
object(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_20]),c_0_21])]) ).
cnf(c_0_49,plain,
object(esk6_1(esk5_0)),
inference(spm,[status(thm)],[c_0_43,c_0_32]) ).
cnf(c_0_50,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]),c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI013+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n001.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % 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 03:35:29 UTC 2026
% 0.04/0.36 % CPUTime :
% 0.04/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.40 Running first-order theorem proving
% 0.04/0.40 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.04/0.42 % Version: 3.5.1
% 0.04/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.04/0.42 % Starting sh5l with 300s (1) cores
% 0.04/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2099722 completed with status 0
% 0.04/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.04/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.42 % No SInE strategy applied
% 0.04/0.42 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.04/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.04/0.42 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.04/0.42 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.04/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.04/0.42 % new_bool_3 with pid 2099730 completed with status 0
% 0.04/0.42 % Result found by new_bool_3
% 0.04/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.42 % No SInE strategy applied
% 0.04/0.42 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.04/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.04/0.42 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.04/0.42 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.04/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.04/0.42 % Preprocessing time : 0.001 s
% 0.04/0.42 % Presaturation interreduction done
% 0.04/0.42
% 0.04/0.42 % Proof found!
% 0.04/0.42 % SZS status Theorem
% 0.04/0.42 % SZS output start CNFRefutation
% See solution above
% 0.04/0.42 % Parsed axioms : 9
% 0.04/0.42 % Removed by relevancy pruning/SinE : 0
% 0.04/0.42 % Initial clauses : 24
% 0.04/0.42 % Removed in clause preprocessing : 0
% 0.04/0.42 % Initial clauses in saturation : 24
% 0.04/0.42 % Processed clauses : 70
% 0.04/0.42 % ...of these trivial : 2
% 0.04/0.42 % ...subsumed : 0
% 0.04/0.42 % ...remaining for further processing : 68
% 0.04/0.42 % Other redundant clauses eliminated : 0
% 0.04/0.42 % Clauses deleted for lack of memory : 0
% 0.04/0.42 % Backward-subsumed : 1
% 0.04/0.42 % Backward-rewritten : 10
% 0.04/0.42 % Generated clauses : 47
% 0.04/0.42 % ...of the previous two non-redundant : 39
% 0.04/0.42 % ...aggressively subsumed : 0
% 0.04/0.42 % Contextual simplify-reflections : 6
% 0.04/0.42 % Paramodulations : 47
% 0.04/0.42 % Factorizations : 0
% 0.04/0.42 % NegExts : 0
% 0.04/0.42 % Equation resolutions : 0
% 0.04/0.42 % Disequality decompositions : 0
% 0.04/0.42 % Total rewrite steps : 58
% 0.04/0.42 % ...of those cached : 45
% 0.04/0.42 % Propositional unsat checks : 0
% 0.04/0.42 % Propositional check models : 0
% 0.04/0.42 % Propositional check unsatisfiable : 0
% 0.04/0.42 % Propositional clauses : 0
% 0.04/0.42 % Propositional clauses after purity: 0
% 0.04/0.42 % Propositional unsat core size : 0
% 0.04/0.42 % Propositional preprocessing time : 0.000
% 0.04/0.42 % Propositional encoding time : 0.000
% 0.04/0.42 % Propositional solver time : 0.000
% 0.04/0.42 % Success case prop preproc time : 0.000
% 0.04/0.42 % Success case prop encoding time : 0.000
% 0.04/0.42 % Success case prop solver time : 0.000
% 0.04/0.42 % Current number of processed clauses : 33
% 0.04/0.42 % Positive orientable unit clauses : 12
% 0.04/0.42 % Positive unorientable unit clauses: 0
% 0.04/0.42 % Negative unit clauses : 1
% 0.04/0.42 % Non-unit-clauses : 20
% 0.04/0.42 % Current number of unprocessed clauses: 14
% 0.04/0.42 % ...number of literals in the above : 47
% 0.04/0.42 % Current number of archived formulas : 0
% 0.04/0.42 % Current number of archived clauses : 35
% 0.04/0.42 % Clause-clause subsumption calls (NU) : 79
% 0.04/0.42 % Rec. Clause-clause subsumption calls : 49
% 0.04/0.42 % Non-unit clause-clause subsumptions : 7
% 0.04/0.42 % Unit Clause-clause subsumption calls : 32
% 0.04/0.42 % Rewrite failures with RHS unbound : 0
% 0.04/0.42 % BW rewrite match attempts : 5
% 0.04/0.42 % BW rewrite match successes : 5
% 0.04/0.42 % Condensation attempts : 0
% 0.04/0.42 % Condensation successes : 0
% 0.04/0.42 % Termbank termtop insertions : 2701
% 0.04/0.42 % Search garbage collected termcells : 389
% 0.04/0.42
% 0.04/0.42 % -------------------------------------------------
% 0.04/0.42 % User time : 0.006 s
% 0.04/0.42 % System time : 0.001 s
% 0.04/0.42 % Total time : 0.007 s
% 0.04/0.42 % Maximum resident set size: 3640 pages
% 0.04/0.42
% 0.04/0.42 % -------------------------------------------------
% 0.04/0.42 % User time : 0.021 s
% 0.04/0.42 % System time : 0.011 s
% 0.04/0.42 % Total time : 0.033 s
% 0.04/0.42 % Maximum resident set size: 4864 pages
% 0.04/0.42 % E exiting
%------------------------------------------------------------------------------