TSTP Solution File: NUM095-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM095-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Sat May 4 08:47:39 EDT 2024
% Result : Unsatisfiable 13.90s 2.30s
% Output : CNFRefutation 13.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 21
% Syntax : Number of clauses : 115 ( 37 unt; 23 nHn; 78 RR)
% Number of literals : 216 ( 40 equ; 97 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 195 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',class_elements_are_sets) ).
cnf(section1,axiom,
( subclass(X2,X3)
| ~ section(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',section1) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',not_subclass_members2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',complement2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',not_subclass_members1) ).
cnf(prove_sections_property4_2,negated_conjecture,
section(xr,w,y),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',prove_sections_property4_2) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',complement1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',intersection1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',intersection3) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',subclass_implies_equal) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',intersection2) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',regularity1) ).
cnf(well_ordering3,axiom,
( member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',well_ordering3) ).
cnf(prove_sections_property4_1,negated_conjecture,
well_ordering(xr,y),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',prove_sections_property4_1) ).
cnf(prove_sections_property4_3,negated_conjecture,
~ member(least(xr,intersection(complement(w),y)),complement(w)),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',prove_sections_property4_3) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',domain1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',regularity2) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',restriction1) ).
cnf(prove_sections_property4_4,negated_conjecture,
y != w,
file('/export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p',prove_sections_property4_4) ).
cnf(c_0_21,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_22,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_21 ).
cnf(c_0_23,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_24,plain,
( subclass(X2,X3)
| ~ section(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[section1]) ).
cnf(c_0_25,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_26,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_27,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_29,plain,
( subclass(X2,X3)
| ~ section(X1,X2,X3) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
section(xr,w,y),
prove_sections_property4_2 ).
cnf(c_0_31,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_32,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_25 ).
cnf(c_0_33,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_26 ).
cnf(c_0_34,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
subclass(w,y),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_31 ).
cnf(c_0_37,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( member(X1,y)
| ~ member(X1,w) ),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_39,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_40,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_41,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( member(not_subclass_element(w,X1),y)
| subclass(w,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_28]) ).
cnf(c_0_43,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_44,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_45,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_39 ).
cnf(c_0_46,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_40 ).
cnf(c_0_47,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_48,negated_conjecture,
subclass(w,complement(complement(y))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_43 ).
cnf(c_0_50,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_51,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_34]) ).
cnf(c_0_52,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_53,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_28]) ).
cnf(c_0_54,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_32,c_0_46]) ).
cnf(c_0_55,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_47 ).
cnf(c_0_56,plain,
( member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3) ),
inference(fof_simplification,[status(thm)],[well_ordering3]) ).
cnf(c_0_57,negated_conjecture,
( member(X1,complement(complement(y)))
| ~ member(X1,w) ),
inference(spm,[status(thm)],[c_0_22,c_0_48]) ).
cnf(c_0_58,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_59,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_32,c_0_51]) ).
cnf(c_0_60,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_52]) ).
cnf(c_0_61,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_52]) ).
cnf(c_0_62,plain,
( member(not_subclass_element(intersection(intersection(X1,X2),X3),X4),X1)
| subclass(intersection(intersection(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_45,c_0_53]) ).
cnf(c_0_63,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_28]) ).
cnf(c_0_64,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_28]) ).
cnf(c_0_65,plain,
( member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3) ),
c_0_56 ).
cnf(c_0_66,negated_conjecture,
well_ordering(xr,y),
prove_sections_property4_1 ).
cnf(c_0_67,negated_conjecture,
~ member(least(xr,intersection(complement(w),y)),complement(w)),
inference(fof_simplification,[status(thm)],[prove_sections_property4_3]) ).
cnf(c_0_68,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_54,c_0_53]) ).
cnf(c_0_69,negated_conjecture,
( ~ member(X1,complement(y))
| ~ member(X1,w) ),
inference(spm,[status(thm)],[c_0_36,c_0_57]) ).
cnf(c_0_70,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_71,plain,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_72,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_32,c_0_53]) ).
cnf(c_0_73,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_74,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_75,plain,
subclass(intersection(intersection(X1,X2),X3),X1),
inference(spm,[status(thm)],[c_0_32,c_0_62]) ).
cnf(c_0_76,plain,
subclass(intersection(X1,X2),intersection(X2,intersection(X1,X2))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_77,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_32,c_0_64]) ).
cnf(c_0_78,negated_conjecture,
( member(least(xr,X1),X1)
| ~ member(X2,X1)
| ~ subclass(X1,y) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_79,negated_conjecture,
~ member(least(xr,intersection(complement(w),y)),complement(w)),
c_0_67 ).
cnf(c_0_80,plain,
subclass(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_68,c_0_64]) ).
cnf(c_0_81,negated_conjecture,
( subclass(X1,y)
| ~ member(not_subclass_element(X1,y),w) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_37]),c_0_70]),c_0_70]) ).
cnf(c_0_82,plain,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
c_0_71 ).
cnf(c_0_83,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_84,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_85,plain,
( intersection(X1,X2) = X1
| ~ subclass(X1,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_72]) ).
cnf(c_0_86,plain,
( intersection(X1,regular(X1)) = complement(universal_class)
| X1 = complement(universal_class) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74]),c_0_74]) ).
cnf(c_0_87,plain,
( member(X1,X2)
| ~ member(X1,intersection(intersection(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_22,c_0_75]) ).
cnf(c_0_88,plain,
intersection(X1,intersection(X2,X1)) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_76]),c_0_77])]) ).
cnf(c_0_89,negated_conjecture,
( member(least(xr,intersection(X1,X2)),intersection(X1,X2))
| ~ member(X3,X2)
| ~ member(X3,X1)
| ~ subclass(intersection(X1,X2),y) ),
inference(spm,[status(thm)],[c_0_78,c_0_46]) ).
cnf(c_0_90,negated_conjecture,
( member(least(xr,intersection(complement(w),y)),w)
| ~ member(least(xr,intersection(complement(w),y)),universal_class) ),
inference(spm,[status(thm)],[c_0_79,c_0_33]) ).
cnf(c_0_91,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_80]),c_0_80])]) ).
cnf(c_0_92,negated_conjecture,
subclass(intersection(X1,w),y),
inference(spm,[status(thm)],[c_0_81,c_0_64]) ).
cnf(c_0_93,plain,
( X1 = complement(universal_class)
| member(regular(X1),X1) ),
inference(rw,[status(thm)],[c_0_52,c_0_74]) ).
cnf(c_0_94,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_82,c_0_83]),c_0_84]) ).
cnf(c_0_95,plain,
( complement(universal_class) = X1
| ~ subclass(X1,complement(universal_class)) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_96,plain,
( member(X1,X2)
| ~ member(X1,intersection(intersection(X3,X2),X4)) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_97,negated_conjecture,
( member(least(xr,intersection(X1,w)),intersection(X1,w))
| ~ member(least(xr,intersection(y,complement(w))),X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_92]),c_0_91])]),c_0_27]) ).
cnf(c_0_98,negated_conjecture,
( X1 = complement(universal_class)
| member(least(xr,X1),X1)
| ~ subclass(X1,y) ),
inference(spm,[status(thm)],[c_0_78,c_0_93]) ).
cnf(c_0_99,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != complement(universal_class)
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[c_0_94,c_0_74]) ).
cnf(c_0_100,plain,
intersection(complement(universal_class),X1) = complement(universal_class),
inference(spm,[status(thm)],[c_0_95,c_0_72]) ).
cnf(c_0_101,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,intersection(X4,X2))) ),
inference(spm,[status(thm)],[c_0_96,c_0_88]) ).
cnf(c_0_102,negated_conjecture,
( intersection(y,complement(w)) = complement(universal_class)
| member(least(xr,intersection(w,intersection(y,complement(w)))),intersection(w,intersection(y,complement(w)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_72])]),c_0_91]),c_0_91]) ).
cnf(c_0_103,plain,
~ member(X1,domain_of(complement(universal_class))),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_104,negated_conjecture,
( intersection(y,complement(w)) = complement(universal_class)
| member(least(xr,intersection(w,intersection(y,complement(w)))),complement(w)) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,negated_conjecture,
( intersection(y,complement(w)) = complement(universal_class)
| member(least(xr,intersection(w,intersection(y,complement(w)))),w) ),
inference(spm,[status(thm)],[c_0_45,c_0_102]) ).
cnf(c_0_106,plain,
domain_of(complement(universal_class)) = complement(universal_class),
inference(spm,[status(thm)],[c_0_103,c_0_93]) ).
cnf(c_0_107,negated_conjecture,
intersection(y,complement(w)) = complement(universal_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_104]),c_0_105]) ).
cnf(c_0_108,plain,
~ member(X1,complement(universal_class)),
inference(rw,[status(thm)],[c_0_103,c_0_106]) ).
cnf(c_0_109,negated_conjecture,
y != w,
inference(fof_simplification,[status(thm)],[prove_sections_property4_4]) ).
cnf(c_0_110,negated_conjecture,
( ~ member(X1,complement(w))
| ~ member(X1,y) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_107]),c_0_108]) ).
cnf(c_0_111,negated_conjecture,
y != w,
c_0_109 ).
cnf(c_0_112,negated_conjecture,
( subclass(X1,w)
| ~ member(not_subclass_element(X1,w),y) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_37]),c_0_70]),c_0_70]) ).
cnf(c_0_113,negated_conjecture,
~ subclass(y,w),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_35]),c_0_111]) ).
cnf(c_0_114,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_28]),c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : NUM095-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n009.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 09:09:40 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.qXn3AiN4KZ/E---3.1_14772.p
% 13.90/2.30 # Version: 3.1.0
% 13.90/2.30 # Preprocessing class: FSLSSMSMSSSNFFN.
% 13.90/2.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.90/2.30 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.90/2.30 # Starting new_bool_3 with 300s (1) cores
% 13.90/2.30 # Starting new_bool_1 with 300s (1) cores
% 13.90/2.30 # Starting sh5l with 300s (1) cores
% 13.90/2.30 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 14850 completed with status 0
% 13.90/2.30 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 13.90/2.30 # Preprocessing class: FSLSSMSMSSSNFFN.
% 13.90/2.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.90/2.30 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.90/2.30 # No SInE strategy applied
% 13.90/2.30 # Search class: FGHSM-FFLM31-DFFFFFNN
% 13.90/2.30 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 13.90/2.30 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 13.90/2.30 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 13.90/2.30 # Starting new_bool_1 with 308s (1) cores
% 13.90/2.30 # Starting sh5l with 304s (1) cores
% 13.90/2.30 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 13.90/2.30 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 14858 completed with status 0
% 13.90/2.30 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 13.90/2.30 # Preprocessing class: FSLSSMSMSSSNFFN.
% 13.90/2.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.90/2.30 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.90/2.30 # No SInE strategy applied
% 13.90/2.30 # Search class: FGHSM-FFLM31-DFFFFFNN
% 13.90/2.30 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 13.90/2.30 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 13.90/2.30 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 13.90/2.30 # Preprocessing time : 0.004 s
% 13.90/2.30 # Presaturation interreduction done
% 13.90/2.30
% 13.90/2.30 # Proof found!
% 13.90/2.30 # SZS status Unsatisfiable
% 13.90/2.30 # SZS output start CNFRefutation
% See solution above
% 13.90/2.30 # Parsed axioms : 162
% 13.90/2.30 # Removed by relevancy pruning/SinE : 0
% 13.90/2.30 # Initial clauses : 162
% 13.90/2.30 # Removed in clause preprocessing : 19
% 13.90/2.30 # Initial clauses in saturation : 143
% 13.90/2.30 # Processed clauses : 14781
% 13.90/2.30 # ...of these trivial : 163
% 13.90/2.30 # ...subsumed : 11121
% 13.90/2.30 # ...remaining for further processing : 3497
% 13.90/2.30 # Other redundant clauses eliminated : 20
% 13.90/2.30 # Clauses deleted for lack of memory : 0
% 13.90/2.30 # Backward-subsumed : 460
% 13.90/2.30 # Backward-rewritten : 652
% 13.90/2.30 # Generated clauses : 79703
% 13.90/2.30 # ...of the previous two non-redundant : 71287
% 13.90/2.30 # ...aggressively subsumed : 0
% 13.90/2.30 # Contextual simplify-reflections : 102
% 13.90/2.30 # Paramodulations : 79669
% 13.90/2.30 # Factorizations : 14
% 13.90/2.30 # NegExts : 0
% 13.90/2.30 # Equation resolutions : 20
% 13.90/2.30 # Disequality decompositions : 0
% 13.90/2.30 # Total rewrite steps : 30864
% 13.90/2.30 # ...of those cached : 29594
% 13.90/2.30 # Propositional unsat checks : 0
% 13.90/2.30 # Propositional check models : 0
% 13.90/2.30 # Propositional check unsatisfiable : 0
% 13.90/2.30 # Propositional clauses : 0
% 13.90/2.30 # Propositional clauses after purity: 0
% 13.90/2.30 # Propositional unsat core size : 0
% 13.90/2.30 # Propositional preprocessing time : 0.000
% 13.90/2.30 # Propositional encoding time : 0.000
% 13.90/2.30 # Propositional solver time : 0.000
% 13.90/2.30 # Success case prop preproc time : 0.000
% 13.90/2.30 # Success case prop encoding time : 0.000
% 13.90/2.30 # Success case prop solver time : 0.000
% 13.90/2.30 # Current number of processed clauses : 2237
% 13.90/2.30 # Positive orientable unit clauses : 179
% 13.90/2.30 # Positive unorientable unit clauses: 4
% 13.90/2.30 # Negative unit clauses : 13
% 13.90/2.30 # Non-unit-clauses : 2041
% 13.90/2.30 # Current number of unprocessed clauses: 55431
% 13.90/2.30 # ...number of literals in the above : 202396
% 13.90/2.30 # Current number of archived formulas : 0
% 13.90/2.30 # Current number of archived clauses : 1273
% 13.90/2.30 # Clause-clause subsumption calls (NU) : 781305
% 13.90/2.30 # Rec. Clause-clause subsumption calls : 402243
% 13.90/2.30 # Non-unit clause-clause subsumptions : 9827
% 13.90/2.30 # Unit Clause-clause subsumption calls : 12512
% 13.90/2.30 # Rewrite failures with RHS unbound : 16
% 13.90/2.30 # BW rewrite match attempts : 1051
% 13.90/2.30 # BW rewrite match successes : 793
% 13.90/2.30 # Condensation attempts : 0
% 13.90/2.30 # Condensation successes : 0
% 13.90/2.30 # Termbank termtop insertions : 2537728
% 13.90/2.30 # Search garbage collected termcells : 289
% 13.90/2.30
% 13.90/2.30 # -------------------------------------------------
% 13.90/2.30 # User time : 1.696 s
% 13.90/2.30 # System time : 0.046 s
% 13.90/2.30 # Total time : 1.742 s
% 13.90/2.30 # Maximum resident set size: 2196 pages
% 13.90/2.30
% 13.90/2.30 # -------------------------------------------------
% 13.90/2.30 # User time : 8.563 s
% 13.90/2.30 # System time : 0.130 s
% 13.90/2.30 # Total time : 8.693 s
% 13.90/2.30 # Maximum resident set size: 1836 pages
% 13.90/2.30 % E---3.1 exiting
% 13.90/2.30 % E exiting
%------------------------------------------------------------------------------