TSTP Solution File: SET097+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET097+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:57:35 EDT 2024
% Result : Theorem 51.19s 6.98s
% Output : CNFRefutation 51.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 10
% Syntax : Number of formulae : 99 ( 23 unt; 0 def)
% Number of atoms : 237 ( 68 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 222 ( 84 ~; 103 |; 26 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 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 : 165 ( 17 sgn 45 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(number_of_elements_in_class,conjecture,
! [X1] :
( X1 = null_class
| ? [X2] : singleton(X2) = X1
| ? [X4] :
( member(X4,X1)
& ? [X7] : member(X7,intersection(complement(singleton(X4)),X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',number_of_elements_in_class) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(intersection,axiom,
! [X1,X2,X5] :
( member(X5,intersection(X1,X2))
<=> ( member(X5,X1)
& member(X5,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',intersection) ).
fof(complement,axiom,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( member(X5,universal_class)
& ~ member(X5,X1) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(class_elements_are_sets,axiom,
! [X1] : subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(regularity,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( member(X3,universal_class)
& member(X3,X1)
& disjoint(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X1,X2)
& subclass(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(null_class_defn,axiom,
! [X1] : ~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',null_class_defn) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( X1 = null_class
| ? [X2] : singleton(X2) = X1
| ? [X4] :
( member(X4,X1)
& ? [X7] : member(X7,intersection(complement(singleton(X4)),X1)) ) ),
inference(assume_negation,[status(cth)],[number_of_elements_in_class]) ).
fof(c_0_11,negated_conjecture,
! [X108,X109,X110] :
( esk8_0 != null_class
& singleton(X108) != esk8_0
& ( ~ member(X109,esk8_0)
| ~ member(X110,intersection(complement(singleton(X109)),esk8_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_12,plain,
! [X24] : singleton(X24) = unordered_pair(X24,X24),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
cnf(c_0_13,negated_conjecture,
( ~ member(X1,esk8_0)
| ~ member(X2,intersection(complement(singleton(X1)),esk8_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X38,X39,X40] :
( ( member(X40,X38)
| ~ member(X40,intersection(X38,X39)) )
& ( member(X40,X39)
| ~ member(X40,intersection(X38,X39)) )
& ( ~ member(X40,X38)
| ~ member(X40,X39)
| member(X40,intersection(X38,X39)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
fof(c_0_16,plain,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( member(X5,universal_class)
& ~ member(X5,X1) ) ),
inference(fof_simplification,[status(thm)],[complement]) ).
fof(c_0_17,plain,
! [X10,X11,X12,X13,X14] :
( ( ~ subclass(X10,X11)
| ~ member(X12,X10)
| member(X12,X11) )
& ( member(esk1_2(X13,X14),X13)
| subclass(X13,X14) )
& ( ~ member(esk1_2(X13,X14),X14)
| subclass(X13,X14) ) ),
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_18,plain,
! [X16] : subclass(X16,universal_class),
inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(X1,esk8_0)
| ~ member(X2,intersection(complement(unordered_pair(X1,X1)),esk8_0)) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X41,X42] :
( ( member(X42,universal_class)
| ~ member(X42,complement(X41)) )
& ( ~ member(X42,X41)
| ~ member(X42,complement(X41)) )
& ( ~ member(X42,universal_class)
| member(X42,X41)
| member(X42,complement(X41)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_22,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X1] :
( X1 != null_class
=> ? [X3] :
( member(X3,universal_class)
& member(X3,X1)
& disjoint(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[regularity]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(X1,complement(unordered_pair(X2,X2)))
| ~ member(X2,esk8_0)
| ~ member(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( member(X1,X2)
| member(X1,complement(X2))
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,plain,
! [X101] :
( ( member(esk6_1(X101),universal_class)
| X101 = null_class )
& ( member(esk6_1(X101),X101)
| X101 = null_class )
& ( disjoint(esk6_1(X101),X101)
| X101 = null_class ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
fof(c_0_29,plain,
! [X19,X20,X21] :
( ( member(X19,universal_class)
| ~ member(X19,unordered_pair(X20,X21)) )
& ( X19 = X20
| X19 = X21
| ~ member(X19,unordered_pair(X20,X21)) )
& ( X19 != X20
| ~ member(X19,universal_class)
| member(X19,unordered_pair(X20,X21)) )
& ( X19 != X21
| ~ member(X19,universal_class)
| member(X19,unordered_pair(X20,X21)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])]) ).
cnf(c_0_30,negated_conjecture,
( member(X1,unordered_pair(X2,X2))
| ~ member(X2,esk8_0)
| ~ member(X1,esk8_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_31,plain,
( member(esk6_1(X1),X1)
| X1 = null_class ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
esk8_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( member(X1,unordered_pair(esk6_1(esk8_0),esk6_1(esk8_0)))
| ~ member(X1,esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,negated_conjecture,
( X1 = esk6_1(esk8_0)
| ~ member(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( member(esk1_2(X1,X2),X1)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_38,plain,
( intersection(X1,X2) = null_class
| member(esk6_1(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_39,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_40,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_41,negated_conjecture,
( esk1_2(esk8_0,X1) = esk6_1(esk8_0)
| subclass(esk8_0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( esk6_1(intersection(X1,esk8_0)) = esk6_1(esk8_0)
| intersection(X1,esk8_0) = null_class ),
inference(spm,[status(thm)],[c_0_36,c_0_38]) ).
fof(c_0_43,plain,
! [X17,X18] :
( ( subclass(X17,X18)
| X17 != X18 )
& ( subclass(X18,X17)
| X17 != X18 )
& ( ~ subclass(X17,X18)
| ~ subclass(X18,X17)
| X17 = X18 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])]) ).
cnf(c_0_44,plain,
( member(esk1_2(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( subclass(esk8_0,X1)
| ~ member(esk6_1(esk8_0),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| member(esk6_1(esk8_0),intersection(X1,esk8_0)) ),
inference(spm,[status(thm)],[c_0_31,c_0_42]) ).
cnf(c_0_47,plain,
( member(esk1_2(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_37]) ).
cnf(c_0_48,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_49,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_40,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| subclass(esk8_0,intersection(X1,esk8_0)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_40,c_0_47]) ).
fof(c_0_53,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[null_class_defn]) ).
cnf(c_0_54,plain,
( subclass(complement(X1),X2)
| ~ member(esk1_2(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_37]) ).
cnf(c_0_55,plain,
( member(esk1_2(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
cnf(c_0_56,plain,
( intersection(X1,X2) = X1
| ~ subclass(X1,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| intersection(X1,esk8_0) = esk8_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_51]),c_0_52])]) ).
fof(c_0_58,plain,
! [X46] : ~ member(X46,null_class),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_53])]) ).
cnf(c_0_59,plain,
( member(esk1_2(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_26]),c_0_55]) ).
cnf(c_0_60,plain,
( esk6_1(unordered_pair(X1,X2)) = X1
| esk6_1(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_61,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| esk8_0 = X1
| ~ subclass(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_63,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_40,c_0_59]) ).
cnf(c_0_64,plain,
( member(esk1_2(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_26]),c_0_55]) ).
cnf(c_0_65,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| member(esk6_1(esk8_0),esk8_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_42]) ).
cnf(c_0_66,plain,
( member(esk6_1(X1),universal_class)
| X1 = null_class ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_67,plain,
( esk6_1(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_60])]) ).
cnf(c_0_68,negated_conjecture,
( esk8_0 = X1
| ~ member(X2,X1)
| ~ subclass(X1,esk8_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_61]),c_0_62]),c_0_22]) ).
cnf(c_0_69,plain,
( complement(complement(X1)) = X1
| ~ subclass(X1,complement(complement(X1))) ),
inference(spm,[status(thm)],[c_0_49,c_0_63]) ).
cnf(c_0_70,negated_conjecture,
( member(esk6_1(esk8_0),X1)
| subclass(esk8_0,complement(X1)) ),
inference(spm,[status(thm)],[c_0_64,c_0_41]) ).
cnf(c_0_71,negated_conjecture,
( member(esk6_1(esk8_0),esk8_0)
| ~ member(X1,esk8_0) ),
inference(condense,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_65]),c_0_62])]) ).
cnf(c_0_72,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_73,negated_conjecture,
( intersection(esk8_0,X1) = esk8_0
| ~ member(X2,intersection(esk8_0,X1)) ),
inference(spm,[status(thm)],[c_0_68,c_0_50]) ).
cnf(c_0_74,plain,
( complement(X1) = null_class
| ~ member(esk6_1(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_31]) ).
cnf(c_0_75,negated_conjecture,
( complement(complement(esk8_0)) = esk8_0
| member(esk6_1(esk8_0),complement(esk8_0)) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
member(esk6_1(esk8_0),esk8_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_31]),c_0_32]) ).
cnf(c_0_77,plain,
( member(X1,universal_class)
| ~ member(X2,unordered_pair(X1,X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_72]) ).
cnf(c_0_78,negated_conjecture,
( intersection(esk8_0,X1) = esk8_0
| ~ member(X2,esk8_0)
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_20]) ).
cnf(c_0_79,plain,
( complement(complement(X1)) = null_class
| member(esk6_1(complement(complement(X1))),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_26]),c_0_66]) ).
cnf(c_0_80,negated_conjecture,
complement(complement(esk8_0)) = esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_75]),c_0_76])]) ).
cnf(c_0_81,negated_conjecture,
( member(esk6_1(esk8_0),universal_class)
| ~ member(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_77,c_0_34]) ).
cnf(c_0_82,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(esk1_2(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_64]) ).
cnf(c_0_83,negated_conjecture,
( intersection(esk8_0,X1) = esk8_0
| ~ member(esk6_1(esk8_0),X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]),c_0_80]),c_0_32]) ).
cnf(c_0_84,negated_conjecture,
member(esk6_1(esk8_0),universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_31]),c_0_32]) ).
cnf(c_0_85,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_82,c_0_37]) ).
cnf(c_0_86,negated_conjecture,
( intersection(esk8_0,complement(X1)) = esk8_0
| member(esk6_1(esk8_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_26]),c_0_84])]) ).
cnf(c_0_87,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_85])]) ).
cnf(c_0_88,negated_conjecture,
( intersection(esk8_0,X1) = esk8_0
| member(esk6_1(esk8_0),complement(X1)) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_89,negated_conjecture,
singleton(X1) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_90,plain,
( esk1_2(unordered_pair(X1,X2),X3) = X1
| esk1_2(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_91,plain,
( intersection(X1,X2) = X2
| ~ subclass(X2,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_52]) ).
cnf(c_0_92,negated_conjecture,
( intersection(esk8_0,unordered_pair(X1,X1)) = esk8_0
| ~ member(X1,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_88]),c_0_76])]) ).
cnf(c_0_93,negated_conjecture,
unordered_pair(X1,X1) != esk8_0,
inference(rw,[status(thm)],[c_0_89,c_0_14]) ).
cnf(c_0_94,plain,
( esk1_2(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_90])]) ).
cnf(c_0_95,negated_conjecture,
( ~ member(X1,esk8_0)
| ~ subclass(unordered_pair(X1,X1),esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]) ).
cnf(c_0_96,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_94]) ).
cnf(c_0_97,negated_conjecture,
~ member(X1,esk8_0),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_76,c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET097+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.38 % Computer : n017.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8042.1875MB
% 0.13/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon May 20 12:46:38 EDT 2024
% 0.13/0.38 % CPUTime :
% 0.23/0.51 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 51.19/6.98 # Version: 3.1.0
% 51.19/6.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 51.19/6.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.19/6.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 51.19/6.98 # Starting new_bool_3 with 300s (1) cores
% 51.19/6.98 # Starting new_bool_1 with 300s (1) cores
% 51.19/6.98 # Starting sh5l with 300s (1) cores
% 51.19/6.98 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7946 completed with status 0
% 51.19/6.98 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 51.19/6.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 51.19/6.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.19/6.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 51.19/6.98 # No SInE strategy applied
% 51.19/6.98 # Search class: FGHSM-FFMS21-DFFFFFNN
% 51.19/6.98 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 51.19/6.98 # Starting new_ho_10 with 271s (1) cores
% 51.19/6.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 51.19/6.98 # Starting ho_unfolding_3 with 271s (1) cores
% 51.19/6.98 # Starting new_ho_10_cnf2 with 271s (1) cores
% 51.19/6.98 # Starting pre_casc_2 with 271s (1) cores
% 51.19/6.98 # pre_casc_2 with pid 7959 completed with status 0
% 51.19/6.98 # Result found by pre_casc_2
% 51.19/6.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 51.19/6.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.19/6.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 51.19/6.98 # No SInE strategy applied
% 51.19/6.98 # Search class: FGHSM-FFMS21-DFFFFFNN
% 51.19/6.98 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 51.19/6.98 # Starting new_ho_10 with 271s (1) cores
% 51.19/6.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 51.19/6.98 # Starting ho_unfolding_3 with 271s (1) cores
% 51.19/6.98 # Starting new_ho_10_cnf2 with 271s (1) cores
% 51.19/6.98 # Starting pre_casc_2 with 271s (1) cores
% 51.19/6.98 # Preprocessing time : 0.002 s
% 51.19/6.98 # Presaturation interreduction done
% 51.19/6.98
% 51.19/6.98 # Proof found!
% 51.19/6.98 # SZS status Theorem
% 51.19/6.98 # SZS output start CNFRefutation
% See solution above
% 51.19/6.98 # Parsed axioms : 44
% 51.19/6.98 # Removed by relevancy pruning/SinE : 0
% 51.19/6.98 # Initial clauses : 92
% 51.19/6.98 # Removed in clause preprocessing : 8
% 51.19/6.98 # Initial clauses in saturation : 84
% 51.19/6.98 # Processed clauses : 24144
% 51.19/6.98 # ...of these trivial : 185
% 51.19/6.98 # ...subsumed : 20818
% 51.19/6.98 # ...remaining for further processing : 3141
% 51.19/6.98 # Other redundant clauses eliminated : 70
% 51.19/6.98 # Clauses deleted for lack of memory : 0
% 51.19/6.98 # Backward-subsumed : 710
% 51.19/6.98 # Backward-rewritten : 279
% 51.19/6.98 # Generated clauses : 309220
% 51.19/6.98 # ...of the previous two non-redundant : 263446
% 51.19/6.98 # ...aggressively subsumed : 0
% 51.19/6.98 # Contextual simplify-reflections : 58
% 51.19/6.98 # Paramodulations : 308905
% 51.19/6.98 # Factorizations : 244
% 51.19/6.98 # NegExts : 0
% 51.19/6.98 # Equation resolutions : 70
% 51.19/6.98 # Disequality decompositions : 0
% 51.19/6.98 # Total rewrite steps : 177897
% 51.19/6.98 # ...of those cached : 175291
% 51.19/6.98 # Propositional unsat checks : 0
% 51.19/6.98 # Propositional check models : 0
% 51.19/6.98 # Propositional check unsatisfiable : 0
% 51.19/6.98 # Propositional clauses : 0
% 51.19/6.98 # Propositional clauses after purity: 0
% 51.19/6.98 # Propositional unsat core size : 0
% 51.19/6.98 # Propositional preprocessing time : 0.000
% 51.19/6.98 # Propositional encoding time : 0.000
% 51.19/6.98 # Propositional solver time : 0.000
% 51.19/6.98 # Success case prop preproc time : 0.000
% 51.19/6.98 # Success case prop encoding time : 0.000
% 51.19/6.98 # Success case prop solver time : 0.000
% 51.19/6.98 # Current number of processed clauses : 2062
% 51.19/6.98 # Positive orientable unit clauses : 160
% 51.19/6.98 # Positive unorientable unit clauses: 0
% 51.19/6.98 # Negative unit clauses : 31
% 51.19/6.98 # Non-unit-clauses : 1871
% 51.19/6.98 # Current number of unprocessed clauses: 238028
% 51.19/6.98 # ...number of literals in the above : 815148
% 51.19/6.98 # Current number of archived formulas : 0
% 51.19/6.98 # Current number of archived clauses : 1081
% 51.19/6.98 # Clause-clause subsumption calls (NU) : 1117962
% 51.19/6.98 # Rec. Clause-clause subsumption calls : 733214
% 51.19/6.98 # Non-unit clause-clause subsumptions : 6494
% 51.19/6.98 # Unit Clause-clause subsumption calls : 72793
% 51.19/6.98 # Rewrite failures with RHS unbound : 0
% 51.19/6.98 # BW rewrite match attempts : 354
% 51.19/6.98 # BW rewrite match successes : 118
% 51.19/6.98 # Condensation attempts : 24144
% 51.19/6.98 # Condensation successes : 551
% 51.19/6.98 # Termbank termtop insertions : 5845975
% 51.19/6.98 # Search garbage collected termcells : 1011
% 51.19/6.98
% 51.19/6.98 # -------------------------------------------------
% 51.19/6.98 # User time : 6.156 s
% 51.19/6.98 # System time : 0.172 s
% 51.19/6.98 # Total time : 6.328 s
% 51.19/6.98 # Maximum resident set size: 2020 pages
% 51.19/6.98
% 51.19/6.98 # -------------------------------------------------
% 51.19/6.98 # User time : 30.966 s
% 51.19/6.98 # System time : 0.908 s
% 51.19/6.98 # Total time : 31.873 s
% 51.19/6.98 # Maximum resident set size: 1752 pages
% 51.19/6.98 % E---3.1 exiting
%------------------------------------------------------------------------------