%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM144-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 : n006.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:25 PM UTC 2026
% Result : Unsatisfiable 16.96s 2.70s
% Output : CNFRefutation 16.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of clauses : 86 ( 34 unt; 20 nHn; 49 RR)
% Number of literals : 155 ( 49 equ; 66 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 : 136 ( 12 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(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(domain1,axiom,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',domain1) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
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(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(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
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_successor_of_proper_class_is_class_2,negated_conjecture,
successor(x) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_successor_of_proper_class_is_class_2) ).
cnf(successor,axiom,
union(X1,singleton(X1)) = successor(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',successor) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(prove_successor_of_proper_class_is_class_1,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_successor_of_proper_class_is_class_1) ).
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(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_18 ).
cnf(c_0_21,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_22,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_19 ).
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,universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_26,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_27,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
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(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_31,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_32,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_25 ).
cnf(c_0_33,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
c_0_26 ).
cnf(c_0_34,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_35,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_36,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_37,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_38,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_28 ).
cnf(c_0_39,plain,
subclass(complement(universal_class),X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_31 ).
cnf(c_0_41,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_42,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_33,c_0_34]),c_0_35]) ).
cnf(c_0_43,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
( ~ subclass(X1,complement(universal_class))
| X1 = complement(universal_class) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,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_42,c_0_43]) ).
cnf(c_0_47,plain,
intersection(complement(universal_class),X1) = complement(universal_class),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
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,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_51,plain,
~ member(X1,domain_of(complement(universal_class))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( member(regular(X1),X1)
| X1 = complement(universal_class) ),
inference(rw,[status(thm)],[c_0_27,c_0_43]) ).
cnf(c_0_53,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
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,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_50 ).
cnf(c_0_56,plain,
domain_of(complement(universal_class)) = complement(universal_class),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,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_40,c_0_53]) ).
cnf(c_0_58,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_54]),c_0_30]) ).
cnf(c_0_59,negated_conjecture,
successor(x) != x,
inference(fof_simplification,[status(thm)],[prove_successor_of_proper_class_is_class_2]) ).
cnf(c_0_60,axiom,
union(X1,singleton(X1)) = successor(X1),
successor ).
cnf(c_0_61,plain,
( regular(unordered_pair(X1,X2)) = X2
| regular(unordered_pair(X1,X2)) = X1
| unordered_pair(X1,X2) = complement(universal_class) ),
inference(spm,[status(thm)],[c_0_55,c_0_52]) ).
cnf(c_0_62,plain,
~ member(X1,complement(universal_class)),
inference(rw,[status(thm)],[c_0_51,c_0_56]) ).
cnf(c_0_63,plain,
( ~ member(not_subclass_element(X1,intersection(X2,universal_class)),X2)
| subclass(X1,intersection(X2,universal_class)) ),
inference(spm,[status(thm)],[c_0_57,c_0_30]) ).
cnf(c_0_64,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
successor(x) != x,
c_0_59 ).
cnf(c_0_66,plain,
union(X1,unordered_pair(X1,X1)) = successor(X1),
inference(rw,[status(thm)],[c_0_60,c_0_34]) ).
cnf(c_0_67,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_68,plain,
( member(regular(X1),universal_class)
| X1 = complement(universal_class) ),
inference(rw,[status(thm)],[c_0_37,c_0_43]) ).
cnf(c_0_69,plain,
( regular(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = complement(universal_class) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_61])]) ).
cnf(c_0_70,plain,
( ~ subclass(universal_class,X1)
| universal_class = X1 ),
inference(spm,[status(thm)],[c_0_38,c_0_21]) ).
cnf(c_0_71,plain,
subclass(X1,complement(complement(universal_class))),
inference(spm,[status(thm)],[c_0_62,c_0_58]) ).
cnf(c_0_72,plain,
subclass(X1,intersection(X1,universal_class)),
inference(spm,[status(thm)],[c_0_63,c_0_23]) ).
cnf(c_0_73,negated_conjecture,
~ member(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_successor_of_proper_class_is_class_1]) ).
cnf(c_0_74,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_64,c_0_23]) ).
cnf(c_0_75,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_29,c_0_54]),c_0_30]) ).
cnf(c_0_76,negated_conjecture,
complement(intersection(complement(x),complement(unordered_pair(x,x)))) != x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_77,plain,
( member(X1,universal_class)
| unordered_pair(X1,X1) = complement(universal_class) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_78,plain,
complement(complement(universal_class)) = universal_class,
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,plain,
intersection(X1,universal_class) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_72]),c_0_45])]) ).
cnf(c_0_80,negated_conjecture,
~ member(x,universal_class),
c_0_73 ).
cnf(c_0_81,plain,
( ~ subclass(complement(complement(X1)),X1)
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_38,c_0_74]) ).
cnf(c_0_82,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_40,c_0_75]) ).
cnf(c_0_83,negated_conjecture,
complement(complement(x)) != x,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_79]),c_0_80]) ).
cnf(c_0_84,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM144-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 : n006.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:07:42 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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
% 16.96/2.70 % Version: 3.5.1
% 16.96/2.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 16.96/2.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.96/2.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 16.96/2.70 % Starting new_bool_3 with 300s (1) cores
% 16.96/2.70 % Starting new_bool_1 with 300s (1) cores
% 16.96/2.70 % Starting sh5l with 300s (1) cores
% 16.96/2.70 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1783855 completed with status 0
% 16.96/2.70 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 16.96/2.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 16.96/2.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.96/2.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 16.96/2.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 16.96/2.70 % No SInE strategy applied
% 16.96/2.70 % Search class: FGHSM-FFLM31-DFFFFFNN
% 16.96/2.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 16.96/2.70 % Starting SubtermCWHack with 136s (1) cores
% 16.96/2.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 16.96/2.70 % Starting new_bool_3 with 311s (1) cores
% 16.96/2.70 % Starting new_bool_1 with 308s (1) cores
% 16.96/2.70 % Starting sh5l with 304s (1) cores
% 16.96/2.70 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1783863 completed with status 0
% 16.96/2.70 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 16.96/2.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 16.96/2.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.96/2.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 16.96/2.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 16.96/2.70 % No SInE strategy applied
% 16.96/2.70 % Search class: FGHSM-FFLM31-DFFFFFNN
% 16.96/2.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 16.96/2.70 % Starting SubtermCWHack with 136s (1) cores
% 16.96/2.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 16.96/2.70 % Preprocessing time : 0.006 s
% 16.96/2.70 % Presaturation interreduction done
% 16.96/2.70
% 16.96/2.70 % Proof found!
% 16.96/2.70 % SZS status Unsatisfiable
% 16.96/2.70 % SZS output start CNFRefutation
% See solution above
% 16.96/2.70 % Parsed axioms : 160
% 16.96/2.70 % Removed by relevancy pruning/SinE : 0
% 16.96/2.70 % Initial clauses : 160
% 16.96/2.70 % Removed in clause preprocessing : 19
% 16.96/2.70 % Initial clauses in saturation : 141
% 16.96/2.70 % Processed clauses : 7029
% 16.96/2.70 % ...of these trivial : 67
% 16.96/2.70 % ...subsumed : 4601
% 16.96/2.70 % ...remaining for further processing : 2361
% 16.96/2.70 % Other redundant clauses eliminated : 20
% 16.96/2.70 % Clauses deleted for lack of memory : 0
% 16.96/2.70 % Backward-subsumed : 189
% 16.96/2.70 % Backward-rewritten : 827
% 16.96/2.70 % Generated clauses : 30801
% 16.96/2.70 % ...of the previous two non-redundant : 28169
% 16.96/2.70 % ...aggressively subsumed : 0
% 16.96/2.70 % Contextual simplify-reflections : 49
% 16.96/2.70 % Paramodulations : 30767
% 16.96/2.70 % Factorizations : 14
% 16.96/2.70 % NegExts : 0
% 16.96/2.70 % Equation resolutions : 20
% 16.96/2.70 % Disequality decompositions : 0
% 16.96/2.70 % Total rewrite steps : 15967
% 16.96/2.70 % ...of those cached : 15092
% 16.96/2.70 % Propositional unsat checks : 0
% 16.96/2.70 % Propositional check models : 0
% 16.96/2.70 % Propositional check unsatisfiable : 0
% 16.96/2.70 % Propositional clauses : 0
% 16.96/2.70 % Propositional clauses after purity: 0
% 16.96/2.70 % Propositional unsat core size : 0
% 16.96/2.70 % Propositional preprocessing time : 0.000
% 16.96/2.70 % Propositional encoding time : 0.000
% 16.96/2.70 % Propositional solver time : 0.000
% 16.96/2.70 % Success case prop preproc time : 0.000
% 16.96/2.70 % Success case prop encoding time : 0.000
% 16.96/2.70 % Success case prop solver time : 0.000
% 16.96/2.70 % Current number of processed clauses : 1199
% 16.96/2.70 % Positive orientable unit clauses : 100
% 16.96/2.70 % Positive unorientable unit clauses: 4
% 16.96/2.70 % Negative unit clauses : 20
% 16.96/2.70 % Non-unit-clauses : 1075
% 16.96/2.70 % Current number of unprocessed clauses: 20731
% 16.96/2.70 % ...number of literals in the above : 75979
% 16.96/2.70 % Current number of archived formulas : 0
% 16.96/2.70 % Current number of archived clauses : 1175
% 16.96/2.70 % Clause-clause subsumption calls (NU) : 267852
% 16.96/2.70 % Rec. Clause-clause subsumption calls : 170946
% 16.96/2.70 % Non-unit clause-clause subsumptions : 3777
% 16.96/2.70 % Unit Clause-clause subsumption calls : 8289
% 16.96/2.70 % Rewrite failures with RHS unbound : 14
% 16.96/2.70 % BW rewrite match attempts : 299
% 16.96/2.70 % BW rewrite match successes : 140
% 16.96/2.70 % Condensation attempts : 0
% 16.96/2.70 % Condensation successes : 0
% 16.96/2.70 % Termbank termtop insertions : 1474309
% 16.96/2.70 % Search garbage collected termcells : 289
% 16.96/2.70
% 16.96/2.70 % -------------------------------------------------
% 16.96/2.70 % User time : 2.022 s
% 16.96/2.70 % System time : 0.052 s
% 16.96/2.70 % Total time : 2.074 s
% 16.96/2.70 % Maximum resident set size: 4036 pages
% 16.96/2.70
% 16.96/2.70 % -------------------------------------------------
% 16.96/2.70 % User time : 9.898 s
% 16.96/2.70 % System time : 0.342 s
% 16.96/2.70 % Total time : 10.240 s
% 16.96/2.70 % Maximum resident set size: 4608 pages
% 16.96/2.70 % E exiting
%------------------------------------------------------------------------------