%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV386^5 : 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 : n003.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 : Wed Sep 30 08:35:27 AM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 1
% Syntax : Number of formulae : 43 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 160 ( 67 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 276 ( 51 ~; 75 |; 6 &; 134 @)
% ( 5 <=>; 3 =>; 0 <=; 2 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 4 ^; 53 !; 6 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
p: a > $o ).
thf(decl_24,type,
esk1_1: a > a ).
thf(decl_25,type,
esk2_0: a ).
thf(decl_26,type,
esk3_0: a ).
thf(decl_27,type,
esk2_1: a > a ).
thf(decl_28,type,
esk3_1: a > a ).
thf(cTTTP5306A_pme,conjecture,
( ? [X1: a] :
( p
= ( ^ [X2: a,X1: a] : ( X2 = X1 )
@ X1 ) )
<=> ? [X1: a] :
( ( p @ X1 )
& ! [X3: a] :
( ( p @ X3 )
=> ( X1 = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.h8XKNV5afH/E---3.1_2661318.p',cTTTP5306A_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ? [X1: a] :
( p
= ( ^ [X2: a,X1: a] : ( X2 = X1 )
@ X1 ) )
<=> ? [X1: a] :
( ( p @ X1 )
& ! [X3: a] :
( ( p @ X3 )
=> ( X1 = X3 ) ) ) ),
inference(assume_negation,[status(cth)],[cTTTP5306A_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ? [X1: a] :
( p
= ( $eq @ X1 ) )
<=> ? [X1: a] :
( ( p @ X1 )
& ! [X3: a] :
( ( p @ X3 )
=> ( X1 = X3 ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
! [X7: a,X8: a,X12: a] :
( ( ( p @ ( esk1_1 @ X8 ) )
| ~ ( p @ X8 )
| ( p
!= ( $eq @ X7 ) ) )
& ( ( X8
!= ( esk1_1 @ X8 ) )
| ~ ( p @ X8 )
| ( p
!= ( $eq @ X7 ) ) )
& ( ( p @ esk3_0 )
| ( p
= ( $eq @ esk2_0 ) ) )
& ( ~ ( p @ X12 )
| ( esk3_0 = X12 )
| ( p
= ( $eq @ esk2_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)],[c_0_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X1: a] :
( ( esk3_0 = X1 )
| ( p
= ( $eq @ esk2_0 ) )
| ~ ( p @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X14: a,X1: a] :
( ( ( esk2_0 = X14 )
<=> ( p @ X14 ) )
| ( esk3_0 = X1 )
| ~ ( p @ X1 ) ),
inference(arg_cong,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: a,X2: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ~ ( p @ X1 )
| ( p
!= ( $eq @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X2: a,X1: a] :
( ( esk3_0 = X1 )
| ( esk2_0 = X2 )
| ~ ( p @ X2 )
| ~ ( p @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X2: a,X1: a] :
( ( esk3_0 = X1 )
| ( p @ ( esk1_1 @ X2 ) )
| ~ ( p @ X2 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X1: a,X2: a] :
( ( X1
!= ( esk1_1 @ X1 ) )
| ~ ( p @ X1 )
| ( p
!= ( $eq @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk1_1 @ X1 )
= esk2_0 )
| ( esk3_0 = X2 )
| ~ ( p @ X2 )
| ~ ( p @ X1 ) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])]) ).
thf(c_0_11,negated_conjecture,
! [X1: a] :
( ( esk3_0 = X1 )
| ( p @ esk2_0 )
| ~ ( p @ X1 ) ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5])]) ).
thf(c_0_12,negated_conjecture,
( ( p @ esk3_0 )
| ( p
= ( $eq @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,negated_conjecture,
! [X2: a,X1: a] :
( ( esk3_0 = X1 )
| ( ( $eq @ X2 )
!= p )
| ~ ( p @ X1 ) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10])]),c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X2: a,X1: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ( ( X2
= ( esk3_1 @ X2 ) )
<~> ( p @ ( esk3_1 @ X2 ) ) )
| ~ ( p @ X1 ) ),
inference(neg_ext,[status(thm)],[c_0_6]) ).
thf(c_0_15,negated_conjecture,
! [X13: a] :
( ( ( esk2_0 = X13 )
<=> ( p @ X13 ) )
| ( p @ esk3_0 ) ),
inference(arg_cong,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X1: a] :
( ( esk3_0 = X1 )
| ~ ( p @ X1 ) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_4])]) ).
thf(c_0_17,negated_conjecture,
! [X1: a,X2: a] :
( ( ( esk3_1 @ X1 )
= X1 )
| ( p @ ( esk1_1 @ X2 ) )
| ( p @ ( esk3_1 @ X1 ) )
| ~ ( p @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X1: a] :
( ( esk2_0 = X1 )
| ( p @ esk3_0 )
| ~ ( p @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_15]) ).
thf(c_0_19,negated_conjecture,
! [X1: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ( p @ esk3_0 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
thf(c_0_20,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk1_1 @ X1 )
= esk3_0 )
| ( ( esk3_1 @ X2 )
= X2 )
| ( p @ ( esk3_1 @ X2 ) )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_21,negated_conjecture,
! [X1: a] :
( ( ( esk1_1 @ X1 )
= esk2_0 )
| ( p @ esk3_0 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
( ( p @ esk3_0 )
| ( p @ esk2_0 ) ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_15])]) ).
thf(c_0_23,negated_conjecture,
! [X1: a,X2: a] :
( ( ( X1
= ( esk2_1 @ X1 ) )
<~> ( p @ ( esk2_1 @ X1 ) ) )
| ( ( esk1_1 @ X2 )
!= X2 )
| ~ ( p @ X2 ) ),
inference(neg_ext,[status(thm)],[c_0_9]) ).
thf(c_0_24,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk1_1 @ X1 )
= esk3_0 )
| ( ( esk3_1 @ X2 )
= esk3_0 )
| ( ( esk3_1 @ X2 )
= X2 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
thf(c_0_25,negated_conjecture,
! [X1: a] :
( ( p @ esk3_0 )
| ( ( $eq @ X1 )
!= p ) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_21])]),c_0_22]) ).
thf(c_0_26,negated_conjecture,
! [X1: a,X2: a] :
( ( ( esk2_1 @ X1 )
= X1 )
| ( p @ ( esk2_1 @ X1 ) )
| ( ( esk1_1 @ X2 )
!= X2 )
| ~ ( p @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_23]) ).
thf(c_0_27,negated_conjecture,
! [X1: a] :
( ( ( esk3_1 @ esk3_0 )
= esk3_0 )
| ( ( esk1_1 @ X1 )
= esk3_0 )
| ~ ( p @ X1 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_24])]) ).
thf(c_0_28,negated_conjecture,
p @ esk3_0,
inference(spm,[status(thm)],[c_0_25,c_0_12]) ).
thf(c_0_29,negated_conjecture,
! [X1: a] :
( ( ( esk3_1 @ esk3_0 )
= esk3_0 )
| ( ( esk2_1 @ X1 )
= X1 )
| ( p @ ( esk2_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27])]),c_0_28])]) ).
thf(c_0_30,negated_conjecture,
! [X1: a] :
( ( ( esk3_1 @ esk3_0 )
= esk3_0 )
| ( ( esk2_1 @ X1 )
= esk3_0 )
| ( ( esk2_1 @ X1 )
= X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_29]) ).
thf(c_0_31,negated_conjecture,
! [X1: a,X2: a] :
( ( ( esk2_1 @ X1 )
!= X1 )
| ( ( esk1_1 @ X2 )
!= X2 )
| ~ ( p @ ( esk2_1 @ X1 ) )
| ~ ( p @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_23]) ).
thf(c_0_32,negated_conjecture,
( ( ( esk2_1 @ esk3_0 )
= esk3_0 )
| ( ( esk3_1 @ esk3_0 )
= esk3_0 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_30])]) ).
thf(c_0_33,negated_conjecture,
! [X1: a] :
( ( ( esk3_1 @ esk3_0 )
= esk3_0 )
| ( ( esk1_1 @ X1 )
!= X1 )
| ~ ( p @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28])]) ).
thf(c_0_34,negated_conjecture,
! [X2: a,X1: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ( ( esk3_1 @ X2 )
!= X2 )
| ~ ( p @ ( esk3_1 @ X2 ) )
| ~ ( p @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_14]) ).
thf(c_0_35,negated_conjecture,
( ( esk3_1 @ esk3_0 )
= esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27])]),c_0_28])]) ).
thf(c_0_36,negated_conjecture,
! [X1: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ~ ( p @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_28])]) ).
thf(c_0_37,negated_conjecture,
! [X1: a] :
( ( ( esk1_1 @ X1 )
= esk3_0 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
thf(c_0_38,negated_conjecture,
! [X1: a] :
( ( ( esk2_1 @ X1 )
= X1 )
| ( p @ ( esk2_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_37])]),c_0_28])]) ).
thf(c_0_39,negated_conjecture,
! [X1: a] :
( ( ( esk2_1 @ X1 )
= esk3_0 )
| ( ( esk2_1 @ X1 )
= X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_38]) ).
thf(c_0_40,negated_conjecture,
( ( esk2_1 @ esk3_0 )
= esk3_0 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_39])]) ).
thf(c_0_41,negated_conjecture,
! [X1: a] :
( ( ( esk1_1 @ X1 )
!= X1 )
| ~ ( p @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_40]),c_0_28])]) ).
thf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_37])]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV386^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n003.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 15:45:28 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.24 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.h8XKNV5afH/E---3.1_2661318.p
% 0.10/0.26 % Version: 3.5.1-ho
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.10/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.10/0.26 % Starting sh5l with 300s (1) cores
% 0.10/0.26 % ehoh_best_nonlift_nonlambdatoforall with pid 2661331 completed with status 0
% 0.10/0.26 % Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.26 % No SInE strategy applied
% 0.10/0.26 % Search class: HGHSF-FFSF11-SSSFFFNN
% 0.10/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.10/0.26 % Starting sh5l with 136s (1) cores
% 0.10/0.26 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.26 % Starting new_bool_2 with 136s (1) cores
% 0.10/0.26 % SubtermCWHack with pid 2661336 completed with status 10
% 0.10/0.26 % Starting new_bool_9 with 136s (1) cores
% 0.10/0.26 % sh5l with pid 2661340 completed with status 0
% 0.10/0.26 % Result found by sh5l
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.26 % No SInE strategy applied
% 0.10/0.26 % Search class: HGHSF-FFSF11-SSSFFFNN
% 0.10/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.10/0.26 % Starting sh5l with 136s (1) cores
% 0.10/0.26 % Preprocessing time : 0.001 s
% 0.10/0.26 % Presaturation interreduction done
% 0.10/0.26
% 0.10/0.26 % Proof found!
% 0.10/0.26 % SZS status Theorem
% 0.10/0.26 % SZS output start CNFRefutation
% See solution above
% 0.10/0.26 % Parsed axioms : 3
% 0.10/0.26 % Removed by relevancy pruning/SinE : 0
% 0.10/0.26 % Initial clauses : 6
% 0.10/0.26 % Removed in clause preprocessing : 2
% 0.10/0.26 % Initial clauses in saturation : 4
% 0.10/0.26 % Processed clauses : 75
% 0.10/0.26 % ...of these trivial : 1
% 0.10/0.26 % ...subsumed : 15
% 0.10/0.26 % ...remaining for further processing : 59
% 0.10/0.26 % Other redundant clauses eliminated : 30
% 0.10/0.26 % Clauses deleted for lack of memory : 0
% 0.10/0.26 % Backward-subsumed : 21
% 0.10/0.26 % Backward-rewritten : 13
% 0.10/0.26 % Generated clauses : 160
% 0.10/0.26 % ...of the previous two non-redundant : 99
% 0.10/0.26 % ...aggressively subsumed : 0
% 0.10/0.26 % Contextual simplify-reflections : 2
% 0.10/0.26 % Paramodulations : 98
% 0.10/0.26 % Factorizations : 8
% 0.10/0.26 % NegExts : 8
% 0.10/0.26 % Equation resolutions : 30
% 0.10/0.26 % Disequality decompositions : 0
% 0.10/0.26 % Total rewrite steps : 54
% 0.10/0.26 % ...of those cached : 52
% 0.10/0.26 % Propositional unsat checks : 0
% 0.10/0.26 % Propositional check models : 0
% 0.10/0.26 % Propositional check unsatisfiable : 0
% 0.10/0.26 % Propositional clauses : 0
% 0.10/0.26 % Propositional clauses after purity: 0
% 0.10/0.26 % Propositional unsat core size : 0
% 0.10/0.26 % Propositional preprocessing time : 0.000
% 0.10/0.26 % Propositional encoding time : 0.000
% 0.10/0.26 % Propositional solver time : 0.000
% 0.10/0.26 % Success case prop preproc time : 0.000
% 0.10/0.26 % Success case prop encoding time : 0.000
% 0.10/0.26 % Success case prop solver time : 0.000
% 0.10/0.26 % Current number of processed clauses : 14
% 0.10/0.26 % Positive orientable unit clauses : 3
% 0.10/0.26 % Positive unorientable unit clauses: 0
% 0.10/0.26 % Negative unit clauses : 1
% 0.10/0.26 % Non-unit-clauses : 10
% 0.10/0.26 % Current number of unprocessed clauses: 17
% 0.10/0.26 % ...number of literals in the above : 63
% 0.10/0.26 % Current number of archived formulas : 0
% 0.10/0.26 % Current number of archived clauses : 45
% 0.10/0.26 % Clause-clause subsumption calls (NU) : 139
% 0.10/0.26 % Rec. Clause-clause subsumption calls : 94
% 0.10/0.26 % Non-unit clause-clause subsumptions : 36
% 0.10/0.26 % Unit Clause-clause subsumption calls : 8
% 0.10/0.26 % Rewrite failures with RHS unbound : 0
% 0.10/0.26 % BW rewrite match attempts : 2
% 0.10/0.26 % BW rewrite match successes : 2
% 0.10/0.26 % Condensation attempts : 75
% 0.10/0.26 % Condensation successes : 3
% 0.10/0.26 % Termbank termtop insertions : 6345
% 0.10/0.26 % Search garbage collected termcells : 149
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.012 s
% 0.10/0.26 % System time : 0.005 s
% 0.10/0.26 % Total time : 0.017 s
% 0.10/0.26 % Maximum resident set size: 3628 pages
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.036 s
% 0.10/0.26 % System time : 0.015 s
% 0.10/0.26 % Total time : 0.051 s
% 0.10/0.26 % Maximum resident set size: 4608 pages
% 0.10/0.26 % E exiting
%------------------------------------------------------------------------------