%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT291+1 : TPTP v9.3.1. Released v3.4.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 : Thu Sep 24 01:04:43 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 143 ( 22 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 167 ( 61 ~; 49 |; 43 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 2 con; 0-4 aty)
% Number of variables : 31 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t28_lopclset,axiom,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> k4_xboole_0(k7_lopclset(X1),k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),X2)) = k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k7_lattices(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_lopclset) ).
fof(t37_lattice4,axiom,
! [X1] :
( ( l3_lattices(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> k7_lattices(X1,k5_lattices(X1)) = k6_lattices(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_lattice4) ).
fof(t37_lopclset,conjecture,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k6_lattices(X1)) = k7_lopclset(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_lopclset) ).
fof(t36_lopclset,axiom,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k5_lattices(X1)) = k1_xboole_0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t36_lopclset) ).
fof(t3_boole,axiom,
! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_boole) ).
fof(dt_k5_lattices,axiom,
! [X1] :
( ( l1_lattices(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k5_lattices(X1),u1_struct_0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_lattices) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( l3_lattices(X1)
=> ( l2_lattices(X1)
& l1_lattices(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l3_lattices) ).
fof(c_0_7,plain,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> k4_xboole_0(k7_lopclset(X1),k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),X2)) = k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k7_lattices(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[t28_lopclset]) ).
fof(c_0_8,plain,
! [X1] :
( ( l3_lattices(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> k7_lattices(X1,k5_lattices(X1)) = k6_lattices(X1) ),
inference(fof_simplification,[status(thm)],[t37_lattice4]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k6_lattices(X1)) = k7_lopclset(X1) ),
inference(assume_negation,[status(cth)],[t37_lopclset]) ).
fof(c_0_10,plain,
! [X32,X33] :
( k4_xboole_0(k7_lopclset(X32),k8_funct_2(u1_struct_0(X32),k1_zfmisc_1(k7_lopclset(X32)),k9_lopclset(X32),X33)) = k8_funct_2(u1_struct_0(X32),k1_zfmisc_1(k7_lopclset(X32)),k9_lopclset(X32),k7_lattices(X32,X33))
| ~ m1_subset_1(X33,u1_struct_0(X32))
| ~ l3_lattices(X32)
| v3_realset2(X32)
| ~ v17_lattices(X32)
| ~ v10_lattices(X32)
| v3_struct_0(X32) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_11,plain,
! [X13] :
( k7_lattices(X13,k5_lattices(X13)) = k6_lattices(X13)
| ~ l3_lattices(X13)
| ~ v17_lattices(X13)
| ~ v10_lattices(X13)
| v3_struct_0(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k5_lattices(X1)) = k1_xboole_0 ),
inference(fof_simplification,[status(thm)],[t36_lopclset]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k6_lattices(X1)) = k7_lopclset(X1) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1)
| k4_xboole_0(k7_lopclset(X1),k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),X2)) = k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k7_lattices(X1,X2))
| v3_realset2(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1)
| k7_lattices(X1,k5_lattices(X1)) = k6_lattices(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X35] :
( k8_funct_2(u1_struct_0(X35),k1_zfmisc_1(k7_lopclset(X35)),k9_lopclset(X35),k5_lattices(X35)) = k1_xboole_0
| ~ l3_lattices(X35)
| v3_realset2(X35)
| ~ v17_lattices(X35)
| ~ v10_lattices(X35)
| v3_struct_0(X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_17,plain,
! [X70] : k4_xboole_0(X70,k1_xboole_0) = X70,
inference(variable_rename,[status(thm)],[t3_boole]) ).
fof(c_0_18,negated_conjecture,
( k8_funct_2(u1_struct_0(esk1_0),k1_zfmisc_1(k7_lopclset(esk1_0)),k9_lopclset(esk1_0),k6_lattices(esk1_0)) != k7_lopclset(esk1_0)
& l3_lattices(esk1_0)
& ~ v3_realset2(esk1_0)
& v17_lattices(esk1_0)
& v10_lattices(esk1_0)
& ~ v3_struct_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_19,plain,
( ~ v10_lattices(X1)
| ~ v17_lattices(X1)
| ~ l3_lattices(X1)
| ~ m1_subset_1(k5_lattices(X1),u1_struct_0(X1))
| v3_struct_0(X1)
| v3_realset2(X1)
| k4_xboole_0(k7_lopclset(X1),k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k5_lattices(X1))) = k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k6_lattices(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1)
| k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k5_lattices(X1)) = k1_xboole_0
| v3_realset2(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X1] :
( ( l1_lattices(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k5_lattices(X1),u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k5_lattices]) ).
cnf(c_0_23,negated_conjecture,
k8_funct_2(u1_struct_0(esk1_0),k1_zfmisc_1(k7_lopclset(esk1_0)),k9_lopclset(esk1_0),k6_lattices(esk1_0)) != k7_lopclset(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( ~ v10_lattices(X1)
| ~ v17_lattices(X1)
| ~ l3_lattices(X1)
| ~ m1_subset_1(k5_lattices(X1),u1_struct_0(X1))
| v3_struct_0(X1)
| v3_realset2(X1)
| k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k6_lattices(X1)) = k7_lopclset(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
v17_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
~ v3_realset2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_30,plain,
! [X34] :
( m1_subset_1(k5_lattices(X34),u1_struct_0(X34))
| ~ l1_lattices(X34)
| v3_struct_0(X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
cnf(c_0_31,negated_conjecture,
~ m1_subset_1(k5_lattices(esk1_0),u1_struct_0(esk1_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]),c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
( ~ l1_lattices(X1)
| m1_subset_1(k5_lattices(X1),u1_struct_0(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_33,plain,
! [X28] :
( ( ~ l3_lattices(X28)
| l2_lattices(X28) )
& ( ~ l3_lattices(X28)
| l1_lattices(X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])])]) ).
cnf(c_0_34,negated_conjecture,
~ l1_lattices(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29]) ).
cnf(c_0_35,plain,
( ~ l3_lattices(X1)
| l1_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT291+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 23:29:01 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % new_bool_1 with pid 2849746 completed with status 0
% 0.11/0.45 % Result found by new_bool_1
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGUSM-FFMM31-MFFFFFNN
% 0.11/0.45 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.11/0.45 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 2849749 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGUSM-FFMM31-MFFFFFNN
% 0.11/0.45 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.11/0.45 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 101
% 0.11/0.45 % Removed by relevancy pruning/SinE : 51
% 0.11/0.45 % Initial clauses : 95
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 95
% 0.11/0.45 % Processed clauses : 232
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 50
% 0.11/0.45 % ...remaining for further processing : 182
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 1
% 0.11/0.45 % Backward-rewritten : 0
% 0.11/0.45 % Generated clauses : 214
% 0.11/0.45 % ...of the previous two non-redundant : 171
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 3
% 0.11/0.45 % Paramodulations : 214
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 54
% 0.11/0.45 % ...of those cached : 41
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 181
% 0.11/0.45 % Positive orientable unit clauses : 30
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 8
% 0.11/0.45 % Non-unit-clauses : 143
% 0.11/0.45 % Current number of unprocessed clauses: 34
% 0.11/0.45 % ...number of literals in the above : 289
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 1
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 10648
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 2632
% 0.11/0.45 % Non-unit clause-clause subsumptions : 54
% 0.11/0.45 % Unit Clause-clause subsumption calls : 114
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 0
% 0.11/0.45 % BW rewrite match successes : 0
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 10326
% 0.11/0.45 % Search garbage collected termcells : 1147
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.015 s
% 0.11/0.45 % System time : 0.001 s
% 0.11/0.45 % Total time : 0.016 s
% 0.11/0.45 % Maximum resident set size: 3996 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.020 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.023 s
% 0.11/0.45 % Maximum resident set size: 4608 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------