TSTP Solution File: NUM155-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM155-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 18:45:59 EDT 2023
% Result : Unsatisfiable 334.48s 42.96s
% Output : CNFRefutation 334.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 25
% Syntax : Number of clauses : 116 ( 38 unt; 30 nHn; 71 RR)
% Number of literals : 226 ( 59 equ; 90 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-3 aty)
% Number of variables : 180 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',subclass_members) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',regularity1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',class_elements_are_sets) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',intersection1) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',restriction1) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',unordered_pair_member) ).
cnf(successor,axiom,
union(X1,singleton(X1)) = successor(X1),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',successor) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',intersection3) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',regularity2) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',not_subclass_members2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',not_subclass_members1) ).
cnf(prove_no_ordinal_between_4,negated_conjecture,
member(y,successor(x)),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',prove_no_ordinal_between_4) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',union) ).
cnf(prove_no_ordinal_between_2,negated_conjecture,
member(y,ordinal_numbers),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',prove_no_ordinal_between_2) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',intersection2) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',unordered_pair2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',complement2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',subclass_implies_equal) ).
cnf(well_ordering3,axiom,
( member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',well_ordering3) ).
cnf(ordinal_numbers1,axiom,
( well_ordering(element_relation,X1)
| ~ member(X1,ordinal_numbers) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',ordinal_numbers1) ).
cnf(prove_no_ordinal_between_3,negated_conjecture,
member(x,y),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',prove_no_ordinal_between_3) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.HXRcElbyaQ/E---3.1_23345.p',unordered_pair3) ).
cnf(c_0_25,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_26,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_27,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_28,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_30,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_31,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_34,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_35,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_36,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_37,plain,
( ~ member(X1,null_class)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_32]) ).
cnf(c_0_38,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_39,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_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
intersection(null_class,X1) = null_class,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31]) ).
cnf(c_0_41,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_41,c_0_26]) ).
cnf(c_0_43,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_44,axiom,
union(X1,singleton(X1)) = successor(X1),
successor ).
cnf(c_0_45,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
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_41,c_0_42]) ).
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_43,c_0_26]) ).
cnf(c_0_49,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_50,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_51,negated_conjecture,
member(y,successor(x)),
prove_no_ordinal_between_4 ).
cnf(c_0_52,plain,
union(X1,unordered_pair(X1,X1)) = successor(X1),
inference(rw,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_53,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_54,negated_conjecture,
member(y,ordinal_numbers),
prove_no_ordinal_between_2 ).
cnf(c_0_55,plain,
( X1 = null_class
| ~ member(X2,regular(X1))
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_56,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_57,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_49,c_0_45]) ).
cnf(c_0_58,plain,
( member(not_subclass_element(X1,X2),X3)
| subclass(X1,X2)
| ~ subclass(X1,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_50]) ).
cnf(c_0_59,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_60,negated_conjecture,
member(y,complement(intersection(complement(x),complement(unordered_pair(x,x))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( member(y,X1)
| ~ subclass(ordinal_numbers,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_54]) ).
cnf(c_0_62,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X2,unordered_pair(X1,X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_64,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_50]) ).
cnf(c_0_65,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_29]) ).
cnf(c_0_66,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_59,c_0_50]) ).
cnf(c_0_67,negated_conjecture,
~ member(y,intersection(complement(x),complement(unordered_pair(x,x)))),
inference(spm,[status(thm)],[c_0_27,c_0_60]) ).
cnf(c_0_68,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_69,negated_conjecture,
member(y,universal_class),
inference(spm,[status(thm)],[c_0_61,c_0_29]) ).
cnf(c_0_70,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X1,universal_class)
| ~ member(X1,X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_31,c_0_56]) ).
cnf(c_0_72,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_73,plain,
subclass(X1,intersection(universal_class,X1)),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_74,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_49,c_0_66]) ).
cnf(c_0_75,negated_conjecture,
( ~ member(y,complement(unordered_pair(x,x)))
| ~ member(y,complement(x)) ),
inference(spm,[status(thm)],[c_0_67,c_0_45]) ).
cnf(c_0_76,negated_conjecture,
( member(y,complement(X1))
| member(y,X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_77,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_50]) ).
cnf(c_0_78,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X1,X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,plain,
intersection(universal_class,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_80,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_50]) ).
cnf(c_0_81,axiom,
( member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3) ),
well_ordering3 ).
cnf(c_0_82,axiom,
( well_ordering(element_relation,X1)
| ~ member(X1,ordinal_numbers) ),
ordinal_numbers1 ).
cnf(c_0_83,negated_conjecture,
( member(y,unordered_pair(x,x))
| ~ member(y,complement(x)) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_84,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| subclass(unordered_pair(X1,X2),X3)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_77]) ).
cnf(c_0_85,negated_conjecture,
member(x,y),
prove_no_ordinal_between_3 ).
cnf(c_0_86,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_78,c_0_45]) ).
cnf(c_0_87,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_79]) ).
cnf(c_0_88,plain,
subclass(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_64,c_0_50]) ).
cnf(c_0_89,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_49,c_0_80]) ).
cnf(c_0_90,plain,
( member(least(element_relation,X1),X1)
| ~ member(X2,ordinal_numbers)
| ~ member(X3,X1)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_91,negated_conjecture,
( member(y,unordered_pair(x,x))
| member(y,x) ),
inference(spm,[status(thm)],[c_0_83,c_0_76]) ).
cnf(c_0_92,negated_conjecture,
( not_subclass_element(unordered_pair(X1,x),y) = X1
| subclass(unordered_pair(X1,x),y) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_93,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_63,c_0_86]),c_0_47]),c_0_87]) ).
cnf(c_0_94,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_88]),c_0_89])]) ).
cnf(c_0_95,negated_conjecture,
( member(least(element_relation,X1),X1)
| ~ member(X2,X1)
| ~ subclass(X1,y) ),
inference(spm,[status(thm)],[c_0_90,c_0_54]) ).
cnf(c_0_96,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_55,c_0_48]) ).
cnf(c_0_97,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_98,negated_conjecture,
( member(y,x)
| member(y,X1)
| ~ subclass(unordered_pair(x,x),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_91]) ).
cnf(c_0_99,negated_conjecture,
( subclass(unordered_pair(X1,x),y)
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_49,c_0_92]) ).
cnf(c_0_100,plain,
~ member(X1,X1),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_101,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_57,c_0_80]) ).
cnf(c_0_102,negated_conjecture,
( member(least(element_relation,intersection(y,X1)),intersection(y,X1))
| ~ member(X2,intersection(y,X1)) ),
inference(spm,[status(thm)],[c_0_95,c_0_89]) ).
cnf(c_0_103,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_96,c_0_97]),c_0_87]) ).
cnf(c_0_104,negated_conjecture,
member(y,x),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_85])]),c_0_100]) ).
cnf(c_0_105,plain,
subclass(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_101,c_0_66]) ).
cnf(c_0_106,negated_conjecture,
( member(least(element_relation,intersection(y,X1)),intersection(y,X1))
| ~ member(X2,y)
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_45]) ).
cnf(c_0_107,negated_conjecture,
( regular(unordered_pair(x,y)) = y
| unordered_pair(x,y) = null_class ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_108,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_105]),c_0_105])]) ).
cnf(c_0_109,negated_conjecture,
( member(least(element_relation,intersection(y,X1)),intersection(y,X1))
| ~ member(x,X1) ),
inference(spm,[status(thm)],[c_0_106,c_0_85]) ).
cnf(c_0_110,negated_conjecture,
( intersection(y,unordered_pair(x,y)) = null_class
| unordered_pair(x,y) = null_class ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_107]),c_0_108]) ).
cnf(c_0_111,negated_conjecture,
( member(x,X1)
| ~ subclass(y,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_85]) ).
cnf(c_0_112,negated_conjecture,
( unordered_pair(x,y) = null_class
| ~ member(x,unordered_pair(x,y)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_47]) ).
cnf(c_0_113,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_111,c_0_29]) ).
cnf(c_0_114,negated_conjecture,
unordered_pair(x,y) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_63]),c_0_113])]) ).
cnf(c_0_115,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_114]),c_0_113])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : NUM155-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n016.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 14:23:21 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.HXRcElbyaQ/E---3.1_23345.p
% 334.48/42.96 # Version: 3.1pre001
% 334.48/42.96 # Preprocessing class: FSLSSMSMSSSNFFN.
% 334.48/42.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 334.48/42.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 334.48/42.96 # Starting new_bool_3 with 300s (1) cores
% 334.48/42.96 # Starting new_bool_1 with 300s (1) cores
% 334.48/42.96 # Starting sh5l with 300s (1) cores
% 334.48/42.96 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23423 completed with status 0
% 334.48/42.96 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 334.48/42.96 # Preprocessing class: FSLSSMSMSSSNFFN.
% 334.48/42.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 334.48/42.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 334.48/42.96 # No SInE strategy applied
% 334.48/42.96 # Search class: FGHSM-FFLM31-DFFFFFNN
% 334.48/42.96 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 334.48/42.96 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 334.48/42.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 334.48/42.96 # Starting new_bool_1 with 308s (1) cores
% 334.48/42.96 # Starting sh5l with 304s (1) cores
% 334.48/42.96 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 334.48/42.96 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 23434 completed with status 0
% 334.48/42.96 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 334.48/42.96 # Preprocessing class: FSLSSMSMSSSNFFN.
% 334.48/42.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 334.48/42.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 334.48/42.96 # No SInE strategy applied
% 334.48/42.96 # Search class: FGHSM-FFLM31-DFFFFFNN
% 334.48/42.96 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 334.48/42.96 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 334.48/42.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 334.48/42.96 # Starting new_bool_1 with 308s (1) cores
% 334.48/42.96 # Starting sh5l with 304s (1) cores
% 334.48/42.96 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 334.48/42.96 # Preprocessing time : 0.003 s
% 334.48/42.96 # Presaturation interreduction done
% 334.48/42.96
% 334.48/42.96 # Proof found!
% 334.48/42.96 # SZS status Unsatisfiable
% 334.48/42.96 # SZS output start CNFRefutation
% See solution above
% 334.48/42.96 # Parsed axioms : 162
% 334.48/42.96 # Removed by relevancy pruning/SinE : 0
% 334.48/42.96 # Initial clauses : 162
% 334.48/42.96 # Removed in clause preprocessing : 19
% 334.48/42.96 # Initial clauses in saturation : 143
% 334.48/42.96 # Processed clauses : 148261
% 334.48/42.96 # ...of these trivial : 208
% 334.48/42.96 # ...subsumed : 134881
% 334.48/42.96 # ...remaining for further processing : 13172
% 334.48/42.96 # Other redundant clauses eliminated : 32
% 334.48/42.96 # Clauses deleted for lack of memory : 0
% 334.48/42.96 # Backward-subsumed : 905
% 334.48/42.96 # Backward-rewritten : 575
% 334.48/42.96 # Generated clauses : 1347702
% 334.48/42.96 # ...of the previous two non-redundant : 1163815
% 334.48/42.96 # ...aggressively subsumed : 0
% 334.48/42.96 # Contextual simplify-reflections : 226
% 334.48/42.96 # Paramodulations : 1347603
% 334.48/42.96 # Factorizations : 62
% 334.48/42.96 # NegExts : 0
% 334.48/42.96 # Equation resolutions : 33
% 334.48/42.96 # Total rewrite steps : 890152
% 334.48/42.96 # Propositional unsat checks : 2
% 334.48/42.96 # Propositional check models : 0
% 334.48/42.96 # Propositional check unsatisfiable : 0
% 334.48/42.96 # Propositional clauses : 0
% 334.48/42.96 # Propositional clauses after purity: 0
% 334.48/42.96 # Propositional unsat core size : 0
% 334.48/42.96 # Propositional preprocessing time : 0.000
% 334.48/42.96 # Propositional encoding time : 2.064
% 334.48/42.96 # Propositional solver time : 0.515
% 334.48/42.96 # Success case prop preproc time : 0.000
% 334.48/42.96 # Success case prop encoding time : 0.000
% 334.48/42.96 # Success case prop solver time : 0.000
% 334.48/42.96 # Current number of processed clauses : 11540
% 334.48/42.96 # Positive orientable unit clauses : 240
% 334.48/42.96 # Positive unorientable unit clauses: 4
% 334.48/42.96 # Negative unit clauses : 113
% 334.48/42.96 # Non-unit-clauses : 11183
% 334.48/42.96 # Current number of unprocessed clauses: 1007339
% 334.48/42.96 # ...number of literals in the above : 4643093
% 334.48/42.96 # Current number of archived formulas : 0
% 334.48/42.96 # Current number of archived clauses : 1645
% 334.48/42.96 # Clause-clause subsumption calls (NU) : 23426151
% 334.48/42.96 # Rec. Clause-clause subsumption calls : 6730370
% 334.48/42.96 # Non-unit clause-clause subsumptions : 53529
% 334.48/42.96 # Unit Clause-clause subsumption calls : 105668
% 334.48/42.96 # Rewrite failures with RHS unbound : 0
% 334.48/42.96 # BW rewrite match attempts : 1852
% 334.48/42.96 # BW rewrite match successes : 712
% 334.48/42.96 # Condensation attempts : 0
% 334.48/42.96 # Condensation successes : 0
% 334.48/42.96 # Termbank termtop insertions : 102213907
% 334.48/42.96
% 334.48/42.96 # -------------------------------------------------
% 334.48/42.96 # User time : 40.948 s
% 334.48/42.96 # System time : 0.836 s
% 334.48/42.96 # Total time : 41.784 s
% 334.48/42.96 # Maximum resident set size: 2208 pages
% 334.48/42.96
% 334.48/42.96 # -------------------------------------------------
% 334.48/42.96 # User time : 206.743 s
% 334.48/42.96 # System time : 2.143 s
% 334.48/42.96 # Total time : 208.887 s
% 334.48/42.96 # Maximum resident set size: 1816 pages
% 334.48/42.96 % E---3.1 exiting
% 334.48/42.96 % E---3.1 exiting
%------------------------------------------------------------------------------