%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET099+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 : Theorem 213.92s 31.83s
% Output : CNFRefutation 213.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 71 ( 17 unt; 0 def)
% Number of atoms : 191 ( 52 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 195 ( 75 ~; 81 |; 26 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 113 ( 8 sgn 49 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(corollary_2_to_number_of_elements_in_class,conjecture,
! [X1] :
( ! [X3,X4] :
( ( member(X4,intersection(complement(singleton(X3)),X1))
& member(X3,X1) )
=> X3 = X4 )
=> ( ? [X2] : singleton(X2) = X1
| X1 = null_class ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_2_to_number_of_elements_in_class) ).
fof(regularity,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( disjoint(X3,X1)
& member(X3,X1)
& member(X3,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( ( X3 = X2
| X3 = X1 )
& member(X3,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(intersection,axiom,
! [X1,X2,X5] :
( member(X5,intersection(X1,X2))
<=> ( member(X5,X2)
& member(X5,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',intersection) ).
fof(null_class_defn,axiom,
! [X1] : ~ member(X1,null_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',null_class_defn) ).
fof(complement,axiom,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( ~ member(X5,X1)
& member(X5,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',complement) ).
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(class_elements_are_sets,axiom,
! [X1] : subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X2,X1)
& subclass(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ! [X3,X4] :
( ( member(X4,intersection(complement(singleton(X3)),X1))
& member(X3,X1) )
=> X3 = X4 )
=> ( ? [X2] : singleton(X2) = X1
| X1 = null_class ) ),
inference(assume_negation,[status(cth)],[corollary_2_to_number_of_elements_in_class]) ).
fof(c_0_11,plain,
! [X1] :
( X1 != null_class
=> ? [X3] :
( disjoint(X3,X1)
& member(X3,X1)
& member(X3,universal_class) ) ),
inference(fof_simplification,[status(thm)],[regularity]) ).
fof(c_0_12,plain,
! [X50,X51,X52] :
( ( member(X50,unordered_pair(X51,X52))
| ~ member(X50,universal_class)
| X50 != X52 )
& ( member(X50,unordered_pair(X51,X52))
| ~ member(X50,universal_class)
| X50 != X51 )
& ( ~ member(X50,unordered_pair(X51,X52))
| X50 = X52
| X50 = X51 )
& ( ~ member(X50,unordered_pair(X51,X52))
| member(X50,universal_class) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])]) ).
fof(c_0_13,plain,
! [X14] : singleton(X14) = unordered_pair(X14,X14),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_14,negated_conjecture,
! [X11,X12,X13] :
( singleton(X13) != esk1_0
& esk1_0 != null_class
& ( X11 = X12
| ~ member(X12,intersection(complement(singleton(X11)),esk1_0))
| ~ member(X11,esk1_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_15,plain,
! [X28] :
( ( X28 = null_class
| disjoint(esk2_1(X28),X28) )
& ( X28 = null_class
| member(esk2_1(X28),X28) )
& ( X28 = null_class
| member(esk2_1(X28),universal_class) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_16,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( ~ member(X2,intersection(complement(singleton(X1)),esk1_0))
| ~ member(X1,esk1_0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( X1 = null_class
| member(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_21,plain,
! [X42,X43,X44] :
( ( member(X44,intersection(X42,X43))
| ~ member(X44,X43)
| ~ member(X44,X42) )
& ( ~ member(X44,intersection(X42,X43))
| member(X44,X43) )
& ( ~ member(X44,intersection(X42,X43))
| member(X44,X42) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
cnf(c_0_22,plain,
( X1 = null_class
| member(esk2_1(X1),universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(X1,esk1_0)
| intersection(complement(singleton(X1)),esk1_0) = null_class
| esk2_1(intersection(complement(singleton(X1)),esk1_0)) = X1 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( singleton(X1) = null_class
| esk2_1(singleton(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,universal_class)
| intersection(complement(singleton(X1)),esk1_0) = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( member(X1,universal_class)
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
fof(c_0_28,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[null_class_defn]) ).
fof(c_0_29,plain,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( ~ member(X5,X1)
& member(X5,universal_class) ) ),
inference(fof_simplification,[status(thm)],[complement]) ).
cnf(c_0_30,plain,
( member(esk2_1(intersection(X1,X2)),X1)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_31,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,universal_class)
| intersection(complement(null_class),esk1_0) = null_class ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
esk1_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_33,plain,
! [X26] : ~ member(X26,null_class),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
fof(c_0_34,plain,
! [X32,X33,X34,X35,X36] :
( ( subclass(X35,X36)
| ~ member(esk4_2(X35,X36),X36) )
& ( subclass(X35,X36)
| member(esk4_2(X35,X36),X35) )
& ( member(X34,X33)
| ~ member(X34,X32)
| ~ subclass(X32,X33) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subclass_defn])])])])])])]) ).
fof(c_0_35,plain,
! [X78] : subclass(X78,universal_class),
inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).
fof(c_0_36,plain,
! [X48,X49] :
( ( member(X49,complement(X48))
| member(X49,X48)
| ~ member(X49,universal_class) )
& ( ~ member(X49,complement(X48))
| ~ member(X49,X48) )
& ( ~ member(X49,complement(X48))
| member(X49,universal_class) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,complement(singleton(X1)))
| intersection(complement(singleton(X1)),esk1_0) = null_class ),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_38,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_39,negated_conjecture,
( member(esk2_1(esk1_0),universal_class)
| intersection(complement(null_class),esk1_0) = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_32]) ).
cnf(c_0_40,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( member(esk2_1(esk1_0),complement(singleton(esk2_1(esk1_0))))
| intersection(complement(singleton(esk2_1(esk1_0))),esk1_0) = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_19]),c_0_32]) ).
cnf(c_0_45,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_46,negated_conjecture,
( ~ member(X1,esk1_0)
| ~ member(X1,complement(null_class))
| member(esk2_1(esk1_0),universal_class) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_47,plain,
( ~ member(X1,universal_class)
| member(X1,complement(X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( ~ member(esk2_1(esk1_0),singleton(esk2_1(esk1_0)))
| intersection(complement(singleton(esk2_1(esk1_0))),esk1_0) = null_class ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( ~ member(X1,esk1_0)
| member(esk2_1(esk1_0),universal_class) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_40]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( ~ member(X1,esk1_0)
| ~ member(X1,complement(singleton(esk2_1(esk1_0))))
| ~ member(esk2_1(esk1_0),singleton(esk2_1(esk1_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_49]),c_0_40]) ).
cnf(c_0_53,plain,
( ~ member(X1,universal_class)
| member(X1,singleton(X1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_17]) ).
cnf(c_0_54,negated_conjecture,
member(esk2_1(esk1_0),universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_19]),c_0_32]) ).
cnf(c_0_55,negated_conjecture,
( ~ member(X1,esk1_0)
| ~ member(X1,complement(singleton(esk2_1(esk1_0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_56,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,singleton(esk2_1(esk1_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_47]),c_0_48]) ).
cnf(c_0_57,negated_conjecture,
( ~ member(X1,esk1_0)
| X1 = esk2_1(esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_56]) ).
cnf(c_0_58,plain,
( subclass(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_59,plain,
( ~ member(esk4_2(X1,X2),X2)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_60,negated_conjecture,
( subclass(esk1_0,X1)
| esk4_2(esk1_0,X1) = esk2_1(esk1_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
fof(c_0_61,plain,
! [X96,X97] :
( ( X96 = X97
| ~ subclass(X97,X96)
| ~ subclass(X96,X97) )
& ( X96 != X97
| subclass(X97,X96) )
& ( X96 != X97
| subclass(X96,X97) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])]) ).
cnf(c_0_62,negated_conjecture,
( ~ member(esk2_1(esk1_0),X1)
| subclass(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_64,negated_conjecture,
subclass(esk1_0,singleton(esk2_1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_53]),c_0_54])]) ).
cnf(c_0_65,negated_conjecture,
singleton(X1) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_66,plain,
( subclass(singleton(X1),X2)
| esk4_2(singleton(X1),X2) = X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_58]) ).
cnf(c_0_67,negated_conjecture,
~ subclass(singleton(esk2_1(esk1_0)),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_68,plain,
( ~ member(X1,X2)
| subclass(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
~ member(esk2_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_19]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET099+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:52:49 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 213.92/31.83 % Version: 3.5.1
% 213.92/31.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 213.92/31.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.92/31.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 213.92/31.83 % Starting new_bool_3 with 300s (1) cores
% 213.92/31.83 % Starting new_bool_1 with 300s (1) cores
% 213.92/31.83 % Starting sh5l with 300s (1) cores
% 213.92/31.83 % sh5l with pid 2287721 completed with status 0
% 213.92/31.83 % Result found by sh5l
% 213.92/31.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 213.92/31.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.92/31.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 213.92/31.83 % Starting new_bool_3 with 300s (1) cores
% 213.92/31.83 % Starting new_bool_1 with 300s (1) cores
% 213.92/31.83 % Starting sh5l with 300s (1) cores
% 213.92/31.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 213.92/31.83 % SinE strategy is gf500_gu_R04_F100_L20000
% 213.92/31.83 % Search class: FGHSM-FFMS31-MFFFFFNN
% 213.92/31.83 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 213.92/31.83 % Starting SubtermCWHack with 28s (1) cores
% 213.92/31.83 % SubtermCWHack with pid 2287725 completed with status 8
% 213.92/31.83 % Starting sh5l with 31s (1) cores
% 213.92/31.83 % sh5l with pid 2287764 completed with status 0
% 213.92/31.83 % Result found by sh5l
% 213.92/31.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 213.92/31.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.92/31.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 213.92/31.83 % Starting new_bool_3 with 300s (1) cores
% 213.92/31.83 % Starting new_bool_1 with 300s (1) cores
% 213.92/31.83 % Starting sh5l with 300s (1) cores
% 213.92/31.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 213.92/31.83 % SinE strategy is gf500_gu_R04_F100_L20000
% 213.92/31.83 % Search class: FGHSM-FFMS31-MFFFFFNN
% 213.92/31.83 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 213.92/31.83 % Starting SubtermCWHack with 28s (1) cores
% 213.92/31.83 % SubtermCWHack with pid 2287725 completed with status 8
% 213.92/31.83 % Starting sh5l with 31s (1) cores
% 213.92/31.83 % Preprocessing time : 0.004 s
% 213.92/31.83 % Presaturation interreduction done
% 213.92/31.83
% 213.92/31.83 % Proof found!
% 213.92/31.83 % SZS status Theorem
% 213.92/31.83 % SZS output start CNFRefutation
% See solution above
% 213.92/31.83 % Parsed axioms : 44
% 213.92/31.83 % Removed by relevancy pruning/SinE : 2
% 213.92/31.83 % Initial clauses : 88
% 213.92/31.83 % Removed in clause preprocessing : 0
% 213.92/31.83 % Initial clauses in saturation : 88
% 213.92/31.83 % Processed clauses : 11900
% 213.92/31.83 % ...of these trivial : 127
% 213.92/31.83 % ...subsumed : 9608
% 213.92/31.83 % ...remaining for further processing : 2165
% 213.92/31.83 % Other redundant clauses eliminated : 20
% 213.92/31.83 % Clauses deleted for lack of memory : 0
% 213.92/31.83 % Backward-subsumed : 183
% 213.92/31.83 % Backward-rewritten : 121
% 213.92/31.83 % Generated clauses : 76796
% 213.92/31.83 % ...of the previous two non-redundant : 63197
% 213.92/31.83 % ...aggressively subsumed : 0
% 213.92/31.83 % Contextual simplify-reflections : 98
% 213.92/31.83 % Paramodulations : 76737
% 213.92/31.83 % Factorizations : 30
% 213.92/31.83 % NegExts : 0
% 213.92/31.83 % Equation resolutions : 20
% 213.92/31.83 % Disequality decompositions : 0
% 213.92/31.83 % Total rewrite steps : 81793
% 213.92/31.83 % ...of those cached : 80642
% 213.92/31.83 % Propositional unsat checks : 0
% 213.92/31.83 % Propositional check models : 0
% 213.92/31.83 % Propositional check unsatisfiable : 0
% 213.92/31.83 % Propositional clauses : 0
% 213.92/31.83 % Propositional clauses after purity: 0
% 213.92/31.83 % Propositional unsat core size : 0
% 213.92/31.83 % Propositional preprocessing time : 0.000
% 213.92/31.83 % Propositional encoding time : 0.000
% 213.92/31.83 % Propositional solver time : 0.000
% 213.92/31.83 % Success case prop preproc time : 0.000
% 213.92/31.83 % Success case prop encoding time : 0.000
% 213.92/31.83 % Success case prop solver time : 0.000
% 213.92/31.83 % Current number of processed clauses : 1759
% 213.92/31.83 % Positive orientable unit clauses : 145
% 213.92/31.83 % Positive unorientable unit clauses: 5
% 213.92/31.83 % Negative unit clauses : 335
% 213.92/31.83 % Non-unit-clauses : 1274
% 213.92/31.83 % Current number of unprocessed clauses: 50636
% 213.92/31.83 % ...number of literals in the above : 150849
% 213.92/31.83 % Current number of archived formulas : 0
% 213.92/31.83 % Current number of archived clauses : 400
% 213.92/31.83 % Clause-clause subsumption calls (NU) : 233970
% 213.92/31.83 % Rec. Clause-clause subsumption calls : 164679
% 213.92/31.83 % Non-unit clause-clause subsumptions : 1842
% 213.92/31.83 % Unit Clause-clause subsumption calls : 38656
% 213.92/31.83 % Rewrite failures with RHS unbound : 64
% 213.92/31.83 % BW rewrite match attempts : 133
% 213.92/31.83 % BW rewrite match successes : 42
% 213.92/31.83 % Condensation attempts : 11900
% 213.92/31.83 % Condensation successes : 144
% 213.92/31.83 % Termbank termtop insertions : 1153691
% 213.92/31.83 % Search garbage collected termcells : 1012
% 213.92/31.83
% 213.92/31.83 % -------------------------------------------------
% 213.92/31.83 % User time : 29.699 s
% 213.92/31.83 % System time : 0.999 s
% 213.92/31.83 % Total time : 30.698 s
% 213.92/31.83 % Maximum resident set size: 3948 pages
% 213.92/31.83
% 213.92/31.83 % -------------------------------------------------
% 213.92/31.83 % User time : 29.702 s
% 213.92/31.83 % System time : 1.006 s
% 213.92/31.83 % Total time : 30.709 s
% 213.92/31.83 % Maximum resident set size: 4864 pages
% 213.92/31.83 % E exiting
%------------------------------------------------------------------------------