%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM159-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:44:26 PM UTC 2026
% Result : Unsatisfiable 33.01s 5.84s
% Output : CNFRefutation 33.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of clauses : 75 ( 29 unt; 15 nHn; 41 RR)
% Number of literals : 133 ( 32 equ; 53 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 5 con; 0-3 aty)
% Number of variables : 130 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(image,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',image) ).
cnf(range_of,axiom,
domain_of(inverse(X1)) = range_of(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',range_of) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(kind_1_ordinals,axiom,
union(singleton(null_class),image(successor_relation,ordinal_numbers)) = kind_1_ordinals,
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',kind_1_ordinals) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',inverse) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(prove_corollary_to_kind_1_ordinal_1,negated_conjecture,
~ subclass(image(successor_relation,ordinal_numbers),kind_1_ordinals),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_kind_1_ordinal_1) ).
cnf(c_0_19,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_21,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_19 ).
cnf(c_0_22,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_23,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_20 ).
cnf(c_0_24,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_25,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_26,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_28,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_25 ).
cnf(c_0_30,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_31,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_27 ).
cnf(c_0_32,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_33,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_34,plain,
( subclass(complement(complement(X1)),X2)
| member(not_subclass_element(complement(complement(X1)),X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_35,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_30]) ).
cnf(c_0_36,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_32 ).
cnf(c_0_37,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_38,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_33 ).
cnf(c_0_39,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_31,c_0_34]) ).
cnf(c_0_40,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_41,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_42,plain,
( member(regular(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( ~ subclass(X1,complement(complement(X1)))
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_40,c_0_24]) ).
cnf(c_0_45,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_41 ).
cnf(c_0_46,plain,
( ~ member(regular(intersection(X1,complement(X2))),X2)
| intersection(X1,complement(X2)) = null_class ),
inference(spm,[status(thm)],[c_0_23,c_0_42]) ).
cnf(c_0_47,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_48,plain,
( member(regular(intersection(X1,X2)),X1)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_49,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
cnf(c_0_50,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_26,c_0_37]) ).
cnf(c_0_51,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_52,plain,
( ~ member(regular(intersection(X1,X2)),complement(X2))
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( member(regular(intersection(intersection(X1,X2),X3)),X2)
| intersection(intersection(X1,X2),X3) = null_class ),
inference(spm,[status(thm)],[c_0_36,c_0_48]) ).
cnf(c_0_54,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
image ).
cnf(c_0_56,axiom,
domain_of(inverse(X1)) = range_of(X1),
range_of ).
cnf(c_0_57,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_58,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_51 ).
cnf(c_0_59,plain,
intersection(intersection(X1,complement(X2)),X2) = null_class,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_54]),c_0_26]) ).
cnf(c_0_61,axiom,
union(singleton(null_class),image(successor_relation,ordinal_numbers)) = kind_1_ordinals,
kind_1_ordinals ).
cnf(c_0_62,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_63,plain,
domain_of(inverse(intersection(X1,cross_product(X2,universal_class)))) = image(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_64,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_65,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_66,plain,
( ~ member(X1,X3)
| ~ member(X1,intersection(X2,complement(X3))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_67,plain,
complement(intersection(complement(unordered_pair(null_class,null_class)),complement(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(ordinal_numbers,universal_class)),universal_class))))))) = kind_1_ordinals,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
~ subclass(image(successor_relation,ordinal_numbers),kind_1_ordinals),
inference(fof_simplification,[status(thm)],[prove_corollary_to_kind_1_ordinal_1]) ).
cnf(c_0_69,plain,
( ~ member(X1,complement(X3))
| ~ member(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_66,c_0_47]) ).
cnf(c_0_70,plain,
( subclass(X1,kind_1_ordinals)
| member(not_subclass_element(X1,kind_1_ordinals),intersection(complement(unordered_pair(null_class,null_class)),complement(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(ordinal_numbers,universal_class)),universal_class))))))) ),
inference(spm,[status(thm)],[c_0_35,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
~ subclass(image(successor_relation,ordinal_numbers),kind_1_ordinals),
c_0_68 ).
cnf(c_0_72,plain,
( ~ member(not_subclass_element(X1,kind_1_ordinals),domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(ordinal_numbers,universal_class)),universal_class)))))
| subclass(X1,kind_1_ordinals) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_47]) ).
cnf(c_0_73,negated_conjecture,
~ subclass(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(ordinal_numbers,universal_class)),universal_class)))),kind_1_ordinals),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_63]),c_0_64]) ).
cnf(c_0_74,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_24]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM159-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n002.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 : Mon Sep 21 02:11:32 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 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
% 33.01/5.84 % Version: 3.5.1
% 33.01/5.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 33.01/5.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.01/5.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 33.01/5.84 % Starting new_bool_3 with 300s (1) cores
% 33.01/5.84 % Starting new_bool_1 with 300s (1) cores
% 33.01/5.84 % Starting sh5l with 300s (1) cores
% 33.01/5.84 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2210845 completed with status 0
% 33.01/5.84 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 33.01/5.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 33.01/5.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.01/5.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 33.01/5.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 33.01/5.84 % No SInE strategy applied
% 33.01/5.84 % Search class: FGHSM-FFLM31-DFFFFFNN
% 33.01/5.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 33.01/5.84 % Starting SubtermCWHack with 136s (1) cores
% 33.01/5.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 33.01/5.84 % Starting new_bool_3 with 311s (1) cores
% 33.01/5.84 % Starting new_bool_1 with 308s (1) cores
% 33.01/5.84 % Starting sh5l with 304s (1) cores
% 33.01/5.84 % sh5l with pid 2210856 completed with status 0
% 33.01/5.84 % Result found by sh5l
% 33.01/5.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 33.01/5.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.01/5.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 33.01/5.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 33.01/5.84 % No SInE strategy applied
% 33.01/5.84 % Search class: FGHSM-FFLM31-DFFFFFNN
% 33.01/5.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 33.01/5.84 % Starting SubtermCWHack with 136s (1) cores
% 33.01/5.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 33.01/5.84 % Starting new_bool_3 with 311s (1) cores
% 33.01/5.84 % Starting new_bool_1 with 308s (1) cores
% 33.01/5.84 % Starting sh5l with 304s (1) cores
% 33.01/5.84 % Preprocessing time : 0.006 s
% 33.01/5.84 % Presaturation interreduction done
% 33.01/5.84
% 33.01/5.84 % Proof found!
% 33.01/5.84 % SZS status Unsatisfiable
% 33.01/5.84 % SZS output start CNFRefutation
% See solution above
% 33.01/5.85 % Parsed axioms : 159
% 33.01/5.85 % Removed by relevancy pruning/SinE : 0
% 33.01/5.85 % Initial clauses : 159
% 33.01/5.85 % Removed in clause preprocessing : 19
% 33.01/5.85 % Initial clauses in saturation : 140
% 33.01/5.85 % Processed clauses : 15482
% 33.01/5.85 % ...of these trivial : 43
% 33.01/5.85 % ...subsumed : 12587
% 33.01/5.85 % ...remaining for further processing : 2852
% 33.01/5.85 % Other redundant clauses eliminated : 22
% 33.01/5.85 % Clauses deleted for lack of memory : 0
% 33.01/5.85 % Backward-subsumed : 461
% 33.01/5.85 % Backward-rewritten : 124
% 33.01/5.85 % Generated clauses : 99749
% 33.01/5.85 % ...of the previous two non-redundant : 83219
% 33.01/5.85 % ...aggressively subsumed : 0
% 33.01/5.85 % Contextual simplify-reflections : 64
% 33.01/5.85 % Paramodulations : 99711
% 33.01/5.85 % Factorizations : 16
% 33.01/5.85 % NegExts : 0
% 33.01/5.85 % Equation resolutions : 22
% 33.01/5.85 % Disequality decompositions : 0
% 33.01/5.85 % Total rewrite steps : 49876
% 33.01/5.85 % ...of those cached : 47952
% 33.01/5.85 % Propositional unsat checks : 0
% 33.01/5.85 % Propositional check models : 0
% 33.01/5.85 % Propositional check unsatisfiable : 0
% 33.01/5.85 % Propositional clauses : 0
% 33.01/5.85 % Propositional clauses after purity: 0
% 33.01/5.85 % Propositional unsat core size : 0
% 33.01/5.85 % Propositional preprocessing time : 0.000
% 33.01/5.85 % Propositional encoding time : 0.000
% 33.01/5.85 % Propositional solver time : 0.000
% 33.01/5.85 % Success case prop preproc time : 0.000
% 33.01/5.85 % Success case prop encoding time : 0.000
% 33.01/5.85 % Success case prop solver time : 0.000
% 33.01/5.85 % Current number of processed clauses : 2122
% 33.01/5.85 % Positive orientable unit clauses : 270
% 33.01/5.85 % Positive unorientable unit clauses: 3
% 33.01/5.85 % Negative unit clauses : 12
% 33.01/5.85 % Non-unit-clauses : 1837
% 33.01/5.85 % Current number of unprocessed clauses: 67169
% 33.01/5.85 % ...number of literals in the above : 258384
% 33.01/5.85 % Current number of archived formulas : 0
% 33.01/5.85 % Current number of archived clauses : 743
% 33.01/5.85 % Clause-clause subsumption calls (NU) : 807146
% 33.01/5.85 % Rec. Clause-clause subsumption calls : 516682
% 33.01/5.85 % Non-unit clause-clause subsumptions : 10533
% 33.01/5.85 % Unit Clause-clause subsumption calls : 23396
% 33.01/5.85 % Rewrite failures with RHS unbound : 32
% 33.01/5.85 % BW rewrite match attempts : 942
% 33.01/5.85 % BW rewrite match successes : 78
% 33.01/5.85 % Condensation attempts : 15482
% 33.01/5.85 % Condensation successes : 468
% 33.01/5.85 % Termbank termtop insertions : 3809642
% 33.01/5.85 % Search garbage collected termcells : 287
% 33.01/5.85
% 33.01/5.85 % -------------------------------------------------
% 33.01/5.85 % User time : 5.128 s
% 33.01/5.85 % System time : 0.130 s
% 33.01/5.85 % Total time : 5.258 s
% 33.01/5.85 % Maximum resident set size: 3524 pages
% 33.01/5.85
% 33.01/5.85 % -------------------------------------------------
% 33.01/5.85 % User time : 22.868 s
% 33.01/5.85 % System time : 0.631 s
% 33.01/5.85 % Total time : 23.499 s
% 33.01/5.85 % Maximum resident set size: 4864 pages
% 33.01/5.85 % E exiting
%------------------------------------------------------------------------------