%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET014-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 : 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 02:13:04 PM UTC 2026
% Result : Unsatisfiable 2.10s 0.92s
% Output : CNFRefutation 2.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of clauses : 82 ( 27 unt; 13 nHn; 58 RR)
% Number of literals : 150 ( 9 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 121 ( 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(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(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_least_upper_bound_2,negated_conjecture,
subclass(y,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_least_upper_bound_2) ).
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(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(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(prove_least_upper_bound_1,negated_conjecture,
subclass(x,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_least_upper_bound_1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_least_upper_bound_3,negated_conjecture,
~ subclass(union(x,y),z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_least_upper_bound_3) ).
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_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_15,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_16,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_17,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_14 ).
cnf(c_0_18,negated_conjecture,
subclass(y,z),
prove_least_upper_bound_2 ).
cnf(c_0_19,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_15 ).
cnf(c_0_20,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( ~ member(X1,y)
| member(X1,z) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_23,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_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( subclass(y,X1)
| member(not_subclass_element(y,X1),z) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(not_subclass_element(y,intersection(X1,z)),X1)
| subclass(y,intersection(X1,z)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_28,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
subclass(y,intersection(z,z)),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_30,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_31,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_32,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_33,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X1,y)
| member(X1,intersection(z,z)) ),
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_35,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_30 ).
cnf(c_0_36,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_37,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
( ~ member(not_subclass_element(complement(intersection(z,z)),X1),y)
| subclass(complement(intersection(z,z)),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_41,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_42,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_22]) ).
cnf(c_0_43,negated_conjecture,
subclass(x,z),
prove_least_upper_bound_1 ).
cnf(c_0_44,negated_conjecture,
subclass(complement(intersection(z,z)),complement(y)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_40 ).
cnf(c_0_46,plain,
subclass(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_41,c_0_22]) ).
cnf(c_0_47,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( ~ member(X1,x)
| member(X1,z) ),
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( ~ member(X1,complement(intersection(z,z)))
| member(X1,complement(y)) ),
inference(spm,[status(thm)],[c_0_17,c_0_44]) ).
cnf(c_0_50,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_51,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_52,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_39]) ).
cnf(c_0_53,negated_conjecture,
( subclass(x,X1)
| member(not_subclass_element(x,X1),z) ),
inference(spm,[status(thm)],[c_0_48,c_0_22]) ).
cnf(c_0_54,negated_conjecture,
( ~ member(X1,complement(z))
| member(X1,complement(y)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_51 ).
cnf(c_0_56,negated_conjecture,
subclass(x,complement(complement(z))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( ~ member(not_subclass_element(X1,intersection(complement(y),X1)),complement(z))
| subclass(X1,intersection(complement(y),X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_54]) ).
cnf(c_0_58,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_22]) ).
cnf(c_0_59,negated_conjecture,
( ~ member(X1,x)
| member(X1,complement(complement(z))) ),
inference(spm,[status(thm)],[c_0_17,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
subclass(complement(z),intersection(complement(y),complement(z))),
inference(spm,[status(thm)],[c_0_57,c_0_22]) ).
cnf(c_0_61,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( ~ member(X1,x)
| ~ member(X1,complement(z)) ),
inference(spm,[status(thm)],[c_0_28,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
intersection(complement(y),complement(z)) = complement(z),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_60]),c_0_61])]) ).
cnf(c_0_64,negated_conjecture,
( ~ member(not_subclass_element(complement(z),X1),x)
| subclass(complement(z),X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_22]) ).
cnf(c_0_65,negated_conjecture,
( subclass(complement(z),X1)
| member(not_subclass_element(complement(z),X1),complement(y)) ),
inference(spm,[status(thm)],[c_0_42,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
subclass(complement(z),complement(x)),
inference(spm,[status(thm)],[c_0_64,c_0_39]) ).
cnf(c_0_67,negated_conjecture,
( ~ member(not_subclass_element(complement(z),intersection(X1,complement(y))),X1)
| subclass(complement(z),intersection(X1,complement(y))) ),
inference(spm,[status(thm)],[c_0_23,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( ~ member(X1,complement(z))
| member(X1,complement(x)) ),
inference(spm,[status(thm)],[c_0_17,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
subclass(complement(z),intersection(complement(x),complement(y))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_22]) ).
cnf(c_0_70,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_52,c_0_22]) ).
cnf(c_0_71,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_33,c_0_35]),c_0_36]) ).
cnf(c_0_72,negated_conjecture,
~ subclass(union(x,y),z),
inference(fof_simplification,[status(thm)],[prove_least_upper_bound_3]) ).
cnf(c_0_73,negated_conjecture,
( ~ member(X1,complement(z))
| member(X1,intersection(complement(x),complement(y))) ),
inference(spm,[status(thm)],[c_0_17,c_0_69]) ).
cnf(c_0_74,plain,
( ~ subclass(complement(complement(X1)),X1)
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_45,c_0_70]) ).
cnf(c_0_75,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_19,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
~ subclass(union(x,y),z),
c_0_72 ).
cnf(c_0_77,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_78,negated_conjecture,
( ~ member(not_subclass_element(complement(intersection(complement(x),complement(y))),X1),complement(z))
| subclass(complement(intersection(complement(x),complement(y))),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_73]) ).
cnf(c_0_79,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_80,negated_conjecture,
~ subclass(complement(intersection(complement(x),complement(y))),z),
inference(rw,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_39]),c_0_79]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET014-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n002.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 04:44:46 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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.10/0.92 % Version: 3.5.1
% 2.10/0.92 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.10/0.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.10/0.92 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.10/0.92 % Starting new_bool_3 with 300s (1) cores
% 2.10/0.92 % Starting new_bool_1 with 300s (1) cores
% 2.10/0.92 % Starting sh5l with 300s (1) cores
% 2.10/0.92 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2451505 completed with status 0
% 2.10/0.92 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.10/0.92 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.10/0.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.10/0.92 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.10/0.92 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.10/0.92 % No SInE strategy applied
% 2.10/0.92 % Search class: FGHSM-FFLM31-DFFFFFNN
% 2.10/0.92 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.10/0.92 % Starting SubtermCWHack with 136s (1) cores
% 2.10/0.92 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.10/0.92 % Starting new_bool_3 with 311s (1) cores
% 2.10/0.92 % Starting new_bool_1 with 308s (1) cores
% 2.10/0.92 % Starting sh5l with 304s (1) cores
% 2.10/0.92 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2451513 completed with status 0
% 2.10/0.92 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.10/0.92 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.10/0.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.10/0.92 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.10/0.92 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.10/0.92 % No SInE strategy applied
% 2.10/0.92 % Search class: FGHSM-FFLM31-DFFFFFNN
% 2.10/0.92 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.10/0.92 % Starting SubtermCWHack with 136s (1) cores
% 2.10/0.92 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.10/0.92 % Preprocessing time : 0.005 s
% 2.10/0.92 % Presaturation interreduction done
% 2.10/0.92
% 2.10/0.92 % Proof found!
% 2.10/0.92 % SZS status Unsatisfiable
% 2.10/0.92 % SZS output start CNFRefutation
% See solution above
% 2.10/0.92 % Parsed axioms : 115
% 2.10/0.92 % Removed by relevancy pruning/SinE : 0
% 2.10/0.92 % Initial clauses : 115
% 2.10/0.92 % Removed in clause preprocessing : 17
% 2.10/0.92 % Initial clauses in saturation : 98
% 2.10/0.92 % Processed clauses : 1807
% 2.10/0.92 % ...of these trivial : 9
% 2.10/0.92 % ...subsumed : 955
% 2.10/0.92 % ...remaining for further processing : 843
% 2.10/0.92 % Other redundant clauses eliminated : 8
% 2.10/0.92 % Clauses deleted for lack of memory : 0
% 2.10/0.92 % Backward-subsumed : 33
% 2.10/0.92 % Backward-rewritten : 149
% 2.10/0.92 % Generated clauses : 4723
% 2.10/0.92 % ...of the previous two non-redundant : 4212
% 2.10/0.92 % ...aggressively subsumed : 0
% 2.10/0.92 % Contextual simplify-reflections : 14
% 2.10/0.92 % Paramodulations : 4711
% 2.10/0.92 % Factorizations : 4
% 2.10/0.92 % NegExts : 0
% 2.10/0.92 % Equation resolutions : 8
% 2.10/0.92 % Disequality decompositions : 0
% 2.10/0.92 % Total rewrite steps : 1255
% 2.10/0.92 % ...of those cached : 1028
% 2.10/0.92 % Propositional unsat checks : 0
% 2.10/0.92 % Propositional check models : 0
% 2.10/0.92 % Propositional check unsatisfiable : 0
% 2.10/0.92 % Propositional clauses : 0
% 2.10/0.92 % Propositional clauses after purity: 0
% 2.10/0.92 % Propositional unsat core size : 0
% 2.10/0.92 % Propositional preprocessing time : 0.000
% 2.10/0.92 % Propositional encoding time : 0.000
% 2.10/0.92 % Propositional solver time : 0.000
% 2.10/0.92 % Success case prop preproc time : 0.000
% 2.10/0.92 % Success case prop encoding time : 0.000
% 2.10/0.92 % Success case prop solver time : 0.000
% 2.10/0.92 % Current number of processed clauses : 560
% 2.10/0.92 % Positive orientable unit clauses : 89
% 2.10/0.92 % Positive unorientable unit clauses: 1
% 2.10/0.92 % Negative unit clauses : 3
% 2.10/0.92 % Non-unit-clauses : 467
% 2.10/0.92 % Current number of unprocessed clauses: 2353
% 2.10/0.92 % ...number of literals in the above : 7339
% 2.10/0.92 % Current number of archived formulas : 0
% 2.10/0.92 % Current number of archived clauses : 296
% 2.10/0.92 % Clause-clause subsumption calls (NU) : 47214
% 2.10/0.92 % Rec. Clause-clause subsumption calls : 31708
% 2.10/0.92 % Non-unit clause-clause subsumptions : 877
% 2.10/0.92 % Unit Clause-clause subsumption calls : 2755
% 2.10/0.92 % Rewrite failures with RHS unbound : 0
% 2.10/0.92 % BW rewrite match attempts : 150
% 2.10/0.92 % BW rewrite match successes : 44
% 2.10/0.92 % Condensation attempts : 0
% 2.10/0.92 % Condensation successes : 0
% 2.10/0.92 % Termbank termtop insertions : 183051
% 2.10/0.92 % Search garbage collected termcells : 185
% 2.10/0.92
% 2.10/0.92 % -------------------------------------------------
% 2.10/0.92 % User time : 0.325 s
% 2.10/0.92 % System time : 0.017 s
% 2.10/0.92 % Total time : 0.342 s
% 2.10/0.92 % Maximum resident set size: 3744 pages
% 2.10/0.92
% 2.10/0.92 % -------------------------------------------------
% 2.10/0.92 % User time : 1.669 s
% 2.10/0.92 % System time : 0.094 s
% 2.10/0.92 % Total time : 1.763 s
% 2.10/0.92 % Maximum resident set size: 4608 pages
% 2.10/0.92 % E exiting
%------------------------------------------------------------------------------