TSTP Solution File: PUZ030-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ030-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Tue May 21 02:24:45 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 35
% Syntax : Number of clauses : 171 ( 9 unt; 62 nHn; 165 RR)
% Number of literals : 421 ( 0 equ; 205 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 : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule9_1,hypothesis,
( both(barry)
| both(lang)
| ~ salt(mill) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule9_1) ).
cnf(rule9_3,hypothesis,
( mustard(mill)
| ~ both(lang) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule9_3) ).
cnf(both3,axiom,
( both(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',both3) ).
cnf(both2,axiom,
( mustard(X1)
| ~ both(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',both2) ).
cnf(neither4,axiom,
( salt(X1)
| mustard(X1)
| neither(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',neither4) ).
cnf(neither2,axiom,
( ~ neither(X1)
| ~ salt(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',neither2) ).
cnf(rule1_3,hypothesis,
( salt(barry)
| ~ oneof(lang) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule1_3) ).
cnf(rule7_2,hypothesis,
( salt(lang)
| ~ oneof(barry) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule7_2) ).
cnf(rule8_3,hypothesis,
( mustard(lang)
| ~ neither(mill) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule8_3) ).
cnf(one_condition_holds1,axiom,
( both(X1)
| neither(X1)
| oneof(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_condition_holds1) ).
cnf(rule5_3,hypothesis,
( salt(dix)
| ~ both(cole) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule5_3) ).
cnf(neither3,axiom,
( ~ neither(X1)
| ~ mustard(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',neither3) ).
cnf(rule3_3,hypothesis,
( salt(cole)
| ~ neither(mill) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule3_3) ).
cnf(rule10_2,hypothesis,
( mustard(mill)
| ~ oneof(cole) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule10_2) ).
cnf(rule2_1,hypothesis,
( neither(dix)
| both(mill)
| ~ mustard(barry) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule2_1) ).
cnf(both1,axiom,
( salt(X1)
| ~ both(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',prove_who_takes_what) ).
cnf(rule9_2,hypothesis,
( salt(mill)
| ~ both(barry) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule9_2) ).
cnf(rule8_2,hypothesis,
( mustard(lang)
| ~ neither(cole) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule8_2) ).
cnf(rule2_2,hypothesis,
( mustard(barry)
| ~ neither(dix) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule2_2) ).
cnf(rule1_1,hypothesis,
( oneof(cole)
| oneof(lang)
| ~ salt(barry) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule1_1) ).
cnf(oneof4,axiom,
( ~ oneof(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oneof4) ).
cnf(rule7_3,hypothesis,
( salt(lang)
| ~ oneof(dix) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule7_3) ).
cnf(rule10_1,hypothesis,
( oneof(cole)
| oneof(dix)
| ~ mustard(mill) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule10_1) ).
cnf(oneof3,axiom,
( ~ oneof(X1)
| ~ neither(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oneof3) ).
cnf(rule4_3,hypothesis,
( mustard(cole)
| ~ both(lang) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule4_3) ).
cnf(rule1_2,hypothesis,
( salt(barry)
| ~ oneof(cole) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule1_2) ).
cnf(rule3_1,hypothesis,
( oneof(barry)
| neither(mill)
| ~ salt(cole) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule3_1) ).
cnf(rule5_1,hypothesis,
( neither(barry)
| both(cole)
| ~ salt(dix) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule5_1) ).
cnf(oneof2,axiom,
( ~ oneof(X1)
| ~ both(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oneof2) ).
cnf(rule6_2,hypothesis,
( mustard(dix)
| ~ neither(lang) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule6_2) ).
cnf(rule6_1,hypothesis,
( neither(lang)
| neither(mill)
| ~ mustard(dix) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule6_1) ).
cnf(rule4_1,hypothesis,
( both(dix)
| both(lang)
| ~ mustard(cole) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule4_1) ).
cnf(neither1,axiom,
( ~ both(X1)
| ~ neither(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',neither1) ).
cnf(rule8_1,hypothesis,
( neither(cole)
| neither(mill)
| ~ mustard(lang) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule8_1) ).
cnf(c_0_35,hypothesis,
( both(barry)
| both(lang)
| ~ salt(mill) ),
inference(fof_simplification,[status(thm)],[rule9_1]) ).
cnf(c_0_36,hypothesis,
( mustard(mill)
| ~ both(lang) ),
inference(fof_simplification,[status(thm)],[rule9_3]) ).
cnf(c_0_37,plain,
( both(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
inference(fof_simplification,[status(thm)],[both3]) ).
cnf(c_0_38,plain,
( mustard(X1)
| ~ both(X1) ),
inference(fof_simplification,[status(thm)],[both2]) ).
cnf(c_0_39,hypothesis,
( both(barry)
| both(lang)
| ~ salt(mill) ),
c_0_35 ).
cnf(c_0_40,axiom,
( salt(X1)
| mustard(X1)
| neither(X1) ),
neither4 ).
cnf(c_0_41,hypothesis,
( mustard(mill)
| ~ both(lang) ),
c_0_36 ).
cnf(c_0_42,plain,
( ~ neither(X1)
| ~ salt(X1) ),
inference(fof_simplification,[status(thm)],[neither2]) ).
cnf(c_0_43,hypothesis,
( salt(barry)
| ~ oneof(lang) ),
inference(fof_simplification,[status(thm)],[rule1_3]) ).
cnf(c_0_44,plain,
( both(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
c_0_37 ).
cnf(c_0_45,hypothesis,
( salt(lang)
| ~ oneof(barry) ),
inference(fof_simplification,[status(thm)],[rule7_2]) ).
cnf(c_0_46,hypothesis,
( mustard(lang)
| ~ neither(mill) ),
inference(fof_simplification,[status(thm)],[rule8_3]) ).
cnf(c_0_47,plain,
( mustard(X1)
| ~ both(X1) ),
c_0_38 ).
cnf(c_0_48,hypothesis,
( neither(mill)
| mustard(mill)
| both(barry) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_49,plain,
( ~ neither(X1)
| ~ salt(X1) ),
c_0_42 ).
cnf(c_0_50,hypothesis,
( salt(barry)
| ~ oneof(lang) ),
c_0_43 ).
cnf(c_0_51,axiom,
( both(X1)
| neither(X1)
| oneof(X1) ),
one_condition_holds1 ).
cnf(c_0_52,hypothesis,
( mustard(mill)
| ~ mustard(lang)
| ~ salt(lang) ),
inference(spm,[status(thm)],[c_0_41,c_0_44]) ).
cnf(c_0_53,hypothesis,
( salt(lang)
| ~ oneof(barry) ),
c_0_45 ).
cnf(c_0_54,hypothesis,
( mustard(lang)
| ~ neither(mill) ),
c_0_46 ).
cnf(c_0_55,hypothesis,
( neither(mill)
| mustard(mill)
| mustard(barry) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,hypothesis,
( salt(dix)
| ~ both(cole) ),
inference(fof_simplification,[status(thm)],[rule5_3]) ).
cnf(c_0_57,hypothesis,
( ~ neither(barry)
| ~ oneof(lang) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_58,hypothesis,
( neither(lang)
| oneof(lang)
| mustard(mill) ),
inference(spm,[status(thm)],[c_0_41,c_0_51]) ).
cnf(c_0_59,hypothesis,
( mustard(mill)
| ~ oneof(barry)
| ~ mustard(lang) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( neither(X1)
| oneof(X1)
| mustard(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_51]) ).
cnf(c_0_61,hypothesis,
( mustard(barry)
| mustard(mill)
| mustard(lang) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,hypothesis,
( salt(dix)
| ~ both(cole) ),
c_0_56 ).
cnf(c_0_63,plain,
( ~ neither(X1)
| ~ mustard(X1) ),
inference(fof_simplification,[status(thm)],[neither3]) ).
cnf(c_0_64,hypothesis,
( neither(lang)
| mustard(mill)
| ~ neither(barry) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,hypothesis,
( neither(barry)
| mustard(barry)
| mustard(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_66,hypothesis,
( salt(cole)
| ~ neither(mill) ),
inference(fof_simplification,[status(thm)],[rule3_3]) ).
cnf(c_0_67,hypothesis,
( mustard(mill)
| ~ oneof(cole) ),
inference(fof_simplification,[status(thm)],[rule10_2]) ).
cnf(c_0_68,hypothesis,
( salt(dix)
| ~ mustard(cole)
| ~ salt(cole) ),
inference(spm,[status(thm)],[c_0_62,c_0_44]) ).
cnf(c_0_69,hypothesis,
( neither(dix)
| both(mill)
| ~ mustard(barry) ),
inference(fof_simplification,[status(thm)],[rule2_1]) ).
cnf(c_0_70,plain,
( ~ neither(X1)
| ~ mustard(X1) ),
c_0_63 ).
cnf(c_0_71,hypothesis,
( neither(lang)
| mustard(barry)
| mustard(mill) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,hypothesis,
( salt(cole)
| ~ neither(mill) ),
c_0_66 ).
cnf(c_0_73,hypothesis,
( mustard(mill)
| ~ oneof(cole) ),
c_0_67 ).
cnf(c_0_74,plain,
( salt(X1)
| ~ both(X1) ),
inference(fof_simplification,[status(thm)],[both1]) ).
cnf(c_0_75,hypothesis,
( ~ neither(dix)
| ~ mustard(cole)
| ~ salt(cole) ),
inference(spm,[status(thm)],[c_0_49,c_0_68]) ).
cnf(c_0_76,hypothesis,
( neither(dix)
| both(mill)
| ~ mustard(barry) ),
c_0_69 ).
cnf(c_0_77,hypothesis,
( mustard(mill)
| mustard(barry) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_61]) ).
cnf(c_0_78,hypothesis,
( ~ neither(cole)
| ~ neither(mill) ),
inference(spm,[status(thm)],[c_0_49,c_0_72]) ).
cnf(c_0_79,hypothesis,
( neither(cole)
| mustard(cole)
| mustard(mill) ),
inference(spm,[status(thm)],[c_0_73,c_0_60]) ).
cnf(c_0_80,negated_conjecture,
( ~ neither(cole)
| ~ neither(dix)
| ~ both(barry)
| ~ oneof(lang)
| ~ salt(mill)
| ~ mustard(lang)
| ~ oneof(mill) ),
inference(fof_simplification,[status(thm)],[prove_who_takes_what]) ).
cnf(c_0_81,hypothesis,
( salt(mill)
| ~ both(barry) ),
inference(fof_simplification,[status(thm)],[rule9_2]) ).
cnf(c_0_82,hypothesis,
( mustard(lang)
| ~ neither(cole) ),
inference(fof_simplification,[status(thm)],[rule8_2]) ).
cnf(c_0_83,plain,
( salt(X1)
| ~ both(X1) ),
c_0_74 ).
cnf(c_0_84,hypothesis,
( ~ neither(dix)
| ~ neither(mill)
| ~ mustard(cole) ),
inference(spm,[status(thm)],[c_0_75,c_0_72]) ).
cnf(c_0_85,hypothesis,
( neither(dix)
| mustard(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_47]) ).
cnf(c_0_86,hypothesis,
( mustard(cole)
| ~ neither(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_70]) ).
cnf(c_0_87,negated_conjecture,
( ~ neither(cole)
| ~ neither(dix)
| ~ both(barry)
| ~ oneof(lang)
| ~ salt(mill)
| ~ mustard(lang)
| ~ oneof(mill) ),
c_0_80 ).
cnf(c_0_88,hypothesis,
( salt(mill)
| ~ both(barry) ),
c_0_81 ).
cnf(c_0_89,hypothesis,
( mustard(lang)
| ~ neither(cole) ),
c_0_82 ).
cnf(c_0_90,hypothesis,
( mustard(barry)
| ~ neither(dix) ),
inference(fof_simplification,[status(thm)],[rule2_2]) ).
cnf(c_0_91,hypothesis,
( oneof(cole)
| oneof(lang)
| ~ salt(barry) ),
inference(fof_simplification,[status(thm)],[rule1_1]) ).
cnf(c_0_92,hypothesis,
( neither(mill)
| mustard(mill)
| salt(barry) ),
inference(spm,[status(thm)],[c_0_83,c_0_48]) ).
cnf(c_0_93,hypothesis,
~ neither(mill),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_70]) ).
cnf(c_0_94,hypothesis,
( neither(cole)
| oneof(cole)
| salt(dix) ),
inference(spm,[status(thm)],[c_0_62,c_0_51]) ).
cnf(c_0_95,negated_conjecture,
( ~ neither(cole)
| ~ neither(dix)
| ~ oneof(lang)
| ~ oneof(mill)
| ~ both(barry) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_87,c_0_88]),c_0_89]) ).
cnf(c_0_96,hypothesis,
( mustard(barry)
| ~ neither(dix) ),
c_0_90 ).
cnf(c_0_97,hypothesis,
( oneof(cole)
| oneof(lang)
| ~ salt(barry) ),
c_0_91 ).
cnf(c_0_98,hypothesis,
( mustard(mill)
| salt(barry) ),
inference(sr,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_99,hypothesis,
( neither(cole)
| oneof(cole)
| ~ neither(dix) ),
inference(spm,[status(thm)],[c_0_49,c_0_94]) ).
cnf(c_0_100,plain,
( ~ oneof(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
inference(fof_simplification,[status(thm)],[oneof4]) ).
cnf(c_0_101,hypothesis,
( salt(lang)
| ~ oneof(dix) ),
inference(fof_simplification,[status(thm)],[rule7_3]) ).
cnf(c_0_102,hypothesis,
( oneof(cole)
| oneof(dix)
| ~ mustard(mill) ),
inference(fof_simplification,[status(thm)],[rule10_1]) ).
cnf(c_0_103,negated_conjecture,
( ~ neither(cole)
| ~ neither(dix)
| ~ oneof(lang)
| ~ oneof(mill) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_44]),c_0_50]),c_0_96]) ).
cnf(c_0_104,hypothesis,
( oneof(lang)
| mustard(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_73]) ).
cnf(c_0_105,hypothesis,
( neither(cole)
| mustard(mill) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_85]),c_0_73]) ).
cnf(c_0_106,plain,
( ~ oneof(X1)
| ~ salt(X1)
| ~ mustard(X1) ),
c_0_100 ).
cnf(c_0_107,hypothesis,
( salt(lang)
| ~ oneof(dix) ),
c_0_101 ).
cnf(c_0_108,hypothesis,
( oneof(cole)
| oneof(dix)
| ~ mustard(mill) ),
c_0_102 ).
cnf(c_0_109,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_103,c_0_60]),c_0_93]),c_0_104]),c_0_85]),c_0_105]) ).
cnf(c_0_110,hypothesis,
( mustard(mill)
| mustard(lang) ),
inference(spm,[status(thm)],[c_0_89,c_0_105]) ).
cnf(c_0_111,plain,
( ~ oneof(X1)
| ~ neither(X1) ),
inference(fof_simplification,[status(thm)],[oneof3]) ).
cnf(c_0_112,hypothesis,
( ~ oneof(lang)
| ~ oneof(dix)
| ~ mustard(lang) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_113,hypothesis,
( oneof(dix)
| oneof(cole) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_109])]) ).
cnf(c_0_114,hypothesis,
( mustard(cole)
| ~ both(lang) ),
inference(fof_simplification,[status(thm)],[rule4_3]) ).
cnf(c_0_115,hypothesis,
( ~ neither(lang)
| ~ oneof(dix) ),
inference(spm,[status(thm)],[c_0_49,c_0_107]) ).
cnf(c_0_116,hypothesis,
( oneof(dix)
| oneof(cole)
| mustard(lang) ),
inference(spm,[status(thm)],[c_0_108,c_0_110]) ).
cnf(c_0_117,hypothesis,
( salt(barry)
| ~ oneof(cole) ),
inference(fof_simplification,[status(thm)],[rule1_2]) ).
cnf(c_0_118,hypothesis,
( oneof(barry)
| neither(mill)
| ~ salt(cole) ),
inference(fof_simplification,[status(thm)],[rule3_1]) ).
cnf(c_0_119,plain,
( ~ oneof(X1)
| ~ neither(X1) ),
c_0_111 ).
cnf(c_0_120,hypothesis,
( oneof(cole)
| ~ oneof(lang)
| ~ mustard(lang) ),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_121,hypothesis,
( mustard(cole)
| ~ both(lang) ),
c_0_114 ).
cnf(c_0_122,hypothesis,
( oneof(cole)
| ~ neither(lang) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_70]) ).
cnf(c_0_123,hypothesis,
( salt(barry)
| ~ oneof(cole) ),
c_0_117 ).
cnf(c_0_124,hypothesis,
( oneof(barry)
| neither(mill)
| ~ salt(cole) ),
c_0_118 ).
cnf(c_0_125,plain,
( neither(X1)
| oneof(X1)
| salt(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_51]) ).
cnf(c_0_126,hypothesis,
( neither(barry)
| both(cole)
| ~ salt(dix) ),
inference(fof_simplification,[status(thm)],[rule5_1]) ).
cnf(c_0_127,hypothesis,
( ~ neither(cole)
| ~ oneof(lang) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_89]) ).
cnf(c_0_128,hypothesis,
( neither(lang)
| oneof(lang)
| mustard(cole) ),
inference(spm,[status(thm)],[c_0_121,c_0_51]) ).
cnf(c_0_129,hypothesis,
( ~ neither(cole)
| ~ neither(lang) ),
inference(spm,[status(thm)],[c_0_119,c_0_122]) ).
cnf(c_0_130,hypothesis,
( ~ neither(barry)
| ~ oneof(cole) ),
inference(spm,[status(thm)],[c_0_49,c_0_123]) ).
cnf(c_0_131,hypothesis,
( neither(cole)
| oneof(cole)
| oneof(barry) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_93]) ).
cnf(c_0_132,hypothesis,
( neither(barry)
| both(cole)
| ~ salt(dix) ),
c_0_126 ).
cnf(c_0_133,hypothesis,
~ neither(cole),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_70]),c_0_129]) ).
cnf(c_0_134,hypothesis,
( neither(cole)
| ~ neither(barry) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_119]) ).
cnf(c_0_135,plain,
( ~ oneof(X1)
| ~ both(X1) ),
inference(fof_simplification,[status(thm)],[oneof2]) ).
cnf(c_0_136,hypothesis,
( neither(dix)
| neither(barry)
| oneof(dix)
| both(cole) ),
inference(spm,[status(thm)],[c_0_132,c_0_125]) ).
cnf(c_0_137,hypothesis,
~ neither(barry),
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_138,hypothesis,
( ~ oneof(barry)
| ~ oneof(cole)
| ~ mustard(barry) ),
inference(spm,[status(thm)],[c_0_106,c_0_123]) ).
cnf(c_0_139,hypothesis,
( oneof(cole)
| ~ neither(dix) ),
inference(spm,[status(thm)],[c_0_119,c_0_113]) ).
cnf(c_0_140,plain,
( ~ oneof(X1)
| ~ both(X1) ),
c_0_135 ).
cnf(c_0_141,hypothesis,
( neither(dix)
| oneof(dix)
| both(cole) ),
inference(sr,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_142,hypothesis,
( neither(dix)
| neither(barry)
| mustard(dix)
| both(cole) ),
inference(spm,[status(thm)],[c_0_132,c_0_40]) ).
cnf(c_0_143,hypothesis,
( ~ neither(dix)
| ~ oneof(barry) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_96]) ).
cnf(c_0_144,hypothesis,
( neither(cole)
| oneof(barry)
| mustard(cole) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_40]),c_0_86]) ).
cnf(c_0_145,hypothesis,
( ~ neither(cole)
| ~ neither(dix) ),
inference(spm,[status(thm)],[c_0_119,c_0_139]) ).
cnf(c_0_146,hypothesis,
( neither(dix)
| oneof(dix) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_113]) ).
cnf(c_0_147,hypothesis,
( mustard(dix)
| ~ neither(lang) ),
inference(fof_simplification,[status(thm)],[rule6_2]) ).
cnf(c_0_148,hypothesis,
( neither(lang)
| neither(mill)
| ~ mustard(dix) ),
inference(fof_simplification,[status(thm)],[rule6_1]) ).
cnf(c_0_149,hypothesis,
( neither(dix)
| mustard(dix)
| both(cole) ),
inference(sr,[status(thm)],[c_0_142,c_0_137]) ).
cnf(c_0_150,hypothesis,
( mustard(cole)
| ~ neither(dix) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_145]) ).
cnf(c_0_151,hypothesis,
( neither(dix)
| ~ neither(lang) ),
inference(spm,[status(thm)],[c_0_115,c_0_146]) ).
cnf(c_0_152,hypothesis,
( mustard(dix)
| ~ neither(lang) ),
c_0_147 ).
cnf(c_0_153,hypothesis,
( both(dix)
| both(lang)
| ~ mustard(cole) ),
inference(fof_simplification,[status(thm)],[rule4_1]) ).
cnf(c_0_154,hypothesis,
( neither(lang)
| neither(mill)
| ~ mustard(dix) ),
c_0_148 ).
cnf(c_0_155,hypothesis,
( mustard(dix)
| mustard(cole) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_149]),c_0_150]) ).
cnf(c_0_156,hypothesis,
~ neither(lang),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_151]),c_0_152]) ).
cnf(c_0_157,hypothesis,
( both(dix)
| both(lang)
| ~ mustard(cole) ),
c_0_153 ).
cnf(c_0_158,hypothesis,
mustard(cole),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_156]),c_0_93]) ).
cnf(c_0_159,plain,
( ~ both(X1)
| ~ neither(X1) ),
inference(fof_simplification,[status(thm)],[neither1]) ).
cnf(c_0_160,hypothesis,
( both(dix)
| both(lang) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_157,c_0_158])]) ).
cnf(c_0_161,plain,
( ~ both(X1)
| ~ neither(X1) ),
c_0_159 ).
cnf(c_0_162,hypothesis,
( both(lang)
| ~ oneof(dix) ),
inference(spm,[status(thm)],[c_0_140,c_0_160]) ).
cnf(c_0_163,hypothesis,
( both(lang)
| ~ neither(dix) ),
inference(spm,[status(thm)],[c_0_161,c_0_160]) ).
cnf(c_0_164,hypothesis,
( ~ oneof(lang)
| ~ oneof(dix) ),
inference(spm,[status(thm)],[c_0_140,c_0_162]) ).
cnf(c_0_165,hypothesis,
( ~ neither(dix)
| ~ oneof(lang) ),
inference(spm,[status(thm)],[c_0_140,c_0_163]) ).
cnf(c_0_166,hypothesis,
( neither(cole)
| neither(mill)
| ~ mustard(lang) ),
inference(fof_simplification,[status(thm)],[rule8_1]) ).
cnf(c_0_167,hypothesis,
~ oneof(lang),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_146]),c_0_165]) ).
cnf(c_0_168,hypothesis,
( neither(cole)
| neither(mill)
| ~ mustard(lang) ),
c_0_166 ).
cnf(c_0_169,hypothesis,
mustard(lang),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_60]),c_0_156]) ).
cnf(c_0_170,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_168,c_0_169])]),c_0_133]),c_0_93]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : PUZ030-1 : TPTP v8.2.0. Released v1.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 10:18:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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/benchmark/theBenchmark.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11647 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHNF-FFMF00-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11652 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHNF-FFMF00-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 43
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 43
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 43
% 0.20/0.52 # Processed clauses : 496
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 189
% 0.20/0.52 # ...remaining for further processing : 307
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 120
% 0.20/0.52 # Backward-rewritten : 46
% 0.20/0.52 # Generated clauses : 707
% 0.20/0.52 # ...of the previous two non-redundant : 576
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 44
% 0.20/0.52 # Paramodulations : 689
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 63
% 0.20/0.52 # ...of those cached : 60
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 80
% 0.20/0.52 # Positive orientable unit clauses : 3
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 5
% 0.20/0.52 # Non-unit-clauses : 72
% 0.20/0.52 # Current number of unprocessed clauses: 83
% 0.20/0.52 # ...number of literals in the above : 279
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 227
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 3095
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 1928
% 0.20/0.52 # Non-unit clause-clause subsumptions : 267
% 0.20/0.52 # Unit Clause-clause subsumption calls : 200
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 3
% 0.20/0.52 # BW rewrite match successes : 3
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 6147
% 0.20/0.52 # Search garbage collected termcells : 79
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.022 s
% 0.20/0.52 # System time : 0.004 s
% 0.20/0.52 # Total time : 0.026 s
% 0.20/0.52 # Maximum resident set size: 1684 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.113 s
% 0.20/0.52 # System time : 0.010 s
% 0.20/0.52 # Total time : 0.123 s
% 0.20/0.52 # Maximum resident set size: 1716 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------