%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET098-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 : 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 02:13:34 PM UTC 2026
% Result : Unsatisfiable 3.06s 0.83s
% Output : CNFRefutation 3.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of clauses : 90 ( 32 unt; 23 nHn; 61 RR)
% Number of literals : 169 ( 51 equ; 73 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 1 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 : 123 ( 9 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(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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_1,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_number_of_elements_in_class_1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
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(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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
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(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_3,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_number_of_elements_in_class_3) ).
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(regularity2,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_2,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_number_of_elements_in_class_2) ).
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,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_18,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_16 ).
cnf(c_0_19,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_17 ).
cnf(c_0_21,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_22,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_number_of_elements_in_class_1]) ).
cnf(c_0_24,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_25,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
c_0_23 ).
cnf(c_0_28,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_29,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_24 ).
cnf(c_0_30,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_31,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_33,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),x),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_22]) ).
cnf(c_0_36,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_37,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_32 ).
cnf(c_0_38,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_33,c_0_34]) ).
cnf(c_0_39,plain,
subclass(null_class,X1),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_40,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_36 ).
cnf(c_0_41,negated_conjecture,
intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_42,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_43,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_44,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_40,c_0_41]),c_0_35]) ).
cnf(c_0_45,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_42 ).
cnf(c_0_46,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_43 ).
cnf(c_0_47,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_44,c_0_45]),c_0_22]) ).
cnf(c_0_48,negated_conjecture,
x != null_class,
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_number_of_elements_in_class_3]) ).
cnf(c_0_49,negated_conjecture,
( ~ member(X1,x)
| X1 = not_subclass_element(x,null_class) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
x != null_class,
c_0_48 ).
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,
not_subclass_element(x,null_class) = regular(x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_21]),c_0_50]) ).
cnf(c_0_53,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_51 ).
cnf(c_0_54,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_55,negated_conjecture,
( ~ member(X1,x)
| X1 = regular(x) ),
inference(rw,[status(thm)],[c_0_49,c_0_52]) ).
cnf(c_0_56,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_57,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_58,plain,
( unordered_pair(X1,X2) = null_class
| regular(unordered_pair(X1,X2)) = X2
| regular(unordered_pair(X1,X2)) = X1 ),
inference(spm,[status(thm)],[c_0_46,c_0_21]) ).
cnf(c_0_59,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_45]),c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( subclass(x,X1)
| not_subclass_element(x,X1) = regular(x) ),
inference(spm,[status(thm)],[c_0_55,c_0_30]) ).
cnf(c_0_61,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_56,c_0_45]),c_0_54]) ).
cnf(c_0_62,plain,
( ~ member(X2,X1)
| ~ member(X2,regular(X1))
| X1 = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_57]),c_0_35]) ).
cnf(c_0_63,plain,
( unordered_pair(X1,X1) = null_class
| regular(unordered_pair(X1,X1)) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_58])]) ).
cnf(c_0_64,negated_conjecture,
( subclass(x,complement(X1))
| member(regular(x),X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_53,c_0_61]) ).
cnf(c_0_66,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_20,c_0_59]) ).
cnf(c_0_67,plain,
( ~ member(X2,X1)
| ~ member(X2,unordered_pair(X1,X1))
| unordered_pair(X1,X1) = null_class ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_53,c_0_34]) ).
cnf(c_0_69,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_number_of_elements_in_class_2]) ).
cnf(c_0_70,negated_conjecture,
( ~ member(regular(x),X1)
| subclass(x,complement(complement(X1))) ),
inference(spm,[status(thm)],[c_0_20,c_0_64]) ).
cnf(c_0_71,plain,
( ~ subclass(X1,complement(complement(X1)))
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_37,c_0_65]) ).
cnf(c_0_72,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_66,c_0_30]) ).
cnf(c_0_73,plain,
( ~ member(regular(unordered_pair(X1,X1)),X1)
| unordered_pair(X1,X1) = null_class ),
inference(spm,[status(thm)],[c_0_67,c_0_21]) ).
cnf(c_0_74,plain,
( ~ subclass(X2,intersection(X1,X2))
| intersection(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_37,c_0_68]) ).
cnf(c_0_75,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
c_0_69 ).
cnf(c_0_76,negated_conjecture,
( ~ subclass(complement(complement(X1)),x)
| ~ member(regular(x),X1)
| complement(complement(X1)) = x ),
inference(spm,[status(thm)],[c_0_37,c_0_70]) ).
cnf(c_0_77,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]) ).
cnf(c_0_78,plain,
null_class = unordered_pair(universal_class,universal_class),
inference(spm,[status(thm)],[c_0_73,c_0_26]) ).
cnf(c_0_79,negated_conjecture,
~ subclass(x,null_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_41]),c_0_50]) ).
cnf(c_0_80,negated_conjecture,
unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)) != x,
inference(rw,[status(thm)],[c_0_75,c_0_28]) ).
cnf(c_0_81,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_46,c_0_30]) ).
cnf(c_0_82,negated_conjecture,
( ~ subclass(X1,x)
| ~ member(regular(x),X1)
| X1 = x ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_77]) ).
cnf(c_0_83,negated_conjecture,
not_subclass_element(x,unordered_pair(universal_class,universal_class)) = regular(x),
inference(rw,[status(thm)],[c_0_52,c_0_78]) ).
cnf(c_0_84,negated_conjecture,
member(regular(x),x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_52]),c_0_79]) ).
cnf(c_0_85,negated_conjecture,
unordered_pair(regular(x),regular(x)) != x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_52]),c_0_52]) ).
cnf(c_0_86,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_81])]) ).
cnf(c_0_87,negated_conjecture,
~ subclass(unordered_pair(regular(x),regular(x)),x),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_47]),c_0_78]),c_0_83]),c_0_78]),c_0_83]),c_0_78]),c_0_83]),c_0_78]),c_0_83]),c_0_84])]),c_0_85]) ).
cnf(c_0_88,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_86]) ).
cnf(c_0_89,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET098-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 04:52:05 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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
% 3.06/0.83 % Version: 3.5.1
% 3.06/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.06/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.06/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.06/0.83 % Starting new_bool_3 with 300s (1) cores
% 3.06/0.83 % Starting new_bool_1 with 300s (1) cores
% 3.06/0.83 % Starting sh5l with 300s (1) cores
% 3.06/0.83 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4173948 completed with status 0
% 3.06/0.83 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.06/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.06/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.06/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.06/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.06/0.83 % No SInE strategy applied
% 3.06/0.83 % Search class: FGHSM-FFLM31-DFFFFFNN
% 3.06/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.06/0.83 % Starting SubtermCWHack with 136s (1) cores
% 3.06/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.06/0.83 % Starting new_bool_3 with 311s (1) cores
% 3.06/0.83 % Starting new_bool_1 with 308s (1) cores
% 3.06/0.83 % Starting sh5l with 304s (1) cores
% 3.06/0.83 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4173956 completed with status 0
% 3.06/0.83 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.06/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.06/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.06/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.06/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.06/0.83 % No SInE strategy applied
% 3.06/0.83 % Search class: FGHSM-FFLM31-DFFFFFNN
% 3.06/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.06/0.83 % Starting SubtermCWHack with 136s (1) cores
% 3.06/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.06/0.83 % Preprocessing time : 0.003 s
% 3.06/0.83 % Presaturation interreduction done
% 3.06/0.83
% 3.06/0.83 % Proof found!
% 3.06/0.83 % SZS status Unsatisfiable
% 3.06/0.83 % SZS output start CNFRefutation
% See solution above
% 3.06/0.83 % Parsed axioms : 94
% 3.06/0.83 % Removed by relevancy pruning/SinE : 0
% 3.06/0.83 % Initial clauses : 94
% 3.06/0.83 % Removed in clause preprocessing : 15
% 3.06/0.83 % Initial clauses in saturation : 79
% 3.06/0.83 % Processed clauses : 2780
% 3.06/0.83 % ...of these trivial : 64
% 3.06/0.83 % ...subsumed : 1684
% 3.06/0.83 % ...remaining for further processing : 1032
% 3.06/0.83 % Other redundant clauses eliminated : 13
% 3.06/0.83 % Clauses deleted for lack of memory : 0
% 3.06/0.83 % Backward-subsumed : 57
% 3.06/0.83 % Backward-rewritten : 268
% 3.06/0.83 % Generated clauses : 12259
% 3.06/0.83 % ...of the previous two non-redundant : 10126
% 3.06/0.83 % ...aggressively subsumed : 0
% 3.06/0.83 % Contextual simplify-reflections : 16
% 3.06/0.83 % Paramodulations : 12235
% 3.06/0.83 % Factorizations : 10
% 3.06/0.83 % NegExts : 0
% 3.06/0.83 % Equation resolutions : 13
% 3.06/0.83 % Disequality decompositions : 0
% 3.06/0.83 % Total rewrite steps : 8200
% 3.06/0.83 % ...of those cached : 7892
% 3.06/0.83 % Propositional unsat checks : 0
% 3.06/0.83 % Propositional check models : 0
% 3.06/0.83 % Propositional check unsatisfiable : 0
% 3.06/0.83 % Propositional clauses : 0
% 3.06/0.83 % Propositional clauses after purity: 0
% 3.06/0.83 % Propositional unsat core size : 0
% 3.06/0.83 % Propositional preprocessing time : 0.000
% 3.06/0.83 % Propositional encoding time : 0.000
% 3.06/0.83 % Propositional solver time : 0.000
% 3.06/0.83 % Success case prop preproc time : 0.000
% 3.06/0.83 % Success case prop encoding time : 0.000
% 3.06/0.83 % Success case prop solver time : 0.000
% 3.06/0.83 % Current number of processed clauses : 625
% 3.06/0.83 % Positive orientable unit clauses : 68
% 3.06/0.83 % Positive unorientable unit clauses: 1
% 3.06/0.83 % Negative unit clauses : 17
% 3.06/0.83 % Non-unit-clauses : 539
% 3.06/0.83 % Current number of unprocessed clauses: 6940
% 3.06/0.83 % ...number of literals in the above : 21533
% 3.06/0.83 % Current number of archived formulas : 0
% 3.06/0.83 % Current number of archived clauses : 419
% 3.06/0.83 % Clause-clause subsumption calls (NU) : 55292
% 3.06/0.83 % Rec. Clause-clause subsumption calls : 40718
% 3.06/0.83 % Non-unit clause-clause subsumptions : 1414
% 3.06/0.83 % Unit Clause-clause subsumption calls : 4103
% 3.06/0.83 % Rewrite failures with RHS unbound : 0
% 3.06/0.83 % BW rewrite match attempts : 367
% 3.06/0.83 % BW rewrite match successes : 53
% 3.06/0.83 % Condensation attempts : 0
% 3.06/0.83 % Condensation successes : 0
% 3.06/0.83 % Termbank termtop insertions : 396979
% 3.06/0.83 % Search garbage collected termcells : 160
% 3.06/0.83
% 3.06/0.83 % -------------------------------------------------
% 3.06/0.83 % User time : 0.387 s
% 3.06/0.83 % System time : 0.017 s
% 3.06/0.83 % Total time : 0.404 s
% 3.06/0.83 % Maximum resident set size: 3720 pages
% 3.06/0.83
% 3.06/0.83 % -------------------------------------------------
% 3.06/0.83 % User time : 1.901 s
% 3.06/0.83 % System time : 0.097 s
% 3.06/0.83 % Total time : 1.999 s
% 3.06/0.83 % Maximum resident set size: 4608 pages
% 3.06/0.83 % E exiting
%------------------------------------------------------------------------------