%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET097-6 : 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 : n008.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:13:34 PM UTC 2026
% Result : Unsatisfiable 4.61s 1.08s
% Output : CNFRefutation 4.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of clauses : 71 ( 25 unt; 17 nHn; 54 RR)
% Number of literals : 134 ( 36 equ; 63 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 95 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_number_of_elements_in_class_1,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),intersection(complement(singleton(not_subclass_element(x,null_class))),x)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_number_of_elements_in_class_1) ).
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(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
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(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(prove_number_of_elements_in_class_3,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_number_of_elements_in_class_3) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(prove_number_of_elements_in_class_2,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_number_of_elements_in_class_2) ).
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(c_0_15,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),intersection(complement(singleton(not_subclass_element(x,null_class))),x)),
inference(fof_simplification,[status(thm)],[prove_number_of_elements_in_class_1]) ).
cnf(c_0_16,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_17,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),intersection(complement(singleton(not_subclass_element(x,null_class))),x)),
c_0_15 ).
cnf(c_0_18,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_20,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_16 ).
cnf(c_0_21,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_22,negated_conjecture,
~ member(not_subclass_element(intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x),null_class),intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_23,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_19 ).
cnf(c_0_25,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_26,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
subclass(intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x),null_class),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(X1,intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x))
| member(X1,null_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_31,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_33,negated_conjecture,
( member(regular(intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x)),null_class)
| intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x) = null_class ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_34,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_31]),c_0_26]) ).
cnf(c_0_35,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_32 ).
cnf(c_0_36,negated_conjecture,
intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x) = null_class,
inference(sr,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_38,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_39,negated_conjecture,
( ~ member(X1,x)
| ~ member(X1,complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34]) ).
cnf(c_0_40,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_37 ).
cnf(c_0_41,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_38 ).
cnf(c_0_42,negated_conjecture,
( ~ member(X1,x)
| member(X1,unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_26]) ).
cnf(c_0_43,negated_conjecture,
x != null_class,
inference(fof_simplification,[status(thm)],[prove_number_of_elements_in_class_3]) ).
cnf(c_0_44,negated_conjecture,
( ~ member(X1,x)
| X1 = not_subclass_element(x,null_class) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
x != null_class,
c_0_43 ).
cnf(c_0_46,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_47,negated_conjecture,
not_subclass_element(x,null_class) = regular(x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_25]),c_0_45]) ).
cnf(c_0_48,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_46 ).
cnf(c_0_49,negated_conjecture,
( ~ member(X1,x)
| X1 = regular(x) ),
inference(rw,[status(thm)],[c_0_44,c_0_47]) ).
cnf(c_0_50,plain,
( member(regular(intersection(X1,X2)),X1)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_48,c_0_25]) ).
cnf(c_0_51,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_52,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
inference(fof_simplification,[status(thm)],[prove_number_of_elements_in_class_2]) ).
cnf(c_0_53,negated_conjecture,
( intersection(x,X1) = null_class
| regular(intersection(x,X1)) = regular(x) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_51 ).
cnf(c_0_55,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
c_0_52 ).
cnf(c_0_56,negated_conjecture,
( member(regular(x),x)
| intersection(x,X1) = null_class ),
inference(spm,[status(thm)],[c_0_50,c_0_53]) ).
cnf(c_0_57,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_58,negated_conjecture,
( ~ member(not_subclass_element(X1,unordered_pair(regular(x),regular(x))),x)
| subclass(X1,unordered_pair(regular(x),regular(x))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_42]),c_0_47]),c_0_47]),c_0_47]),c_0_47]) ).
cnf(c_0_59,negated_conjecture,
unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)) != x,
inference(rw,[status(thm)],[c_0_55,c_0_18]) ).
cnf(c_0_60,plain,
( subclass(unordered_pair(X1,X2),X3)
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| not_subclass_element(unordered_pair(X1,X2),X3) = X1 ),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_61,negated_conjecture,
( ~ member(X1,X2)
| ~ member(X1,x)
| member(regular(x),x) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_56]),c_0_34]) ).
cnf(c_0_62,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_57 ).
cnf(c_0_63,negated_conjecture,
subclass(x,unordered_pair(regular(x),regular(x))),
inference(spm,[status(thm)],[c_0_58,c_0_23]) ).
cnf(c_0_64,negated_conjecture,
unordered_pair(regular(x),regular(x)) != x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_47]),c_0_47]) ).
cnf(c_0_65,plain,
( subclass(unordered_pair(X1,X1),X2)
| not_subclass_element(unordered_pair(X1,X1),X2) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_60])]) ).
cnf(c_0_66,negated_conjecture,
( ~ member(regular(x),X1)
| member(regular(x),x) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_25]),c_0_45]) ).
cnf(c_0_67,negated_conjecture,
~ subclass(unordered_pair(regular(x),regular(x)),x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_68,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
member(regular(x),x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_29]),c_0_45]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET097-6 : 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 : n008.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 04:53:24 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.45 Running first-order theorem proving
% 0.11/0.45 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
% 4.61/1.08 % Version: 3.5.1
% 4.61/1.08 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.61/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.61/1.08 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.61/1.08 % Starting new_bool_3 with 300s (1) cores
% 4.61/1.08 % Starting new_bool_1 with 300s (1) cores
% 4.61/1.08 % Starting sh5l with 300s (1) cores
% 4.61/1.08 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 185667 completed with status 0
% 4.61/1.08 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.61/1.08 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.61/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.61/1.08 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.61/1.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.61/1.08 % No SInE strategy applied
% 4.61/1.08 % Search class: FGHSM-FFLM31-DFFFFFNN
% 4.61/1.08 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.61/1.08 % Starting SubtermCWHack with 136s (1) cores
% 4.61/1.08 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.61/1.08 % Starting new_bool_3 with 311s (1) cores
% 4.61/1.08 % Starting new_bool_1 with 308s (1) cores
% 4.61/1.08 % Starting sh5l with 304s (1) cores
% 4.61/1.08 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 185675 completed with status 0
% 4.61/1.08 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.61/1.08 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.61/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.61/1.08 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.61/1.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.61/1.08 % No SInE strategy applied
% 4.61/1.08 % Search class: FGHSM-FFLM31-DFFFFFNN
% 4.61/1.08 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.61/1.08 % Starting SubtermCWHack with 136s (1) cores
% 4.61/1.08 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.61/1.08 % Preprocessing time : 0.002 s
% 4.61/1.08 % Presaturation interreduction done
% 4.61/1.08
% 4.61/1.08 % Proof found!
% 4.61/1.08 % SZS status Unsatisfiable
% 4.61/1.08 % SZS output start CNFRefutation
% See solution above
% 4.61/1.08 % Parsed axioms : 94
% 4.61/1.08 % Removed by relevancy pruning/SinE : 0
% 4.61/1.08 % Initial clauses : 94
% 4.61/1.08 % Removed in clause preprocessing : 15
% 4.61/1.08 % Initial clauses in saturation : 79
% 4.61/1.08 % Processed clauses : 5005
% 4.61/1.08 % ...of these trivial : 66
% 4.61/1.08 % ...subsumed : 3695
% 4.61/1.08 % ...remaining for further processing : 1244
% 4.61/1.08 % Other redundant clauses eliminated : 19
% 4.61/1.08 % Clauses deleted for lack of memory : 0
% 4.61/1.08 % Backward-subsumed : 75
% 4.61/1.08 % Backward-rewritten : 42
% 4.61/1.08 % Generated clauses : 30991
% 4.61/1.08 % ...of the previous two non-redundant : 21540
% 4.61/1.08 % ...aggressively subsumed : 0
% 4.61/1.08 % Contextual simplify-reflections : 18
% 4.61/1.08 % Paramodulations : 30946
% 4.61/1.08 % Factorizations : 24
% 4.61/1.08 % NegExts : 0
% 4.61/1.08 % Equation resolutions : 19
% 4.61/1.08 % Disequality decompositions : 0
% 4.61/1.08 % Total rewrite steps : 20351
% 4.61/1.08 % ...of those cached : 19786
% 4.61/1.08 % Propositional unsat checks : 0
% 4.61/1.08 % Propositional check models : 0
% 4.61/1.08 % Propositional check unsatisfiable : 0
% 4.61/1.08 % Propositional clauses : 0
% 4.61/1.08 % Propositional clauses after purity: 0
% 4.61/1.08 % Propositional unsat core size : 0
% 4.61/1.08 % Propositional preprocessing time : 0.000
% 4.61/1.08 % Propositional encoding time : 0.000
% 4.61/1.08 % Propositional solver time : 0.000
% 4.61/1.08 % Success case prop preproc time : 0.000
% 4.61/1.08 % Success case prop encoding time : 0.000
% 4.61/1.08 % Success case prop solver time : 0.000
% 4.61/1.08 % Current number of processed clauses : 1044
% 4.61/1.08 % Positive orientable unit clauses : 187
% 4.61/1.08 % Positive unorientable unit clauses: 1
% 4.61/1.08 % Negative unit clauses : 35
% 4.61/1.08 % Non-unit-clauses : 821
% 4.61/1.08 % Current number of unprocessed clauses: 16568
% 4.61/1.08 % ...number of literals in the above : 53602
% 4.61/1.08 % Current number of archived formulas : 0
% 4.61/1.08 % Current number of archived clauses : 212
% 4.61/1.08 % Clause-clause subsumption calls (NU) : 204369
% 4.61/1.08 % Rec. Clause-clause subsumption calls : 87547
% 4.61/1.08 % Non-unit clause-clause subsumptions : 2579
% 4.61/1.08 % Unit Clause-clause subsumption calls : 26763
% 4.61/1.08 % Rewrite failures with RHS unbound : 0
% 4.61/1.08 % BW rewrite match attempts : 1961
% 4.61/1.08 % BW rewrite match successes : 28
% 4.61/1.08 % Condensation attempts : 0
% 4.61/1.08 % Condensation successes : 0
% 4.61/1.08 % Termbank termtop insertions : 763523
% 4.61/1.08 % Search garbage collected termcells : 160
% 4.61/1.08
% 4.61/1.08 % -------------------------------------------------
% 4.61/1.08 % User time : 0.544 s
% 4.61/1.08 % System time : 0.024 s
% 4.61/1.08 % Total time : 0.568 s
% 4.61/1.08 % Maximum resident set size: 3720 pages
% 4.61/1.08
% 4.61/1.08 % -------------------------------------------------
% 4.61/1.08 % User time : 2.763 s
% 4.61/1.08 % System time : 0.131 s
% 4.61/1.08 % Total time : 2.894 s
% 4.61/1.08 % Maximum resident set size: 4864 pages
% 4.61/1.08 % E exiting
%------------------------------------------------------------------------------