%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWB029+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:39:19 PM UTC 2026
% Result : ContradictoryAxioms 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 189 ( 0 equ)
% Maximal formula atoms : 71 ( 6 avg)
% Number of connectives : 270 ( 112 ~; 111 |; 39 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 14 con; 0-5 aty)
% Number of variables : 73 ( 4 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_bool_intersectionof_class_002,axiom,
! [X3,X4,X5,X6,X7] :
( ( iext(uri_rdf_rest,X6,uri_rdf_nil)
& iext(uri_rdf_first,X6,X7)
& iext(uri_rdf_rest,X4,X6)
& iext(uri_rdf_first,X4,X5) )
=> ( iext(uri_owl_intersectionOf,X3,X4)
<=> ( ! [X1] :
( icext(X3,X1)
<=> ( icext(X7,X1)
& icext(X5,X1) ) )
& ic(X7)
& ic(X5)
& ic(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_bool_intersectionof_class_002) ).
fof(testcase_premise_fullish_029_Ex_Falso_Quodlibet,axiom,
? [X8,X9,X10,X11] :
( iext(uri_owl_complementOf,X9,uri_ex_A)
& iext(uri_rdf_rest,X11,uri_rdf_nil)
& iext(uri_rdf_first,X11,X9)
& iext(uri_rdf_rest,X10,X11)
& iext(uri_rdf_first,X10,uri_ex_A)
& iext(uri_owl_intersectionOf,X8,X10)
& iext(uri_rdf_type,uri_ex_w,X8)
& iext(uri_rdf_type,uri_ex_B,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_A,uri_owl_Class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_029_Ex_Falso_Quodlibet) ).
fof(owl_bool_complementof_class,axiom,
! [X3,X2] :
( iext(uri_owl_complementOf,X3,X2)
=> ( ! [X1] :
( icext(X3,X1)
<=> ~ icext(X2,X1) )
& ic(X2)
& ic(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_bool_complementof_class) ).
fof(rdfs_cext_def,axiom,
! [X1,X2] :
( iext(uri_rdf_type,X1,X2)
<=> icext(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdfs_cext_def) ).
fof(c_0_4,plain,
! [X17,X18,X19,X20,X21,X22,X23] :
( ( ~ iext(uri_rdf_rest,X20,uri_rdf_nil)
| ~ iext(uri_rdf_first,X20,X21)
| ~ iext(uri_rdf_rest,X18,X20)
| ~ iext(uri_rdf_first,X18,X19)
| iext(uri_owl_intersectionOf,X17,X18)
| ~ ic(X21)
| ~ ic(X19)
| ~ ic(X17)
| icext(X17,esk1_5(X17,X18,X19,X20,X21))
| icext(X21,esk1_5(X17,X18,X19,X20,X21)) )
& ( ~ iext(uri_rdf_rest,X20,uri_rdf_nil)
| ~ iext(uri_rdf_first,X20,X21)
| ~ iext(uri_rdf_rest,X18,X20)
| ~ iext(uri_rdf_first,X18,X19)
| iext(uri_owl_intersectionOf,X17,X18)
| ~ ic(X21)
| ~ ic(X19)
| ~ ic(X17)
| icext(X17,esk1_5(X17,X18,X19,X20,X21))
| icext(X19,esk1_5(X17,X18,X19,X20,X21)) )
& ( ~ iext(uri_rdf_rest,X20,uri_rdf_nil)
| ~ iext(uri_rdf_first,X20,X21)
| ~ iext(uri_rdf_rest,X18,X20)
| ~ iext(uri_rdf_first,X18,X19)
| iext(uri_owl_intersectionOf,X17,X18)
| ~ ic(X21)
| ~ ic(X19)
| ~ ic(X17)
| ~ icext(X21,esk1_5(X17,X18,X19,X20,X21))
| ~ icext(X19,esk1_5(X17,X18,X19,X20,X21))
| ~ icext(X17,esk1_5(X17,X18,X19,X20,X21)) )
& ( ~ iext(uri_rdf_rest,X20,uri_rdf_nil)
| ~ iext(uri_rdf_first,X20,X21)
| ~ iext(uri_rdf_rest,X18,X20)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_owl_intersectionOf,X17,X18)
| icext(X17,X23)
| ~ icext(X21,X23)
| ~ icext(X19,X23) )
& ( ~ iext(uri_rdf_rest,X20,uri_rdf_nil)
| ~ iext(uri_rdf_first,X20,X21)
| ~ iext(uri_rdf_rest,X18,X20)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_owl_intersectionOf,X17,X18)
| ~ icext(X17,X22)
| icext(X21,X22) )
& ( ~ iext(uri_rdf_rest,X20,uri_rdf_nil)
| ~ iext(uri_rdf_first,X20,X21)
| ~ iext(uri_rdf_rest,X18,X20)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_owl_intersectionOf,X17,X18)
| ~ icext(X17,X22)
| icext(X19,X22) )
& ( ~ iext(uri_rdf_rest,X20,uri_rdf_nil)
| ~ iext(uri_rdf_first,X20,X21)
| ~ iext(uri_rdf_rest,X18,X20)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_owl_intersectionOf,X17,X18)
| ic(X21) )
& ( ~ iext(uri_rdf_rest,X20,uri_rdf_nil)
| ~ iext(uri_rdf_first,X20,X21)
| ~ iext(uri_rdf_rest,X18,X20)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_owl_intersectionOf,X17,X18)
| ic(X19) )
& ( ~ iext(uri_rdf_rest,X20,uri_rdf_nil)
| ~ iext(uri_rdf_first,X20,X21)
| ~ iext(uri_rdf_rest,X18,X20)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_owl_intersectionOf,X17,X18)
| ic(X17) ) ),
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)],[owl_bool_intersectionof_class_002])])])])])])]) ).
fof(c_0_5,plain,
( iext(uri_owl_complementOf,esk3_0,uri_ex_A)
& iext(uri_rdf_rest,esk5_0,uri_rdf_nil)
& iext(uri_rdf_first,esk5_0,esk3_0)
& iext(uri_rdf_rest,esk4_0,esk5_0)
& iext(uri_rdf_first,esk4_0,uri_ex_A)
& iext(uri_owl_intersectionOf,esk2_0,esk4_0)
& iext(uri_rdf_type,uri_ex_w,esk2_0)
& iext(uri_rdf_type,uri_ex_B,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_A,uri_owl_Class) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_029_Ex_Falso_Quodlibet])]) ).
cnf(c_0_6,plain,
( ~ iext(uri_rdf_rest,X6,uri_rdf_nil)
| ~ iext(uri_rdf_first,X6,X1)
| ~ iext(uri_rdf_rest,X4,X6)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_rdf_rest,esk5_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ iext(uri_rdf_rest,X5,uri_rdf_nil)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_rdf_rest,X4,X5)
| ~ iext(uri_rdf_first,X4,X1)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X3,X2] :
( iext(uri_owl_complementOf,X3,X2)
=> ( ! [X1] :
( icext(X3,X1)
<=> ~ icext(X2,X1) )
& ic(X2)
& ic(X3) ) ),
inference(fof_simplification,[status(thm)],[owl_bool_complementof_class]) ).
cnf(c_0_10,plain,
( ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_rdf_rest,X4,esk5_0)
| ~ iext(uri_rdf_first,esk5_0,X1)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
iext(uri_rdf_first,esk4_0,uri_ex_A),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
iext(uri_rdf_rest,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X12,X13] :
( ( iext(uri_rdf_type,X12,X13)
| ~ icext(X13,X12) )
& ( icext(X13,X12)
| ~ iext(uri_rdf_type,X12,X13) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).
cnf(c_0_14,plain,
( ~ iext(uri_owl_intersectionOf,X3,X5)
| ~ iext(uri_rdf_first,X5,X1)
| ~ iext(uri_rdf_rest,X5,esk5_0)
| ~ iext(uri_rdf_first,esk5_0,X4)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_15,plain,
iext(uri_rdf_first,esk5_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_16,plain,
! [X14,X15,X16] :
( ( ~ iext(uri_owl_complementOf,X14,X15)
| icext(X14,X16)
| icext(X15,X16) )
& ( ~ iext(uri_owl_complementOf,X14,X15)
| ~ icext(X15,X16)
| ~ icext(X14,X16) )
& ( ~ iext(uri_owl_complementOf,X14,X15)
| ic(X15) )
& ( ~ iext(uri_owl_complementOf,X14,X15)
| ic(X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_17,plain,
( ~ iext(uri_owl_intersectionOf,X3,esk4_0)
| ~ iext(uri_rdf_first,esk5_0,X1)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_18,plain,
( ~ iext(uri_rdf_type,X1,X2)
| icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ iext(uri_rdf_first,X4,X1)
| ~ iext(uri_rdf_rest,X4,esk5_0)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ iext(uri_owl_complementOf,X1,X3)
| ~ icext(X3,X2)
| ~ icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
iext(uri_owl_complementOf,esk3_0,uri_ex_A),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,plain,
( ~ iext(uri_rdf_type,X2,X3)
| ~ iext(uri_owl_intersectionOf,X3,esk4_0)
| ~ iext(uri_rdf_first,esk5_0,X1)
| icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
iext(uri_rdf_type,uri_ex_w,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,plain,
iext(uri_owl_intersectionOf,esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,plain,
( ~ iext(uri_owl_intersectionOf,X2,esk4_0)
| ~ icext(X2,X1)
| icext(uri_ex_A,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_12])]) ).
cnf(c_0_26,plain,
( ~ icext(esk3_0,X1)
| ~ icext(uri_ex_A,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ iext(uri_rdf_first,esk5_0,X1)
| icext(X1,uri_ex_w) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
( ~ iext(uri_rdf_type,X1,X2)
| ~ iext(uri_owl_intersectionOf,X2,esk4_0)
| icext(uri_ex_A,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_29,plain,
~ icext(uri_ex_A,uri_ex_w),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15])]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_23]),c_0_24])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWB029+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 07:43:08 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 507354 completed with status 0
% 0.13/0.42 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.13/0.42 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 507359 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status ContradictoryAxioms
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 5
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 25
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 25
% 0.13/0.42 % Processed clauses : 127
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 45
% 0.13/0.42 % ...remaining for further processing : 82
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 14
% 0.13/0.42 % Backward-rewritten : 0
% 0.13/0.42 % Generated clauses : 159
% 0.13/0.42 % ...of the previous two non-redundant : 147
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 1
% 0.13/0.42 % Paramodulations : 159
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 24
% 0.13/0.42 % ...of those cached : 18
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 68
% 0.13/0.42 % Positive orientable unit clauses : 12
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 7
% 0.13/0.42 % Non-unit-clauses : 49
% 0.13/0.42 % Current number of unprocessed clauses: 31
% 0.13/0.42 % ...number of literals in the above : 204
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 14
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 1607
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 344
% 0.13/0.42 % Non-unit clause-clause subsumptions : 23
% 0.13/0.42 % Unit Clause-clause subsumption calls : 131
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 3
% 0.13/0.42 % BW rewrite match successes : 0
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 4473
% 0.13/0.42 % Search garbage collected termcells : 337
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.007 s
% 0.13/0.42 % System time : 0.004 s
% 0.13/0.42 % Total time : 0.011 s
% 0.13/0.42 % Maximum resident set size: 3640 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.028 s
% 0.13/0.42 % System time : 0.012 s
% 0.13/0.42 % Total time : 0.040 s
% 0.13/0.42 % Maximum resident set size: 4608 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------