TSTP Solution File: PUZ030-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : PUZ030-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:11:42 EDT 2023
% Result : Unsatisfiable 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 35
% Syntax : Number of clauses : 138 ( 9 unt; 53 nHn; 132 RR)
% Number of literals : 339 ( 0 equ; 158 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule9_1,hypothesis,
( both(barry)
| both(lang)
| ~ salt(mill) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule9_1) ).
cnf(neither4,axiom,
( salt(X1)
| mustard(X1)
| neither(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',neither4) ).
cnf(rule9_3,hypothesis,
( mustard(mill)
| ~ both(lang) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule9_3) ).
cnf(both3,axiom,
( both(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',both3) ).
cnf(both2,axiom,
( mustard(X1)
| ~ both(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',both2) ).
cnf(neither2,axiom,
( ~ neither(X1)
| ~ salt(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',neither2) ).
cnf(rule1_3,hypothesis,
( salt(barry)
| ~ oneof(lang) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule1_3) ).
cnf(one_condition_holds1,axiom,
( both(X1)
| neither(X1)
| oneof(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',one_condition_holds1) ).
cnf(rule7_2,hypothesis,
( salt(lang)
| ~ oneof(barry) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule7_2) ).
cnf(rule8_3,hypothesis,
( mustard(lang)
| ~ neither(mill) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule8_3) ).
cnf(rule5_3,hypothesis,
( salt(dix)
| ~ both(cole) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule5_3) ).
cnf(neither3,axiom,
( ~ neither(X1)
| ~ mustard(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',neither3) ).
cnf(rule3_3,hypothesis,
( salt(cole)
| ~ neither(mill) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule3_3) ).
cnf(rule10_2,hypothesis,
( mustard(mill)
| ~ oneof(cole) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule10_2) ).
cnf(rule2_1,hypothesis,
( neither(dix)
| both(mill)
| ~ mustard(barry) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule2_1) ).
cnf(both1,axiom,
( salt(X1)
| ~ both(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',both1) ).
cnf(prove_who_takes_what,negated_conjecture,
( ~ neither(cole)
| ~ neither(dix)
| ~ both(barry)
| ~ oneof(lang)
| ~ salt(mill)
| ~ mustard(lang)
| ~ oneof(mill) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',prove_who_takes_what) ).
cnf(rule9_2,hypothesis,
( salt(mill)
| ~ both(barry) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule9_2) ).
cnf(rule8_2,hypothesis,
( mustard(lang)
| ~ neither(cole) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule8_2) ).
cnf(rule2_2,hypothesis,
( mustard(barry)
| ~ neither(dix) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule2_2) ).
cnf(rule1_1,hypothesis,
( oneof(cole)
| oneof(lang)
| ~ salt(barry) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule1_1) ).
cnf(oneof4,axiom,
( ~ oneof(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',oneof4) ).
cnf(rule7_3,hypothesis,
( salt(lang)
| ~ oneof(dix) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule7_3) ).
cnf(rule10_1,hypothesis,
( oneof(cole)
| oneof(dix)
| ~ mustard(mill) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule10_1) ).
cnf(oneof3,axiom,
( ~ oneof(X1)
| ~ neither(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',oneof3) ).
cnf(rule4_3,hypothesis,
( mustard(cole)
| ~ both(lang) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule4_3) ).
cnf(rule1_2,hypothesis,
( salt(barry)
| ~ oneof(cole) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule1_2) ).
cnf(rule3_1,hypothesis,
( oneof(barry)
| neither(mill)
| ~ salt(cole) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule3_1) ).
cnf(rule5_1,hypothesis,
( neither(barry)
| both(cole)
| ~ salt(dix) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule5_1) ).
cnf(oneof2,axiom,
( ~ oneof(X1)
| ~ both(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',oneof2) ).
cnf(rule6_2,hypothesis,
( mustard(dix)
| ~ neither(lang) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule6_2) ).
cnf(rule6_1,hypothesis,
( neither(lang)
| neither(mill)
| ~ mustard(dix) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule6_1) ).
cnf(rule4_1,hypothesis,
( both(dix)
| both(lang)
| ~ mustard(cole) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule4_1) ).
cnf(neither1,axiom,
( ~ both(X1)
| ~ neither(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',neither1) ).
cnf(rule8_1,hypothesis,
( neither(cole)
| neither(mill)
| ~ mustard(lang) ),
file('/export/starexec/sandbox2/tmp/tmp.kAJjgX95l4/E---3.1_20298.p',rule8_1) ).
cnf(c_0_35,hypothesis,
( both(barry)
| both(lang)
| ~ salt(mill) ),
rule9_1 ).
cnf(c_0_36,axiom,
( salt(X1)
| mustard(X1)
| neither(X1) ),
neither4 ).
cnf(c_0_37,hypothesis,
( mustard(mill)
| ~ both(lang) ),
rule9_3 ).
cnf(c_0_38,axiom,
( both(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
both3 ).
cnf(c_0_39,axiom,
( mustard(X1)
| ~ both(X1) ),
both2 ).
cnf(c_0_40,hypothesis,
( neither(mill)
| mustard(mill)
| both(barry) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_41,axiom,
( ~ neither(X1)
| ~ salt(X1) ),
neither2 ).
cnf(c_0_42,hypothesis,
( salt(barry)
| ~ oneof(lang) ),
rule1_3 ).
cnf(c_0_43,axiom,
( both(X1)
| neither(X1)
| oneof(X1) ),
one_condition_holds1 ).
cnf(c_0_44,hypothesis,
( mustard(mill)
| ~ mustard(lang)
| ~ salt(lang) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,hypothesis,
( salt(lang)
| ~ oneof(barry) ),
rule7_2 ).
cnf(c_0_46,hypothesis,
( mustard(lang)
| ~ neither(mill) ),
rule8_3 ).
cnf(c_0_47,hypothesis,
( neither(mill)
| mustard(mill)
| mustard(barry) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,hypothesis,
( ~ neither(barry)
| ~ oneof(lang) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,hypothesis,
( neither(lang)
| oneof(lang)
| mustard(mill) ),
inference(spm,[status(thm)],[c_0_37,c_0_43]) ).
cnf(c_0_50,hypothesis,
( mustard(mill)
| ~ oneof(barry)
| ~ mustard(lang) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
( neither(X1)
| oneof(X1)
| mustard(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_52,hypothesis,
( mustard(barry)
| mustard(mill)
| mustard(lang) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,hypothesis,
( salt(dix)
| ~ both(cole) ),
rule5_3 ).
cnf(c_0_54,hypothesis,
( neither(lang)
| mustard(mill)
| ~ neither(barry) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,hypothesis,
( neither(barry)
| mustard(barry)
| mustard(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_56,hypothesis,
( salt(dix)
| ~ mustard(cole)
| ~ salt(cole) ),
inference(spm,[status(thm)],[c_0_53,c_0_38]) ).
cnf(c_0_57,axiom,
( ~ neither(X1)
| ~ mustard(X1) ),
neither3 ).
cnf(c_0_58,hypothesis,
( neither(lang)
| mustard(barry)
| mustard(mill) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,hypothesis,
( salt(cole)
| ~ neither(mill) ),
rule3_3 ).
cnf(c_0_60,hypothesis,
( mustard(mill)
| ~ oneof(cole) ),
rule10_2 ).
cnf(c_0_61,hypothesis,
( ~ neither(dix)
| ~ mustard(cole)
| ~ salt(cole) ),
inference(spm,[status(thm)],[c_0_41,c_0_56]) ).
cnf(c_0_62,hypothesis,
( neither(dix)
| both(mill)
| ~ mustard(barry) ),
rule2_1 ).
cnf(c_0_63,hypothesis,
( mustard(mill)
| mustard(barry) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_52]) ).
cnf(c_0_64,hypothesis,
( ~ neither(cole)
| ~ neither(mill) ),
inference(spm,[status(thm)],[c_0_41,c_0_59]) ).
cnf(c_0_65,hypothesis,
( neither(cole)
| mustard(cole)
| mustard(mill) ),
inference(spm,[status(thm)],[c_0_60,c_0_51]) ).
cnf(c_0_66,axiom,
( salt(X1)
| ~ both(X1) ),
both1 ).
cnf(c_0_67,hypothesis,
( ~ neither(dix)
| ~ neither(mill)
| ~ mustard(cole) ),
inference(spm,[status(thm)],[c_0_61,c_0_59]) ).
cnf(c_0_68,hypothesis,
( neither(dix)
| mustard(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_39]) ).
cnf(c_0_69,hypothesis,
( mustard(cole)
| ~ neither(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_57]) ).
cnf(c_0_70,negated_conjecture,
( ~ neither(cole)
| ~ neither(dix)
| ~ both(barry)
| ~ oneof(lang)
| ~ salt(mill)
| ~ mustard(lang)
| ~ oneof(mill) ),
prove_who_takes_what ).
cnf(c_0_71,hypothesis,
( salt(mill)
| ~ both(barry) ),
rule9_2 ).
cnf(c_0_72,hypothesis,
( mustard(lang)
| ~ neither(cole) ),
rule8_2 ).
cnf(c_0_73,hypothesis,
( neither(mill)
| mustard(mill)
| salt(barry) ),
inference(spm,[status(thm)],[c_0_66,c_0_40]) ).
cnf(c_0_74,hypothesis,
~ neither(mill),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_57]) ).
cnf(c_0_75,hypothesis,
( neither(cole)
| oneof(cole)
| salt(dix) ),
inference(spm,[status(thm)],[c_0_53,c_0_43]) ).
cnf(c_0_76,negated_conjecture,
( ~ neither(cole)
| ~ neither(dix)
| ~ oneof(lang)
| ~ oneof(mill)
| ~ both(barry) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_77,hypothesis,
( mustard(barry)
| ~ neither(dix) ),
rule2_2 ).
cnf(c_0_78,hypothesis,
( oneof(cole)
| oneof(lang)
| ~ salt(barry) ),
rule1_1 ).
cnf(c_0_79,hypothesis,
( mustard(mill)
| salt(barry) ),
inference(sr,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_80,hypothesis,
( neither(cole)
| oneof(cole)
| ~ neither(dix) ),
inference(spm,[status(thm)],[c_0_41,c_0_75]) ).
cnf(c_0_81,negated_conjecture,
( ~ neither(cole)
| ~ neither(dix)
| ~ oneof(lang)
| ~ oneof(mill) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_38]),c_0_42]),c_0_77]) ).
cnf(c_0_82,hypothesis,
( oneof(lang)
| mustard(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_60]) ).
cnf(c_0_83,hypothesis,
( neither(cole)
| mustard(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_68]),c_0_60]) ).
cnf(c_0_84,axiom,
( ~ oneof(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
oneof4 ).
cnf(c_0_85,hypothesis,
( salt(lang)
| ~ oneof(dix) ),
rule7_3 ).
cnf(c_0_86,hypothesis,
( oneof(cole)
| oneof(dix)
| ~ mustard(mill) ),
rule10_1 ).
cnf(c_0_87,negated_conjecture,
mustard(mill),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_51]),c_0_74]),c_0_82]),c_0_68]),c_0_83]) ).
cnf(c_0_88,hypothesis,
( mustard(mill)
| mustard(lang) ),
inference(spm,[status(thm)],[c_0_72,c_0_83]) ).
cnf(c_0_89,hypothesis,
( ~ oneof(lang)
| ~ oneof(dix)
| ~ mustard(lang) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_90,hypothesis,
( oneof(dix)
| oneof(cole) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]) ).
cnf(c_0_91,hypothesis,
( ~ neither(lang)
| ~ oneof(dix) ),
inference(spm,[status(thm)],[c_0_41,c_0_85]) ).
cnf(c_0_92,hypothesis,
( oneof(dix)
| oneof(cole)
| mustard(lang) ),
inference(spm,[status(thm)],[c_0_86,c_0_88]) ).
cnf(c_0_93,axiom,
( ~ oneof(X1)
| ~ neither(X1) ),
oneof3 ).
cnf(c_0_94,hypothesis,
( oneof(cole)
| ~ oneof(lang)
| ~ mustard(lang) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_95,hypothesis,
( mustard(cole)
| ~ both(lang) ),
rule4_3 ).
cnf(c_0_96,hypothesis,
( oneof(cole)
| ~ neither(lang) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_57]) ).
cnf(c_0_97,hypothesis,
( salt(barry)
| ~ oneof(cole) ),
rule1_2 ).
cnf(c_0_98,hypothesis,
( oneof(barry)
| neither(mill)
| ~ salt(cole) ),
rule3_1 ).
cnf(c_0_99,plain,
( neither(X1)
| oneof(X1)
| salt(X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_43]) ).
cnf(c_0_100,hypothesis,
( ~ neither(cole)
| ~ oneof(lang) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_72]) ).
cnf(c_0_101,hypothesis,
( neither(lang)
| oneof(lang)
| mustard(cole) ),
inference(spm,[status(thm)],[c_0_95,c_0_43]) ).
cnf(c_0_102,hypothesis,
( ~ neither(cole)
| ~ neither(lang) ),
inference(spm,[status(thm)],[c_0_93,c_0_96]) ).
cnf(c_0_103,hypothesis,
( ~ neither(barry)
| ~ oneof(cole) ),
inference(spm,[status(thm)],[c_0_41,c_0_97]) ).
cnf(c_0_104,hypothesis,
( neither(cole)
| oneof(cole)
| oneof(barry) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_74]) ).
cnf(c_0_105,hypothesis,
( neither(barry)
| both(cole)
| ~ salt(dix) ),
rule5_1 ).
cnf(c_0_106,hypothesis,
~ neither(cole),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_57]),c_0_102]) ).
cnf(c_0_107,hypothesis,
( neither(cole)
| ~ neither(barry) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_93]) ).
cnf(c_0_108,hypothesis,
( neither(dix)
| neither(barry)
| oneof(dix)
| both(cole) ),
inference(spm,[status(thm)],[c_0_105,c_0_99]) ).
cnf(c_0_109,hypothesis,
~ neither(barry),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_110,hypothesis,
( ~ oneof(barry)
| ~ oneof(cole)
| ~ mustard(barry) ),
inference(spm,[status(thm)],[c_0_84,c_0_97]) ).
cnf(c_0_111,hypothesis,
( oneof(cole)
| ~ neither(dix) ),
inference(spm,[status(thm)],[c_0_93,c_0_90]) ).
cnf(c_0_112,axiom,
( ~ oneof(X1)
| ~ both(X1) ),
oneof2 ).
cnf(c_0_113,hypothesis,
( neither(dix)
| oneof(dix)
| both(cole) ),
inference(sr,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_114,hypothesis,
( neither(dix)
| neither(barry)
| mustard(dix)
| both(cole) ),
inference(spm,[status(thm)],[c_0_105,c_0_36]) ).
cnf(c_0_115,hypothesis,
( ~ neither(dix)
| ~ oneof(barry) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_77]) ).
cnf(c_0_116,hypothesis,
( neither(cole)
| oneof(barry)
| mustard(cole) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_36]),c_0_69]) ).
cnf(c_0_117,hypothesis,
( ~ neither(cole)
| ~ neither(dix) ),
inference(spm,[status(thm)],[c_0_93,c_0_111]) ).
cnf(c_0_118,hypothesis,
( neither(dix)
| oneof(dix) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_90]) ).
cnf(c_0_119,hypothesis,
( neither(dix)
| mustard(dix)
| both(cole) ),
inference(sr,[status(thm)],[c_0_114,c_0_109]) ).
cnf(c_0_120,hypothesis,
( mustard(cole)
| ~ neither(dix) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117]) ).
cnf(c_0_121,hypothesis,
( neither(dix)
| ~ neither(lang) ),
inference(spm,[status(thm)],[c_0_91,c_0_118]) ).
cnf(c_0_122,hypothesis,
( mustard(dix)
| ~ neither(lang) ),
rule6_2 ).
cnf(c_0_123,hypothesis,
( neither(lang)
| neither(mill)
| ~ mustard(dix) ),
rule6_1 ).
cnf(c_0_124,hypothesis,
( mustard(dix)
| mustard(cole) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_119]),c_0_120]) ).
cnf(c_0_125,hypothesis,
~ neither(lang),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_121]),c_0_122]) ).
cnf(c_0_126,hypothesis,
( both(dix)
| both(lang)
| ~ mustard(cole) ),
rule4_1 ).
cnf(c_0_127,hypothesis,
mustard(cole),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]),c_0_74]) ).
cnf(c_0_128,hypothesis,
( both(dix)
| both(lang) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127])]) ).
cnf(c_0_129,axiom,
( ~ both(X1)
| ~ neither(X1) ),
neither1 ).
cnf(c_0_130,hypothesis,
( both(lang)
| ~ oneof(dix) ),
inference(spm,[status(thm)],[c_0_112,c_0_128]) ).
cnf(c_0_131,hypothesis,
( both(lang)
| ~ neither(dix) ),
inference(spm,[status(thm)],[c_0_129,c_0_128]) ).
cnf(c_0_132,hypothesis,
( ~ oneof(lang)
| ~ oneof(dix) ),
inference(spm,[status(thm)],[c_0_112,c_0_130]) ).
cnf(c_0_133,hypothesis,
( ~ neither(dix)
| ~ oneof(lang) ),
inference(spm,[status(thm)],[c_0_112,c_0_131]) ).
cnf(c_0_134,hypothesis,
~ oneof(lang),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_118]),c_0_133]) ).
cnf(c_0_135,hypothesis,
( neither(cole)
| neither(mill)
| ~ mustard(lang) ),
rule8_1 ).
cnf(c_0_136,hypothesis,
mustard(lang),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_51]),c_0_125]) ).
cnf(c_0_137,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_135,c_0_136])]),c_0_106]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PUZ030-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 18:46:49 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.kAJjgX95l4/E---3.1_20298.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20377 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGHNF-FFMF00-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.47 # Starting sh5l with 136s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20383 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGHNF-FFMF00-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Preprocessing time : 0.001 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Unsatisfiable
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 43
% 0.17/0.47 # Removed by relevancy pruning/SinE : 0
% 0.17/0.47 # Initial clauses : 43
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 43
% 0.17/0.47 # Processed clauses : 496
% 0.17/0.47 # ...of these trivial : 0
% 0.17/0.47 # ...subsumed : 189
% 0.17/0.47 # ...remaining for further processing : 307
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 120
% 0.17/0.47 # Backward-rewritten : 46
% 0.17/0.47 # Generated clauses : 707
% 0.17/0.47 # ...of the previous two non-redundant : 576
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 44
% 0.17/0.47 # Paramodulations : 689
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Total rewrite steps : 63
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 80
% 0.17/0.47 # Positive orientable unit clauses : 3
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 5
% 0.17/0.47 # Non-unit-clauses : 72
% 0.17/0.47 # Current number of unprocessed clauses: 83
% 0.17/0.47 # ...number of literals in the above : 279
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 227
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 3095
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 1928
% 0.17/0.47 # Non-unit clause-clause subsumptions : 267
% 0.17/0.47 # Unit Clause-clause subsumption calls : 200
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 3
% 0.17/0.47 # BW rewrite match successes : 3
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 5886
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.018 s
% 0.17/0.47 # System time : 0.002 s
% 0.17/0.47 # Total time : 0.020 s
% 0.17/0.47 # Maximum resident set size: 1668 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.089 s
% 0.17/0.47 # System time : 0.007 s
% 0.17/0.47 # Total time : 0.096 s
% 0.17/0.47 # Maximum resident set size: 1696 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------