%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET126-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:41 PM UTC 2026
% Result : Unsatisfiable 2.22s 0.89s
% Output : CNFRefutation 2.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 81 ( 32 unt; 16 nHn; 46 RR)
% Number of literals : 143 ( 45 equ; 63 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 129 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(domain1,axiom,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',domain1) ).
cnf(regularity2,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(prove_set_builder_and_singleton_1,negated_conjecture,
set_builder(x,null_class) != singleton(x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_set_builder_and_singleton_1) ).
cnf(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_of_set_builder) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_17,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_18,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
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_17 ).
cnf(c_0_21,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_22,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_23,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_18 ).
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,X2)
| ~ member(X1,complement(X2)) ),
c_0_19 ).
cnf(c_0_26,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_27,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_29,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_22 ).
cnf(c_0_30,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_33,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_34,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_28 ).
cnf(c_0_35,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_37,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
c_0_33 ).
cnf(c_0_39,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_40,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_41,plain,
( ~ subclass(X1,intersection(X1,X2))
| intersection(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
( X1 = complement(universal_class)
| intersection(X1,regular(X1)) = complement(universal_class) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_43,plain,
( ~ member(X2,domain_of(X1))
| intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_44,plain,
( ~ subclass(X1,complement(universal_class))
| complement(universal_class) = X1 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( ~ member(X2,domain_of(X1))
| intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != complement(universal_class) ),
inference(rw,[status(thm)],[c_0_43,c_0_37]) ).
cnf(c_0_46,plain,
intersection(complement(universal_class),X1) = complement(universal_class),
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_47,plain,
~ member(X1,domain_of(complement(universal_class))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
( member(regular(X1),X1)
| X1 = complement(universal_class) ),
inference(rw,[status(thm)],[c_0_26,c_0_37]) ).
cnf(c_0_49,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_50,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_51,negated_conjecture,
set_builder(x,null_class) != singleton(x),
inference(fof_simplification,[status(thm)],[prove_set_builder_and_singleton_1]) ).
cnf(c_0_52,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_53,plain,
domain_of(complement(universal_class)) = complement(universal_class),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_49 ).
cnf(c_0_55,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_56,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_50 ).
cnf(c_0_57,negated_conjecture,
set_builder(x,null_class) != singleton(x),
c_0_51 ).
cnf(c_0_58,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_52,c_0_39]) ).
cnf(c_0_59,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_60,plain,
~ member(X1,complement(universal_class)),
inference(rw,[status(thm)],[c_0_47,c_0_53]) ).
cnf(c_0_61,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_54]),c_0_55]) ).
cnf(c_0_62,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X3)),X2)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| subclass(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_56]) ).
cnf(c_0_63,negated_conjecture,
complement(intersection(complement(unordered_pair(x,x)),complement(null_class))) != unordered_pair(x,x),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_39]),c_0_58]),c_0_59]) ).
cnf(c_0_64,plain,
( ~ subclass(universal_class,X1)
| universal_class = X1 ),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_65,plain,
subclass(X1,complement(complement(universal_class))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,plain,
( ~ member(not_subclass_element(X1,intersection(X2,universal_class)),X2)
| subclass(X1,intersection(X2,universal_class)) ),
inference(spm,[status(thm)],[c_0_62,c_0_55]) ).
cnf(c_0_67,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_25,c_0_61]) ).
cnf(c_0_68,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_69,negated_conjecture,
complement(intersection(complement(unordered_pair(x,x)),complement(complement(universal_class)))) != unordered_pair(x,x),
inference(spm,[status(thm)],[c_0_63,c_0_37]) ).
cnf(c_0_70,plain,
complement(complement(universal_class)) = universal_class,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,plain,
subclass(X1,intersection(X1,universal_class)),
inference(spm,[status(thm)],[c_0_66,c_0_24]) ).
cnf(c_0_72,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_67,c_0_24]) ).
cnf(c_0_73,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_68,c_0_54]),c_0_55]) ).
cnf(c_0_74,negated_conjecture,
complement(intersection(complement(unordered_pair(x,x)),universal_class)) != unordered_pair(x,x),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_75,plain,
intersection(X1,universal_class) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_71]),c_0_35])]) ).
cnf(c_0_76,plain,
( ~ subclass(complement(complement(X1)),X1)
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_34,c_0_72]) ).
cnf(c_0_77,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_29,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
complement(complement(unordered_pair(x,x))) != unordered_pair(x,x),
inference(rw,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET126-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n019.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 04:55:35 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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
% 2.22/0.89 % Version: 3.5.1
% 2.22/0.89 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.22/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/0.89 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.22/0.89 % Starting new_bool_3 with 300s (1) cores
% 2.22/0.89 % Starting new_bool_1 with 300s (1) cores
% 2.22/0.89 % Starting sh5l with 300s (1) cores
% 2.22/0.89 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1729757 completed with status 0
% 2.22/0.89 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.22/0.89 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.22/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/0.89 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.22/0.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.22/0.89 % No SInE strategy applied
% 2.22/0.89 % Search class: FGHSM-FFLM31-DFFFFFNN
% 2.22/0.89 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.22/0.89 % Starting SubtermCWHack with 136s (1) cores
% 2.22/0.89 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.22/0.89 % Starting new_bool_3 with 311s (1) cores
% 2.22/0.89 % Starting new_bool_1 with 308s (1) cores
% 2.22/0.89 % Starting sh5l with 304s (1) cores
% 2.22/0.89 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1729765 completed with status 0
% 2.22/0.89 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.22/0.89 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.22/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/0.89 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.22/0.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.22/0.89 % No SInE strategy applied
% 2.22/0.89 % Search class: FGHSM-FFLM31-DFFFFFNN
% 2.22/0.89 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.22/0.89 % Starting SubtermCWHack with 136s (1) cores
% 2.22/0.89 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.22/0.89 % Preprocessing time : 0.002 s
% 2.22/0.89 % Presaturation interreduction done
% 2.22/0.89
% 2.22/0.89 % Proof found!
% 2.22/0.89 % SZS status Unsatisfiable
% 2.22/0.89 % SZS output start CNFRefutation
% See solution above
% 2.22/0.89 % Parsed axioms : 93
% 2.22/0.89 % Removed by relevancy pruning/SinE : 0
% 2.22/0.89 % Initial clauses : 93
% 2.22/0.89 % Removed in clause preprocessing : 16
% 2.22/0.89 % Initial clauses in saturation : 77
% 2.22/0.89 % Processed clauses : 2475
% 2.22/0.89 % ...of these trivial : 75
% 2.22/0.89 % ...subsumed : 1614
% 2.22/0.89 % ...remaining for further processing : 786
% 2.22/0.89 % Other redundant clauses eliminated : 13
% 2.22/0.89 % Clauses deleted for lack of memory : 0
% 2.22/0.89 % Backward-subsumed : 23
% 2.22/0.89 % Backward-rewritten : 269
% 2.22/0.89 % Generated clauses : 9181
% 2.22/0.89 % ...of the previous two non-redundant : 7961
% 2.22/0.89 % ...aggressively subsumed : 0
% 2.22/0.89 % Contextual simplify-reflections : 11
% 2.22/0.89 % Paramodulations : 9158
% 2.22/0.89 % Factorizations : 10
% 2.22/0.89 % NegExts : 0
% 2.22/0.89 % Equation resolutions : 13
% 2.22/0.89 % Disequality decompositions : 0
% 2.22/0.89 % Total rewrite steps : 6359
% 2.22/0.89 % ...of those cached : 5976
% 2.22/0.89 % Propositional unsat checks : 0
% 2.22/0.89 % Propositional check models : 0
% 2.22/0.89 % Propositional check unsatisfiable : 0
% 2.22/0.89 % Propositional clauses : 0
% 2.22/0.89 % Propositional clauses after purity: 0
% 2.22/0.89 % Propositional unsat core size : 0
% 2.22/0.89 % Propositional preprocessing time : 0.000
% 2.22/0.89 % Propositional encoding time : 0.000
% 2.22/0.89 % Propositional solver time : 0.000
% 2.22/0.89 % Success case prop preproc time : 0.000
% 2.22/0.89 % Success case prop encoding time : 0.000
% 2.22/0.89 % Success case prop solver time : 0.000
% 2.22/0.89 % Current number of processed clauses : 415
% 2.22/0.89 % Positive orientable unit clauses : 53
% 2.22/0.89 % Positive unorientable unit clauses: 1
% 2.22/0.89 % Negative unit clauses : 11
% 2.22/0.89 % Non-unit-clauses : 350
% 2.22/0.89 % Current number of unprocessed clauses: 5430
% 2.22/0.89 % ...number of literals in the above : 19951
% 2.22/0.89 % Current number of archived formulas : 0
% 2.22/0.89 % Current number of archived clauses : 384
% 2.22/0.89 % Clause-clause subsumption calls (NU) : 36733
% 2.22/0.89 % Rec. Clause-clause subsumption calls : 22577
% 2.22/0.89 % Non-unit clause-clause subsumptions : 1160
% 2.22/0.89 % Unit Clause-clause subsumption calls : 1407
% 2.22/0.89 % Rewrite failures with RHS unbound : 0
% 2.22/0.89 % BW rewrite match attempts : 170
% 2.22/0.89 % BW rewrite match successes : 80
% 2.22/0.89 % Condensation attempts : 0
% 2.22/0.89 % Condensation successes : 0
% 2.22/0.89 % Termbank termtop insertions : 529637
% 2.22/0.89 % Search garbage collected termcells : 156
% 2.22/0.89
% 2.22/0.89 % -------------------------------------------------
% 2.22/0.89 % User time : 0.321 s
% 2.22/0.89 % System time : 0.010 s
% 2.22/0.89 % Total time : 0.331 s
% 2.22/0.89 % Maximum resident set size: 3720 pages
% 2.22/0.89
% 2.22/0.89 % -------------------------------------------------
% 2.22/0.89 % User time : 1.504 s
% 2.22/0.89 % System time : 0.083 s
% 2.22/0.89 % Total time : 1.587 s
% 2.22/0.89 % Maximum resident set size: 4864 pages
% 2.22/0.89 % E exiting
%------------------------------------------------------------------------------