%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV223^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:14 AM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 39 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 130 ( 47 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 251 ( 30 ~; 42 |; 37 &; 138 @)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 19 ^; 19 !; 37 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_23,type,
f: b > a ).
thf(decl_24,type,
w: ( b > $o ) > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(decl_26,type,
epred2_0: a > $o ).
thf(decl_27,type,
epred3_0: b > $o ).
thf(decl_28,type,
esk2_0: b ).
thf(decl_29,type,
epred4_0: b > $o ).
thf(decl_30,type,
esk3_1: a > b ).
thf(decl_31,type,
esk4_1: a > b ).
thf(decl_32,type,
esk5_1: a > b ).
thf(cX5204_pme,conjecture,
( ( ^ [X1: a] :
? [X2: b] :
( ? [X3: b > $o] :
( ( w @ X3 )
& ( X3 @ X2 ) )
& ( X1
= ( f @ X2 ) ) ) )
= ( ^ [X4: a] :
? [X5: a > $o] :
( ? [X6: b > $o] :
( ( w @ X6 )
& ( X5
= ( ^ [X1: a] :
? [X7: b] :
( ( X6 @ X7 )
& ( X1
= ( f @ X7 ) ) ) ) ) )
& ( X5 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VotCxydOS8/E---3.1_457071.p',cX5204_pme) ).
thf(c_0_1,negated_conjecture,
( ( ^ [X1: a] :
? [X2: b] :
( ? [X3: b > $o] :
( ( w @ X3 )
& ( X3 @ X2 ) )
& ( X1
= ( f @ X2 ) ) ) )
!= ( ^ [X4: a] :
? [X5: a > $o] :
( ? [X6: b > $o] :
( ( w @ X6 )
& ( X5
= ( ^ [X1: a] :
? [X7: b] :
( ( X6 @ X7 )
& ( X1
= ( f @ X7 ) ) ) ) ) )
& ( X5 @ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[cX5204_pme]) ).
thf(c_0_2,negated_conjecture,
( ( ^ [Z0: a] :
? [X2: b] :
( ? [X3: b > $o] :
( ( w @ X3 )
& ( X3 @ X2 ) )
& ( Z0
= ( f @ X2 ) ) ) )
!= ( ^ [Z0: a] :
? [X5: a > $o] :
( ? [X6: b > $o] :
( ( w @ X6 )
& ( X5
= ( ^ [Z1: a] :
? [X7: b] :
( ( X6 @ X7 )
& ( Z1
= ( f @ X7 ) ) ) ) ) )
& ( X5 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
( ( ^ [Z0: a] :
? [X2: b] :
( ? [X3: b > $o] :
( ( w @ X3 )
& ( X3 @ X2 ) )
& ( Z0
= ( f @ X2 ) ) ) )
!= ( ^ [Z0: a] :
? [X5: a > $o] :
( ? [X6: b > $o] :
( ( w @ X6 )
& ( X5
= ( ^ [Z1: a] :
? [X7: b] :
( ( X6 @ X7 )
& ( Z1
= ( f @ X7 ) ) ) ) ) )
& ( X5 @ Z0 ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( ^ [Z0: a] :
? [X44: b] :
( ? [X45: b > $o] :
( ( w @ X45 )
& ( X45 @ X44 ) )
& ( Z0
= ( f @ X44 ) ) ) )
!= ( ^ [Z0: a] :
? [X46: a > $o] :
( ? [X47: b > $o] :
( ( w @ X47 )
& ( X46
= ( ^ [Z1: a] :
? [X48: b] :
( ( X47 @ X48 )
& ( Z1
= ( f @ X48 ) ) ) ) ) )
& ( X46 @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ? [X49: a > $o] :
( ? [X50: b > $o] :
( ( w @ X50 )
& ( X49
= ( ^ [Z0: a] :
? [X51: b] :
( ( X50 @ X51 )
& ( Z0
= ( f @ X51 ) ) ) ) ) )
& ( X49 @ esk1_0 ) )
<~> ? [X52: b] :
( ? [X53: b > $o] :
( ( w @ X53 )
& ( X53 @ X52 ) )
& ( esk1_0
= ( f @ X52 ) ) ) ),
inference(neg_ext,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X6: b > $o,X3: b > $o,X2: b] :
( ( ( f @ X2 )
!= esk1_0 )
| ~ ? [X54: b] :
( ( X3 @ X54 )
& ( esk1_0
= ( f @ X54 ) ) )
| ~ ( w @ X3 )
| ~ ( w @ X6 )
| ~ ( X6 @ X2 ) ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5])]) ).
thf(c_0_7,negated_conjecture,
( ( ( ^ [Z0: a] :
? [X55: b] :
( ( epred3_0 @ X55 )
& ( Z0
= ( f @ X55 ) ) ) )
= epred2_0 )
| ( ( f @ esk2_0 )
= esk1_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: b > $o,X2: b] :
( ( ( f @ X2 )
!= esk1_0 )
| ~ ( w @ X3 )
| ~ ( X3 @ X2 ) ),
inference(condense,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]) ).
thf(c_0_9,negated_conjecture,
( ( ( f @ esk2_0 )
= esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
( ( ( ^ [Z0: a] :
? [X56: b] :
( ( epred3_0 @ X56 )
& ( Z0
= ( f @ X56 ) ) ) )
= epred2_0 )
| ( w @ epred4_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
( ( ( ^ [Z0: a] :
? [X57: b] :
( ( epred3_0 @ X57 )
& ( Z0
= ( f @ X57 ) ) ) )
= epred2_0 )
| ( epred4_0 @ esk2_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_12,negated_conjecture,
! [X21: a] :
( ( ? [X58: b] :
( ( epred3_0 @ X58 )
& ( X21
= ( f @ X58 ) ) )
<=> ( epred2_0 @ X21 ) )
| ( ( f @ esk2_0 )
= esk1_0 ) ),
inference(arg_cong,[status(thm)],[c_0_7]) ).
thf(c_0_13,negated_conjecture,
! [X3: b > $o] :
( ( epred2_0 @ esk1_0 )
| ~ ( w @ X3 )
| ~ ( X3 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_14,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( w @ epred4_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_15,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred4_0 @ esk2_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_16,negated_conjecture,
! [X27: a] :
( ( ? [X59: b] :
( ( epred3_0 @ X59 )
& ( X27
= ( f @ X59 ) ) )
<=> ( epred2_0 @ X27 ) )
| ( w @ epred4_0 ) ),
inference(arg_cong,[status(thm)],[c_0_10]) ).
thf(c_0_17,negated_conjecture,
! [X28: a] :
( ( ? [X60: b] :
( ( epred3_0 @ X60 )
& ( X28
= ( f @ X60 ) ) )
<=> ( epred2_0 @ X28 ) )
| ( epred4_0 @ esk2_0 ) ),
inference(arg_cong,[status(thm)],[c_0_11]) ).
thf(c_0_18,negated_conjecture,
! [X1: a] :
( ( ( f @ esk2_0 )
= esk1_0 )
| ( ( f @ ( esk3_1 @ X1 ) )
= X1 )
| ~ ( epred2_0 @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
epred2_0 @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_20,negated_conjecture,
! [X1: a] :
( ( ( f @ esk2_0 )
= esk1_0 )
| ( epred3_0 @ ( esk3_1 @ X1 ) )
| ~ ( epred2_0 @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_21,negated_conjecture,
! [X1: a] :
( ( ( f @ ( esk4_1 @ X1 ) )
= X1 )
| ( w @ epred4_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_16]) ).
thf(c_0_22,negated_conjecture,
! [X1: a] :
( ( ( f @ ( esk5_1 @ X1 ) )
= X1 )
| ( epred4_0 @ esk2_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_17]) ).
thf(c_0_23,negated_conjecture,
! [X3: b > $o] :
( ( ( f @ esk2_0 )
= esk1_0 )
| ~ ( X3 @ ( esk3_1 @ esk1_0 ) )
| ~ ( w @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18])]),c_0_19])]) ).
thf(c_0_24,negated_conjecture,
( ( ( f @ esk2_0 )
= esk1_0 )
| ( w @ epred3_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_25,negated_conjecture,
( ( ( f @ esk2_0 )
= esk1_0 )
| ( epred3_0 @ ( esk3_1 @ esk1_0 ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
thf(c_0_26,negated_conjecture,
! [X3: b > $o] :
( ( w @ epred4_0 )
| ~ ( X3 @ ( esk4_1 @ esk1_0 ) )
| ~ ( w @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_21])]),c_0_19])]) ).
thf(c_0_27,negated_conjecture,
( ( w @ epred3_0 )
| ( w @ epred4_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_28,negated_conjecture,
! [X3: b > $o] :
( ( epred4_0 @ esk2_0 )
| ~ ( X3 @ ( esk5_1 @ esk1_0 ) )
| ~ ( w @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_22])]),c_0_19])]) ).
thf(c_0_29,negated_conjecture,
( ( w @ epred3_0 )
| ( epred4_0 @ esk2_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_30,negated_conjecture,
( ( f @ esk2_0 )
= esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
thf(c_0_31,negated_conjecture,
! [X1: a] :
( ( epred3_0 @ ( esk4_1 @ X1 ) )
| ( w @ epred4_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_16]) ).
thf(c_0_32,negated_conjecture,
( ( w @ epred4_0 )
| ~ ( epred3_0 @ ( esk4_1 @ esk1_0 ) ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_33,negated_conjecture,
( ( epred4_0 @ esk2_0 )
| ~ ( epred3_0 @ ( esk5_1 @ esk1_0 ) ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_34,negated_conjecture,
! [X1: a] :
( ( epred3_0 @ ( esk5_1 @ X1 ) )
| ( epred4_0 @ esk2_0 )
| ~ ( epred2_0 @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_17]) ).
thf(c_0_35,negated_conjecture,
! [X3: b > $o] :
( ~ ( w @ X3 )
| ~ ( X3 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_30]) ).
thf(c_0_36,negated_conjecture,
w @ epred4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_32]) ).
thf(c_0_37,negated_conjecture,
epred4_0 @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_19])]) ).
thf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV223^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n017.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 15:18:52 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.VotCxydOS8/E---3.1_457071.p
% 0.08/0.26 % Version: 3.5.1-ho
% 0.08/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.08/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.26 % Starting sh5l with 300s (1) cores
% 0.08/0.26 % new_bool_9 with pid 457086 completed with status 0
% 0.08/0.26 % Result found by new_bool_9
% 0.08/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.08/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.08/0.26 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.08/0.26 % Search class: HUUPF-FFSF11-DSSFFFNN
% 0.08/0.26 % partial match(1): HUUPF-FFSF11-MSSFFFNN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % SubtermCWHack with pid 457092 completed with status 10
% 0.08/0.26 % Starting new_ho_10 with 181s (1) cores
% 0.08/0.26 % new_ho_10 with pid 457098 completed with status 0
% 0.08/0.26 % Result found by new_ho_10
% 0.08/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.08/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.08/0.26 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.08/0.26 % Search class: HUUPF-FFSF11-DSSFFFNN
% 0.08/0.26 % partial match(1): HUUPF-FFSF11-MSSFFFNN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % SubtermCWHack with pid 457092 completed with status 10
% 0.08/0.26 % Starting new_ho_10 with 181s (1) cores
% 0.08/0.26 % Preprocessing time : 0.001 s
% 0.08/0.26 % Presaturation interreduction done
% 0.08/0.26
% 0.08/0.26 % Proof found!
% 0.08/0.26 % SZS status Theorem
% 0.08/0.26 % SZS output start CNFRefutation
% See solution above
% 0.08/0.26 % Parsed axioms : 5
% 0.08/0.26 % Removed by relevancy pruning/SinE : 4
% 0.08/0.26 % Initial clauses : 1
% 0.08/0.26 % Removed in clause preprocessing : 0
% 0.08/0.26 % Initial clauses in saturation : 1
% 0.08/0.26 % Processed clauses : 43
% 0.08/0.26 % ...of these trivial : 1
% 0.08/0.26 % ...subsumed : 0
% 0.08/0.26 % ...remaining for further processing : 41
% 0.08/0.26 % Other redundant clauses eliminated : 7
% 0.08/0.26 % Clauses deleted for lack of memory : 0
% 0.08/0.26 % Backward-subsumed : 5
% 0.08/0.26 % Backward-rewritten : 22
% 0.08/0.26 % Generated clauses : 72
% 0.08/0.26 % ...of the previous two non-redundant : 57
% 0.08/0.26 % ...aggressively subsumed : 0
% 0.08/0.26 % Contextual simplify-reflections : 4
% 0.08/0.26 % Paramodulations : 41
% 0.08/0.26 % Factorizations : 0
% 0.08/0.26 % NegExts : 1
% 0.08/0.26 % Equation resolutions : 7
% 0.08/0.26 % Disequality decompositions : 0
% 0.08/0.26 % Total rewrite steps : 33
% 0.08/0.26 % ...of those cached : 29
% 0.08/0.26 % Propositional unsat checks : 0
% 0.08/0.26 % Propositional check models : 0
% 0.08/0.26 % Propositional check unsatisfiable : 0
% 0.08/0.26 % Propositional clauses : 0
% 0.08/0.26 % Propositional clauses after purity: 0
% 0.08/0.26 % Propositional unsat core size : 0
% 0.08/0.26 % Propositional preprocessing time : 0.000
% 0.08/0.26 % Propositional encoding time : 0.000
% 0.08/0.26 % Propositional solver time : 0.000
% 0.08/0.26 % Success case prop preproc time : 0.000
% 0.08/0.26 % Success case prop encoding time : 0.000
% 0.08/0.26 % Success case prop solver time : 0.000
% 0.08/0.26 % Current number of processed clauses : 8
% 0.08/0.26 % Positive orientable unit clauses : 4
% 0.08/0.26 % Positive unorientable unit clauses: 0
% 0.08/0.26 % Negative unit clauses : 1
% 0.08/0.26 % Non-unit-clauses : 3
% 0.08/0.26 % Current number of unprocessed clauses: 2
% 0.08/0.26 % ...number of literals in the above : 3
% 0.08/0.26 % Current number of archived formulas : 0
% 0.08/0.26 % Current number of archived clauses : 33
% 0.08/0.26 % Clause-clause subsumption calls (NU) : 71
% 0.08/0.26 % Rec. Clause-clause subsumption calls : 58
% 0.08/0.26 % Non-unit clause-clause subsumptions : 6
% 0.08/0.26 % Unit Clause-clause subsumption calls : 11
% 0.08/0.26 % Rewrite failures with RHS unbound : 0
% 0.08/0.26 % BW rewrite match attempts : 4
% 0.08/0.26 % BW rewrite match successes : 4
% 0.08/0.26 % Condensation attempts : 43
% 0.08/0.26 % Condensation successes : 1
% 0.08/0.26 % Termbank termtop insertions : 3034
% 0.08/0.26 % Search garbage collected termcells : 28
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.011 s
% 0.08/0.26 % System time : 0.001 s
% 0.08/0.26 % Total time : 0.012 s
% 0.08/0.26 % Maximum resident set size: 3892 pages
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.014 s
% 0.08/0.26 % System time : 0.004 s
% 0.08/0.26 % Total time : 0.018 s
% 0.08/0.26 % Maximum resident set size: 4864 pages
% 0.08/0.26 % E exiting
%------------------------------------------------------------------------------