%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NLP001-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n010.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 5 04:50:03 PM UTC 2026
% Result : Unsatisfiable 1.23s 1.70s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 30
% Syntax : Number of clauses : 73 ( 21 unt; 20 nHn; 73 RR)
% Number of literals : 235 ( 0 equ; 149 neg)
% Maximal clause size : 15 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause29,negated_conjecture,
( ssSkC0
| ~ street(X1)
| ~ way(X1)
| ~ lonely(X1)
| ~ old(X2)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ chevy(X2)
| ~ event(X3)
| ~ barrel(X3,X2)
| ~ down(X3,X1)
| ~ in(X3,X4)
| ~ city(X4)
| ~ hollywood(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause29) ).
cnf(clause30,negated_conjecture,
( ~ chevy(X1)
| ~ car(X1)
| ~ white(X1)
| ~ dirty(X1)
| ~ old(X1)
| ~ lonely(X2)
| ~ way(X2)
| ~ street(X2)
| ~ event(X3)
| ~ barrel(X3,X1)
| ~ down(X3,X2)
| ~ in(X3,X4)
| ~ city(X4)
| ~ hollywood(X4)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause30) ).
cnf(clause22,negated_conjecture,
( city(skc11)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause22) ).
cnf(clause5,negated_conjecture,
hollywood(skc11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause15,negated_conjecture,
( ssSkC0
| city(skc15) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause15) ).
cnf(clause1,negated_conjecture,
hollywood(skc15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause17,negated_conjecture,
( way(skc8)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause17) ).
cnf(clause8,negated_conjecture,
lonely(skc8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
cnf(clause16,negated_conjecture,
( street(skc8)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause16) ).
cnf(clause14,negated_conjecture,
( ssSkC0
| way(skc13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause14) ).
cnf(clause3,negated_conjecture,
street(skc13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause13,negated_conjecture,
( ssSkC0
| lonely(skc13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause13) ).
cnf(clause19,negated_conjecture,
( dirty(skc9)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause19) ).
cnf(clause7,negated_conjecture,
chevy(skc9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
cnf(clause18,negated_conjecture,
( old(skc9)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause18) ).
cnf(clause21,negated_conjecture,
( car(skc9)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause21) ).
cnf(clause20,negated_conjecture,
( white(skc9)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause20) ).
cnf(clause12,negated_conjecture,
( ssSkC0
| dirty(skc12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause12) ).
cnf(clause4,negated_conjecture,
old(skc12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(clause9,negated_conjecture,
( ssSkC0
| chevy(skc12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause9) ).
cnf(clause10,negated_conjecture,
( ssSkC0
| car(skc12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).
cnf(clause11,negated_conjecture,
( ssSkC0
| white(skc12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).
cnf(clause6,negated_conjecture,
event(skc10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(clause26,negated_conjecture,
( barrel(skc10,skc9)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause26) ).
cnf(clause27,negated_conjecture,
( down(skc10,skc8)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause27) ).
cnf(clause28,negated_conjecture,
( in(skc10,skc11)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause28) ).
cnf(clause2,negated_conjecture,
event(skc14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause23,negated_conjecture,
( ssSkC0
| barrel(skc14,skc12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause23) ).
cnf(clause25,negated_conjecture,
( ssSkC0
| in(skc14,skc15) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause25) ).
cnf(clause24,negated_conjecture,
( ssSkC0
| down(skc14,skc13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause24) ).
cnf(c_0_30,negated_conjecture,
( ssSkC0
| ~ street(X1)
| ~ way(X1)
| ~ lonely(X1)
| ~ old(X2)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ chevy(X2)
| ~ event(X3)
| ~ barrel(X3,X2)
| ~ down(X3,X1)
| ~ in(X3,X4)
| ~ city(X4)
| ~ hollywood(X4) ),
clause29 ).
cnf(c_0_31,negated_conjecture,
( ~ chevy(X1)
| ~ car(X1)
| ~ white(X1)
| ~ dirty(X1)
| ~ old(X1)
| ~ lonely(X2)
| ~ way(X2)
| ~ street(X2)
| ~ event(X3)
| ~ barrel(X3,X1)
| ~ down(X3,X2)
| ~ in(X3,X4)
| ~ city(X4)
| ~ hollywood(X4)
| ~ ssSkC0 ),
clause30 ).
cnf(c_0_32,negated_conjecture,
( ~ in(X1,X2)
| ~ down(X1,X3)
| ~ barrel(X1,X4)
| ~ city(X2)
| ~ way(X3)
| ~ dirty(X4)
| ~ white(X4)
| ~ car(X4)
| ~ lonely(X3)
| ~ chevy(X4)
| ~ old(X4)
| ~ street(X3)
| ~ event(X1)
| ~ hollywood(X2) ),
inference(csr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( city(skc11)
| ~ ssSkC0 ),
clause22 ).
cnf(c_0_34,negated_conjecture,
hollywood(skc11),
clause5 ).
cnf(c_0_35,negated_conjecture,
( ssSkC0
| city(skc15) ),
clause15 ).
cnf(c_0_36,negated_conjecture,
hollywood(skc15),
clause1 ).
cnf(c_0_37,negated_conjecture,
( ~ in(X1,skc11)
| ~ down(X1,X2)
| ~ barrel(X1,X3)
| ~ way(X2)
| ~ dirty(X3)
| ~ white(X3)
| ~ car(X3)
| ~ ssSkC0
| ~ lonely(X2)
| ~ chevy(X3)
| ~ old(X3)
| ~ street(X2)
| ~ event(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
( way(skc8)
| ~ ssSkC0 ),
clause17 ).
cnf(c_0_39,negated_conjecture,
lonely(skc8),
clause8 ).
cnf(c_0_40,negated_conjecture,
( street(skc8)
| ~ ssSkC0 ),
clause16 ).
cnf(c_0_41,negated_conjecture,
( ssSkC0
| ~ in(X1,skc15)
| ~ down(X1,X2)
| ~ barrel(X1,X3)
| ~ way(X2)
| ~ dirty(X3)
| ~ white(X3)
| ~ car(X3)
| ~ lonely(X2)
| ~ chevy(X3)
| ~ old(X3)
| ~ street(X2)
| ~ event(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_35]),c_0_36])]) ).
cnf(c_0_42,negated_conjecture,
( ssSkC0
| way(skc13) ),
clause14 ).
cnf(c_0_43,negated_conjecture,
street(skc13),
clause3 ).
cnf(c_0_44,negated_conjecture,
( ssSkC0
| lonely(skc13) ),
clause13 ).
cnf(c_0_45,negated_conjecture,
( ~ in(X1,skc11)
| ~ down(X1,skc8)
| ~ barrel(X1,X2)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ ssSkC0
| ~ chevy(X2)
| ~ old(X2)
| ~ event(X1) ),
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]) ).
cnf(c_0_46,negated_conjecture,
( dirty(skc9)
| ~ ssSkC0 ),
clause19 ).
cnf(c_0_47,negated_conjecture,
chevy(skc9),
clause7 ).
cnf(c_0_48,negated_conjecture,
( old(skc9)
| ~ ssSkC0 ),
clause18 ).
cnf(c_0_49,negated_conjecture,
( car(skc9)
| ~ ssSkC0 ),
clause21 ).
cnf(c_0_50,negated_conjecture,
( white(skc9)
| ~ ssSkC0 ),
clause20 ).
cnf(c_0_51,negated_conjecture,
( ssSkC0
| ~ in(X1,skc15)
| ~ down(X1,skc13)
| ~ barrel(X1,X2)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ chevy(X2)
| ~ old(X2)
| ~ event(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( ssSkC0
| dirty(skc12) ),
clause12 ).
cnf(c_0_53,negated_conjecture,
old(skc12),
clause4 ).
cnf(c_0_54,negated_conjecture,
( ssSkC0
| chevy(skc12) ),
clause9 ).
cnf(c_0_55,negated_conjecture,
( ssSkC0
| car(skc12) ),
clause10 ).
cnf(c_0_56,negated_conjecture,
( ssSkC0
| white(skc12) ),
clause11 ).
cnf(c_0_57,negated_conjecture,
( ~ in(X1,skc11)
| ~ down(X1,skc8)
| ~ barrel(X1,skc9)
| ~ ssSkC0
| ~ event(X1) ),
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_45,c_0_46]),c_0_47])]),c_0_48]),c_0_49]),c_0_50]) ).
cnf(c_0_58,negated_conjecture,
event(skc10),
clause6 ).
cnf(c_0_59,negated_conjecture,
( barrel(skc10,skc9)
| ~ ssSkC0 ),
clause26 ).
cnf(c_0_60,negated_conjecture,
( down(skc10,skc8)
| ~ ssSkC0 ),
clause27 ).
cnf(c_0_61,negated_conjecture,
( in(skc10,skc11)
| ~ ssSkC0 ),
clause28 ).
cnf(c_0_62,negated_conjecture,
( ssSkC0
| ~ in(X1,skc15)
| ~ down(X1,skc13)
| ~ barrel(X1,skc12)
| ~ event(X1) ),
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_51,c_0_52]),c_0_53])]),c_0_54]),c_0_55]),c_0_56]) ).
cnf(c_0_63,negated_conjecture,
event(skc14),
clause2 ).
cnf(c_0_64,negated_conjecture,
( ssSkC0
| barrel(skc14,skc12) ),
clause23 ).
cnf(c_0_65,negated_conjecture,
~ ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]),c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( ssSkC0
| in(skc14,skc15) ),
clause25 ).
cnf(c_0_67,negated_conjecture,
( ssSkC0
| down(skc14,skc13) ),
clause24 ).
cnf(c_0_68,negated_conjecture,
( ssSkC0
| ~ in(skc14,skc15)
| ~ down(skc14,skc13)
| ~ barrel(skc14,skc12) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,negated_conjecture,
barrel(skc14,skc12),
inference(sr,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
in(skc14,skc15),
inference(sr,[status(thm)],[c_0_66,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
down(skc14,skc13),
inference(sr,[status(thm)],[c_0_67,c_0_65]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),c_0_65]),c_0_70]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NLP001-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 4 23:38:21 EDT 2026
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % start to proof: theBenchmark
% 1.23/1.70 % Version : CSE_E---1.7
% 1.23/1.70 % Problem : theBenchmark.p
% 1.23/1.70 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.70 % SZS output start CNFRefutation
% See solution above
% 1.23/1.70 % Total time : 1.368s
%------------------------------------------------------------------------------