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