TSTP Solution File: NLP004-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NLP004-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:55:54 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 60
% Syntax : Number of clauses : 176 ( 55 unt; 44 nHn; 176 RR)
% Number of literals : 584 ( 16 equ; 371 neg)
% Maximal clause size : 30 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 23 ( 21 usr; 2 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 16 con; 0-0 aty)
% Number of variables : 82 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause59,negated_conjecture,
( ssSkC0
| X7 = X6
| ~ 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)
| ~ seat(X5)
| ~ furniture(X5)
| ~ front(X5)
| ~ in(X6,X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X7,X8)
| ~ front(X8)
| ~ furniture(X8)
| ~ seat(X8)
| ~ young(X7)
| ~ man(X7)
| ~ fellow(X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause59) ).
cnf(clause60,negated_conjecture,
( X7 = X6
| ~ 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)
| ~ seat(X5)
| ~ furniture(X5)
| ~ front(X5)
| ~ in(X6,X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X7,X8)
| ~ front(X8)
| ~ furniture(X8)
| ~ seat(X8)
| ~ young(X7)
| ~ man(X7)
| ~ fellow(X7)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause60) ).
cnf(clause50,negated_conjecture,
( ssSkC0
| in(skc24,skc27) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause50) ).
cnf(clause8,negated_conjecture,
young(skc24),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
cnf(clause5,negated_conjecture,
front(skc27),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause24,negated_conjecture,
( ssSkC0
| seat(skc27) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause24) ).
cnf(clause26,negated_conjecture,
( ssSkC0
| fellow(skc24) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause26) ).
cnf(clause25,negated_conjecture,
( ssSkC0
| furniture(skc27) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause25) ).
cnf(clause27,negated_conjecture,
( ssSkC0
| man(skc24) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause27) ).
cnf(clause57,negated_conjecture,
( ssSkC0
| skc25 != skc24 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).
cnf(clause51,negated_conjecture,
( ssSkC0
| in(skc25,skc26) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause51) ).
cnf(clause7,negated_conjecture,
fellow(skc25),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
cnf(clause6,negated_conjecture,
seat(skc26),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(clause28,negated_conjecture,
( ssSkC0
| front(skc26) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause28) ).
cnf(clause30,negated_conjecture,
( ssSkC0
| young(skc25) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause30) ).
cnf(clause29,negated_conjecture,
( ssSkC0
| furniture(skc26) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause29) ).
cnf(clause31,negated_conjecture,
( ssSkC0
| man(skc25) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause31) ).
cnf(clause49,negated_conjecture,
( ssSkC0
| in(skc30,skc31) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause49) ).
cnf(clause2,negated_conjecture,
event(skc30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause1,negated_conjecture,
hollywood(skc31),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause23,negated_conjecture,
( ssSkC0
| city(skc31) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause23) ).
cnf(clause48,negated_conjecture,
( ssSkC0
| down(skc30,skc29) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause48) ).
cnf(clause3,negated_conjecture,
street(skc29),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause21,negated_conjecture,
( ssSkC0
| lonely(skc29) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause21) ).
cnf(clause22,negated_conjecture,
( ssSkC0
| way(skc29) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause22) ).
cnf(clause56,negated_conjecture,
( in(skc17,skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause56) ).
cnf(clause47,negated_conjecture,
( ssSkC0
| barrel(skc30,skc28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause47) ).
cnf(clause4,negated_conjecture,
old(skc28),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(clause17,negated_conjecture,
( ssSkC0
| chevy(skc28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause17) ).
cnf(clause18,negated_conjecture,
( ssSkC0
| car(skc28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause18) ).
cnf(clause19,negated_conjecture,
( ssSkC0
| white(skc28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause19) ).
cnf(clause20,negated_conjecture,
( ssSkC0
| dirty(skc28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause20) ).
cnf(clause46,negated_conjecture,
( man(skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause46) ).
cnf(clause44,negated_conjecture,
( furniture(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause44) ).
cnf(clause45,negated_conjecture,
( young(skc17)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause45) ).
cnf(clause43,negated_conjecture,
( front(skc18)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause43) ).
cnf(clause55,negated_conjecture,
( in(skc16,skc19)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause55) ).
cnf(clause42,negated_conjecture,
( man(skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause42) ).
cnf(clause40,negated_conjecture,
( furniture(skc19)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause40) ).
cnf(clause41,negated_conjecture,
( fellow(skc16)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause41) ).
cnf(clause39,negated_conjecture,
( seat(skc19)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause39) ).
cnf(clause58,negated_conjecture,
( skc17 != skc16
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause58) ).
cnf(clause15,negated_conjecture,
fellow(skc17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause15) ).
cnf(clause14,negated_conjecture,
seat(skc18),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause14) ).
cnf(clause54,negated_conjecture,
( in(skc22,skc23)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause54) ).
cnf(clause38,negated_conjecture,
( city(skc23)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause38) ).
cnf(clause16,negated_conjecture,
young(skc16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause16) ).
cnf(clause13,negated_conjecture,
front(skc19),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause13) ).
cnf(clause53,negated_conjecture,
( down(skc22,skc20)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause53) ).
cnf(clause33,negated_conjecture,
( way(skc20)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause33) ).
cnf(clause32,negated_conjecture,
( street(skc20)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause32) ).
cnf(clause10,negated_conjecture,
event(skc22),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).
cnf(clause9,negated_conjecture,
hollywood(skc23),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause9) ).
cnf(clause52,negated_conjecture,
( barrel(skc22,skc21)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause52) ).
cnf(clause35,negated_conjecture,
( dirty(skc21)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause35) ).
cnf(clause36,negated_conjecture,
( white(skc21)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause36) ).
cnf(clause37,negated_conjecture,
( car(skc21)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause37) ).
cnf(clause34,negated_conjecture,
( old(skc21)
| ~ ssSkC0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause34) ).
cnf(clause12,negated_conjecture,
lonely(skc20),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause12) ).
cnf(clause11,negated_conjecture,
chevy(skc21),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).
cnf(c_0_60,negated_conjecture,
( ssSkC0
| X7 = X6
| ~ 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)
| ~ seat(X5)
| ~ furniture(X5)
| ~ front(X5)
| ~ in(X6,X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X7,X8)
| ~ front(X8)
| ~ furniture(X8)
| ~ seat(X8)
| ~ young(X7)
| ~ man(X7)
| ~ fellow(X7) ),
inference(fof_simplification,[status(thm)],[clause59]) ).
cnf(c_0_61,negated_conjecture,
( X7 = X6
| ~ 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)
| ~ seat(X5)
| ~ furniture(X5)
| ~ front(X5)
| ~ in(X6,X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X7,X8)
| ~ front(X8)
| ~ furniture(X8)
| ~ seat(X8)
| ~ young(X7)
| ~ man(X7)
| ~ fellow(X7)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_62,negated_conjecture,
( ssSkC0
| X7 = X6
| ~ 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)
| ~ seat(X5)
| ~ furniture(X5)
| ~ front(X5)
| ~ in(X6,X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X7,X8)
| ~ front(X8)
| ~ furniture(X8)
| ~ seat(X8)
| ~ young(X7)
| ~ man(X7)
| ~ fellow(X7) ),
c_0_60 ).
cnf(c_0_63,negated_conjecture,
( X7 = X6
| ~ 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)
| ~ seat(X5)
| ~ furniture(X5)
| ~ front(X5)
| ~ in(X6,X5)
| ~ fellow(X6)
| ~ man(X6)
| ~ young(X6)
| ~ in(X7,X8)
| ~ front(X8)
| ~ furniture(X8)
| ~ seat(X8)
| ~ young(X7)
| ~ man(X7)
| ~ fellow(X7)
| ~ ssSkC0 ),
c_0_61 ).
cnf(c_0_64,negated_conjecture,
( X1 = X2
| ~ in(X2,X3)
| ~ in(X1,X4)
| ~ in(X5,X6)
| ~ down(X5,X7)
| ~ barrel(X5,X8)
| ~ man(X2)
| ~ man(X1)
| ~ furniture(X3)
| ~ furniture(X4)
| ~ city(X6)
| ~ way(X7)
| ~ dirty(X8)
| ~ white(X8)
| ~ car(X8)
| ~ lonely(X7)
| ~ chevy(X8)
| ~ young(X2)
| ~ young(X1)
| ~ fellow(X2)
| ~ fellow(X1)
| ~ seat(X3)
| ~ seat(X4)
| ~ front(X3)
| ~ front(X4)
| ~ old(X8)
| ~ street(X7)
| ~ event(X5)
| ~ hollywood(X6) ),
inference(csr,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_65,negated_conjecture,
( ssSkC0
| in(skc24,skc27) ),
clause50 ).
cnf(c_0_66,negated_conjecture,
young(skc24),
clause8 ).
cnf(c_0_67,negated_conjecture,
front(skc27),
clause5 ).
cnf(c_0_68,negated_conjecture,
( ssSkC0
| seat(skc27) ),
clause24 ).
cnf(c_0_69,negated_conjecture,
( ssSkC0
| fellow(skc24) ),
clause26 ).
cnf(c_0_70,negated_conjecture,
( ssSkC0
| furniture(skc27) ),
clause25 ).
cnf(c_0_71,negated_conjecture,
( ssSkC0
| man(skc24) ),
clause27 ).
cnf(c_0_72,negated_conjecture,
( ssSkC0
| skc25 != skc24 ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_73,negated_conjecture,
( X1 = skc24
| ssSkC0
| ~ in(X1,X2)
| ~ in(X3,X4)
| ~ down(X3,X5)
| ~ barrel(X3,X6)
| ~ man(X1)
| ~ furniture(X2)
| ~ city(X4)
| ~ way(X5)
| ~ dirty(X6)
| ~ white(X6)
| ~ car(X6)
| ~ lonely(X5)
| ~ chevy(X6)
| ~ young(X1)
| ~ fellow(X1)
| ~ seat(X2)
| ~ front(X2)
| ~ old(X6)
| ~ street(X5)
| ~ event(X3)
| ~ hollywood(X4) ),
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_64,c_0_65]),c_0_66]),c_0_67])]),c_0_68]),c_0_69]),c_0_70]),c_0_71]) ).
cnf(c_0_74,negated_conjecture,
( ssSkC0
| in(skc25,skc26) ),
clause51 ).
cnf(c_0_75,negated_conjecture,
fellow(skc25),
clause7 ).
cnf(c_0_76,negated_conjecture,
seat(skc26),
clause6 ).
cnf(c_0_77,negated_conjecture,
( ssSkC0
| front(skc26) ),
clause28 ).
cnf(c_0_78,negated_conjecture,
( ssSkC0
| young(skc25) ),
clause30 ).
cnf(c_0_79,negated_conjecture,
( ssSkC0
| furniture(skc26) ),
clause29 ).
cnf(c_0_80,negated_conjecture,
( ssSkC0
| man(skc25) ),
clause31 ).
cnf(c_0_81,negated_conjecture,
( ssSkC0
| skc25 != skc24 ),
c_0_72 ).
cnf(c_0_82,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(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_73,c_0_74]),c_0_75]),c_0_76])]),c_0_77]),c_0_78]),c_0_79]),c_0_80]),c_0_81]) ).
cnf(c_0_83,negated_conjecture,
( ssSkC0
| in(skc30,skc31) ),
clause49 ).
cnf(c_0_84,negated_conjecture,
event(skc30),
clause2 ).
cnf(c_0_85,negated_conjecture,
hollywood(skc31),
clause1 ).
cnf(c_0_86,negated_conjecture,
( ssSkC0
| city(skc31) ),
clause23 ).
cnf(c_0_87,negated_conjecture,
( ssSkC0
| ~ down(skc30,X1)
| ~ barrel(skc30,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_82,c_0_83]),c_0_84]),c_0_85])]),c_0_86]) ).
cnf(c_0_88,negated_conjecture,
( ssSkC0
| down(skc30,skc29) ),
clause48 ).
cnf(c_0_89,negated_conjecture,
street(skc29),
clause3 ).
cnf(c_0_90,negated_conjecture,
( ssSkC0
| lonely(skc29) ),
clause21 ).
cnf(c_0_91,negated_conjecture,
( ssSkC0
| way(skc29) ),
clause22 ).
cnf(c_0_92,negated_conjecture,
( in(skc17,skc18)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_93,negated_conjecture,
( ssSkC0
| ~ barrel(skc30,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_87,c_0_88]),c_0_89])]),c_0_90]),c_0_91]) ).
cnf(c_0_94,negated_conjecture,
( ssSkC0
| barrel(skc30,skc28) ),
clause47 ).
cnf(c_0_95,negated_conjecture,
old(skc28),
clause4 ).
cnf(c_0_96,negated_conjecture,
( ssSkC0
| chevy(skc28) ),
clause17 ).
cnf(c_0_97,negated_conjecture,
( ssSkC0
| car(skc28) ),
clause18 ).
cnf(c_0_98,negated_conjecture,
( ssSkC0
| white(skc28) ),
clause19 ).
cnf(c_0_99,negated_conjecture,
( ssSkC0
| dirty(skc28) ),
clause20 ).
cnf(c_0_100,negated_conjecture,
( man(skc17)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause46]) ).
cnf(c_0_101,negated_conjecture,
( furniture(skc18)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause44]) ).
cnf(c_0_102,negated_conjecture,
( young(skc17)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause45]) ).
cnf(c_0_103,negated_conjecture,
( front(skc18)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause43]) ).
cnf(c_0_104,negated_conjecture,
( in(skc17,skc18)
| ~ ssSkC0 ),
c_0_92 ).
cnf(c_0_105,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_93,c_0_94]),c_0_95])]),c_0_96]),c_0_97]),c_0_98]),c_0_99]) ).
cnf(c_0_106,negated_conjecture,
( man(skc17)
| ~ ssSkC0 ),
c_0_100 ).
cnf(c_0_107,negated_conjecture,
( furniture(skc18)
| ~ ssSkC0 ),
c_0_101 ).
cnf(c_0_108,negated_conjecture,
( young(skc17)
| ~ ssSkC0 ),
c_0_102 ).
cnf(c_0_109,negated_conjecture,
( front(skc18)
| ~ ssSkC0 ),
c_0_103 ).
cnf(c_0_110,negated_conjecture,
( in(skc16,skc19)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause55]) ).
cnf(c_0_111,negated_conjecture,
( man(skc16)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause42]) ).
cnf(c_0_112,negated_conjecture,
( furniture(skc19)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause40]) ).
cnf(c_0_113,negated_conjecture,
( fellow(skc16)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause41]) ).
cnf(c_0_114,negated_conjecture,
( seat(skc19)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause39]) ).
cnf(c_0_115,negated_conjecture,
( skc17 != skc16
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_116,negated_conjecture,
in(skc17,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]) ).
cnf(c_0_117,negated_conjecture,
man(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_105])]) ).
cnf(c_0_118,negated_conjecture,
furniture(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_105])]) ).
cnf(c_0_119,negated_conjecture,
young(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_105])]) ).
cnf(c_0_120,negated_conjecture,
fellow(skc17),
clause15 ).
cnf(c_0_121,negated_conjecture,
seat(skc18),
clause14 ).
cnf(c_0_122,negated_conjecture,
front(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_105])]) ).
cnf(c_0_123,negated_conjecture,
( in(skc16,skc19)
| ~ ssSkC0 ),
c_0_110 ).
cnf(c_0_124,negated_conjecture,
( man(skc16)
| ~ ssSkC0 ),
c_0_111 ).
cnf(c_0_125,negated_conjecture,
( furniture(skc19)
| ~ ssSkC0 ),
c_0_112 ).
cnf(c_0_126,negated_conjecture,
( fellow(skc16)
| ~ ssSkC0 ),
c_0_113 ).
cnf(c_0_127,negated_conjecture,
( seat(skc19)
| ~ ssSkC0 ),
c_0_114 ).
cnf(c_0_128,negated_conjecture,
( skc17 != skc16
| ~ ssSkC0 ),
c_0_115 ).
cnf(c_0_129,negated_conjecture,
( in(skc22,skc23)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause54]) ).
cnf(c_0_130,negated_conjecture,
( city(skc23)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause38]) ).
cnf(c_0_131,negated_conjecture,
( X1 = skc17
| ~ in(X1,X2)
| ~ in(X3,X4)
| ~ down(X3,X5)
| ~ barrel(X3,X6)
| ~ man(X1)
| ~ furniture(X2)
| ~ city(X4)
| ~ way(X5)
| ~ dirty(X6)
| ~ white(X6)
| ~ car(X6)
| ~ lonely(X5)
| ~ chevy(X6)
| ~ young(X1)
| ~ fellow(X1)
| ~ seat(X2)
| ~ front(X2)
| ~ old(X6)
| ~ street(X5)
| ~ event(X3)
| ~ hollywood(X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[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_64,c_0_116]),c_0_117]),c_0_118]),c_0_119]),c_0_120]),c_0_121])]),c_0_122])]) ).
cnf(c_0_132,negated_conjecture,
in(skc16,skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_105])]) ).
cnf(c_0_133,negated_conjecture,
man(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_105])]) ).
cnf(c_0_134,negated_conjecture,
furniture(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_105])]) ).
cnf(c_0_135,negated_conjecture,
young(skc16),
clause16 ).
cnf(c_0_136,negated_conjecture,
fellow(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_105])]) ).
cnf(c_0_137,negated_conjecture,
seat(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_105])]) ).
cnf(c_0_138,negated_conjecture,
front(skc19),
clause13 ).
cnf(c_0_139,negated_conjecture,
skc16 != skc17,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_105])]) ).
cnf(c_0_140,negated_conjecture,
( in(skc22,skc23)
| ~ ssSkC0 ),
c_0_129 ).
cnf(c_0_141,negated_conjecture,
( city(skc23)
| ~ ssSkC0 ),
c_0_130 ).
cnf(c_0_142,negated_conjecture,
( down(skc22,skc20)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause53]) ).
cnf(c_0_143,negated_conjecture,
( way(skc20)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause33]) ).
cnf(c_0_144,negated_conjecture,
( street(skc20)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause32]) ).
cnf(c_0_145,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(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]),c_0_136]),c_0_137]),c_0_138])]),c_0_139]) ).
cnf(c_0_146,negated_conjecture,
in(skc22,skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_105])]) ).
cnf(c_0_147,negated_conjecture,
city(skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_105])]) ).
cnf(c_0_148,negated_conjecture,
event(skc22),
clause10 ).
cnf(c_0_149,negated_conjecture,
hollywood(skc23),
clause9 ).
cnf(c_0_150,negated_conjecture,
( down(skc22,skc20)
| ~ ssSkC0 ),
c_0_142 ).
cnf(c_0_151,negated_conjecture,
( way(skc20)
| ~ ssSkC0 ),
c_0_143 ).
cnf(c_0_152,negated_conjecture,
( street(skc20)
| ~ ssSkC0 ),
c_0_144 ).
cnf(c_0_153,negated_conjecture,
( barrel(skc22,skc21)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause52]) ).
cnf(c_0_154,negated_conjecture,
( dirty(skc21)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause35]) ).
cnf(c_0_155,negated_conjecture,
( white(skc21)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause36]) ).
cnf(c_0_156,negated_conjecture,
( car(skc21)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause37]) ).
cnf(c_0_157,negated_conjecture,
( old(skc21)
| ~ ssSkC0 ),
inference(fof_simplification,[status(thm)],[clause34]) ).
cnf(c_0_158,negated_conjecture,
( ~ down(skc22,X1)
| ~ barrel(skc22,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_145,c_0_146]),c_0_147]),c_0_148]),c_0_149])]) ).
cnf(c_0_159,negated_conjecture,
down(skc22,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_105])]) ).
cnf(c_0_160,negated_conjecture,
way(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_105])]) ).
cnf(c_0_161,negated_conjecture,
lonely(skc20),
clause12 ).
cnf(c_0_162,negated_conjecture,
street(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_105])]) ).
cnf(c_0_163,negated_conjecture,
( barrel(skc22,skc21)
| ~ ssSkC0 ),
c_0_153 ).
cnf(c_0_164,negated_conjecture,
( dirty(skc21)
| ~ ssSkC0 ),
c_0_154 ).
cnf(c_0_165,negated_conjecture,
( white(skc21)
| ~ ssSkC0 ),
c_0_155 ).
cnf(c_0_166,negated_conjecture,
( car(skc21)
| ~ ssSkC0 ),
c_0_156 ).
cnf(c_0_167,negated_conjecture,
( old(skc21)
| ~ ssSkC0 ),
c_0_157 ).
cnf(c_0_168,negated_conjecture,
( ~ barrel(skc22,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_158,c_0_159]),c_0_160]),c_0_161]),c_0_162])]) ).
cnf(c_0_169,negated_conjecture,
barrel(skc22,skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_105])]) ).
cnf(c_0_170,negated_conjecture,
dirty(skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_105])]) ).
cnf(c_0_171,negated_conjecture,
white(skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_165,c_0_105])]) ).
cnf(c_0_172,negated_conjecture,
car(skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_105])]) ).
cnf(c_0_173,negated_conjecture,
chevy(skc21),
clause11 ).
cnf(c_0_174,negated_conjecture,
old(skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_167,c_0_105])]) ).
cnf(c_0_175,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_168,c_0_169]),c_0_170]),c_0_171]),c_0_172]),c_0_173]),c_0_174])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NLP004-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 21:44:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 11079 completed with status 0
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting sh5l with 136s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 11084 completed with status 0
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 60
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 60
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 60
% 0.21/0.51 # Processed clauses : 150
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 150
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 6
% 0.21/0.51 # Backward-rewritten : 44
% 0.21/0.51 # Generated clauses : 20
% 0.21/0.51 # ...of the previous two non-redundant : 40
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 17
% 0.21/0.51 # Paramodulations : 20
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 80
% 0.21/0.51 # ...of those cached : 48
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 41
% 0.21/0.51 # Positive orientable unit clauses : 37
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 3
% 0.21/0.51 # Current number of unprocessed clauses: 1
% 0.21/0.51 # ...number of literals in the above : 13
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 109
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 2202
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 823
% 0.21/0.51 # Non-unit clause-clause subsumptions : 23
% 0.21/0.51 # Unit Clause-clause subsumption calls : 7
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 1
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 2959
% 0.21/0.51 # Search garbage collected termcells : 160
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.012 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.014 s
% 0.21/0.51 # Maximum resident set size: 1788 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.054 s
% 0.21/0.51 # System time : 0.008 s
% 0.21/0.51 # Total time : 0.062 s
% 0.21/0.51 # Maximum resident set size: 1744 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------