%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP122-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:35:10 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 36
% Syntax : Number of clauses : 111 ( 22 unt; 32 nHn; 111 RR)
% Number of literals : 328 ( 0 equ; 190 neg)
% Maximal clause size : 18 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 2 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause35,negated_conjecture,
( ~ actual_world(X1)
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ chevy(X1,X4)
| ~ white(X1,X4)
| ~ dirty(X1,X4)
| ~ old(X1,X4)
| ~ agent(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ street(X1,X3)
| ~ lonely(X1,X3)
| ~ down(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause35) ).
cnf(clause30,negated_conjecture,
( down(skc15,skc16,skc17)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).
cnf(clause1,negated_conjecture,
actual_world(skc15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
cnf(clause10,negated_conjecture,
( event(skc15,skc16)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause10) ).
cnf(clause11,negated_conjecture,
( present(skc15,skc16)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause11) ).
cnf(clause12,negated_conjecture,
( barrel(skc15,skc16)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause12) ).
cnf(clause13,negated_conjecture,
( lonely(skc15,skc17)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause13) ).
cnf(clause14,negated_conjecture,
( street(skc15,skc17)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).
cnf(clause36,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ down(X1,X3,X5)
| ~ barrel(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ of(X1,X4,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X3,X2)
| ~ agent(X1,X3,X2)
| ~ old(X1,X2)
| ~ dirty(X1,X2)
| ~ white(X1,X2)
| ~ chevy(X1,X2)
| ~ city(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause36) ).
cnf(clause29,negated_conjecture,
( of(skc15,skc19,skc18)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).
cnf(clause3,negated_conjecture,
( city(skc15,skc18)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
cnf(clause4,negated_conjecture,
( chevy(skc15,skc18)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
cnf(clause5,negated_conjecture,
( white(skc15,skc18)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).
cnf(clause6,negated_conjecture,
( dirty(skc15,skc18)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).
cnf(clause7,negated_conjecture,
( old(skc15,skc18)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).
cnf(clause8,negated_conjecture,
( placename(skc15,skc19)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
cnf(clause9,negated_conjecture,
( hollywood_placename(skc15,skc19)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause9) ).
cnf(clause27,negated_conjecture,
( agent(skc15,skc16,skc18)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).
cnf(clause28,negated_conjecture,
( in(skc15,skc16,skc18)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause28) ).
cnf(clause31,negated_conjecture,
( ~ ssSkC0
| down(skc10,skc11,skc14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause31) ).
cnf(clause19,negated_conjecture,
( ~ ssSkC0
| street(skc10,skc14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause19) ).
cnf(clause18,negated_conjecture,
( ~ ssSkC0
| lonely(skc10,skc14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause18) ).
cnf(clause17,negated_conjecture,
( ~ ssSkC0
| barrel(skc10,skc11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause17) ).
cnf(clause16,negated_conjecture,
( ~ ssSkC0
| present(skc10,skc11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause16) ).
cnf(clause15,negated_conjecture,
( ~ ssSkC0
| event(skc10,skc11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause15) ).
cnf(clause34,negated_conjecture,
( ~ ssSkC0
| of(skc10,skc13,skc12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause34) ).
cnf(clause32,negated_conjecture,
( ~ ssSkC0
| in(skc10,skc11,skc12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause32) ).
cnf(clause33,negated_conjecture,
( ~ ssSkC0
| agent(skc10,skc11,skc12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause33) ).
cnf(clause25,negated_conjecture,
( ~ ssSkC0
| hollywood_placename(skc10,skc13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause25) ).
cnf(clause26,negated_conjecture,
( ~ ssSkC0
| placename(skc10,skc13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause26) ).
cnf(clause20,negated_conjecture,
( ~ ssSkC0
| old(skc10,skc12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).
cnf(clause21,negated_conjecture,
( ~ ssSkC0
| dirty(skc10,skc12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause21) ).
cnf(clause22,negated_conjecture,
( ~ ssSkC0
| white(skc10,skc12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause22) ).
cnf(clause23,negated_conjecture,
( ~ ssSkC0
| chevy(skc10,skc12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause23) ).
cnf(clause24,negated_conjecture,
( ~ ssSkC0
| city(skc10,skc12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause24) ).
cnf(clause2,negated_conjecture,
actual_world(skc10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
cnf(c_0_36,negated_conjecture,
( ~ actual_world(X1)
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ chevy(X1,X4)
| ~ white(X1,X4)
| ~ dirty(X1,X4)
| ~ old(X1,X4)
| ~ agent(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ street(X1,X3)
| ~ lonely(X1,X3)
| ~ down(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause35]) ).
cnf(c_0_37,negated_conjecture,
( ~ actual_world(X1)
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ chevy(X1,X4)
| ~ white(X1,X4)
| ~ dirty(X1,X4)
| ~ old(X1,X4)
| ~ agent(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ street(X1,X3)
| ~ lonely(X1,X3)
| ~ down(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ssSkC0 ),
c_0_36 ).
cnf(c_0_38,negated_conjecture,
( down(skc15,skc16,skc17)
| ssSkC0 ),
clause30 ).
cnf(c_0_39,negated_conjecture,
actual_world(skc15),
clause1 ).
cnf(c_0_40,negated_conjecture,
( event(skc15,skc16)
| ssSkC0 ),
clause10 ).
cnf(c_0_41,negated_conjecture,
( present(skc15,skc16)
| ssSkC0 ),
clause11 ).
cnf(c_0_42,negated_conjecture,
( barrel(skc15,skc16)
| ssSkC0 ),
clause12 ).
cnf(c_0_43,negated_conjecture,
( lonely(skc15,skc17)
| ssSkC0 ),
clause13 ).
cnf(c_0_44,negated_conjecture,
( street(skc15,skc17)
| ssSkC0 ),
clause14 ).
cnf(c_0_45,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ down(X1,X3,X5)
| ~ barrel(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ of(X1,X4,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X3,X2)
| ~ agent(X1,X3,X2)
| ~ old(X1,X2)
| ~ dirty(X1,X2)
| ~ white(X1,X2)
| ~ chevy(X1,X2)
| ~ city(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause36]) ).
cnf(c_0_46,negated_conjecture,
( ~ city(skc15,X2)
| ~ chevy(skc15,X2)
| ~ white(skc15,X2)
| ~ dirty(skc15,X2)
| ~ old(skc15,X2)
| ~ placename(skc15,X1)
| ~ hollywood_placename(skc15,X1)
| ~ agent(skc15,skc16,X2)
| ~ in(skc15,skc16,X2)
| ~ of(skc15,X1,X2)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),c_0_40]),c_0_41]),c_0_42]),c_0_43]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( of(skc15,skc19,skc18)
| ssSkC0 ),
clause29 ).
cnf(c_0_48,negated_conjecture,
( city(skc15,skc18)
| ssSkC0 ),
clause3 ).
cnf(c_0_49,negated_conjecture,
( chevy(skc15,skc18)
| ssSkC0 ),
clause4 ).
cnf(c_0_50,negated_conjecture,
( white(skc15,skc18)
| ssSkC0 ),
clause5 ).
cnf(c_0_51,negated_conjecture,
( dirty(skc15,skc18)
| ssSkC0 ),
clause6 ).
cnf(c_0_52,negated_conjecture,
( old(skc15,skc18)
| ssSkC0 ),
clause7 ).
cnf(c_0_53,negated_conjecture,
( placename(skc15,skc19)
| ssSkC0 ),
clause8 ).
cnf(c_0_54,negated_conjecture,
( hollywood_placename(skc15,skc19)
| ssSkC0 ),
clause9 ).
cnf(c_0_55,negated_conjecture,
( agent(skc15,skc16,skc18)
| ssSkC0 ),
clause27 ).
cnf(c_0_56,negated_conjecture,
( in(skc15,skc16,skc18)
| ssSkC0 ),
clause28 ).
cnf(c_0_57,negated_conjecture,
( ~ ssSkC0
| down(skc10,skc11,skc14) ),
inference(fof_simplification,[status(thm)],[clause31]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssSkC0
| street(skc10,skc14) ),
inference(fof_simplification,[status(thm)],[clause19]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssSkC0
| lonely(skc10,skc14) ),
inference(fof_simplification,[status(thm)],[clause18]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssSkC0
| barrel(skc10,skc11) ),
inference(fof_simplification,[status(thm)],[clause17]) ).
cnf(c_0_61,negated_conjecture,
( ~ ssSkC0
| present(skc10,skc11) ),
inference(fof_simplification,[status(thm)],[clause16]) ).
cnf(c_0_62,negated_conjecture,
( ~ ssSkC0
| event(skc10,skc11) ),
inference(fof_simplification,[status(thm)],[clause15]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ down(X1,X3,X5)
| ~ barrel(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ of(X1,X4,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X3,X2)
| ~ agent(X1,X3,X2)
| ~ old(X1,X2)
| ~ dirty(X1,X2)
| ~ white(X1,X2)
| ~ chevy(X1,X2)
| ~ city(X1,X2) ),
c_0_45 ).
cnf(c_0_64,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]),c_0_50]),c_0_51]),c_0_52]),c_0_53]),c_0_54]),c_0_55]),c_0_56]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssSkC0
| down(skc10,skc11,skc14) ),
c_0_57 ).
cnf(c_0_66,negated_conjecture,
( ~ ssSkC0
| street(skc10,skc14) ),
c_0_58 ).
cnf(c_0_67,negated_conjecture,
( ~ ssSkC0
| lonely(skc10,skc14) ),
c_0_59 ).
cnf(c_0_68,negated_conjecture,
( ~ ssSkC0
| barrel(skc10,skc11) ),
c_0_60 ).
cnf(c_0_69,negated_conjecture,
( ~ ssSkC0
| present(skc10,skc11) ),
c_0_61 ).
cnf(c_0_70,negated_conjecture,
( ~ ssSkC0
| event(skc10,skc11) ),
c_0_62 ).
cnf(c_0_71,negated_conjecture,
( ~ ssSkC0
| of(skc10,skc13,skc12) ),
inference(fof_simplification,[status(thm)],[clause34]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssSkC0
| in(skc10,skc11,skc12) ),
inference(fof_simplification,[status(thm)],[clause32]) ).
cnf(c_0_73,negated_conjecture,
( ~ ssSkC0
| agent(skc10,skc11,skc12) ),
inference(fof_simplification,[status(thm)],[clause33]) ).
cnf(c_0_74,negated_conjecture,
( ~ ssSkC0
| hollywood_placename(skc10,skc13) ),
inference(fof_simplification,[status(thm)],[clause25]) ).
cnf(c_0_75,negated_conjecture,
( ~ ssSkC0
| placename(skc10,skc13) ),
inference(fof_simplification,[status(thm)],[clause26]) ).
cnf(c_0_76,negated_conjecture,
( ~ ssSkC0
| old(skc10,skc12) ),
inference(fof_simplification,[status(thm)],[clause20]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssSkC0
| dirty(skc10,skc12) ),
inference(fof_simplification,[status(thm)],[clause21]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssSkC0
| white(skc10,skc12) ),
inference(fof_simplification,[status(thm)],[clause22]) ).
cnf(c_0_79,negated_conjecture,
( ~ ssSkC0
| chevy(skc10,skc12) ),
inference(fof_simplification,[status(thm)],[clause23]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssSkC0
| city(skc10,skc12) ),
inference(fof_simplification,[status(thm)],[clause24]) ).
cnf(c_0_81,negated_conjecture,
( ~ actual_world(X1)
| ~ city(X1,X5)
| ~ chevy(X1,X5)
| ~ white(X1,X5)
| ~ dirty(X1,X5)
| ~ old(X1,X5)
| ~ placename(X1,X4)
| ~ hollywood_placename(X1,X4)
| ~ event(X1,X2)
| ~ present(X1,X2)
| ~ barrel(X1,X2)
| ~ lonely(X1,X3)
| ~ street(X1,X3)
| ~ agent(X1,X2,X5)
| ~ in(X1,X2,X5)
| ~ of(X1,X4,X5)
| ~ down(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]) ).
cnf(c_0_82,negated_conjecture,
down(skc10,skc11,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_64])]) ).
cnf(c_0_83,negated_conjecture,
street(skc10,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_64])]) ).
cnf(c_0_84,negated_conjecture,
lonely(skc10,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_64])]) ).
cnf(c_0_85,negated_conjecture,
barrel(skc10,skc11),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_64])]) ).
cnf(c_0_86,negated_conjecture,
present(skc10,skc11),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_64])]) ).
cnf(c_0_87,negated_conjecture,
event(skc10,skc11),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_64])]) ).
cnf(c_0_88,negated_conjecture,
actual_world(skc10),
clause2 ).
cnf(c_0_89,negated_conjecture,
( ~ ssSkC0
| of(skc10,skc13,skc12) ),
c_0_71 ).
cnf(c_0_90,negated_conjecture,
( ~ ssSkC0
| in(skc10,skc11,skc12) ),
c_0_72 ).
cnf(c_0_91,negated_conjecture,
( ~ ssSkC0
| agent(skc10,skc11,skc12) ),
c_0_73 ).
cnf(c_0_92,negated_conjecture,
( ~ ssSkC0
| hollywood_placename(skc10,skc13) ),
c_0_74 ).
cnf(c_0_93,negated_conjecture,
( ~ ssSkC0
| placename(skc10,skc13) ),
c_0_75 ).
cnf(c_0_94,negated_conjecture,
( ~ ssSkC0
| old(skc10,skc12) ),
c_0_76 ).
cnf(c_0_95,negated_conjecture,
( ~ ssSkC0
| dirty(skc10,skc12) ),
c_0_77 ).
cnf(c_0_96,negated_conjecture,
( ~ ssSkC0
| white(skc10,skc12) ),
c_0_78 ).
cnf(c_0_97,negated_conjecture,
( ~ ssSkC0
| chevy(skc10,skc12) ),
c_0_79 ).
cnf(c_0_98,negated_conjecture,
( ~ ssSkC0
| city(skc10,skc12) ),
c_0_80 ).
cnf(c_0_99,negated_conjecture,
( ~ city(skc10,X2)
| ~ chevy(skc10,X2)
| ~ white(skc10,X2)
| ~ dirty(skc10,X2)
| ~ old(skc10,X2)
| ~ placename(skc10,X1)
| ~ hollywood_placename(skc10,X1)
| ~ agent(skc10,skc11,X2)
| ~ in(skc10,skc11,X2)
| ~ of(skc10,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84]),c_0_85]),c_0_86]),c_0_87]),c_0_88])]) ).
cnf(c_0_100,negated_conjecture,
of(skc10,skc13,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_64])]) ).
cnf(c_0_101,negated_conjecture,
in(skc10,skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_64])]) ).
cnf(c_0_102,negated_conjecture,
agent(skc10,skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_64])]) ).
cnf(c_0_103,negated_conjecture,
hollywood_placename(skc10,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_64])]) ).
cnf(c_0_104,negated_conjecture,
placename(skc10,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_64])]) ).
cnf(c_0_105,negated_conjecture,
old(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_64])]) ).
cnf(c_0_106,negated_conjecture,
dirty(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_64])]) ).
cnf(c_0_107,negated_conjecture,
white(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_64])]) ).
cnf(c_0_108,negated_conjecture,
chevy(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_64])]) ).
cnf(c_0_109,negated_conjecture,
city(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_64])]) ).
cnf(c_0_110,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101]),c_0_102]),c_0_103]),c_0_104]),c_0_105]),c_0_106]),c_0_107]),c_0_108]),c_0_109])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP122-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n014.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 01:41:34 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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/benchmark/theBenchmark.p
% 0.16/0.45 % Version: 3.5.1
% 0.16/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % Starting sh5l with 300s (1) cores
% 0.16/0.45 % new_bool_1 with pid 2889378 completed with status 0
% 0.16/0.45 % Result found by new_bool_1
% 0.16/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.16/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.45 % SubtermCWHack with pid 2889386 completed with status 0
% 0.16/0.45 % Result found by SubtermCWHack
% 0.16/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.16/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.45 % Preprocessing time : 0.002 s
% 0.16/0.45
% 0.16/0.45 % Proof found!
% 0.16/0.45 % SZS status Unsatisfiable
% 0.16/0.45 % SZS output start CNFRefutation
% See solution above
% 0.16/0.45 % Parsed axioms : 36
% 0.16/0.45 % Removed by relevancy pruning/SinE : 0
% 0.16/0.45 % Initial clauses : 36
% 0.16/0.45 % Removed in clause preprocessing : 0
% 0.16/0.45 % Initial clauses in saturation : 36
% 0.16/0.45 % Processed clauses : 55
% 0.16/0.45 % ...of these trivial : 0
% 0.16/0.45 % ...subsumed : 0
% 0.16/0.45 % ...remaining for further processing : 55
% 0.16/0.45 % Other redundant clauses eliminated : 0
% 0.16/0.45 % Clauses deleted for lack of memory : 0
% 0.16/0.45 % Backward-subsumed : 0
% 0.16/0.45 % Backward-rewritten : 34
% 0.16/0.45 % Generated clauses : 5
% 0.16/0.45 % ...of the previous two non-redundant : 20
% 0.16/0.45 % ...aggressively subsumed : 0
% 0.16/0.45 % Contextual simplify-reflections : 14
% 0.16/0.45 % Paramodulations : 5
% 0.16/0.45 % Factorizations : 0
% 0.16/0.45 % NegExts : 0
% 0.16/0.45 % Equation resolutions : 0
% 0.16/0.45 % Disequality decompositions : 0
% 0.16/0.45 % Total rewrite steps : 52
% 0.16/0.45 % ...of those cached : 35
% 0.16/0.45 % Propositional unsat checks : 0
% 0.16/0.45 % Propositional check models : 0
% 0.16/0.45 % Propositional check unsatisfiable : 0
% 0.16/0.45 % Propositional clauses : 0
% 0.16/0.45 % Propositional clauses after purity: 0
% 0.16/0.45 % Propositional unsat core size : 0
% 0.16/0.45 % Propositional preprocessing time : 0.000
% 0.16/0.45 % Propositional encoding time : 0.000
% 0.16/0.45 % Propositional solver time : 0.000
% 0.16/0.45 % Success case prop preproc time : 0.000
% 0.16/0.45 % Success case prop encoding time : 0.000
% 0.16/0.45 % Success case prop solver time : 0.000
% 0.16/0.45 % Current number of processed clauses : 21
% 0.16/0.45 % Positive orientable unit clauses : 19
% 0.16/0.45 % Positive unorientable unit clauses: 0
% 0.16/0.45 % Negative unit clauses : 0
% 0.16/0.45 % Non-unit-clauses : 2
% 0.16/0.45 % Current number of unprocessed clauses: 0
% 0.16/0.45 % ...number of literals in the above : 0
% 0.16/0.45 % Current number of archived formulas : 0
% 0.16/0.45 % Current number of archived clauses : 34
% 0.16/0.45 % Clause-clause subsumption calls (NU) : 136
% 0.16/0.45 % Rec. Clause-clause subsumption calls : 115
% 0.16/0.45 % Non-unit clause-clause subsumptions : 14
% 0.16/0.45 % Unit Clause-clause subsumption calls : 0
% 0.16/0.45 % Rewrite failures with RHS unbound : 0
% 0.16/0.45 % BW rewrite match attempts : 1
% 0.16/0.45 % BW rewrite match successes : 1
% 0.16/0.45 % Condensation attempts : 0
% 0.16/0.45 % Condensation successes : 0
% 0.16/0.45 % Termbank termtop insertions : 1558
% 0.16/0.45 % Search garbage collected termcells : 117
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.008 s
% 0.16/0.45 % System time : 0.003 s
% 0.16/0.45 % Total time : 0.011 s
% 0.16/0.45 % Maximum resident set size: 3664 pages
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.010 s
% 0.16/0.45 % System time : 0.008 s
% 0.16/0.45 % Total time : 0.018 s
% 0.16/0.45 % Maximum resident set size: 4608 pages
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------