## TSTP Solution File: NLP117-1 by E---3.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : E---3.0
% Problem  : NLP117-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% 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 : Sun Sep 18 05:45:37 EDT 2022

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   66
% Syntax   : Number of formulae    :  139 (  22 unt;  30 typ;   0 def)
%            Number of atoms       :  397 (   0 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  550 ( 262   ~; 288   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   37 (  17   >;  20   *;   0   +;   0  <<)
%            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   :   61 (   0 sgn   0   !;   0   ?;   0   :)

%------------------------------------------------------------------------------
tff(decl_22,type,
skc18: \$i ).

tff(decl_23,type,
actual_world: \$i > \$o ).

tff(decl_24,type,
skc12: \$i ).

tff(decl_25,type,
ssSkC0: \$o ).

tff(decl_26,type,
skc23: \$i ).

tff(decl_27,type,
old: ( \$i * \$i ) > \$o ).

tff(decl_28,type,
dirty: ( \$i * \$i ) > \$o ).

tff(decl_29,type,
white: ( \$i * \$i ) > \$o ).

tff(decl_30,type,
chevy: ( \$i * \$i ) > \$o ).

tff(decl_31,type,
skc19: \$i ).

tff(decl_32,type,
barrel: ( \$i * \$i ) > \$o ).

tff(decl_33,type,
present: ( \$i * \$i ) > \$o ).

tff(decl_34,type,
event: ( \$i * \$i ) > \$o ).

tff(decl_35,type,
skc21: \$i ).

tff(decl_36,type,
hollywood_placename: ( \$i * \$i ) > \$o ).

tff(decl_37,type,
placename: ( \$i * \$i ) > \$o ).

tff(decl_38,type,
skc22: \$i ).

tff(decl_39,type,
city: ( \$i * \$i ) > \$o ).

tff(decl_40,type,
skc20: \$i ).

tff(decl_41,type,
street: ( \$i * \$i ) > \$o ).

tff(decl_42,type,
lonely: ( \$i * \$i ) > \$o ).

tff(decl_43,type,
skc17: \$i ).

tff(decl_44,type,
skc13: \$i ).

tff(decl_45,type,
skc15: \$i ).

tff(decl_46,type,
skc16: \$i ).

tff(decl_47,type,
skc14: \$i ).

tff(decl_48,type,
agent: ( \$i * \$i * \$i ) > \$o ).

tff(decl_49,type,
in: ( \$i * \$i * \$i ) > \$o ).

tff(decl_50,type,
of: ( \$i * \$i * \$i ) > \$o ).

tff(decl_51,type,
down: ( \$i * \$i * \$i ) > \$o ).

cnf(clause35,negated_conjecture,
( ssSkC0
| ~ down(X1,X2,X3)
| ~ lonely(X1,X3)
| ~ street(X1,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X2,X5)
| ~ city(X1,X5)
| ~ of(X1,X4,X5)
| ~ chevy(X1,X6)
| ~ white(X1,X6)
| ~ dirty(X1,X6)
| ~ old(X1,X6)
| ~ agent(X1,X2,X6)
| ~ actual_world(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause35) ).

cnf(clause30,negated_conjecture,
( ssSkC0
| down(skc18,skc19,skc20) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).

cnf(clause1,negated_conjecture,
actual_world(skc18),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

cnf(clause14,negated_conjecture,
( ssSkC0
| lonely(skc18,skc20) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).

cnf(clause13,negated_conjecture,
( ssSkC0
| street(skc18,skc20) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause13) ).

cnf(clause9,negated_conjecture,
( ssSkC0
| event(skc18,skc19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause9) ).

cnf(clause8,negated_conjecture,
( ssSkC0
| present(skc18,skc19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

cnf(clause7,negated_conjecture,
( ssSkC0
| barrel(skc18,skc19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).

cnf(clause28,negated_conjecture,
( ssSkC0
| in(skc18,skc19,skc22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause28) ).

cnf(clause12,negated_conjecture,
( ssSkC0
| city(skc18,skc22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause12) ).

cnf(clause29,negated_conjecture,
( ssSkC0
| of(skc18,skc21,skc22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).

cnf(clause11,negated_conjecture,
( ssSkC0
| placename(skc18,skc21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause11) ).

cnf(clause10,negated_conjecture,
( ssSkC0
| hollywood_placename(skc18,skc21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause10) ).

cnf(clause27,negated_conjecture,
( ssSkC0
| agent(skc18,skc19,skc23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).

cnf(clause6,negated_conjecture,
( ssSkC0
| chevy(skc18,skc23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).

cnf(clause5,negated_conjecture,
( ssSkC0
| white(skc18,skc23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

cnf(clause4,negated_conjecture,
( ssSkC0
| dirty(skc18,skc23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

cnf(clause3,negated_conjecture,
( ssSkC0
| old(skc18,skc23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

cnf(clause36,negated_conjecture,
( ~ agent(X1,X2,X3)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X2,X5)
| ~ city(X1,X5)
| ~ of(X1,X4,X5)
| ~ street(X1,X6)
| ~ lonely(X1,X6)
| ~ down(X1,X2,X6)
| ~ actual_world(X1)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause36) ).

cnf(clause31,negated_conjecture,
( down(skc12,skc13,skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause31) ).

cnf(clause15,negated_conjecture,
( lonely(skc12,skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause15) ).

cnf(clause16,negated_conjecture,
( street(skc12,skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause16) ).

cnf(clause19,negated_conjecture,
( event(skc12,skc13)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause19) ).

cnf(clause18,negated_conjecture,
( present(skc12,skc13)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause18) ).

cnf(clause17,negated_conjecture,
( barrel(skc12,skc13)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause17) ).

cnf(clause2,negated_conjecture,
actual_world(skc12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

cnf(clause32,negated_conjecture,
( in(skc12,skc13,skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause32) ).

cnf(clause22,negated_conjecture,
( city(skc12,skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause22) ).

cnf(clause33,negated_conjecture,
( of(skc12,skc15,skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause33) ).

cnf(clause21,negated_conjecture,
( placename(skc12,skc15)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause21) ).

cnf(clause20,negated_conjecture,
( hollywood_placename(skc12,skc15)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).

cnf(clause34,negated_conjecture,
( agent(skc12,skc13,skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause34) ).

cnf(clause23,negated_conjecture,
( chevy(skc12,skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause23) ).

cnf(clause24,negated_conjecture,
( white(skc12,skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause24) ).

cnf(clause25,negated_conjecture,
( dirty(skc12,skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause25) ).

cnf(clause26,negated_conjecture,
( old(skc12,skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause26) ).

cnf(c_0_36,negated_conjecture,
( ssSkC0
| ~ down(X1,X2,X3)
| ~ lonely(X1,X3)
| ~ street(X1,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X2,X5)
| ~ city(X1,X5)
| ~ of(X1,X4,X5)
| ~ chevy(X1,X6)
| ~ white(X1,X6)
| ~ dirty(X1,X6)
| ~ old(X1,X6)
| ~ agent(X1,X2,X6)
| ~ actual_world(X1) ),
clause35 ).

cnf(c_0_37,negated_conjecture,
( ssSkC0
| down(skc18,skc19,skc20) ),
clause30 ).

cnf(c_0_38,negated_conjecture,
actual_world(skc18),
clause1 ).

cnf(c_0_39,negated_conjecture,
( ssSkC0
| ~ of(skc18,X1,X2)
| ~ in(skc18,skc19,X2)
| ~ agent(skc18,skc19,X3)
| ~ lonely(skc18,skc20)
| ~ street(skc18,skc20)
| ~ city(skc18,X2)
| ~ placename(skc18,X1)
| ~ hollywood_placename(skc18,X1)
| ~ event(skc18,skc19)
| ~ present(skc18,skc19)
| ~ barrel(skc18,skc19)
| ~ chevy(skc18,X3)
| ~ white(skc18,X3)
| ~ dirty(skc18,X3)
| ~ old(skc18,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).

cnf(c_0_40,negated_conjecture,
( ssSkC0
| lonely(skc18,skc20) ),
clause14 ).

cnf(c_0_41,negated_conjecture,
( ssSkC0
| ~ of(skc18,X1,X2)
| ~ in(skc18,skc19,X2)
| ~ agent(skc18,skc19,X3)
| ~ street(skc18,skc20)
| ~ city(skc18,X2)
| ~ placename(skc18,X1)
| ~ hollywood_placename(skc18,X1)
| ~ event(skc18,skc19)
| ~ present(skc18,skc19)
| ~ barrel(skc18,skc19)
| ~ chevy(skc18,X3)
| ~ white(skc18,X3)
| ~ dirty(skc18,X3)
| ~ old(skc18,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_42,negated_conjecture,
( ssSkC0
| street(skc18,skc20) ),
clause13 ).

cnf(c_0_43,negated_conjecture,
( ssSkC0
| ~ of(skc18,X1,X2)
| ~ in(skc18,skc19,X2)
| ~ agent(skc18,skc19,X3)
| ~ city(skc18,X2)
| ~ placename(skc18,X1)
| ~ hollywood_placename(skc18,X1)
| ~ event(skc18,skc19)
| ~ present(skc18,skc19)
| ~ barrel(skc18,skc19)
| ~ chevy(skc18,X3)
| ~ white(skc18,X3)
| ~ dirty(skc18,X3)
| ~ old(skc18,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_44,negated_conjecture,
( ssSkC0
| event(skc18,skc19) ),
clause9 ).

cnf(c_0_45,negated_conjecture,
( ssSkC0
| ~ of(skc18,X1,X2)
| ~ in(skc18,skc19,X2)
| ~ agent(skc18,skc19,X3)
| ~ city(skc18,X2)
| ~ placename(skc18,X1)
| ~ hollywood_placename(skc18,X1)
| ~ present(skc18,skc19)
| ~ barrel(skc18,skc19)
| ~ chevy(skc18,X3)
| ~ white(skc18,X3)
| ~ dirty(skc18,X3)
| ~ old(skc18,X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_46,negated_conjecture,
( ssSkC0
| present(skc18,skc19) ),
clause8 ).

cnf(c_0_47,negated_conjecture,
( ssSkC0
| ~ of(skc18,X1,X2)
| ~ in(skc18,skc19,X2)
| ~ agent(skc18,skc19,X3)
| ~ city(skc18,X2)
| ~ placename(skc18,X1)
| ~ hollywood_placename(skc18,X1)
| ~ barrel(skc18,skc19)
| ~ chevy(skc18,X3)
| ~ white(skc18,X3)
| ~ dirty(skc18,X3)
| ~ old(skc18,X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_48,negated_conjecture,
( ssSkC0
| barrel(skc18,skc19) ),
clause7 ).

cnf(c_0_49,negated_conjecture,
( ssSkC0
| ~ of(skc18,X1,X2)
| ~ in(skc18,skc19,X2)
| ~ agent(skc18,skc19,X3)
| ~ city(skc18,X2)
| ~ placename(skc18,X1)
| ~ hollywood_placename(skc18,X1)
| ~ chevy(skc18,X3)
| ~ white(skc18,X3)
| ~ dirty(skc18,X3)
| ~ old(skc18,X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_50,negated_conjecture,
( ssSkC0
| in(skc18,skc19,skc22) ),
clause28 ).

cnf(c_0_51,negated_conjecture,
( ssSkC0
| ~ of(skc18,X1,skc22)
| ~ agent(skc18,skc19,X2)
| ~ city(skc18,skc22)
| ~ placename(skc18,X1)
| ~ hollywood_placename(skc18,X1)
| ~ chevy(skc18,X2)
| ~ white(skc18,X2)
| ~ dirty(skc18,X2)
| ~ old(skc18,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_52,negated_conjecture,
( ssSkC0
| city(skc18,skc22) ),
clause12 ).

cnf(c_0_53,negated_conjecture,
( ssSkC0
| ~ of(skc18,X1,skc22)
| ~ agent(skc18,skc19,X2)
| ~ placename(skc18,X1)
| ~ hollywood_placename(skc18,X1)
| ~ chevy(skc18,X2)
| ~ white(skc18,X2)
| ~ dirty(skc18,X2)
| ~ old(skc18,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_54,negated_conjecture,
( ssSkC0
| of(skc18,skc21,skc22) ),
clause29 ).

cnf(c_0_55,negated_conjecture,
( ssSkC0
| ~ agent(skc18,skc19,X1)
| ~ placename(skc18,skc21)
| ~ hollywood_placename(skc18,skc21)
| ~ chevy(skc18,X1)
| ~ white(skc18,X1)
| ~ dirty(skc18,X1)
| ~ old(skc18,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_56,negated_conjecture,
( ssSkC0
| placename(skc18,skc21) ),
clause11 ).

cnf(c_0_57,negated_conjecture,
( ssSkC0
| ~ agent(skc18,skc19,X1)
| ~ hollywood_placename(skc18,skc21)
| ~ chevy(skc18,X1)
| ~ white(skc18,X1)
| ~ dirty(skc18,X1)
| ~ old(skc18,X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_58,negated_conjecture,
( ssSkC0
| hollywood_placename(skc18,skc21) ),
clause10 ).

cnf(c_0_59,negated_conjecture,
( ssSkC0
| ~ agent(skc18,skc19,X1)
| ~ chevy(skc18,X1)
| ~ white(skc18,X1)
| ~ dirty(skc18,X1)
| ~ old(skc18,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_60,negated_conjecture,
( ssSkC0
| agent(skc18,skc19,skc23) ),
clause27 ).

cnf(c_0_61,negated_conjecture,
( ssSkC0
| ~ chevy(skc18,skc23)
| ~ white(skc18,skc23)
| ~ dirty(skc18,skc23)
| ~ old(skc18,skc23) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_62,negated_conjecture,
( ssSkC0
| chevy(skc18,skc23) ),
clause6 ).

cnf(c_0_63,negated_conjecture,
( ssSkC0
| ~ white(skc18,skc23)
| ~ dirty(skc18,skc23)
| ~ old(skc18,skc23) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_64,negated_conjecture,
( ssSkC0
| white(skc18,skc23) ),
clause5 ).

cnf(c_0_65,negated_conjecture,
( ssSkC0
| ~ dirty(skc18,skc23)
| ~ old(skc18,skc23) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

cnf(c_0_66,negated_conjecture,
( ssSkC0
| dirty(skc18,skc23) ),
clause4 ).

cnf(c_0_67,negated_conjecture,
( ssSkC0
| ~ old(skc18,skc23) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).

cnf(c_0_68,negated_conjecture,
( ssSkC0
| old(skc18,skc23) ),
clause3 ).

cnf(c_0_69,negated_conjecture,
( ~ agent(X1,X2,X3)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X2,X5)
| ~ city(X1,X5)
| ~ of(X1,X4,X5)
| ~ street(X1,X6)
| ~ lonely(X1,X6)
| ~ down(X1,X2,X6)
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause36 ).

cnf(c_0_70,negated_conjecture,
ssSkC0,
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_71,negated_conjecture,
( down(skc12,skc13,skc17)
| ~ ssSkC0 ),
clause31 ).

cnf(c_0_72,negated_conjecture,
( lonely(skc12,skc17)
| ~ ssSkC0 ),
clause15 ).

cnf(c_0_73,negated_conjecture,
( street(skc12,skc17)
| ~ ssSkC0 ),
clause16 ).

cnf(c_0_74,negated_conjecture,
( event(skc12,skc13)
| ~ ssSkC0 ),
clause19 ).

cnf(c_0_75,negated_conjecture,
( present(skc12,skc13)
| ~ ssSkC0 ),
clause18 ).

cnf(c_0_76,negated_conjecture,
( barrel(skc12,skc13)
| ~ ssSkC0 ),
clause17 ).

cnf(c_0_77,negated_conjecture,
( ~ down(X1,X2,X3)
| ~ of(X1,X4,X5)
| ~ in(X1,X2,X5)
| ~ agent(X1,X2,X6)
| ~ lonely(X1,X3)
| ~ street(X1,X3)
| ~ city(X1,X5)
| ~ placename(X1,X4)
| ~ hollywood_placename(X1,X4)
| ~ event(X1,X2)
| ~ present(X1,X2)
| ~ barrel(X1,X2)
| ~ chevy(X1,X6)
| ~ white(X1,X6)
| ~ dirty(X1,X6)
| ~ old(X1,X6)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).

cnf(c_0_78,negated_conjecture,
down(skc12,skc13,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_70])]) ).

cnf(c_0_79,negated_conjecture,
lonely(skc12,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_70])]) ).

cnf(c_0_80,negated_conjecture,
street(skc12,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_70])]) ).

cnf(c_0_81,negated_conjecture,
event(skc12,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_70])]) ).

cnf(c_0_82,negated_conjecture,
present(skc12,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_70])]) ).

cnf(c_0_83,negated_conjecture,
barrel(skc12,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_70])]) ).

cnf(c_0_84,negated_conjecture,
actual_world(skc12),
clause2 ).

cnf(c_0_85,negated_conjecture,
( in(skc12,skc13,skc16)
| ~ ssSkC0 ),
clause32 ).

cnf(c_0_86,negated_conjecture,
( city(skc12,skc16)
| ~ ssSkC0 ),
clause22 ).

cnf(c_0_87,negated_conjecture,
( ~ of(skc12,X1,X2)
| ~ in(skc12,skc13,X2)
| ~ agent(skc12,skc13,X3)
| ~ city(skc12,X2)
| ~ placename(skc12,X1)
| ~ hollywood_placename(skc12,X1)
| ~ chevy(skc12,X3)
| ~ white(skc12,X3)
| ~ dirty(skc12,X3)
| ~ old(skc12,X3) ),
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_88,negated_conjecture,
in(skc12,skc13,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_70])]) ).

cnf(c_0_89,negated_conjecture,
city(skc12,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_70])]) ).

cnf(c_0_90,negated_conjecture,
( of(skc12,skc15,skc16)
| ~ ssSkC0 ),
clause33 ).

cnf(c_0_91,negated_conjecture,
( placename(skc12,skc15)
| ~ ssSkC0 ),
clause21 ).

cnf(c_0_92,negated_conjecture,
( hollywood_placename(skc12,skc15)
| ~ ssSkC0 ),
clause20 ).

cnf(c_0_93,negated_conjecture,
( ~ of(skc12,X1,skc16)
| ~ agent(skc12,skc13,X2)
| ~ placename(skc12,X1)
| ~ hollywood_placename(skc12,X1)
| ~ chevy(skc12,X2)
| ~ white(skc12,X2)
| ~ dirty(skc12,X2)
| ~ old(skc12,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]) ).

cnf(c_0_94,negated_conjecture,
of(skc12,skc15,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_70])]) ).

cnf(c_0_95,negated_conjecture,
placename(skc12,skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_70])]) ).

cnf(c_0_96,negated_conjecture,
hollywood_placename(skc12,skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_70])]) ).

cnf(c_0_97,negated_conjecture,
( agent(skc12,skc13,skc14)
| ~ ssSkC0 ),
clause34 ).

cnf(c_0_98,negated_conjecture,
( chevy(skc12,skc14)
| ~ ssSkC0 ),
clause23 ).

cnf(c_0_99,negated_conjecture,
( white(skc12,skc14)
| ~ ssSkC0 ),
clause24 ).

cnf(c_0_100,negated_conjecture,
( dirty(skc12,skc14)
| ~ ssSkC0 ),
clause25 ).

cnf(c_0_101,negated_conjecture,
( old(skc12,skc14)
| ~ ssSkC0 ),
clause26 ).

cnf(c_0_102,negated_conjecture,
( ~ agent(skc12,skc13,X1)
| ~ chevy(skc12,X1)
| ~ white(skc12,X1)
| ~ dirty(skc12,X1)
| ~ old(skc12,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),c_0_96])]) ).

cnf(c_0_103,negated_conjecture,
agent(skc12,skc13,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_70])]) ).

cnf(c_0_104,negated_conjecture,
chevy(skc12,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_70])]) ).

cnf(c_0_105,negated_conjecture,
white(skc12,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_70])]) ).

cnf(c_0_106,negated_conjecture,
dirty(skc12,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_70])]) ).

cnf(c_0_107,negated_conjecture,
old(skc12,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_70])]) ).

cnf(c_0_108,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_102,c_0_103]),c_0_104]),c_0_105]),c_0_106]),c_0_107])]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : NLP117-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n010.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   : Fri Sep  2 04:34:58 EDT 2022
% 0.13/0.35  % CPUTime    :
% 0.19/0.47  Running first-order on 8 cores theorem proving
% 0.19/0.47  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.19/0.48  # Version: 3.0pre003
% 0.19/0.49  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # Starting sh5l with 300s (1) cores
% 0.19/0.49  # new_bool_3 with pid 7475 completed with status 0
% 0.19/0.49  # Result found by new_bool_3
% 0.19/0.49  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # ...ProofStateSinE()=36/36
% 0.19/0.49  # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.19/0.49  # H----_011_C07_F1_PI_AE_OS_S1U with pid 7480 completed with status 0
% 0.19/0.49  # Result found by H----_011_C07_F1_PI_AE_OS_S1U
% 0.19/0.49  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # ...ProofStateSinE()=36/36
% 0.19/0.49  # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.19/0.49  # Preprocessing time       : 0.001 s
% 0.19/0.49
% 0.19/0.49  # Proof found!
% 0.19/0.49  # SZS status Unsatisfiable
% 0.19/0.49  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 36
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.49  # Initial clauses                      : 36
% 0.19/0.49  # Removed in clause preprocessing      : 0
% 0.19/0.49  # Initial clauses in saturation        : 36
% 0.19/0.49  # Processed clauses                    : 72
% 0.19/0.49  # ...of these trivial                  : 0
% 0.19/0.49  # ...subsumed                          : 0
% 0.19/0.49  # ...remaining for further processing  : 72
% 0.19/0.49  # Other redundant clauses eliminated   : 0
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 15
% 0.19/0.49  # Backward-rewritten                   : 36
% 0.19/0.49  # Generated clauses                    : 21
% 0.19/0.49  # ...of the previous two non-redundant : 37
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 0
% 0.19/0.49  # Paramodulations                      : 21
% 0.19/0.49  # Factorizations                       : 0
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 0
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 21
% 0.19/0.49  #    Positive orientable unit clauses  : 19
% 0.19/0.49  #    Positive unorientable unit clauses: 0
% 0.19/0.49  #    Negative unit clauses             : 0
% 0.19/0.49  #    Non-unit-clauses                  : 2
% 0.19/0.49  # Current number of unprocessed clauses: 0
% 0.19/0.49  # ...number of literals in the above   : 0
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 51
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 112
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 72
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 15
% 0.19/0.49  # Unit Clause-clause subsumption calls : 0
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 1
% 0.19/0.49  # BW rewrite match successes           : 1
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 2260
% 0.19/0.49
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.007 s
% 0.19/0.49  # System time              : 0.001 s
% 0.19/0.49  # Total time               : 0.008 s
% 0.19/0.49  # Maximum resident set size: 1800 pages
% 0.19/0.49
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.010 s
% 0.19/0.49  # System time              : 0.002 s
% 0.19/0.49  # Total time               : 0.012 s
% 0.19/0.49  # Maximum resident set size: 1756 pages
%------------------------------------------------------------------------------
```