TSTP Solution File: NLP009-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP009-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 21 00:53:10 EDT 2024
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 54
% Syntax : Number of clauses : 160 ( 49 unt; 39 nHn; 160 RR)
% Number of literals : 533 ( 22 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 : 71 ( 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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.p',clause54) ).
cnf(clause49,negated_conjecture,
( in(skc14,skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause49) ).
cnf(clause35,negated_conjecture,
( young(skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause35) ).
cnf(clause36,negated_conjecture,
( man(skc14)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause36) ).
cnf(clause39,negated_conjecture,
( front(skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause39) ).
cnf(clause40,negated_conjecture,
( furniture(skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause40) ).
cnf(clause14,negated_conjecture,
fellow(skc14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).
cnf(clause12,negated_conjecture,
seat(skc16),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause12) ).
cnf(clause48,negated_conjecture,
( in(skc19,skc20)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause48) ).
cnf(clause34,negated_conjecture,
( city(skc20)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause34) ).
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(clause47,negated_conjecture,
( down(skc19,skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause47) ).
cnf(clause28,negated_conjecture,
( street(skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause28) ).
cnf(clause29,negated_conjecture,
( way(skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).
cnf(clause11,negated_conjecture,
lonely(skc17),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause11) ).
cnf(clause46,negated_conjecture,
( barrel(skc19,skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause46) ).
cnf(clause30,negated_conjecture,
( old(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).
cnf(clause33,negated_conjecture,
( car(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause33) ).
cnf(clause32,negated_conjecture,
( white(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause32) ).
cnf(clause31,negated_conjecture,
( dirty(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause31) ).
cnf(clause10,negated_conjecture,
chevy(skc18),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause10) ).
cnf(clause38,negated_conjecture,
( man(skc15)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause38) ).
cnf(clause37,negated_conjecture,
( fellow(skc15)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause37) ).
cnf(clause50,negated_conjecture,
( in(skc15,skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause50) ).
cnf(clause52,negated_conjecture,
( skc15 != skc14
| ~ ssSkC0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause52) ).
cnf(clause13,negated_conjecture,
young(skc15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause13) ).
cnf(clause45,negated_conjecture,
( ssSkC0
| in(skc22,skc23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause45) ).
cnf(clause27,negated_conjecture,
( ssSkC0
| furniture(skc23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).
cnf(clause26,negated_conjecture,
( ssSkC0
| front(skc23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause26) ).
cnf(clause25,negated_conjecture,
( ssSkC0
| man(skc22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause25) ).
cnf(clause24,negated_conjecture,
( ssSkC0
| fellow(skc22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause24) ).
cnf(clause6,negated_conjecture,
young(skc22),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).
cnf(clause5,negated_conjecture,
seat(skc23),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).
cnf(clause43,negated_conjecture,
( ssSkC0
| in(skc26,skc27) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause43) ).
cnf(clause21,negated_conjecture,
( ssSkC0
| city(skc27) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause21) ).
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(clause42,negated_conjecture,
( ssSkC0
| down(skc26,skc25) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause42) ).
cnf(clause20,negated_conjecture,
( ssSkC0
| way(skc25) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).
cnf(clause19,negated_conjecture,
( ssSkC0
| lonely(skc25) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause19) ).
cnf(clause3,negated_conjecture,
street(skc25),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
cnf(clause41,negated_conjecture,
( ssSkC0
| barrel(skc26,skc24) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause41) ).
cnf(clause18,negated_conjecture,
( ssSkC0
| dirty(skc24) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause18) ).
cnf(clause17,negated_conjecture,
( ssSkC0
| white(skc24) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause17) ).
cnf(clause16,negated_conjecture,
( ssSkC0
| car(skc24) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause16) ).
cnf(clause15,negated_conjecture,
( ssSkC0
| chevy(skc24) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause15) ).
cnf(clause4,negated_conjecture,
old(skc24),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
cnf(clause23,negated_conjecture,
( ssSkC0
| man(skc21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause23) ).
cnf(clause44,negated_conjecture,
( ssSkC0
| in(skc21,skc23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause44) ).
cnf(clause22,negated_conjecture,
( ssSkC0
| young(skc21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause22) ).
cnf(clause51,negated_conjecture,
( ssSkC0
| skc22 != skc21 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause51) ).
cnf(clause7,negated_conjecture,
fellow(skc21),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).
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) ),
inference(fof_simplification,[status(thm)],[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 ),
inference(fof_simplification,[status(thm)],[clause54]) ).
cnf(c_0_56,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) ),
c_0_54 ).
cnf(c_0_57,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 ),
c_0_55 ).
cnf(c_0_58,negated_conjecture,
( in(skc14,skc16)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause49]) ).
cnf(c_0_59,negated_conjecture,
( young(skc14)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause35]) ).
cnf(c_0_60,negated_conjecture,
( man(skc14)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause36]) ).
cnf(c_0_61,negated_conjecture,
( front(skc16)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause39]) ).
cnf(c_0_62,negated_conjecture,
( furniture(skc16)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause40]) ).
cnf(c_0_63,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_56,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( in(skc14,skc16)
| ~ ssSkC0 ),
c_0_58 ).
cnf(c_0_65,negated_conjecture,
fellow(skc14),
clause14 ).
cnf(c_0_66,negated_conjecture,
seat(skc16),
clause12 ).
cnf(c_0_67,negated_conjecture,
( young(skc14)
| ~ ssSkC0 ),
c_0_59 ).
cnf(c_0_68,negated_conjecture,
( man(skc14)
| ~ ssSkC0 ),
c_0_60 ).
cnf(c_0_69,negated_conjecture,
( front(skc16)
| ~ ssSkC0 ),
c_0_61 ).
cnf(c_0_70,negated_conjecture,
( furniture(skc16)
| ~ ssSkC0 ),
c_0_62 ).
cnf(c_0_71,negated_conjecture,
( in(skc19,skc20)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause48]) ).
cnf(c_0_72,negated_conjecture,
( city(skc20)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause34]) ).
cnf(c_0_73,negated_conjecture,
( X1 = skc14
| ~ in(X1,skc16)
| ~ in(X2,X3)
| ~ down(X2,X4)
| ~ barrel(X2,X5)
| ~ man(X1)
| ~ city(X3)
| ~ way(X4)
| ~ dirty(X5)
| ~ white(X5)
| ~ car(X5)
| ~ ssSkC0
| ~ 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_63,c_0_64]),c_0_65]),c_0_66])]),c_0_67]),c_0_68]),c_0_69]),c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( in(skc19,skc20)
| ~ ssSkC0 ),
c_0_71 ).
cnf(c_0_75,negated_conjecture,
event(skc19),
clause9 ).
cnf(c_0_76,negated_conjecture,
hollywood(skc20),
clause8 ).
cnf(c_0_77,negated_conjecture,
( city(skc20)
| ~ ssSkC0 ),
c_0_72 ).
cnf(c_0_78,negated_conjecture,
( down(skc19,skc17)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause47]) ).
cnf(c_0_79,negated_conjecture,
( street(skc17)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause28]) ).
cnf(c_0_80,negated_conjecture,
( way(skc17)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause29]) ).
cnf(c_0_81,negated_conjecture,
( X1 = skc14
| ~ in(X1,skc16)
| ~ down(skc19,X2)
| ~ barrel(skc19,X3)
| ~ man(X1)
| ~ way(X2)
| ~ dirty(X3)
| ~ white(X3)
| ~ car(X3)
| ~ ssSkC0
| ~ lonely(X2)
| ~ chevy(X3)
| ~ fellow(X1)
| ~ young(X1)
| ~ old(X3)
| ~ street(X2) ),
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_82,negated_conjecture,
( down(skc19,skc17)
| ~ ssSkC0 ),
c_0_78 ).
cnf(c_0_83,negated_conjecture,
lonely(skc17),
clause11 ).
cnf(c_0_84,negated_conjecture,
( street(skc17)
| ~ ssSkC0 ),
c_0_79 ).
cnf(c_0_85,negated_conjecture,
( way(skc17)
| ~ ssSkC0 ),
c_0_80 ).
cnf(c_0_86,negated_conjecture,
( barrel(skc19,skc18)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause46]) ).
cnf(c_0_87,negated_conjecture,
( old(skc18)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause30]) ).
cnf(c_0_88,negated_conjecture,
( car(skc18)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause33]) ).
cnf(c_0_89,negated_conjecture,
( white(skc18)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause32]) ).
cnf(c_0_90,negated_conjecture,
( dirty(skc18)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause31]) ).
cnf(c_0_91,negated_conjecture,
( X1 = skc14
| ~ in(X1,skc16)
| ~ barrel(skc19,X2)
| ~ man(X1)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ ssSkC0
| ~ chevy(X2)
| ~ fellow(X1)
| ~ young(X1)
| ~ old(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83])]),c_0_84]),c_0_85]) ).
cnf(c_0_92,negated_conjecture,
( barrel(skc19,skc18)
| ~ ssSkC0 ),
c_0_86 ).
cnf(c_0_93,negated_conjecture,
chevy(skc18),
clause10 ).
cnf(c_0_94,negated_conjecture,
( old(skc18)
| ~ ssSkC0 ),
c_0_87 ).
cnf(c_0_95,negated_conjecture,
( car(skc18)
| ~ ssSkC0 ),
c_0_88 ).
cnf(c_0_96,negated_conjecture,
( white(skc18)
| ~ ssSkC0 ),
c_0_89 ).
cnf(c_0_97,negated_conjecture,
( dirty(skc18)
| ~ ssSkC0 ),
c_0_90 ).
cnf(c_0_98,negated_conjecture,
( man(skc15)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause38]) ).
cnf(c_0_99,negated_conjecture,
( fellow(skc15)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause37]) ).
cnf(c_0_100,negated_conjecture,
( in(skc15,skc16)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause50]) ).
cnf(c_0_101,negated_conjecture,
( skc15 != skc14
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause52]) ).
cnf(c_0_102,negated_conjecture,
( X1 = skc14
| ~ in(X1,skc16)
| ~ man(X1)
| ~ ssSkC0
| ~ fellow(X1)
| ~ young(X1) ),
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_91,c_0_92]),c_0_93])]),c_0_94]),c_0_95]),c_0_96]),c_0_97]) ).
cnf(c_0_103,negated_conjecture,
( man(skc15)
| ~ ssSkC0 ),
c_0_98 ).
cnf(c_0_104,negated_conjecture,
young(skc15),
clause13 ).
cnf(c_0_105,negated_conjecture,
( fellow(skc15)
| ~ ssSkC0 ),
c_0_99 ).
cnf(c_0_106,negated_conjecture,
( in(skc15,skc16)
| ~ ssSkC0 ),
c_0_100 ).
cnf(c_0_107,negated_conjecture,
( skc15 != skc14
| ~ ssSkC0 ),
c_0_101 ).
cnf(c_0_108,negated_conjecture,
( ssSkC0
| in(skc22,skc23) ),
clause45 ).
cnf(c_0_109,negated_conjecture,
~ 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_102,c_0_103]),c_0_104])]),c_0_105]),c_0_106]),c_0_107]) ).
cnf(c_0_110,negated_conjecture,
( ssSkC0
| furniture(skc23) ),
clause27 ).
cnf(c_0_111,negated_conjecture,
( ssSkC0
| front(skc23) ),
clause26 ).
cnf(c_0_112,negated_conjecture,
( ssSkC0
| man(skc22) ),
clause25 ).
cnf(c_0_113,negated_conjecture,
( ssSkC0
| fellow(skc22) ),
clause24 ).
cnf(c_0_114,negated_conjecture,
in(skc22,skc23),
inference(sr,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_115,negated_conjecture,
furniture(skc23),
inference(sr,[status(thm)],[c_0_110,c_0_109]) ).
cnf(c_0_116,negated_conjecture,
front(skc23),
inference(sr,[status(thm)],[c_0_111,c_0_109]) ).
cnf(c_0_117,negated_conjecture,
man(skc22),
inference(sr,[status(thm)],[c_0_112,c_0_109]) ).
cnf(c_0_118,negated_conjecture,
fellow(skc22),
inference(sr,[status(thm)],[c_0_113,c_0_109]) ).
cnf(c_0_119,negated_conjecture,
young(skc22),
clause6 ).
cnf(c_0_120,negated_conjecture,
seat(skc23),
clause5 ).
cnf(c_0_121,negated_conjecture,
( ssSkC0
| in(skc26,skc27) ),
clause43 ).
cnf(c_0_122,negated_conjecture,
( ssSkC0
| city(skc27) ),
clause21 ).
cnf(c_0_123,negated_conjecture,
( X1 = skc22
| ~ 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(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_63,c_0_114]),c_0_115]),c_0_116]),c_0_117]),c_0_118]),c_0_119]),c_0_120])]) ).
cnf(c_0_124,negated_conjecture,
in(skc26,skc27),
inference(sr,[status(thm)],[c_0_121,c_0_109]) ).
cnf(c_0_125,negated_conjecture,
city(skc27),
inference(sr,[status(thm)],[c_0_122,c_0_109]) ).
cnf(c_0_126,negated_conjecture,
event(skc26),
clause2 ).
cnf(c_0_127,negated_conjecture,
hollywood(skc27),
clause1 ).
cnf(c_0_128,negated_conjecture,
( ssSkC0
| down(skc26,skc25) ),
clause42 ).
cnf(c_0_129,negated_conjecture,
( ssSkC0
| way(skc25) ),
clause20 ).
cnf(c_0_130,negated_conjecture,
( ssSkC0
| lonely(skc25) ),
clause19 ).
cnf(c_0_131,negated_conjecture,
( X1 = skc22
| ~ in(X1,skc23)
| ~ down(skc26,X2)
| ~ barrel(skc26,X3)
| ~ man(X1)
| ~ way(X2)
| ~ dirty(X3)
| ~ white(X3)
| ~ car(X3)
| ~ lonely(X2)
| ~ chevy(X3)
| ~ fellow(X1)
| ~ young(X1)
| ~ old(X3)
| ~ street(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]),c_0_126]),c_0_127])]) ).
cnf(c_0_132,negated_conjecture,
down(skc26,skc25),
inference(sr,[status(thm)],[c_0_128,c_0_109]) ).
cnf(c_0_133,negated_conjecture,
way(skc25),
inference(sr,[status(thm)],[c_0_129,c_0_109]) ).
cnf(c_0_134,negated_conjecture,
lonely(skc25),
inference(sr,[status(thm)],[c_0_130,c_0_109]) ).
cnf(c_0_135,negated_conjecture,
street(skc25),
clause3 ).
cnf(c_0_136,negated_conjecture,
( ssSkC0
| barrel(skc26,skc24) ),
clause41 ).
cnf(c_0_137,negated_conjecture,
( ssSkC0
| dirty(skc24) ),
clause18 ).
cnf(c_0_138,negated_conjecture,
( ssSkC0
| white(skc24) ),
clause17 ).
cnf(c_0_139,negated_conjecture,
( ssSkC0
| car(skc24) ),
clause16 ).
cnf(c_0_140,negated_conjecture,
( ssSkC0
| chevy(skc24) ),
clause15 ).
cnf(c_0_141,negated_conjecture,
( X1 = skc22
| ~ in(X1,skc23)
| ~ barrel(skc26,X2)
| ~ man(X1)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ chevy(X2)
| ~ fellow(X1)
| ~ young(X1)
| ~ old(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]),c_0_134]),c_0_135])]) ).
cnf(c_0_142,negated_conjecture,
barrel(skc26,skc24),
inference(sr,[status(thm)],[c_0_136,c_0_109]) ).
cnf(c_0_143,negated_conjecture,
dirty(skc24),
inference(sr,[status(thm)],[c_0_137,c_0_109]) ).
cnf(c_0_144,negated_conjecture,
white(skc24),
inference(sr,[status(thm)],[c_0_138,c_0_109]) ).
cnf(c_0_145,negated_conjecture,
car(skc24),
inference(sr,[status(thm)],[c_0_139,c_0_109]) ).
cnf(c_0_146,negated_conjecture,
chevy(skc24),
inference(sr,[status(thm)],[c_0_140,c_0_109]) ).
cnf(c_0_147,negated_conjecture,
old(skc24),
clause4 ).
cnf(c_0_148,negated_conjecture,
( ssSkC0
| man(skc21) ),
clause23 ).
cnf(c_0_149,negated_conjecture,
( ssSkC0
| in(skc21,skc23) ),
clause44 ).
cnf(c_0_150,negated_conjecture,
( ssSkC0
| young(skc21) ),
clause22 ).
cnf(c_0_151,negated_conjecture,
( ssSkC0
| skc22 != skc21 ),
inference(fof_simplification,[status(thm)],[clause51]) ).
cnf(c_0_152,negated_conjecture,
( X1 = skc22
| ~ in(X1,skc23)
| ~ man(X1)
| ~ fellow(X1)
| ~ young(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(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143]),c_0_144]),c_0_145]),c_0_146]),c_0_147])]) ).
cnf(c_0_153,negated_conjecture,
man(skc21),
inference(sr,[status(thm)],[c_0_148,c_0_109]) ).
cnf(c_0_154,negated_conjecture,
in(skc21,skc23),
inference(sr,[status(thm)],[c_0_149,c_0_109]) ).
cnf(c_0_155,negated_conjecture,
fellow(skc21),
clause7 ).
cnf(c_0_156,negated_conjecture,
young(skc21),
inference(sr,[status(thm)],[c_0_150,c_0_109]) ).
cnf(c_0_157,negated_conjecture,
( ssSkC0
| skc22 != skc21 ),
c_0_151 ).
cnf(c_0_158,negated_conjecture,
skc21 = skc22,
inference(cn,[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])]) ).
cnf(c_0_159,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_157,c_0_158])]),c_0_109]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP009-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 22:25:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order 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.49 # Version: 3.1.0
% 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 26206 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 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 26212 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 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 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 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 : 54
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 54
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 54
% 0.19/0.49 # Processed clauses : 135
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 135
% 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 : 27
% 0.19/0.49 # Backward-rewritten : 5
% 0.19/0.49 # Generated clauses : 44
% 0.19/0.49 # ...of the previous two non-redundant : 42
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 15
% 0.19/0.49 # Paramodulations : 26
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 50
% 0.19/0.49 # ...of those cached : 20
% 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 : 32
% 0.19/0.49 # Positive orientable unit clauses : 29
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 1
% 0.19/0.49 # Non-unit-clauses : 2
% 0.19/0.49 # Current number of unprocessed clauses: 14
% 0.19/0.49 # ...number of literals in the above : 300
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 103
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 1098
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 564
% 0.19/0.49 # Non-unit clause-clause subsumptions : 22
% 0.19/0.49 # Unit Clause-clause subsumption calls : 34
% 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 : 2909
% 0.19/0.49 # Search garbage collected termcells : 146
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.009 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.012 s
% 0.19/0.49 # Maximum resident set size: 1772 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.012 s
% 0.19/0.49 # System time : 0.004 s
% 0.19/0.49 # Total time : 0.016 s
% 0.19/0.49 # Maximum resident set size: 1736 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------