TSTP Solution File: NLP009-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP009-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:43:35 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 54
% Syntax : Number of clauses : 138 ( 49 unt; 39 nHn; 138 RR)
% Number of literals : 437 ( 12 equ; 266 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 : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause53,negated_conjecture,
( ssSkC0
| X6 = X5
| ~ 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)
| ~ young(X5)
| ~ man(X5)
| ~ fellow(X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X5,X7)
| ~ in(X6,X7)
| ~ front(X7)
| ~ furniture(X7)
| ~ seat(X7) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause53) ).
cnf(clause54,negated_conjecture,
( X6 = X5
| ~ 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)
| ~ young(X5)
| ~ man(X5)
| ~ fellow(X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X5,X7)
| ~ in(X6,X7)
| ~ front(X7)
| ~ furniture(X7)
| ~ seat(X7)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause54) ).
cnf(clause44,negated_conjecture,
( ssSkC0
| in(skc21,skc23) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause44) ).
cnf(clause7,negated_conjecture,
fellow(skc21),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause7) ).
cnf(clause5,negated_conjecture,
seat(skc23),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause5) ).
cnf(clause22,negated_conjecture,
( ssSkC0
| young(skc21) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause22) ).
cnf(clause23,negated_conjecture,
( ssSkC0
| man(skc21) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause23) ).
cnf(clause26,negated_conjecture,
( ssSkC0
| front(skc23) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause26) ).
cnf(clause27,negated_conjecture,
( ssSkC0
| furniture(skc23) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause27) ).
cnf(clause45,negated_conjecture,
( ssSkC0
| in(skc22,skc23) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause45) ).
cnf(clause6,negated_conjecture,
young(skc22),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause6) ).
cnf(clause24,negated_conjecture,
( ssSkC0
| fellow(skc22) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause24) ).
cnf(clause25,negated_conjecture,
( ssSkC0
| man(skc22) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause25) ).
cnf(clause51,negated_conjecture,
( ssSkC0
| skc22 != skc21 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause51) ).
cnf(clause43,negated_conjecture,
( ssSkC0
| in(skc26,skc27) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause43) ).
cnf(clause2,negated_conjecture,
event(skc26),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause2) ).
cnf(clause1,negated_conjecture,
hollywood(skc27),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause1) ).
cnf(clause21,negated_conjecture,
( ssSkC0
| city(skc27) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause21) ).
cnf(clause42,negated_conjecture,
( ssSkC0
| down(skc26,skc25) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause42) ).
cnf(clause3,negated_conjecture,
street(skc25),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause3) ).
cnf(clause19,negated_conjecture,
( ssSkC0
| lonely(skc25) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause19) ).
cnf(clause20,negated_conjecture,
( ssSkC0
| way(skc25) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause20) ).
cnf(clause41,negated_conjecture,
( ssSkC0
| barrel(skc26,skc24) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause41) ).
cnf(clause4,negated_conjecture,
old(skc24),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause4) ).
cnf(clause15,negated_conjecture,
( ssSkC0
| chevy(skc24) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause15) ).
cnf(clause16,negated_conjecture,
( ssSkC0
| car(skc24) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause16) ).
cnf(clause17,negated_conjecture,
( ssSkC0
| white(skc24) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause17) ).
cnf(clause18,negated_conjecture,
( ssSkC0
| dirty(skc24) ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause18) ).
cnf(clause50,negated_conjecture,
( in(skc15,skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause50) ).
cnf(clause40,negated_conjecture,
( furniture(skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause40) ).
cnf(clause39,negated_conjecture,
( front(skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause39) ).
cnf(clause38,negated_conjecture,
( man(skc15)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause38) ).
cnf(clause37,negated_conjecture,
( fellow(skc15)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause37) ).
cnf(clause13,negated_conjecture,
young(skc15),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause13) ).
cnf(clause12,negated_conjecture,
seat(skc16),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause12) ).
cnf(clause49,negated_conjecture,
( in(skc14,skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause49) ).
cnf(clause36,negated_conjecture,
( man(skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause36) ).
cnf(clause35,negated_conjecture,
( young(skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause35) ).
cnf(clause52,negated_conjecture,
( skc15 != skc14
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause52) ).
cnf(clause14,negated_conjecture,
fellow(skc14),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause14) ).
cnf(clause48,negated_conjecture,
( in(skc19,skc20)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause48) ).
cnf(clause34,negated_conjecture,
( city(skc20)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause34) ).
cnf(clause9,negated_conjecture,
event(skc19),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause9) ).
cnf(clause8,negated_conjecture,
hollywood(skc20),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause8) ).
cnf(clause47,negated_conjecture,
( down(skc19,skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause47) ).
cnf(clause29,negated_conjecture,
( way(skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause29) ).
cnf(clause28,negated_conjecture,
( street(skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause28) ).
cnf(clause11,negated_conjecture,
lonely(skc17),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause11) ).
cnf(clause46,negated_conjecture,
( barrel(skc19,skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause46) ).
cnf(clause31,negated_conjecture,
( dirty(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause31) ).
cnf(clause32,negated_conjecture,
( white(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause32) ).
cnf(clause33,negated_conjecture,
( car(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause33) ).
cnf(clause30,negated_conjecture,
( old(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause30) ).
cnf(clause10,negated_conjecture,
chevy(skc18),
file('/export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p',clause10) ).
cnf(c_0_54,negated_conjecture,
( ssSkC0
| X6 = X5
| ~ 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)
| ~ young(X5)
| ~ man(X5)
| ~ fellow(X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X5,X7)
| ~ in(X6,X7)
| ~ front(X7)
| ~ furniture(X7)
| ~ seat(X7) ),
clause53 ).
cnf(c_0_55,negated_conjecture,
( X6 = X5
| ~ 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)
| ~ young(X5)
| ~ man(X5)
| ~ fellow(X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X5,X7)
| ~ in(X6,X7)
| ~ front(X7)
| ~ furniture(X7)
| ~ seat(X7)
| ~ ssSkC0 ),
clause54 ).
cnf(c_0_56,negated_conjecture,
( X1 = X2
| ~ in(X2,X3)
| ~ in(X1,X3)
| ~ in(X4,X5)
| ~ down(X4,X6)
| ~ barrel(X4,X7)
| ~ furniture(X3)
| ~ front(X3)
| ~ man(X2)
| ~ man(X1)
| ~ city(X5)
| ~ way(X6)
| ~ dirty(X7)
| ~ white(X7)
| ~ car(X7)
| ~ lonely(X6)
| ~ chevy(X7)
| ~ fellow(X2)
| ~ fellow(X1)
| ~ young(X2)
| ~ young(X1)
| ~ seat(X3)
| ~ old(X7)
| ~ street(X6)
| ~ event(X4)
| ~ hollywood(X5) ),
inference(csr,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,negated_conjecture,
( ssSkC0
| in(skc21,skc23) ),
clause44 ).
cnf(c_0_58,negated_conjecture,
fellow(skc21),
clause7 ).
cnf(c_0_59,negated_conjecture,
seat(skc23),
clause5 ).
cnf(c_0_60,negated_conjecture,
( ssSkC0
| young(skc21) ),
clause22 ).
cnf(c_0_61,negated_conjecture,
( ssSkC0
| man(skc21) ),
clause23 ).
cnf(c_0_62,negated_conjecture,
( ssSkC0
| front(skc23) ),
clause26 ).
cnf(c_0_63,negated_conjecture,
( ssSkC0
| furniture(skc23) ),
clause27 ).
cnf(c_0_64,negated_conjecture,
( X1 = skc21
| ssSkC0
| ~ in(X1,skc23)
| ~ in(X2,X3)
| ~ down(X2,X4)
| ~ barrel(X2,X5)
| ~ man(X1)
| ~ city(X3)
| ~ way(X4)
| ~ dirty(X5)
| ~ white(X5)
| ~ car(X5)
| ~ lonely(X4)
| ~ chevy(X5)
| ~ fellow(X1)
| ~ young(X1)
| ~ old(X5)
| ~ street(X4)
| ~ event(X2)
| ~ hollywood(X3) ),
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_56,c_0_57]),c_0_58]),c_0_59])]),c_0_60]),c_0_61]),c_0_62]),c_0_63]) ).
cnf(c_0_65,negated_conjecture,
( ssSkC0
| in(skc22,skc23) ),
clause45 ).
cnf(c_0_66,negated_conjecture,
young(skc22),
clause6 ).
cnf(c_0_67,negated_conjecture,
( ssSkC0
| fellow(skc22) ),
clause24 ).
cnf(c_0_68,negated_conjecture,
( ssSkC0
| man(skc22) ),
clause25 ).
cnf(c_0_69,negated_conjecture,
( ssSkC0
| skc22 != skc21 ),
clause51 ).
cnf(c_0_70,negated_conjecture,
( ssSkC0
| ~ 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)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),c_0_67]),c_0_68]),c_0_69]) ).
cnf(c_0_71,negated_conjecture,
( ssSkC0
| in(skc26,skc27) ),
clause43 ).
cnf(c_0_72,negated_conjecture,
event(skc26),
clause2 ).
cnf(c_0_73,negated_conjecture,
hollywood(skc27),
clause1 ).
cnf(c_0_74,negated_conjecture,
( ssSkC0
| city(skc27) ),
clause21 ).
cnf(c_0_75,negated_conjecture,
( ssSkC0
| ~ down(skc26,X1)
| ~ barrel(skc26,X2)
| ~ way(X1)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ lonely(X1)
| ~ chevy(X2)
| ~ old(X2)
| ~ street(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]),c_0_73])]),c_0_74]) ).
cnf(c_0_76,negated_conjecture,
( ssSkC0
| down(skc26,skc25) ),
clause42 ).
cnf(c_0_77,negated_conjecture,
street(skc25),
clause3 ).
cnf(c_0_78,negated_conjecture,
( ssSkC0
| lonely(skc25) ),
clause19 ).
cnf(c_0_79,negated_conjecture,
( ssSkC0
| way(skc25) ),
clause20 ).
cnf(c_0_80,negated_conjecture,
( ssSkC0
| ~ barrel(skc26,X1)
| ~ dirty(X1)
| ~ white(X1)
| ~ car(X1)
| ~ chevy(X1)
| ~ old(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77])]),c_0_78]),c_0_79]) ).
cnf(c_0_81,negated_conjecture,
( ssSkC0
| barrel(skc26,skc24) ),
clause41 ).
cnf(c_0_82,negated_conjecture,
old(skc24),
clause4 ).
cnf(c_0_83,negated_conjecture,
( ssSkC0
| chevy(skc24) ),
clause15 ).
cnf(c_0_84,negated_conjecture,
( ssSkC0
| car(skc24) ),
clause16 ).
cnf(c_0_85,negated_conjecture,
( ssSkC0
| white(skc24) ),
clause17 ).
cnf(c_0_86,negated_conjecture,
( ssSkC0
| dirty(skc24) ),
clause18 ).
cnf(c_0_87,negated_conjecture,
( in(skc15,skc16)
| ~ ssSkC0 ),
clause50 ).
cnf(c_0_88,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_80,c_0_81]),c_0_82])]),c_0_83]),c_0_84]),c_0_85]),c_0_86]) ).
cnf(c_0_89,negated_conjecture,
( furniture(skc16)
| ~ ssSkC0 ),
clause40 ).
cnf(c_0_90,negated_conjecture,
( front(skc16)
| ~ ssSkC0 ),
clause39 ).
cnf(c_0_91,negated_conjecture,
( man(skc15)
| ~ ssSkC0 ),
clause38 ).
cnf(c_0_92,negated_conjecture,
( fellow(skc15)
| ~ ssSkC0 ),
clause37 ).
cnf(c_0_93,negated_conjecture,
in(skc15,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_94,negated_conjecture,
furniture(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_88])]) ).
cnf(c_0_95,negated_conjecture,
front(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_88])]) ).
cnf(c_0_96,negated_conjecture,
man(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_88])]) ).
cnf(c_0_97,negated_conjecture,
fellow(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_88])]) ).
cnf(c_0_98,negated_conjecture,
young(skc15),
clause13 ).
cnf(c_0_99,negated_conjecture,
seat(skc16),
clause12 ).
cnf(c_0_100,negated_conjecture,
( in(skc14,skc16)
| ~ ssSkC0 ),
clause49 ).
cnf(c_0_101,negated_conjecture,
( man(skc14)
| ~ ssSkC0 ),
clause36 ).
cnf(c_0_102,negated_conjecture,
( young(skc14)
| ~ ssSkC0 ),
clause35 ).
cnf(c_0_103,negated_conjecture,
( skc15 != skc14
| ~ ssSkC0 ),
clause52 ).
cnf(c_0_104,negated_conjecture,
( X1 = skc15
| ~ in(X1,skc16)
| ~ in(X2,X3)
| ~ down(X2,X4)
| ~ barrel(X2,X5)
| ~ man(X1)
| ~ city(X3)
| ~ way(X4)
| ~ dirty(X5)
| ~ white(X5)
| ~ car(X5)
| ~ lonely(X4)
| ~ chevy(X5)
| ~ fellow(X1)
| ~ young(X1)
| ~ old(X5)
| ~ street(X4)
| ~ event(X2)
| ~ hollywood(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_56,c_0_93]),c_0_94]),c_0_95]),c_0_96]),c_0_97]),c_0_98]),c_0_99])]) ).
cnf(c_0_105,negated_conjecture,
in(skc14,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_88])]) ).
cnf(c_0_106,negated_conjecture,
man(skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_88])]) ).
cnf(c_0_107,negated_conjecture,
fellow(skc14),
clause14 ).
cnf(c_0_108,negated_conjecture,
young(skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_88])]) ).
cnf(c_0_109,negated_conjecture,
skc14 != skc15,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_88])]) ).
cnf(c_0_110,negated_conjecture,
( in(skc19,skc20)
| ~ ssSkC0 ),
clause48 ).
cnf(c_0_111,negated_conjecture,
( city(skc20)
| ~ ssSkC0 ),
clause34 ).
cnf(c_0_112,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(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_104,c_0_105]),c_0_106]),c_0_107]),c_0_108])]),c_0_109]) ).
cnf(c_0_113,negated_conjecture,
in(skc19,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_88])]) ).
cnf(c_0_114,negated_conjecture,
city(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_88])]) ).
cnf(c_0_115,negated_conjecture,
event(skc19),
clause9 ).
cnf(c_0_116,negated_conjecture,
hollywood(skc20),
clause8 ).
cnf(c_0_117,negated_conjecture,
( down(skc19,skc17)
| ~ ssSkC0 ),
clause47 ).
cnf(c_0_118,negated_conjecture,
( way(skc17)
| ~ ssSkC0 ),
clause29 ).
cnf(c_0_119,negated_conjecture,
( street(skc17)
| ~ ssSkC0 ),
clause28 ).
cnf(c_0_120,negated_conjecture,
( ~ down(skc19,X1)
| ~ barrel(skc19,X2)
| ~ way(X1)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ lonely(X1)
| ~ chevy(X2)
| ~ old(X2)
| ~ street(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]),c_0_115]),c_0_116])]) ).
cnf(c_0_121,negated_conjecture,
down(skc19,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_88])]) ).
cnf(c_0_122,negated_conjecture,
way(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_88])]) ).
cnf(c_0_123,negated_conjecture,
lonely(skc17),
clause11 ).
cnf(c_0_124,negated_conjecture,
street(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_88])]) ).
cnf(c_0_125,negated_conjecture,
( barrel(skc19,skc18)
| ~ ssSkC0 ),
clause46 ).
cnf(c_0_126,negated_conjecture,
( dirty(skc18)
| ~ ssSkC0 ),
clause31 ).
cnf(c_0_127,negated_conjecture,
( white(skc18)
| ~ ssSkC0 ),
clause32 ).
cnf(c_0_128,negated_conjecture,
( car(skc18)
| ~ ssSkC0 ),
clause33 ).
cnf(c_0_129,negated_conjecture,
( old(skc18)
| ~ ssSkC0 ),
clause30 ).
cnf(c_0_130,negated_conjecture,
( ~ barrel(skc19,X1)
| ~ dirty(X1)
| ~ white(X1)
| ~ car(X1)
| ~ chevy(X1)
| ~ old(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_122]),c_0_123]),c_0_124])]) ).
cnf(c_0_131,negated_conjecture,
barrel(skc19,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_88])]) ).
cnf(c_0_132,negated_conjecture,
dirty(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_88])]) ).
cnf(c_0_133,negated_conjecture,
white(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_88])]) ).
cnf(c_0_134,negated_conjecture,
car(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_88])]) ).
cnf(c_0_135,negated_conjecture,
chevy(skc18),
clause10 ).
cnf(c_0_136,negated_conjecture,
old(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_88])]) ).
cnf(c_0_137,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_130,c_0_131]),c_0_132]),c_0_133]),c_0_134]),c_0_135]),c_0_136])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP009-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 11:18:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.mOe9UdJvPF/E---3.1_27930.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 28015 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 28023 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.50 # Preprocessing time : 0.002 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 54
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 54
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 54
% 0.21/0.50 # Processed clauses : 135
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 135
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 6
% 0.21/0.50 # Backward-rewritten : 40
% 0.21/0.50 # Generated clauses : 18
% 0.21/0.50 # ...of the previous two non-redundant : 36
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 15
% 0.21/0.50 # Paramodulations : 18
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 73
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 36
% 0.21/0.50 # Positive orientable unit clauses : 33
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 2
% 0.21/0.50 # Current number of unprocessed clauses: 6
% 0.21/0.50 # ...number of literals in the above : 122
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 99
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 966
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 558
% 0.21/0.50 # Non-unit clause-clause subsumptions : 21
% 0.21/0.50 # Unit Clause-clause subsumption calls : 11
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 2213
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.009 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.012 s
% 0.21/0.50 # Maximum resident set size: 1716 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.047 s
% 0.21/0.50 # System time : 0.009 s
% 0.21/0.50 # Total time : 0.055 s
% 0.21/0.50 # Maximum resident set size: 1720 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------