%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NLP009-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 : n016.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:36:31 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 54
% Syntax : Number of clauses : 160 ( 49 unt; 40 nHn; 160 RR)
% Number of literals : 531 ( 16 equ; 338 neg)
% Maximal clause size : 27 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 23 ( 21 usr; 2 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 14 con; 0-0 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause53,negated_conjecture,
( ~ seat(X7)
| ~ furniture(X7)
| ~ front(X7)
| ~ in(X6,X7)
| ~ in(X5,X7)
| ~ young(X6)
| ~ man(X6)
| ~ fellow(X6)
| ~ fellow(X5)
| ~ man(X5)
| ~ young(X5)
| ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X1)
| ~ barrel(X3,X2)
| ~ event(X3)
| ~ chevy(X2)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ old(X2)
| ~ lonely(X1)
| ~ way(X1)
| ~ street(X1)
| X6 = X5
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause53) ).
cnf(clause54,negated_conjecture,
( ~ ssSkC0
| ~ seat(X7)
| ~ furniture(X7)
| ~ front(X7)
| ~ in(X6,X7)
| ~ in(X5,X7)
| ~ young(X6)
| ~ man(X6)
| ~ fellow(X6)
| ~ fellow(X5)
| ~ man(X5)
| ~ young(X5)
| ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X2)
| ~ barrel(X3,X1)
| ~ event(X3)
| ~ street(X2)
| ~ way(X2)
| ~ lonely(X2)
| ~ old(X1)
| ~ dirty(X1)
| ~ white(X1)
| ~ car(X1)
| ~ chevy(X1)
| X6 = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause54) ).
cnf(clause44,negated_conjecture,
( in(skc21,skc23)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause44) ).
cnf(clause7,negated_conjecture,
fellow(skc21),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).
cnf(clause5,negated_conjecture,
seat(skc23),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).
cnf(clause22,negated_conjecture,
( young(skc21)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause22) ).
cnf(clause23,negated_conjecture,
( man(skc21)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause23) ).
cnf(clause26,negated_conjecture,
( front(skc23)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause26) ).
cnf(clause27,negated_conjecture,
( furniture(skc23)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).
cnf(clause51,negated_conjecture,
( skc22 != skc21
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause51) ).
cnf(clause45,negated_conjecture,
( in(skc22,skc23)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause45) ).
cnf(clause6,negated_conjecture,
young(skc22),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).
cnf(clause24,negated_conjecture,
( fellow(skc22)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause24) ).
cnf(clause25,negated_conjecture,
( man(skc22)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause25) ).
cnf(clause43,negated_conjecture,
( in(skc26,skc27)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause43) ).
cnf(clause2,negated_conjecture,
event(skc26),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
cnf(clause1,negated_conjecture,
hollywood(skc27),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
cnf(clause21,negated_conjecture,
( city(skc27)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause21) ).
cnf(clause42,negated_conjecture,
( down(skc26,skc25)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause42) ).
cnf(clause3,negated_conjecture,
street(skc25),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
cnf(clause19,negated_conjecture,
( lonely(skc25)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause19) ).
cnf(clause20,negated_conjecture,
( way(skc25)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).
cnf(clause50,negated_conjecture,
( ~ ssSkC0
| in(skc15,skc16) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause50) ).
cnf(clause41,negated_conjecture,
( barrel(skc26,skc24)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause41) ).
cnf(clause4,negated_conjecture,
old(skc24),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
cnf(clause15,negated_conjecture,
( chevy(skc24)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause15) ).
cnf(clause16,negated_conjecture,
( car(skc24)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause16) ).
cnf(clause17,negated_conjecture,
( white(skc24)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause17) ).
cnf(clause18,negated_conjecture,
( dirty(skc24)
| ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause18) ).
cnf(clause40,negated_conjecture,
( ~ ssSkC0
| furniture(skc16) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause40) ).
cnf(clause39,negated_conjecture,
( ~ ssSkC0
| front(skc16) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause39) ).
cnf(clause38,negated_conjecture,
( ~ ssSkC0
| man(skc15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause38) ).
cnf(clause37,negated_conjecture,
( ~ ssSkC0
| fellow(skc15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause37) ).
cnf(clause49,negated_conjecture,
( ~ ssSkC0
| in(skc14,skc16) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause49) ).
cnf(clause36,negated_conjecture,
( ~ ssSkC0
| man(skc14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause36) ).
cnf(clause35,negated_conjecture,
( ~ ssSkC0
| young(skc14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause35) ).
cnf(clause52,negated_conjecture,
( ~ ssSkC0
| skc15 != skc14 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause52) ).
cnf(clause13,negated_conjecture,
young(skc15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause13) ).
cnf(clause12,negated_conjecture,
seat(skc16),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause12) ).
cnf(clause48,negated_conjecture,
( ~ ssSkC0
| in(skc19,skc20) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause48) ).
cnf(clause34,negated_conjecture,
( ~ ssSkC0
| city(skc20) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause34) ).
cnf(clause14,negated_conjecture,
fellow(skc14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).
cnf(clause47,negated_conjecture,
( ~ ssSkC0
| down(skc19,skc17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause47) ).
cnf(clause29,negated_conjecture,
( ~ ssSkC0
| way(skc17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).
cnf(clause28,negated_conjecture,
( ~ ssSkC0
| street(skc17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause28) ).
cnf(clause9,negated_conjecture,
event(skc19),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause9) ).
cnf(clause8,negated_conjecture,
hollywood(skc20),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
cnf(clause46,negated_conjecture,
( ~ ssSkC0
| barrel(skc19,skc18) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause46) ).
cnf(clause31,negated_conjecture,
( ~ ssSkC0
| dirty(skc18) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause31) ).
cnf(clause32,negated_conjecture,
( ~ ssSkC0
| white(skc18) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause32) ).
cnf(clause33,negated_conjecture,
( ~ ssSkC0
| car(skc18) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause33) ).
cnf(clause30,negated_conjecture,
( ~ ssSkC0
| old(skc18) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).
cnf(clause11,negated_conjecture,
lonely(skc17),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause11) ).
cnf(clause10,negated_conjecture,
chevy(skc18),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause10) ).
cnf(c_0_54,negated_conjecture,
( ~ seat(X7)
| ~ furniture(X7)
| ~ front(X7)
| ~ in(X6,X7)
| ~ in(X5,X7)
| ~ young(X6)
| ~ man(X6)
| ~ fellow(X6)
| ~ fellow(X5)
| ~ man(X5)
| ~ young(X5)
| ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X1)
| ~ barrel(X3,X2)
| ~ event(X3)
| ~ chevy(X2)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ old(X2)
| ~ lonely(X1)
| ~ way(X1)
| ~ street(X1)
| X6 = X5
| ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause53]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssSkC0
| ~ seat(X7)
| ~ furniture(X7)
| ~ front(X7)
| ~ in(X6,X7)
| ~ in(X5,X7)
| ~ young(X6)
| ~ man(X6)
| ~ fellow(X6)
| ~ fellow(X5)
| ~ man(X5)
| ~ young(X5)
| ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X2)
| ~ barrel(X3,X1)
| ~ event(X3)
| ~ street(X2)
| ~ way(X2)
| ~ lonely(X2)
| ~ old(X1)
| ~ dirty(X1)
| ~ white(X1)
| ~ car(X1)
| ~ chevy(X1)
| X6 = X5 ),
inference(fof_simplification,[status(thm)],[clause54]) ).
cnf(c_0_56,negated_conjecture,
( ~ seat(X7)
| ~ furniture(X7)
| ~ front(X7)
| ~ in(X6,X7)
| ~ in(X5,X7)
| ~ young(X6)
| ~ man(X6)
| ~ fellow(X6)
| ~ fellow(X5)
| ~ man(X5)
| ~ young(X5)
| ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X1)
| ~ barrel(X3,X2)
| ~ event(X3)
| ~ chevy(X2)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ old(X2)
| ~ lonely(X1)
| ~ way(X1)
| ~ street(X1)
| X6 = X5
| ssSkC0 ),
c_0_54 ).
cnf(c_0_57,negated_conjecture,
( ~ ssSkC0
| ~ seat(X7)
| ~ furniture(X7)
| ~ front(X7)
| ~ in(X6,X7)
| ~ in(X5,X7)
| ~ young(X6)
| ~ man(X6)
| ~ fellow(X6)
| ~ fellow(X5)
| ~ man(X5)
| ~ young(X5)
| ~ hollywood(X4)
| ~ city(X4)
| ~ in(X3,X4)
| ~ down(X3,X2)
| ~ barrel(X3,X1)
| ~ event(X3)
| ~ street(X2)
| ~ way(X2)
| ~ lonely(X2)
| ~ old(X1)
| ~ dirty(X1)
| ~ white(X1)
| ~ car(X1)
| ~ chevy(X1)
| X6 = X5 ),
c_0_55 ).
cnf(c_0_58,negated_conjecture,
( ~ hollywood(X5)
| ~ event(X4)
| ~ street(X6)
| ~ old(X7)
| ~ seat(X3)
| ~ young(X1)
| ~ young(X2)
| ~ fellow(X1)
| ~ fellow(X2)
| ~ chevy(X7)
| ~ lonely(X6)
| ~ car(X7)
| ~ white(X7)
| ~ dirty(X7)
| ~ way(X6)
| ~ city(X5)
| ~ man(X1)
| ~ man(X2)
| ~ front(X3)
| ~ furniture(X3)
| ~ barrel(X4,X7)
| ~ down(X4,X6)
| ~ in(X4,X5)
| ~ in(X1,X3)
| ~ in(X2,X3)
| X1 = X2 ),
inference(csr,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
( in(skc21,skc23)
| ssSkC0 ),
clause44 ).
cnf(c_0_60,negated_conjecture,
fellow(skc21),
clause7 ).
cnf(c_0_61,negated_conjecture,
seat(skc23),
clause5 ).
cnf(c_0_62,negated_conjecture,
( young(skc21)
| ssSkC0 ),
clause22 ).
cnf(c_0_63,negated_conjecture,
( man(skc21)
| ssSkC0 ),
clause23 ).
cnf(c_0_64,negated_conjecture,
( front(skc23)
| ssSkC0 ),
clause26 ).
cnf(c_0_65,negated_conjecture,
( furniture(skc23)
| ssSkC0 ),
clause27 ).
cnf(c_0_66,negated_conjecture,
( skc22 != skc21
| ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause51]) ).
cnf(c_0_67,negated_conjecture,
( ~ hollywood(X3)
| ~ event(X2)
| ~ street(X4)
| ~ old(X5)
| ~ young(X1)
| ~ fellow(X1)
| ~ chevy(X5)
| ~ lonely(X4)
| ~ car(X5)
| ~ white(X5)
| ~ dirty(X5)
| ~ way(X4)
| ~ city(X3)
| ~ man(X1)
| ~ barrel(X2,X5)
| ~ down(X2,X4)
| ~ in(X2,X3)
| ~ in(X1,skc23)
| ssSkC0
| X1 = skc21 ),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]),c_0_62]),c_0_63]),c_0_64]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( in(skc22,skc23)
| ssSkC0 ),
clause45 ).
cnf(c_0_69,negated_conjecture,
young(skc22),
clause6 ).
cnf(c_0_70,negated_conjecture,
( fellow(skc22)
| ssSkC0 ),
clause24 ).
cnf(c_0_71,negated_conjecture,
( man(skc22)
| ssSkC0 ),
clause25 ).
cnf(c_0_72,negated_conjecture,
( skc22 != skc21
| ssSkC0 ),
c_0_66 ).
cnf(c_0_73,negated_conjecture,
( ~ hollywood(X2)
| ~ event(X1)
| ~ street(X3)
| ~ old(X4)
| ~ chevy(X4)
| ~ lonely(X3)
| ~ car(X4)
| ~ white(X4)
| ~ dirty(X4)
| ~ way(X3)
| ~ city(X2)
| ~ barrel(X1,X4)
| ~ down(X1,X3)
| ~ in(X1,X2)
| ssSkC0 ),
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_67,c_0_68]),c_0_69])]),c_0_70]),c_0_71]),c_0_72]) ).
cnf(c_0_74,negated_conjecture,
( in(skc26,skc27)
| ssSkC0 ),
clause43 ).
cnf(c_0_75,negated_conjecture,
event(skc26),
clause2 ).
cnf(c_0_76,negated_conjecture,
hollywood(skc27),
clause1 ).
cnf(c_0_77,negated_conjecture,
( city(skc27)
| ssSkC0 ),
clause21 ).
cnf(c_0_78,negated_conjecture,
( ~ street(X1)
| ~ old(X2)
| ~ chevy(X2)
| ~ lonely(X1)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ way(X1)
| ~ barrel(skc26,X2)
| ~ down(skc26,X1)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76])]),c_0_77]) ).
cnf(c_0_79,negated_conjecture,
( down(skc26,skc25)
| ssSkC0 ),
clause42 ).
cnf(c_0_80,negated_conjecture,
street(skc25),
clause3 ).
cnf(c_0_81,negated_conjecture,
( lonely(skc25)
| ssSkC0 ),
clause19 ).
cnf(c_0_82,negated_conjecture,
( way(skc25)
| ssSkC0 ),
clause20 ).
cnf(c_0_83,negated_conjecture,
( ~ ssSkC0
| in(skc15,skc16) ),
inference(fof_simplification,[status(thm)],[clause50]) ).
cnf(c_0_84,negated_conjecture,
( ~ old(X1)
| ~ chevy(X1)
| ~ car(X1)
| ~ white(X1)
| ~ dirty(X1)
| ~ barrel(skc26,X1)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]),c_0_81]),c_0_82]) ).
cnf(c_0_85,negated_conjecture,
( barrel(skc26,skc24)
| ssSkC0 ),
clause41 ).
cnf(c_0_86,negated_conjecture,
old(skc24),
clause4 ).
cnf(c_0_87,negated_conjecture,
( chevy(skc24)
| ssSkC0 ),
clause15 ).
cnf(c_0_88,negated_conjecture,
( car(skc24)
| ssSkC0 ),
clause16 ).
cnf(c_0_89,negated_conjecture,
( white(skc24)
| ssSkC0 ),
clause17 ).
cnf(c_0_90,negated_conjecture,
( dirty(skc24)
| ssSkC0 ),
clause18 ).
cnf(c_0_91,negated_conjecture,
( ~ ssSkC0
| furniture(skc16) ),
inference(fof_simplification,[status(thm)],[clause40]) ).
cnf(c_0_92,negated_conjecture,
( ~ ssSkC0
| front(skc16) ),
inference(fof_simplification,[status(thm)],[clause39]) ).
cnf(c_0_93,negated_conjecture,
( ~ ssSkC0
| man(skc15) ),
inference(fof_simplification,[status(thm)],[clause38]) ).
cnf(c_0_94,negated_conjecture,
( ~ ssSkC0
| fellow(skc15) ),
inference(fof_simplification,[status(thm)],[clause37]) ).
cnf(c_0_95,negated_conjecture,
( ~ ssSkC0
| in(skc15,skc16) ),
c_0_83 ).
cnf(c_0_96,negated_conjecture,
ssSkC0,
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_84,c_0_85]),c_0_86])]),c_0_87]),c_0_88]),c_0_89]),c_0_90]) ).
cnf(c_0_97,negated_conjecture,
( ~ ssSkC0
| furniture(skc16) ),
c_0_91 ).
cnf(c_0_98,negated_conjecture,
( ~ ssSkC0
| front(skc16) ),
c_0_92 ).
cnf(c_0_99,negated_conjecture,
( ~ ssSkC0
| man(skc15) ),
c_0_93 ).
cnf(c_0_100,negated_conjecture,
( ~ ssSkC0
| fellow(skc15) ),
c_0_94 ).
cnf(c_0_101,negated_conjecture,
( ~ ssSkC0
| in(skc14,skc16) ),
inference(fof_simplification,[status(thm)],[clause49]) ).
cnf(c_0_102,negated_conjecture,
( ~ ssSkC0
| man(skc14) ),
inference(fof_simplification,[status(thm)],[clause36]) ).
cnf(c_0_103,negated_conjecture,
( ~ ssSkC0
| young(skc14) ),
inference(fof_simplification,[status(thm)],[clause35]) ).
cnf(c_0_104,negated_conjecture,
( ~ ssSkC0
| skc15 != skc14 ),
inference(fof_simplification,[status(thm)],[clause52]) ).
cnf(c_0_105,negated_conjecture,
in(skc15,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_106,negated_conjecture,
furniture(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_96])]) ).
cnf(c_0_107,negated_conjecture,
front(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_96])]) ).
cnf(c_0_108,negated_conjecture,
man(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_96])]) ).
cnf(c_0_109,negated_conjecture,
fellow(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_96])]) ).
cnf(c_0_110,negated_conjecture,
young(skc15),
clause13 ).
cnf(c_0_111,negated_conjecture,
seat(skc16),
clause12 ).
cnf(c_0_112,negated_conjecture,
( ~ ssSkC0
| in(skc14,skc16) ),
c_0_101 ).
cnf(c_0_113,negated_conjecture,
( ~ ssSkC0
| man(skc14) ),
c_0_102 ).
cnf(c_0_114,negated_conjecture,
( ~ ssSkC0
| young(skc14) ),
c_0_103 ).
cnf(c_0_115,negated_conjecture,
( ~ ssSkC0
| skc15 != skc14 ),
c_0_104 ).
cnf(c_0_116,negated_conjecture,
( ~ ssSkC0
| in(skc19,skc20) ),
inference(fof_simplification,[status(thm)],[clause48]) ).
cnf(c_0_117,negated_conjecture,
( ~ ssSkC0
| city(skc20) ),
inference(fof_simplification,[status(thm)],[clause34]) ).
cnf(c_0_118,negated_conjecture,
( ~ hollywood(X3)
| ~ event(X2)
| ~ street(X4)
| ~ old(X5)
| ~ young(X1)
| ~ fellow(X1)
| ~ chevy(X5)
| ~ lonely(X4)
| ~ car(X5)
| ~ white(X5)
| ~ dirty(X5)
| ~ way(X4)
| ~ city(X3)
| ~ man(X1)
| ~ barrel(X2,X5)
| ~ down(X2,X4)
| ~ in(X2,X3)
| ~ in(X1,skc16)
| X1 = skc15 ),
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_58,c_0_105]),c_0_106]),c_0_107]),c_0_108]),c_0_109]),c_0_110]),c_0_111])]) ).
cnf(c_0_119,negated_conjecture,
in(skc14,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_96])]) ).
cnf(c_0_120,negated_conjecture,
man(skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_96])]) ).
cnf(c_0_121,negated_conjecture,
fellow(skc14),
clause14 ).
cnf(c_0_122,negated_conjecture,
young(skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_114,c_0_96])]) ).
cnf(c_0_123,negated_conjecture,
skc14 != skc15,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_96])]) ).
cnf(c_0_124,negated_conjecture,
( ~ ssSkC0
| in(skc19,skc20) ),
c_0_116 ).
cnf(c_0_125,negated_conjecture,
( ~ ssSkC0
| city(skc20) ),
c_0_117 ).
cnf(c_0_126,negated_conjecture,
( ~ ssSkC0
| down(skc19,skc17) ),
inference(fof_simplification,[status(thm)],[clause47]) ).
cnf(c_0_127,negated_conjecture,
( ~ ssSkC0
| way(skc17) ),
inference(fof_simplification,[status(thm)],[clause29]) ).
cnf(c_0_128,negated_conjecture,
( ~ ssSkC0
| street(skc17) ),
inference(fof_simplification,[status(thm)],[clause28]) ).
cnf(c_0_129,negated_conjecture,
( ~ hollywood(X2)
| ~ event(X1)
| ~ street(X3)
| ~ old(X4)
| ~ chevy(X4)
| ~ lonely(X3)
| ~ car(X4)
| ~ white(X4)
| ~ dirty(X4)
| ~ way(X3)
| ~ city(X2)
| ~ barrel(X1,X4)
| ~ down(X1,X3)
| ~ in(X1,X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]),c_0_121]),c_0_122])]),c_0_123]) ).
cnf(c_0_130,negated_conjecture,
in(skc19,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_96])]) ).
cnf(c_0_131,negated_conjecture,
city(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_96])]) ).
cnf(c_0_132,negated_conjecture,
event(skc19),
clause9 ).
cnf(c_0_133,negated_conjecture,
hollywood(skc20),
clause8 ).
cnf(c_0_134,negated_conjecture,
( ~ ssSkC0
| down(skc19,skc17) ),
c_0_126 ).
cnf(c_0_135,negated_conjecture,
( ~ ssSkC0
| way(skc17) ),
c_0_127 ).
cnf(c_0_136,negated_conjecture,
( ~ ssSkC0
| street(skc17) ),
c_0_128 ).
cnf(c_0_137,negated_conjecture,
( ~ ssSkC0
| barrel(skc19,skc18) ),
inference(fof_simplification,[status(thm)],[clause46]) ).
cnf(c_0_138,negated_conjecture,
( ~ ssSkC0
| dirty(skc18) ),
inference(fof_simplification,[status(thm)],[clause31]) ).
cnf(c_0_139,negated_conjecture,
( ~ ssSkC0
| white(skc18) ),
inference(fof_simplification,[status(thm)],[clause32]) ).
cnf(c_0_140,negated_conjecture,
( ~ ssSkC0
| car(skc18) ),
inference(fof_simplification,[status(thm)],[clause33]) ).
cnf(c_0_141,negated_conjecture,
( ~ ssSkC0
| old(skc18) ),
inference(fof_simplification,[status(thm)],[clause30]) ).
cnf(c_0_142,negated_conjecture,
( ~ street(X1)
| ~ old(X2)
| ~ chevy(X2)
| ~ lonely(X1)
| ~ car(X2)
| ~ white(X2)
| ~ dirty(X2)
| ~ way(X1)
| ~ barrel(skc19,X2)
| ~ down(skc19,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_131]),c_0_132]),c_0_133])]) ).
cnf(c_0_143,negated_conjecture,
down(skc19,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_96])]) ).
cnf(c_0_144,negated_conjecture,
way(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_135,c_0_96])]) ).
cnf(c_0_145,negated_conjecture,
lonely(skc17),
clause11 ).
cnf(c_0_146,negated_conjecture,
street(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_136,c_0_96])]) ).
cnf(c_0_147,negated_conjecture,
( ~ ssSkC0
| barrel(skc19,skc18) ),
c_0_137 ).
cnf(c_0_148,negated_conjecture,
( ~ ssSkC0
| dirty(skc18) ),
c_0_138 ).
cnf(c_0_149,negated_conjecture,
( ~ ssSkC0
| white(skc18) ),
c_0_139 ).
cnf(c_0_150,negated_conjecture,
( ~ ssSkC0
| car(skc18) ),
c_0_140 ).
cnf(c_0_151,negated_conjecture,
( ~ ssSkC0
| old(skc18) ),
c_0_141 ).
cnf(c_0_152,negated_conjecture,
( ~ old(X1)
| ~ chevy(X1)
| ~ car(X1)
| ~ white(X1)
| ~ dirty(X1)
| ~ barrel(skc19,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_144]),c_0_145]),c_0_146])]) ).
cnf(c_0_153,negated_conjecture,
barrel(skc19,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_147,c_0_96])]) ).
cnf(c_0_154,negated_conjecture,
dirty(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_148,c_0_96])]) ).
cnf(c_0_155,negated_conjecture,
white(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_96])]) ).
cnf(c_0_156,negated_conjecture,
car(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_96])]) ).
cnf(c_0_157,negated_conjecture,
chevy(skc18),
clause10 ).
cnf(c_0_158,negated_conjecture,
old(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_96])]) ).
cnf(c_0_159,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(spm,[status(thm)],[c_0_152,c_0_153]),c_0_154]),c_0_155]),c_0_156]),c_0_157]),c_0_158])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP009-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.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 01:36:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1291500 completed with status 0
% 0.13/0.43 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.13/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.43 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1291506 completed with status 0
% 0.13/0.43 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.13/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43 % Presaturation interreduction done
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Unsatisfiable
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 54
% 0.13/0.43 % Removed by relevancy pruning/SinE : 0
% 0.13/0.43 % Initial clauses : 54
% 0.13/0.43 % Removed in clause preprocessing : 0
% 0.13/0.43 % Initial clauses in saturation : 54
% 0.13/0.43 % Processed clauses : 135
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 0
% 0.13/0.43 % ...remaining for further processing : 135
% 0.13/0.43 % Other redundant clauses eliminated : 0
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 6
% 0.13/0.43 % Backward-rewritten : 40
% 0.13/0.43 % Generated clauses : 18
% 0.13/0.43 % ...of the previous two non-redundant : 36
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 15
% 0.13/0.43 % Paramodulations : 18
% 0.13/0.43 % Factorizations : 0
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 0
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 73
% 0.13/0.43 % ...of those cached : 45
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 36
% 0.13/0.43 % Positive orientable unit clauses : 33
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 1
% 0.13/0.43 % Non-unit-clauses : 2
% 0.13/0.43 % Current number of unprocessed clauses: 6
% 0.13/0.43 % ...number of literals in the above : 122
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 99
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 1069
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 632
% 0.13/0.43 % Non-unit clause-clause subsumptions : 21
% 0.13/0.43 % Unit Clause-clause subsumption calls : 11
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 1
% 0.13/0.43 % BW rewrite match successes : 1
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 2805
% 0.13/0.43 % Search garbage collected termcells : 146
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.003 s
% 0.13/0.43 % System time : 0.007 s
% 0.13/0.43 % Total time : 0.010 s
% 0.13/0.43 % Maximum resident set size: 3628 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.017 s
% 0.13/0.43 % System time : 0.018 s
% 0.13/0.43 % Total time : 0.036 s
% 0.13/0.43 % Maximum resident set size: 4608 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------