TSTP Solution File: SET523-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET523-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:19:20 EDT 2023
% Result : Unsatisfiable 466.19s 60.36s
% Output : CNFRefutation 466.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 21
% Syntax : Number of clauses : 123 ( 35 unt; 42 nHn; 68 RR)
% Number of literals : 241 ( 71 equ; 82 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 197 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',subclass_members) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',regularity1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',class_elements_are_sets) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',restriction2) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',intersection2) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',unordered_pair_member) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',intersection3) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',not_subclass_members1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',regularity2) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',intersection1) ).
cnf(prove_element_and_complement_not_both_sets_2,negated_conjecture,
member(complement(x),z),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',prove_element_and_complement_not_both_sets_2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',complement2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',subclass_implies_equal) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',unordered_pair2) ).
cnf(prove_element_and_complement_not_both_sets_1,negated_conjecture,
member(x,y),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',prove_element_and_complement_not_both_sets_1) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p',unordered_pair3) ).
cnf(c_0_21,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_22,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_23,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_24,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_26,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_29,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_30,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_31,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_32,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_34,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_35,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_36,plain,
( ~ member(X1,null_class)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
cnf(c_0_37,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
cnf(c_0_38,plain,
( intersection(cross_product(unordered_pair(X1,X1),universal_class),X2) != null_class
| ~ member(X1,domain_of(X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
intersection(X1,null_class) = null_class,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_27]) ).
cnf(c_0_40,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_40,c_0_22]) ).
cnf(c_0_42,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_43,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_44,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_45,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_46,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_47,plain,
~ member(X1,null_class),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( regular(unordered_pair(X1,X2)) = X1
| regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_49,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
( member(not_subclass_element(X1,X2),X3)
| subclass(X1,X2)
| ~ subclass(X1,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_45]) ).
cnf(c_0_51,plain,
( X1 = null_class
| ~ member(X2,regular(X1))
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_46]),c_0_47]) ).
cnf(c_0_52,plain,
( regular(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_48])]) ).
cnf(c_0_53,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_54,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_45]) ).
cnf(c_0_55,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_25]) ).
cnf(c_0_56,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_45]) ).
cnf(c_0_57,negated_conjecture,
member(complement(x),z),
prove_element_and_complement_not_both_sets_2 ).
cnf(c_0_58,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X2,unordered_pair(X1,X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_60,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_53,c_0_45]) ).
cnf(c_0_61,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_62,plain,
subclass(X1,intersection(universal_class,X1)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_63,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_43,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( member(complement(x),X1)
| ~ subclass(z,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_57]) ).
cnf(c_0_65,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(regular(unordered_pair(X1,X1)),X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_22]) ).
cnf(c_0_66,plain,
( member(not_subclass_element(intersection(universal_class,X1),X2),complement(X3))
| member(not_subclass_element(intersection(universal_class,X1),X2),X3)
| subclass(intersection(universal_class,X1),X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_67,plain,
intersection(universal_class,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
cnf(c_0_68,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_22]) ).
cnf(c_0_69,plain,
( subclass(intersection(X1,X2),intersection(X3,X1))
| ~ member(not_subclass_element(intersection(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_60]) ).
cnf(c_0_70,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_71,negated_conjecture,
( member(complement(x),complement(X1))
| member(complement(x),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_64]),c_0_25])]) ).
cnf(c_0_72,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X1,X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_52]) ).
cnf(c_0_73,plain,
( member(not_subclass_element(X1,X2),complement(X3))
| member(not_subclass_element(X1,X2),X3)
| subclass(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_67]),c_0_67]) ).
cnf(c_0_74,plain,
( intersection(complement(X1),X2) = null_class
| ~ member(regular(intersection(complement(X1),X2)),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_68]) ).
cnf(c_0_75,plain,
( X1 = null_class
| member(regular(X1),complement(X2))
| member(regular(X1),X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_27]) ).
cnf(c_0_76,plain,
subclass(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_69,c_0_56]) ).
cnf(c_0_77,negated_conjecture,
member(x,y),
prove_element_and_complement_not_both_sets_1 ).
cnf(c_0_78,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X1,universal_class)
| ~ member(X1,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_70]) ).
cnf(c_0_79,negated_conjecture,
( member(complement(x),X1)
| member(complement(x),X2)
| ~ subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_71]) ).
cnf(c_0_80,plain,
( unordered_pair(intersection(X1,X2),intersection(X1,X2)) = null_class
| ~ member(intersection(X1,X2),X2)
| ~ member(intersection(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_44]) ).
cnf(c_0_81,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_67]) ).
cnf(c_0_82,plain,
subclass(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_54,c_0_45]) ).
cnf(c_0_83,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_43,c_0_60]) ).
cnf(c_0_84,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_73]) ).
cnf(c_0_85,plain,
( intersection(X1,regular(X2)) = null_class
| X2 = null_class
| ~ member(regular(intersection(X1,regular(X2))),X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_37]) ).
cnf(c_0_86,plain,
( intersection(complement(complement(X1)),X2) = null_class
| member(regular(intersection(complement(complement(X1)),X2)),X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_87,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_76]),c_0_76])]) ).
cnf(c_0_88,negated_conjecture,
( member(x,X1)
| ~ subclass(y,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_77]) ).
cnf(c_0_89,negated_conjecture,
( unordered_pair(complement(x),complement(x)) = null_class
| ~ member(complement(x),complement(x)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_64]),c_0_25])]) ).
cnf(c_0_90,negated_conjecture,
( member(complement(x),universal_class)
| member(complement(x),X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_25]) ).
cnf(c_0_91,plain,
( ~ member(intersection(X1,X2),X2)
| ~ member(intersection(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_80]),c_0_47]),c_0_81]) ).
cnf(c_0_92,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_82]),c_0_83])]) ).
cnf(c_0_93,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_52]) ).
cnf(c_0_94,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_84]) ).
cnf(c_0_95,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_45]) ).
cnf(c_0_96,plain,
( intersection(regular(X1),complement(complement(X1))) = null_class
| X1 = null_class ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_97,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_88,c_0_25]) ).
cnf(c_0_98,plain,
( regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class
| ~ member(X3,unordered_pair(X1,X2))
| ~ member(X3,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_48]) ).
cnf(c_0_99,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_100,negated_conjecture,
( unordered_pair(complement(x),complement(x)) = null_class
| member(complement(x),x) ),
inference(spm,[status(thm)],[c_0_89,c_0_71]) ).
cnf(c_0_101,negated_conjecture,
member(complement(x),universal_class),
inference(ef,[status(thm)],[c_0_90]) ).
cnf(c_0_102,plain,
~ member(X1,X1),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_103,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,complement(X2))
| member(X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_93]) ).
cnf(c_0_104,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_94,c_0_45]) ).
cnf(c_0_105,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(spm,[status(thm)],[c_0_95,c_0_73]) ).
cnf(c_0_106,plain,
( X1 = null_class
| ~ member(X2,complement(complement(X1)))
| ~ member(X2,regular(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_96]),c_0_47]) ).
cnf(c_0_107,negated_conjecture,
( member(x,complement(X1))
| member(x,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_97]) ).
cnf(c_0_108,plain,
( regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class
| ~ member(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_81]) ).
cnf(c_0_109,negated_conjecture,
member(complement(x),x),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_100]),c_0_101])]),c_0_47]) ).
cnf(c_0_110,plain,
( unordered_pair(complement(X1),complement(X1)) = null_class
| member(complement(X1),X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_111,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_104]) ).
cnf(c_0_112,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_43,c_0_105]) ).
cnf(c_0_113,negated_conjecture,
( X1 = null_class
| member(x,complement(X1))
| ~ member(x,regular(X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_114,negated_conjecture,
( regular(unordered_pair(x,complement(x))) = complement(x)
| unordered_pair(x,complement(x)) = null_class ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_115,plain,
( member(complement(X1),X1)
| ~ member(complement(X1),universal_class) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_110]),c_0_47]) ).
cnf(c_0_116,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_112])]) ).
cnf(c_0_117,negated_conjecture,
( unordered_pair(x,complement(x)) = null_class
| member(x,complement(unordered_pair(x,complement(x))))
| ~ member(x,complement(x)) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_118,plain,
( member(X1,complement(X1))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_119,negated_conjecture,
( unordered_pair(x,complement(x)) = null_class
| member(x,complement(unordered_pair(x,complement(x)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_97])]) ).
cnf(c_0_120,negated_conjecture,
( unordered_pair(x,complement(x)) = null_class
| ~ member(x,unordered_pair(x,complement(x))) ),
inference(spm,[status(thm)],[c_0_23,c_0_119]) ).
cnf(c_0_121,negated_conjecture,
unordered_pair(x,complement(x)) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_70]),c_0_97])]) ).
cnf(c_0_122,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_121]),c_0_97])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET523-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n025.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 17:59:21 EDT 2023
% 0.18/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.vIBSEvu6M3/E---3.1_19558.p
% 466.19/60.36 # Version: 3.1pre001
% 466.19/60.36 # Preprocessing class: FSLSSMSMSSSNFFN.
% 466.19/60.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 466.19/60.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 466.19/60.36 # Starting new_bool_3 with 300s (1) cores
% 466.19/60.36 # Starting new_bool_1 with 300s (1) cores
% 466.19/60.36 # Starting sh5l with 300s (1) cores
% 466.19/60.36 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 19637 completed with status 0
% 466.19/60.36 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 466.19/60.36 # Preprocessing class: FSLSSMSMSSSNFFN.
% 466.19/60.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 466.19/60.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 466.19/60.36 # No SInE strategy applied
% 466.19/60.36 # Search class: FGHSM-FFLM31-DFFFFFNN
% 466.19/60.36 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 466.19/60.36 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 466.19/60.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 466.19/60.36 # Starting new_bool_1 with 308s (1) cores
% 466.19/60.36 # Starting sh5l with 304s (1) cores
% 466.19/60.36 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 466.19/60.36 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 19651 completed with status 0
% 466.19/60.36 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 466.19/60.36 # Preprocessing class: FSLSSMSMSSSNFFN.
% 466.19/60.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 466.19/60.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 466.19/60.36 # No SInE strategy applied
% 466.19/60.36 # Search class: FGHSM-FFLM31-DFFFFFNN
% 466.19/60.36 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 466.19/60.36 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 466.19/60.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 466.19/60.36 # Starting new_bool_1 with 308s (1) cores
% 466.19/60.36 # Starting sh5l with 304s (1) cores
% 466.19/60.36 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 466.19/60.36 # Preprocessing time : 0.003 s
% 466.19/60.36 # Presaturation interreduction done
% 466.19/60.36
% 466.19/60.36 # Proof found!
% 466.19/60.36 # SZS status Unsatisfiable
% 466.19/60.36 # SZS output start CNFRefutation
% See solution above
% 466.19/60.36 # Parsed axioms : 114
% 466.19/60.36 # Removed by relevancy pruning/SinE : 0
% 466.19/60.36 # Initial clauses : 114
% 466.19/60.36 # Removed in clause preprocessing : 17
% 466.19/60.36 # Initial clauses in saturation : 97
% 466.19/60.36 # Processed clauses : 174709
% 466.19/60.36 # ...of these trivial : 138
% 466.19/60.36 # ...subsumed : 157165
% 466.19/60.36 # ...remaining for further processing : 17406
% 466.19/60.36 # Other redundant clauses eliminated : 38
% 466.19/60.36 # Clauses deleted for lack of memory : 0
% 466.19/60.36 # Backward-subsumed : 900
% 466.19/60.36 # Backward-rewritten : 3144
% 466.19/60.36 # Generated clauses : 1573687
% 466.19/60.36 # ...of the previous two non-redundant : 1349690
% 466.19/60.36 # ...aggressively subsumed : 0
% 466.19/60.36 # Contextual simplify-reflections : 329
% 466.19/60.36 # Paramodulations : 1573533
% 466.19/60.36 # Factorizations : 113
% 466.19/60.36 # NegExts : 0
% 466.19/60.36 # Equation resolutions : 39
% 466.19/60.36 # Total rewrite steps : 1189688
% 466.19/60.36 # Propositional unsat checks : 3
% 466.19/60.36 # Propositional check models : 0
% 466.19/60.36 # Propositional check unsatisfiable : 0
% 466.19/60.36 # Propositional clauses : 0
% 466.19/60.36 # Propositional clauses after purity: 0
% 466.19/60.36 # Propositional unsat core size : 0
% 466.19/60.36 # Propositional preprocessing time : 0.000
% 466.19/60.36 # Propositional encoding time : 4.760
% 466.19/60.36 # Propositional solver time : 1.309
% 466.19/60.36 # Success case prop preproc time : 0.000
% 466.19/60.36 # Success case prop encoding time : 0.000
% 466.19/60.36 # Success case prop solver time : 0.000
% 466.19/60.36 # Current number of processed clauses : 13260
% 466.19/60.36 # Positive orientable unit clauses : 228
% 466.19/60.36 # Positive unorientable unit clauses: 1
% 466.19/60.36 # Negative unit clauses : 529
% 466.19/60.36 # Non-unit-clauses : 12502
% 466.19/60.36 # Current number of unprocessed clauses: 1154121
% 466.19/60.36 # ...number of literals in the above : 4932735
% 466.19/60.36 # Current number of archived formulas : 0
% 466.19/60.36 # Current number of archived clauses : 4159
% 466.19/60.36 # Clause-clause subsumption calls (NU) : 36396086
% 466.19/60.36 # Rec. Clause-clause subsumption calls : 9035470
% 466.19/60.36 # Non-unit clause-clause subsumptions : 75617
% 466.19/60.36 # Unit Clause-clause subsumption calls : 608066
% 466.19/60.36 # Rewrite failures with RHS unbound : 0
% 466.19/60.36 # BW rewrite match attempts : 10777
% 466.19/60.36 # BW rewrite match successes : 864
% 466.19/60.36 # Condensation attempts : 0
% 466.19/60.36 # Condensation successes : 0
% 466.19/60.36 # Termbank termtop insertions : 100089911
% 466.19/60.36
% 466.19/60.36 # -------------------------------------------------
% 466.19/60.36 # User time : 58.164 s
% 466.19/60.36 # System time : 1.073 s
% 466.19/60.36 # Total time : 59.237 s
% 466.19/60.36 # Maximum resident set size: 2040 pages
% 466.19/60.36
% 466.19/60.36 # -------------------------------------------------
% 466.19/60.36 # User time : 291.739 s
% 466.19/60.36 # System time : 2.721 s
% 466.19/60.36 # Total time : 294.460 s
% 466.19/60.36 # Maximum resident set size: 1776 pages
% 466.19/60.36 % E---3.1 exiting
% 466.19/60.36 % E---3.1 exiting
%------------------------------------------------------------------------------