TSTP Solution File: SET097+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET097+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n006.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 : Thu Aug 31 14:33:01 EDT 2023
% Result : Theorem 195.80s 195.97s
% Output : CNFRefutation 195.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 49
% Syntax : Number of formulae : 137 ( 23 unt; 39 typ; 0 def)
% Number of atoms : 233 ( 67 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 218 ( 83 ~; 103 |; 24 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 47 ( 31 >; 16 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 34 ( 34 usr; 8 con; 0-3 aty)
% Number of variables : 163 ( 17 sgn; 44 !; 7 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
subclass: ( $i * $i ) > $o ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
universal_class: $i ).
tff(decl_25,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_26,type,
singleton: $i > $i ).
tff(decl_27,type,
ordered_pair: ( $i * $i ) > $i ).
tff(decl_28,type,
cross_product: ( $i * $i ) > $i ).
tff(decl_29,type,
first: $i > $i ).
tff(decl_30,type,
second: $i > $i ).
tff(decl_31,type,
element_relation: $i ).
tff(decl_32,type,
intersection: ( $i * $i ) > $i ).
tff(decl_33,type,
complement: $i > $i ).
tff(decl_34,type,
restrict: ( $i * $i * $i ) > $i ).
tff(decl_35,type,
null_class: $i ).
tff(decl_36,type,
domain_of: $i > $i ).
tff(decl_37,type,
rotate: $i > $i ).
tff(decl_38,type,
flip: $i > $i ).
tff(decl_39,type,
union: ( $i * $i ) > $i ).
tff(decl_40,type,
successor: $i > $i ).
tff(decl_41,type,
successor_relation: $i ).
tff(decl_42,type,
inverse: $i > $i ).
tff(decl_43,type,
range_of: $i > $i ).
tff(decl_44,type,
image: ( $i * $i ) > $i ).
tff(decl_45,type,
inductive: $i > $o ).
tff(decl_46,type,
sum_class: $i > $i ).
tff(decl_47,type,
power_class: $i > $i ).
tff(decl_48,type,
compose: ( $i * $i ) > $i ).
tff(decl_49,type,
identity_relation: $i ).
tff(decl_50,type,
function: $i > $o ).
tff(decl_51,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_52,type,
apply: ( $i * $i ) > $i ).
tff(decl_53,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk2_0: $i ).
tff(decl_55,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk4_1: $i > $i ).
tff(decl_57,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk6_1: $i > $i ).
tff(decl_59,type,
esk7_0: $i ).
tff(decl_60,type,
esk8_0: $i ).
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(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(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(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(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]) ).
cnf(c_0_24,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_25,plain,
( member(X1,X2)
| member(X1,complement(X2))
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,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)],[regularity])])])]) ).
fof(c_0_28,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])]) ).
cnf(c_0_29,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_24,c_0_25]),c_0_26]) ).
cnf(c_0_30,plain,
( member(esk6_1(X1),X1)
| X1 = null_class ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
esk8_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,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_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( X1 = esk6_1(esk8_0)
| ~ member(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( member(esk1_2(X1,X2),X1)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,plain,
( intersection(X1,X2) = null_class
| member(esk6_1(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_38,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_39,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_40,negated_conjecture,
( esk1_2(esk8_0,X1) = esk6_1(esk8_0)
| subclass(esk8_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( esk6_1(intersection(X1,esk8_0)) = esk6_1(esk8_0)
| intersection(X1,esk8_0) = null_class ),
inference(spm,[status(thm)],[c_0_35,c_0_37]) ).
fof(c_0_42,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])]) ).
cnf(c_0_43,plain,
( member(esk1_2(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( subclass(esk8_0,X1)
| ~ member(esk6_1(esk8_0),X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| member(esk6_1(esk8_0),intersection(X1,esk8_0)) ),
inference(spm,[status(thm)],[c_0_30,c_0_41]) ).
cnf(c_0_46,plain,
( member(esk1_2(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_36]) ).
cnf(c_0_47,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_48,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| subclass(esk8_0,intersection(X1,esk8_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_39,c_0_46]) ).
fof(c_0_52,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[null_class_defn]) ).
cnf(c_0_53,plain,
( subclass(complement(X1),X2)
| ~ member(esk1_2(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_36]) ).
cnf(c_0_54,plain,
( member(esk1_2(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_36]) ).
cnf(c_0_55,plain,
( intersection(X1,X2) = X1
| ~ subclass(X1,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,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_48,c_0_50]),c_0_51])]) ).
fof(c_0_57,plain,
! [X46] : ~ member(X46,null_class),
inference(variable_rename,[status(thm)],[c_0_52]) ).
cnf(c_0_58,plain,
( member(esk1_2(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_25]),c_0_54]) ).
cnf(c_0_59,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_32,c_0_30]) ).
cnf(c_0_60,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| esk8_0 = X1
| ~ subclass(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_62,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_39,c_0_58]) ).
cnf(c_0_63,plain,
( member(esk1_2(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_25]),c_0_54]) ).
cnf(c_0_64,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| member(esk6_1(esk8_0),esk8_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_41]) ).
cnf(c_0_65,plain,
( member(esk6_1(X1),universal_class)
| X1 = null_class ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_66,plain,
( esk6_1(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_59])]) ).
cnf(c_0_67,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_60]),c_0_61]),c_0_22]) ).
cnf(c_0_68,plain,
( complement(complement(X1)) = X1
| ~ subclass(X1,complement(complement(X1))) ),
inference(spm,[status(thm)],[c_0_48,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
( member(esk6_1(esk8_0),X1)
| subclass(esk8_0,complement(X1)) ),
inference(spm,[status(thm)],[c_0_63,c_0_40]) ).
cnf(c_0_70,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_64]),c_0_61])]) ).
cnf(c_0_71,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_72,negated_conjecture,
( intersection(esk8_0,X1) = esk8_0
| ~ member(X2,intersection(esk8_0,X1)) ),
inference(spm,[status(thm)],[c_0_67,c_0_49]) ).
cnf(c_0_73,plain,
( complement(X1) = null_class
| ~ member(esk6_1(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_30]) ).
cnf(c_0_74,negated_conjecture,
( complement(complement(esk8_0)) = esk8_0
| member(esk6_1(esk8_0),complement(esk8_0)) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
member(esk6_1(esk8_0),esk8_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_30]),c_0_31]) ).
cnf(c_0_76,plain,
( member(X1,universal_class)
| ~ member(X2,unordered_pair(X1,X1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( intersection(esk8_0,X1) = esk8_0
| ~ member(X2,esk8_0)
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_20]) ).
cnf(c_0_78,plain,
( complement(complement(X1)) = null_class
| member(esk6_1(complement(complement(X1))),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_25]),c_0_65]) ).
cnf(c_0_79,negated_conjecture,
complement(complement(esk8_0)) = esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_74]),c_0_75])]) ).
cnf(c_0_80,negated_conjecture,
( member(esk6_1(esk8_0),universal_class)
| ~ member(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_76,c_0_33]) ).
cnf(c_0_81,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(esk1_2(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_63]) ).
cnf(c_0_82,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_77,c_0_78]),c_0_79]),c_0_79]),c_0_31]) ).
cnf(c_0_83,negated_conjecture,
member(esk6_1(esk8_0),universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_30]),c_0_31]) ).
cnf(c_0_84,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_81,c_0_36]) ).
cnf(c_0_85,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_82,c_0_25]),c_0_83])]) ).
cnf(c_0_86,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_84])]) ).
cnf(c_0_87,negated_conjecture,
( intersection(esk8_0,X1) = esk8_0
| member(esk6_1(esk8_0),complement(X1)) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_88,negated_conjecture,
singleton(X1) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_89,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_32,c_0_36]) ).
cnf(c_0_90,plain,
( intersection(X1,X2) = X2
| ~ subclass(X2,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_51]) ).
cnf(c_0_91,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_24,c_0_87]),c_0_75])]) ).
cnf(c_0_92,negated_conjecture,
unordered_pair(X1,X1) != esk8_0,
inference(rw,[status(thm)],[c_0_88,c_0_14]) ).
cnf(c_0_93,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_89])]) ).
cnf(c_0_94,negated_conjecture,
( ~ member(X1,esk8_0)
| ~ subclass(unordered_pair(X1,X1),esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]) ).
cnf(c_0_95,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_93]) ).
cnf(c_0_96,negated_conjecture,
~ member(X1,esk8_0),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_75,c_0_96]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.15 % Problem : SET097+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.12/0.15 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.35 % Computer : n006.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sat Aug 26 13:44:22 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.17/0.58 start to proof: theBenchmark
% 195.80/195.96 % Version : CSE_E---1.5
% 195.80/195.96 % Problem : theBenchmark.p
% 195.80/195.96 % Proof found
% 195.80/195.97 % SZS status Theorem for theBenchmark.p
% 195.80/195.97 % SZS output start Proof
% See solution above
% 195.80/195.98 % Total time : 195.369000 s
% 195.80/195.98 % SZS output end Proof
% 195.80/195.98 % Total time : 195.380000 s
%------------------------------------------------------------------------------