%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU325+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:24:43 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 20 unt; 0 def)
% Number of atoms : 129 ( 23 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 127 ( 54 ~; 35 |; 22 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 13 sgn 39 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( empty(X2)
& element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(t5_tops_2,conjecture,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ~ ( X2 = empty_set
& is_a_cover_of_carrier(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tops_2) ).
fof(redefinition_k5_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> union_of_subsets(X1,X2) = union(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_setfam_1) ).
fof(dt_k5_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(union_of_subsets(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_setfam_1) ).
fof(d8_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ( is_a_cover_of_carrier(X1,X2)
<=> cast_as_carrier_subset(X1) = union_of_subsets(the_carrier(X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_pre_topc) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( empty(X3)
& element(X2,powerset(X3))
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_subset) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(fc6_membered,axiom,
( v5_membered(empty_set)
& v4_membered(empty_set)
& v3_membered(empty_set)
& v2_membered(empty_set)
& v1_membered(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_membered) ).
fof(c_0_12,plain,
! [X80] :
( X80 = empty_set
| ~ empty(X80) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_13,plain,
! [X58] :
( empty(esk8_1(X58))
& element(esk8_1(X58),powerset(X58)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
cnf(c_0_14,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
empty(esk8_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ~ ( X2 = empty_set
& is_a_cover_of_carrier(X1,X2) ) ) ),
inference(assume_negation,[status(cth)],[t5_tops_2]) ).
fof(c_0_17,plain,
! [X63,X64] :
( union_of_subsets(X63,X64) = union(X64)
| ~ element(X64,powerset(powerset(X63))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])])]) ).
cnf(c_0_18,plain,
element(esk8_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
esk8_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ~ ( X2 = empty_set
& is_a_cover_of_carrier(X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X47,X48] :
( element(union_of_subsets(X47,X48),powerset(X47))
| ~ element(X48,powerset(powerset(X47))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_setfam_1])])]) ).
cnf(c_0_22,plain,
( ~ element(X1,powerset(powerset(X2)))
| union_of_subsets(X2,X1) = union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,plain,
! [X44,X45] :
( ( ~ one_sorted_str(X44)
| ~ element(X45,powerset(powerset(the_carrier(X44))))
| is_a_cover_of_carrier(X44,X45)
| cast_as_carrier_subset(X44) != union_of_subsets(the_carrier(X44),X45) )
& ( ~ one_sorted_str(X44)
| ~ element(X45,powerset(powerset(the_carrier(X44))))
| cast_as_carrier_subset(X44) = union_of_subsets(the_carrier(X44),X45)
| ~ is_a_cover_of_carrier(X44,X45) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_pre_topc])])])])]) ).
fof(c_0_25,negated_conjecture,
( esk12_0 = empty_set
& is_a_cover_of_carrier(esk11_0,esk12_0)
& element(esk12_0,powerset(powerset(the_carrier(esk11_0))))
& one_sorted_str(esk11_0)
& ~ empty_carrier(esk11_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
fof(c_0_26,plain,
! [X32] :
( cast_as_carrier_subset(X32) = the_carrier(X32)
| ~ one_sorted_str(X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
fof(c_0_27,plain,
! [X75,X76,X77] :
( ~ empty(X77)
| ~ element(X76,powerset(X77))
| ~ in(X75,X76) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
cnf(c_0_28,plain,
( ~ element(X1,powerset(powerset(X2)))
| element(union_of_subsets(X2,X1),powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
union_of_subsets(X1,empty_set) = union(empty_set),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( ~ one_sorted_str(X1)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| ~ is_a_cover_of_carrier(X1,X2)
| cast_as_carrier_subset(X1) = union_of_subsets(the_carrier(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
is_a_cover_of_carrier(esk11_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
esk12_0 = empty_set,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( ~ one_sorted_str(X1)
| cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,negated_conjecture,
one_sorted_str(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_35,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
cnf(c_0_36,plain,
( ~ empty(X3)
| ~ element(X2,powerset(X3))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
element(union(empty_set),powerset(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23])]) ).
cnf(c_0_38,plain,
( ~ one_sorted_str(X1)
| ~ is_a_cover_of_carrier(X1,empty_set)
| cast_as_carrier_subset(X1) = union(empty_set) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_29]) ).
cnf(c_0_39,negated_conjecture,
is_a_cover_of_carrier(esk11_0,empty_set),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
cast_as_carrier_subset(esk11_0) = the_carrier(esk11_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_41,plain,
! [X52] :
( ~ empty(the_carrier(X52))
| ~ one_sorted_str(X52)
| empty_carrier(X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])]) ).
cnf(c_0_42,plain,
( ~ in(X2,union(empty_set))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
union(empty_set) = the_carrier(esk11_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_34])]) ).
fof(c_0_44,plain,
! [X68,X69] :
( in(X68,X69)
| empty(X69)
| ~ element(X68,X69) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_45,negated_conjecture,
~ empty_carrier(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_46,plain,
( ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
( ~ in(X2,the_carrier(esk11_0))
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
~ empty(the_carrier(esk11_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_34])]) ).
fof(c_0_50,plain,
! [X50] : element(esk5_1(X50),X50),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_51,plain,
( ~ element(X2,the_carrier(esk11_0))
| ~ empty(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_52,plain,
element(esk5_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_53,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_54,plain,
~ empty(X1),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
$false,
inference(sr,[status(thm)],[c_0_53,c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU325+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n010.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 06:12:09 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.46 % Version: 3.5.1
% 0.10/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 185839 completed with status 0
% 0.10/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.10/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.10/0.46 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.46 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.10/0.46 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.10/0.46 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 0.10/0.46 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 185848 completed with status 0
% 0.10/0.46 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 0.10/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.10/0.46 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.46 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.10/0.46 % Preprocessing time : 0.002 s
% 0.10/0.46 % Presaturation interreduction done
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Theorem
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 49
% 0.10/0.46 % Removed by relevancy pruning/SinE : 0
% 0.10/0.46 % Initial clauses : 98
% 0.10/0.46 % Removed in clause preprocessing : 6
% 0.10/0.46 % Initial clauses in saturation : 92
% 0.10/0.46 % Processed clauses : 342
% 0.10/0.46 % ...of these trivial : 0
% 0.10/0.46 % ...subsumed : 33
% 0.10/0.46 % ...remaining for further processing : 309
% 0.10/0.46 % Other redundant clauses eliminated : 3
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 28
% 0.10/0.46 % Backward-rewritten : 16
% 0.10/0.46 % Generated clauses : 311
% 0.10/0.46 % ...of the previous two non-redundant : 294
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 0
% 0.10/0.46 % Paramodulations : 306
% 0.10/0.46 % Factorizations : 0
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 3
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 65
% 0.10/0.46 % ...of those cached : 32
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 168
% 0.10/0.46 % Positive orientable unit clauses : 44
% 0.10/0.46 % Positive unorientable unit clauses: 0
% 0.10/0.46 % Negative unit clauses : 34
% 0.10/0.46 % Non-unit-clauses : 90
% 0.10/0.46 % Current number of unprocessed clauses: 126
% 0.10/0.46 % ...number of literals in the above : 284
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 138
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 3057
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 2968
% 0.10/0.46 % Non-unit clause-clause subsumptions : 12
% 0.10/0.46 % Unit Clause-clause subsumption calls : 284
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 22
% 0.10/0.46 % BW rewrite match successes : 8
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 8997
% 0.10/0.46 % Search garbage collected termcells : 951
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.022 s
% 0.10/0.46 % System time : 0.007 s
% 0.10/0.46 % Total time : 0.029 s
% 0.10/0.46 % Maximum resident set size: 3680 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.100 s
% 0.10/0.46 % System time : 0.020 s
% 0.10/0.46 % Total time : 0.120 s
% 0.10/0.46 % Maximum resident set size: 4864 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------