%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM066-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 : n013.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:19 PM UTC 2026
% Result : Unsatisfiable 174.96s 23.10s
% Output : CNFRefutation 174.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of clauses : 71 ( 21 unt; 4 nHn; 56 RR)
% Number of literals : 164 ( 9 equ; 97 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 149 ( 15 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(well_ordering3,axiom,
( ~ member(X4,X3)
| ~ subclass(X3,X2)
| ~ well_ordering(X1,X2)
| member(least(X1,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',well_ordering3) ).
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_corollary_to_well_ordering_property1_2,negated_conjecture,
subclass(u,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_well_ordering_property1_2) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
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(well_ordering5,axiom,
( ~ member(ordered_pair(X4,least(X1,X3)),X1)
| ~ member(X4,X3)
| ~ subclass(X3,X2)
| ~ well_ordering(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',well_ordering5) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(element_relation3,axiom,
( ~ member(X1,X2)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| member(ordered_pair(X1,X2),element_relation) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',element_relation3) ).
cnf(prove_corollary_to_well_ordering_property1_1,negated_conjecture,
well_ordering(element_relation,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_well_ordering_property1_1) ).
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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(cartesian_product3,axiom,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product3) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(prove_corollary_to_well_ordering_property1_3,negated_conjecture,
member(v,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_well_ordering_property1_3) ).
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(prove_corollary_to_well_ordering_property1_4,negated_conjecture,
member(v,least(element_relation,u)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_well_ordering_property1_4) ).
cnf(c_0_18,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_19,plain,
( ~ member(X4,X3)
| ~ subclass(X3,X2)
| ~ well_ordering(X1,X2)
| member(least(X1,X3),X3) ),
inference(fof_simplification,[status(thm)],[well_ordering3]) ).
cnf(c_0_20,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_21,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
subclass(u,y),
prove_corollary_to_well_ordering_property1_2 ).
cnf(c_0_23,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_24,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_25,plain,
( ~ member(ordered_pair(X4,least(X1,X3)),X1)
| ~ member(X4,X3)
| ~ subclass(X3,X2)
| ~ well_ordering(X1,X2) ),
inference(fof_simplification,[status(thm)],[well_ordering5]) ).
cnf(c_0_26,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_27,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_28,plain,
( ~ member(X1,X2)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| member(ordered_pair(X1,X2),element_relation) ),
inference(fof_simplification,[status(thm)],[element_relation3]) ).
cnf(c_0_29,plain,
( ~ member(X4,X3)
| ~ subclass(X3,X2)
| ~ well_ordering(X1,X2)
| member(least(X1,X3),X3) ),
c_0_19 ).
cnf(c_0_30,negated_conjecture,
well_ordering(element_relation,y),
prove_corollary_to_well_ordering_property1_1 ).
cnf(c_0_31,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_20 ).
cnf(c_0_32,negated_conjecture,
( ~ member(X1,u)
| member(X1,y) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_33,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_23 ).
cnf(c_0_34,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_35,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_24 ).
cnf(c_0_36,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_37,plain,
( ~ member(ordered_pair(X4,least(X1,X3)),X1)
| ~ member(X4,X3)
| ~ subclass(X3,X2)
| ~ well_ordering(X1,X2) ),
c_0_25 ).
cnf(c_0_38,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_39,plain,
( ~ member(X1,X2)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| member(ordered_pair(X1,X2),element_relation) ),
c_0_28 ).
cnf(c_0_40,plain,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product3]) ).
cnf(c_0_41,negated_conjecture,
( ~ subclass(X1,y)
| ~ member(X2,X1)
| member(least(element_relation,X1),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(not_subclass_element(X1,y),u)
| subclass(X1,y) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_43,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,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_31,c_0_35]) ).
cnf(c_0_45,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_21,c_0_36]) ).
cnf(c_0_46,plain,
( ~ member(unordered_pair(unordered_pair(X4,X4),unordered_pair(X4,unordered_pair(least(X1,X3),least(X1,X3)))),X1)
| ~ well_ordering(X1,X2)
| ~ member(X4,X3)
| ~ subclass(X3,X2) ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,plain,
( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(universal_class,universal_class))
| ~ member(X1,X2)
| member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),element_relation) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_38]),c_0_38]) ).
cnf(c_0_48,plain,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
c_0_40 ).
cnf(c_0_49,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_50,negated_conjecture,
( ~ subclass(intersection(X1,X2),y)
| ~ member(X3,X1)
| ~ member(X3,X2)
| member(least(element_relation,intersection(X1,X2)),intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_35]) ).
cnf(c_0_51,negated_conjecture,
member(v,u),
prove_corollary_to_well_ordering_property1_3 ).
cnf(c_0_52,negated_conjecture,
subclass(intersection(X1,u),y),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_54,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_55,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_45,c_0_34]) ).
cnf(c_0_56,plain,
( ~ subclass(X3,X1)
| ~ member(X2,X3)
| ~ member(X2,least(element_relation,X3))
| ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(least(element_relation,X3),least(element_relation,X3)))),cross_product(universal_class,universal_class))
| ~ well_ordering(element_relation,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,plain,
( ~ member(X1,X2)
| ~ member(X3,X4)
| member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X3,X3))),cross_product(X2,X4)) ),
inference(rw,[status(thm)],[c_0_48,c_0_38]) ).
cnf(c_0_58,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_49 ).
cnf(c_0_59,negated_conjecture,
( ~ member(v,X1)
| member(least(element_relation,intersection(X1,u)),intersection(X1,u)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_60,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_53 ).
cnf(c_0_61,plain,
subclass(X1,intersection(universal_class,X1)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_31,c_0_43]) ).
cnf(c_0_63,plain,
( ~ subclass(X2,X1)
| ~ member(X3,X2)
| ~ member(X3,least(element_relation,X2))
| ~ member(least(element_relation,X2),universal_class)
| ~ well_ordering(element_relation,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_45]) ).
cnf(c_0_64,negated_conjecture,
( ~ member(v,X1)
| member(least(element_relation,intersection(X1,u)),X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,plain,
intersection(universal_class,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_66,negated_conjecture,
member(v,universal_class),
inference(spm,[status(thm)],[c_0_45,c_0_51]) ).
cnf(c_0_67,negated_conjecture,
( ~ subclass(u,X1)
| ~ member(X2,u)
| ~ member(X2,least(element_relation,u))
| ~ well_ordering(element_relation,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_65]),c_0_65]),c_0_66])]) ).
cnf(c_0_68,negated_conjecture,
member(v,least(element_relation,u)),
prove_corollary_to_well_ordering_property1_4 ).
cnf(c_0_69,negated_conjecture,
( ~ subclass(u,X1)
| ~ well_ordering(element_relation,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_51])]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_22]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM066-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n013.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 02:02:01 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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
% 174.96/23.10 % Version: 3.5.1
% 174.96/23.10 % Preprocessing class: FSLSSMSMSSSNFFN.
% 174.96/23.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 174.96/23.10 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 174.96/23.10 % Starting new_bool_3 with 300s (1) cores
% 174.96/23.10 % Starting new_bool_1 with 300s (1) cores
% 174.96/23.10 % Starting sh5l with 300s (1) cores
% 174.96/23.10 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3918639 completed with status 0
% 174.96/23.10 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 174.96/23.10 % Preprocessing class: FSLSSMSMSSSNFFN.
% 174.96/23.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 174.96/23.10 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 174.96/23.10 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 174.96/23.10 % No SInE strategy applied
% 174.96/23.10 % Search class: FGHSM-FFLM31-DFFFFFNN
% 174.96/23.10 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 174.96/23.10 % Starting SubtermCWHack with 136s (1) cores
% 174.96/23.10 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 174.96/23.10 % Starting new_bool_3 with 311s (1) cores
% 174.96/23.10 % Starting new_bool_1 with 308s (1) cores
% 174.96/23.10 % Starting sh5l with 304s (1) cores
% 174.96/23.10 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3918647 completed with status 0
% 174.96/23.10 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 174.96/23.10 % Preprocessing class: FSLSSMSMSSSNFFN.
% 174.96/23.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 174.96/23.10 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 174.96/23.10 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 174.96/23.10 % No SInE strategy applied
% 174.96/23.10 % Search class: FGHSM-FFLM31-DFFFFFNN
% 174.96/23.10 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 174.96/23.10 % Starting SubtermCWHack with 136s (1) cores
% 174.96/23.10 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 174.96/23.10 % Preprocessing time : 0.006 s
% 174.96/23.10 % Presaturation interreduction done
% 174.96/23.10
% 174.96/23.10 % Proof found!
% 174.96/23.10 % SZS status Unsatisfiable
% 174.96/23.10 % SZS output start CNFRefutation
% See solution above
% 174.96/23.11 % Parsed axioms : 162
% 174.96/23.11 % Removed by relevancy pruning/SinE : 0
% 174.96/23.11 % Initial clauses : 162
% 174.96/23.11 % Removed in clause preprocessing : 19
% 174.96/23.11 % Initial clauses in saturation : 143
% 174.96/23.11 % Processed clauses : 33608
% 174.96/23.11 % ...of these trivial : 118
% 174.96/23.11 % ...subsumed : 27389
% 174.96/23.11 % ...remaining for further processing : 6101
% 174.96/23.11 % Other redundant clauses eliminated : 22
% 174.96/23.11 % Clauses deleted for lack of memory : 0
% 174.96/23.11 % Backward-subsumed : 499
% 174.96/23.11 % Backward-rewritten : 370
% 174.96/23.11 % Generated clauses : 372250
% 174.96/23.11 % ...of the previous two non-redundant : 358785
% 174.96/23.11 % ...aggressively subsumed : 0
% 174.96/23.11 % Contextual simplify-reflections : 118
% 174.96/23.11 % Paramodulations : 372211
% 174.96/23.11 % Factorizations : 17
% 174.96/23.11 % NegExts : 0
% 174.96/23.11 % Equation resolutions : 22
% 174.96/23.11 % Disequality decompositions : 0
% 174.96/23.11 % Total rewrite steps : 91087
% 174.96/23.11 % ...of those cached : 88548
% 174.96/23.11 % Propositional unsat checks : 1
% 174.96/23.11 % Propositional check models : 0
% 174.96/23.11 % Propositional check unsatisfiable : 0
% 174.96/23.11 % Propositional clauses : 0
% 174.96/23.11 % Propositional clauses after purity: 0
% 174.96/23.11 % Propositional unsat core size : 0
% 174.96/23.11 % Propositional preprocessing time : 0.000
% 174.96/23.11 % Propositional encoding time : 0.462
% 174.96/23.11 % Propositional solver time : 0.337
% 174.96/23.11 % Success case prop preproc time : 0.000
% 174.96/23.11 % Success case prop encoding time : 0.000
% 174.96/23.11 % Success case prop solver time : 0.000
% 174.96/23.11 % Current number of processed clauses : 5084
% 174.96/23.11 % Positive orientable unit clauses : 245
% 174.96/23.11 % Positive unorientable unit clauses: 4
% 174.96/23.11 % Negative unit clauses : 13
% 174.96/23.11 % Non-unit-clauses : 4822
% 174.96/23.11 % Current number of unprocessed clauses: 323277
% 174.96/23.11 % ...number of literals in the above : 1441867
% 174.96/23.11 % Current number of archived formulas : 0
% 174.96/23.11 % Current number of archived clauses : 1030
% 174.96/23.11 % Clause-clause subsumption calls (NU) : 2436269
% 174.96/23.11 % Rec. Clause-clause subsumption calls : 1130549
% 174.96/23.11 % Non-unit clause-clause subsumptions : 22397
% 174.96/23.11 % Unit Clause-clause subsumption calls : 23561
% 174.96/23.11 % Rewrite failures with RHS unbound : 16
% 174.96/23.11 % BW rewrite match attempts : 1111
% 174.96/23.11 % BW rewrite match successes : 647
% 174.96/23.11 % Condensation attempts : 0
% 174.96/23.11 % Condensation successes : 0
% 174.96/23.11 % Termbank termtop insertions : 29137176
% 174.96/23.11 % Search garbage collected termcells : 285
% 174.96/23.11
% 174.96/23.11 % -------------------------------------------------
% 174.96/23.11 % User time : 21.130 s
% 174.96/23.11 % System time : 0.462 s
% 174.96/23.11 % Total time : 21.592 s
% 174.96/23.11 % Maximum resident set size: 3780 pages
% 174.96/23.11
% 174.96/23.11 % -------------------------------------------------
% 174.96/23.11 % User time : 105.170 s
% 174.96/23.11 % System time : 3.641 s
% 174.96/23.11 % Total time : 108.811 s
% 174.96/23.11 % Maximum resident set size: 4864 pages
% 174.96/23.11 % E exiting
%------------------------------------------------------------------------------