TSTP Solution File: NLP122-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP122-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:42:20 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 36
% Syntax : Number of clauses : 108 ( 22 unt; 32 nHn; 108 RR)
% Number of literals : 387 ( 0 equ; 252 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 : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause35,negated_conjecture,
( ssSkC0
| ~ event(X1,X2)
| ~ present(X1,X2)
| ~ barrel(X1,X2)
| ~ down(X1,X2,X3)
| ~ lonely(X1,X3)
| ~ street(X1,X3)
| ~ in(X1,X2,X4)
| ~ agent(X1,X2,X4)
| ~ old(X1,X4)
| ~ dirty(X1,X4)
| ~ white(X1,X4)
| ~ chevy(X1,X4)
| ~ city(X1,X4)
| ~ of(X1,X5,X4)
| ~ hollywood_placename(X1,X5)
| ~ placename(X1,X5)
| ~ actual_world(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause35) ).
cnf(clause30,negated_conjecture,
( ssSkC0
| down(skc15,skc16,skc17) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause30) ).
cnf(clause1,negated_conjecture,
actual_world(skc15),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause1) ).
cnf(clause14,negated_conjecture,
( ssSkC0
| street(skc15,skc17) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause14) ).
cnf(clause13,negated_conjecture,
( ssSkC0
| lonely(skc15,skc17) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause13) ).
cnf(clause12,negated_conjecture,
( ssSkC0
| barrel(skc15,skc16) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause12) ).
cnf(clause11,negated_conjecture,
( ssSkC0
| present(skc15,skc16) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause11) ).
cnf(clause10,negated_conjecture,
( ssSkC0
| event(skc15,skc16) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause10) ).
cnf(clause28,negated_conjecture,
( ssSkC0
| in(skc15,skc16,skc18) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause28) ).
cnf(clause7,negated_conjecture,
( ssSkC0
| old(skc15,skc18) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause7) ).
cnf(clause6,negated_conjecture,
( ssSkC0
| dirty(skc15,skc18) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause6) ).
cnf(clause5,negated_conjecture,
( ssSkC0
| white(skc15,skc18) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause5) ).
cnf(clause4,negated_conjecture,
( ssSkC0
| chevy(skc15,skc18) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause4) ).
cnf(clause3,negated_conjecture,
( ssSkC0
| city(skc15,skc18) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause3) ).
cnf(clause27,negated_conjecture,
( ssSkC0
| agent(skc15,skc16,skc18) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause27) ).
cnf(clause29,negated_conjecture,
( ssSkC0
| of(skc15,skc19,skc18) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause29) ).
cnf(clause9,negated_conjecture,
( ssSkC0
| hollywood_placename(skc15,skc19) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause9) ).
cnf(clause8,negated_conjecture,
( ssSkC0
| placename(skc15,skc19) ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause8) ).
cnf(clause36,negated_conjecture,
( ~ city(X1,X2)
| ~ chevy(X1,X2)
| ~ white(X1,X2)
| ~ dirty(X1,X2)
| ~ old(X1,X2)
| ~ agent(X1,X3,X2)
| ~ in(X1,X3,X2)
| ~ placename(X1,X4)
| ~ hollywood_placename(X1,X4)
| ~ of(X1,X4,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ barrel(X1,X3)
| ~ down(X1,X3,X5)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ actual_world(X1)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause36) ).
cnf(clause31,negated_conjecture,
( down(skc10,skc11,skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause31) ).
cnf(clause19,negated_conjecture,
( street(skc10,skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause19) ).
cnf(clause18,negated_conjecture,
( lonely(skc10,skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause18) ).
cnf(clause17,negated_conjecture,
( barrel(skc10,skc11)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause17) ).
cnf(clause16,negated_conjecture,
( present(skc10,skc11)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause16) ).
cnf(clause15,negated_conjecture,
( event(skc10,skc11)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause15) ).
cnf(clause2,negated_conjecture,
actual_world(skc10),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause2) ).
cnf(clause32,negated_conjecture,
( in(skc10,skc11,skc12)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause32) ).
cnf(clause33,negated_conjecture,
( agent(skc10,skc11,skc12)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause33) ).
cnf(clause20,negated_conjecture,
( old(skc10,skc12)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause20) ).
cnf(clause21,negated_conjecture,
( dirty(skc10,skc12)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause21) ).
cnf(clause22,negated_conjecture,
( white(skc10,skc12)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause22) ).
cnf(clause23,negated_conjecture,
( chevy(skc10,skc12)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause23) ).
cnf(clause24,negated_conjecture,
( city(skc10,skc12)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause24) ).
cnf(clause34,negated_conjecture,
( of(skc10,skc13,skc12)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause34) ).
cnf(clause25,negated_conjecture,
( hollywood_placename(skc10,skc13)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause25) ).
cnf(clause26,negated_conjecture,
( placename(skc10,skc13)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.ooiktJxbYv/E---3.1_5570.p',clause26) ).
cnf(c_0_36,negated_conjecture,
( ssSkC0
| ~ event(X1,X2)
| ~ present(X1,X2)
| ~ barrel(X1,X2)
| ~ down(X1,X2,X3)
| ~ lonely(X1,X3)
| ~ street(X1,X3)
| ~ in(X1,X2,X4)
| ~ agent(X1,X2,X4)
| ~ old(X1,X4)
| ~ dirty(X1,X4)
| ~ white(X1,X4)
| ~ chevy(X1,X4)
| ~ city(X1,X4)
| ~ of(X1,X5,X4)
| ~ hollywood_placename(X1,X5)
| ~ placename(X1,X5)
| ~ actual_world(X1) ),
clause35 ).
cnf(c_0_37,negated_conjecture,
( ssSkC0
| down(skc15,skc16,skc17) ),
clause30 ).
cnf(c_0_38,negated_conjecture,
actual_world(skc15),
clause1 ).
cnf(c_0_39,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,X2)
| ~ in(skc15,skc16,X2)
| ~ agent(skc15,skc16,X2)
| ~ street(skc15,skc17)
| ~ lonely(skc15,skc17)
| ~ barrel(skc15,skc16)
| ~ present(skc15,skc16)
| ~ event(skc15,skc16)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ old(skc15,X2)
| ~ dirty(skc15,X2)
| ~ white(skc15,X2)
| ~ chevy(skc15,X2)
| ~ city(skc15,X2) ),
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
| street(skc15,skc17) ),
clause14 ).
cnf(c_0_41,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,X2)
| ~ in(skc15,skc16,X2)
| ~ agent(skc15,skc16,X2)
| ~ lonely(skc15,skc17)
| ~ barrel(skc15,skc16)
| ~ present(skc15,skc16)
| ~ event(skc15,skc16)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ old(skc15,X2)
| ~ dirty(skc15,X2)
| ~ white(skc15,X2)
| ~ chevy(skc15,X2)
| ~ city(skc15,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( ssSkC0
| lonely(skc15,skc17) ),
clause13 ).
cnf(c_0_43,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,X2)
| ~ in(skc15,skc16,X2)
| ~ agent(skc15,skc16,X2)
| ~ barrel(skc15,skc16)
| ~ present(skc15,skc16)
| ~ event(skc15,skc16)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ old(skc15,X2)
| ~ dirty(skc15,X2)
| ~ white(skc15,X2)
| ~ chevy(skc15,X2)
| ~ city(skc15,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( ssSkC0
| barrel(skc15,skc16) ),
clause12 ).
cnf(c_0_45,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,X2)
| ~ in(skc15,skc16,X2)
| ~ agent(skc15,skc16,X2)
| ~ present(skc15,skc16)
| ~ event(skc15,skc16)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ old(skc15,X2)
| ~ dirty(skc15,X2)
| ~ white(skc15,X2)
| ~ chevy(skc15,X2)
| ~ city(skc15,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( ssSkC0
| present(skc15,skc16) ),
clause11 ).
cnf(c_0_47,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,X2)
| ~ in(skc15,skc16,X2)
| ~ agent(skc15,skc16,X2)
| ~ event(skc15,skc16)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ old(skc15,X2)
| ~ dirty(skc15,X2)
| ~ white(skc15,X2)
| ~ chevy(skc15,X2)
| ~ city(skc15,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
( ssSkC0
| event(skc15,skc16) ),
clause10 ).
cnf(c_0_49,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,X2)
| ~ in(skc15,skc16,X2)
| ~ agent(skc15,skc16,X2)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ old(skc15,X2)
| ~ dirty(skc15,X2)
| ~ white(skc15,X2)
| ~ chevy(skc15,X2)
| ~ city(skc15,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,negated_conjecture,
( ssSkC0
| in(skc15,skc16,skc18) ),
clause28 ).
cnf(c_0_51,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,skc18)
| ~ agent(skc15,skc16,skc18)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ old(skc15,skc18)
| ~ dirty(skc15,skc18)
| ~ white(skc15,skc18)
| ~ chevy(skc15,skc18)
| ~ city(skc15,skc18) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,negated_conjecture,
( ssSkC0
| old(skc15,skc18) ),
clause7 ).
cnf(c_0_53,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,skc18)
| ~ agent(skc15,skc16,skc18)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ dirty(skc15,skc18)
| ~ white(skc15,skc18)
| ~ chevy(skc15,skc18)
| ~ city(skc15,skc18) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
( ssSkC0
| dirty(skc15,skc18) ),
clause6 ).
cnf(c_0_55,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,skc18)
| ~ agent(skc15,skc16,skc18)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ white(skc15,skc18)
| ~ chevy(skc15,skc18)
| ~ city(skc15,skc18) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
( ssSkC0
| white(skc15,skc18) ),
clause5 ).
cnf(c_0_57,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,skc18)
| ~ agent(skc15,skc16,skc18)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ chevy(skc15,skc18)
| ~ city(skc15,skc18) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
( ssSkC0
| chevy(skc15,skc18) ),
clause4 ).
cnf(c_0_59,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,skc18)
| ~ agent(skc15,skc16,skc18)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1)
| ~ city(skc15,skc18) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,negated_conjecture,
( ssSkC0
| city(skc15,skc18) ),
clause3 ).
cnf(c_0_61,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,skc18)
| ~ agent(skc15,skc16,skc18)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( ssSkC0
| agent(skc15,skc16,skc18) ),
clause27 ).
cnf(c_0_63,negated_conjecture,
( ssSkC0
| ~ of(skc15,X1,skc18)
| ~ hollywood_placename(skc15,X1)
| ~ placename(skc15,X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
( ssSkC0
| of(skc15,skc19,skc18) ),
clause29 ).
cnf(c_0_65,negated_conjecture,
( ssSkC0
| ~ hollywood_placename(skc15,skc19)
| ~ placename(skc15,skc19) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_66,negated_conjecture,
( ssSkC0
| hollywood_placename(skc15,skc19) ),
clause9 ).
cnf(c_0_67,negated_conjecture,
( ssSkC0
| ~ placename(skc15,skc19) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_68,negated_conjecture,
( ssSkC0
| placename(skc15,skc19) ),
clause8 ).
cnf(c_0_69,negated_conjecture,
( ~ city(X1,X2)
| ~ chevy(X1,X2)
| ~ white(X1,X2)
| ~ dirty(X1,X2)
| ~ old(X1,X2)
| ~ agent(X1,X3,X2)
| ~ in(X1,X3,X2)
| ~ placename(X1,X4)
| ~ hollywood_placename(X1,X4)
| ~ of(X1,X4,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ barrel(X1,X3)
| ~ down(X1,X3,X5)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ 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(skc10,skc11,skc14)
| ~ ssSkC0 ),
clause31 ).
cnf(c_0_72,negated_conjecture,
( street(skc10,skc14)
| ~ ssSkC0 ),
clause19 ).
cnf(c_0_73,negated_conjecture,
( lonely(skc10,skc14)
| ~ ssSkC0 ),
clause18 ).
cnf(c_0_74,negated_conjecture,
( barrel(skc10,skc11)
| ~ ssSkC0 ),
clause17 ).
cnf(c_0_75,negated_conjecture,
( present(skc10,skc11)
| ~ ssSkC0 ),
clause16 ).
cnf(c_0_76,negated_conjecture,
( event(skc10,skc11)
| ~ ssSkC0 ),
clause15 ).
cnf(c_0_77,negated_conjecture,
( ~ down(X1,X2,X3)
| ~ of(X1,X4,X5)
| ~ in(X1,X2,X5)
| ~ agent(X1,X2,X5)
| ~ street(X1,X3)
| ~ lonely(X1,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ old(X1,X5)
| ~ dirty(X1,X5)
| ~ white(X1,X5)
| ~ chevy(X1,X5)
| ~ city(X1,X5)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).
cnf(c_0_78,negated_conjecture,
down(skc10,skc11,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_70])]) ).
cnf(c_0_79,negated_conjecture,
street(skc10,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_70])]) ).
cnf(c_0_80,negated_conjecture,
lonely(skc10,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_70])]) ).
cnf(c_0_81,negated_conjecture,
barrel(skc10,skc11),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_70])]) ).
cnf(c_0_82,negated_conjecture,
present(skc10,skc11),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_70])]) ).
cnf(c_0_83,negated_conjecture,
event(skc10,skc11),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_70])]) ).
cnf(c_0_84,negated_conjecture,
actual_world(skc10),
clause2 ).
cnf(c_0_85,negated_conjecture,
( in(skc10,skc11,skc12)
| ~ ssSkC0 ),
clause32 ).
cnf(c_0_86,negated_conjecture,
( agent(skc10,skc11,skc12)
| ~ ssSkC0 ),
clause33 ).
cnf(c_0_87,negated_conjecture,
( old(skc10,skc12)
| ~ ssSkC0 ),
clause20 ).
cnf(c_0_88,negated_conjecture,
( dirty(skc10,skc12)
| ~ ssSkC0 ),
clause21 ).
cnf(c_0_89,negated_conjecture,
( white(skc10,skc12)
| ~ ssSkC0 ),
clause22 ).
cnf(c_0_90,negated_conjecture,
( chevy(skc10,skc12)
| ~ ssSkC0 ),
clause23 ).
cnf(c_0_91,negated_conjecture,
( city(skc10,skc12)
| ~ ssSkC0 ),
clause24 ).
cnf(c_0_92,negated_conjecture,
( ~ of(skc10,X1,X2)
| ~ in(skc10,skc11,X2)
| ~ agent(skc10,skc11,X2)
| ~ hollywood_placename(skc10,X1)
| ~ placename(skc10,X1)
| ~ old(skc10,X2)
| ~ dirty(skc10,X2)
| ~ white(skc10,X2)
| ~ chevy(skc10,X2)
| ~ city(skc10,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_93,negated_conjecture,
in(skc10,skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_70])]) ).
cnf(c_0_94,negated_conjecture,
agent(skc10,skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_70])]) ).
cnf(c_0_95,negated_conjecture,
old(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_70])]) ).
cnf(c_0_96,negated_conjecture,
dirty(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_70])]) ).
cnf(c_0_97,negated_conjecture,
white(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_70])]) ).
cnf(c_0_98,negated_conjecture,
chevy(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_70])]) ).
cnf(c_0_99,negated_conjecture,
city(skc10,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_70])]) ).
cnf(c_0_100,negated_conjecture,
( of(skc10,skc13,skc12)
| ~ ssSkC0 ),
clause34 ).
cnf(c_0_101,negated_conjecture,
( hollywood_placename(skc10,skc13)
| ~ ssSkC0 ),
clause25 ).
cnf(c_0_102,negated_conjecture,
( placename(skc10,skc13)
| ~ ssSkC0 ),
clause26 ).
cnf(c_0_103,negated_conjecture,
( ~ of(skc10,X1,skc12)
| ~ hollywood_placename(skc10,X1)
| ~ placename(skc10,X1) ),
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_92,c_0_93]),c_0_94]),c_0_95]),c_0_96]),c_0_97]),c_0_98]),c_0_99])]) ).
cnf(c_0_104,negated_conjecture,
of(skc10,skc13,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_70])]) ).
cnf(c_0_105,negated_conjecture,
hollywood_placename(skc10,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_70])]) ).
cnf(c_0_106,negated_conjecture,
placename(skc10,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_70])]) ).
cnf(c_0_107,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]),c_0_106])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : NLP122-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.16 % Command : run_E %s %d THM
% 0.21/0.36 % Computer : n003.cluster.edu
% 0.21/0.36 % Model : x86_64 x86_64
% 0.21/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.36 % Memory : 8042.1875MB
% 0.21/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.21/0.36 % CPULimit : 2400
% 0.21/0.36 % WCLimit : 300
% 0.21/0.36 % DateTime : Mon Oct 2 11:11:33 EDT 2023
% 0.21/0.37 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/tmp/tmp.ooiktJxbYv/E---3.1_5570.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_3 with pid 5649 completed with status 0
% 0.21/0.53 # Result found by new_bool_3
% 0.21/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.21/0.53 # H----_011_C07_F1_PI_AE_OS_S1U with pid 5652 completed with status 0
% 0.21/0.53 # Result found by H----_011_C07_F1_PI_AE_OS_S1U
% 0.21/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 36
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 36
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 36
% 0.21/0.53 # Processed clauses : 71
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 0
% 0.21/0.53 # ...remaining for further processing : 71
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 12
% 0.21/0.53 # Backward-rewritten : 37
% 0.21/0.53 # Generated clauses : 20
% 0.21/0.53 # ...of the previous two non-redundant : 36
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 20
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Total rewrite steps : 53
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 22
% 0.21/0.53 # Positive orientable unit clauses : 19
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 0
% 0.21/0.53 # Non-unit-clauses : 3
% 0.21/0.53 # Current number of unprocessed clauses: 0
% 0.21/0.53 # ...number of literals in the above : 0
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 49
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 133
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 107
% 0.21/0.53 # Non-unit clause-clause subsumptions : 12
% 0.21/0.53 # Unit Clause-clause subsumption calls : 0
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 1
% 0.21/0.53 # BW rewrite match successes : 1
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 2075
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.006 s
% 0.21/0.53 # System time : 0.001 s
% 0.21/0.53 # Total time : 0.007 s
% 0.21/0.53 # Maximum resident set size: 1800 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.009 s
% 0.21/0.53 # System time : 0.001 s
% 0.21/0.53 # Total time : 0.010 s
% 0.21/0.53 # Maximum resident set size: 1708 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------