↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NLP007-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:34:05 PM UTC 2026

% Result   : Unsatisfiable 0.16s 0.49s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   60
% Syntax   : Number of clauses     :  176 (  55 unt;  44 nHn; 176 RR)
%            Number of literals    :  580 (  16 equ; 367 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,
    ( ~ fellow(X7)
    | ~ man(X7)
    | ~ young(X7)
    | ~ seat(X8)
    | ~ furniture(X8)
    | ~ front(X8)
    | ~ in(X7,X8)
    | ~ young(X6)
    | ~ man(X6)
    | ~ fellow(X6)
    | ~ in(X6,X5)
    | ~ front(X5)
    | ~ furniture(X5)
    | ~ seat(X5)
    | ~ in(X3,X4)
    | ~ city(X4)
    | ~ hollywood(X4)
    | ~ event(X3)
    | ~ barrel(X3,X2)
    | ~ down(X3,X1)
    | ~ old(X2)
    | ~ dirty(X2)
    | ~ white(X2)
    | ~ car(X2)
    | ~ chevy(X2)
    | ~ street(X1)
    | ~ way(X1)
    | ~ lonely(X1)
    | X7 = X6
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause59) ).

cnf(clause50,negated_conjecture,
    ( in(skc24,skc27)
    | ssSkC0 ),
    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,
    seat(skc27),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(clause26,negated_conjecture,
    ( front(skc27)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause26) ).

cnf(clause24,negated_conjecture,
    ( fellow(skc24)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause24) ).

cnf(clause25,negated_conjecture,
    ( man(skc24)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause25) ).

cnf(clause27,negated_conjecture,
    ( furniture(skc27)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause27) ).

cnf(clause57,negated_conjecture,
    ( skc25 != skc24
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).

cnf(clause51,negated_conjecture,
    ( in(skc25,skc26)
    | ssSkC0 ),
    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,
    front(skc26),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

cnf(clause30,negated_conjecture,
    ( seat(skc26)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause30) ).

cnf(clause28,negated_conjecture,
    ( young(skc25)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause28) ).

cnf(clause29,negated_conjecture,
    ( man(skc25)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause29) ).

cnf(clause31,negated_conjecture,
    ( furniture(skc26)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause31) ).

cnf(clause49,negated_conjecture,
    ( in(skc30,skc31)
    | ssSkC0 ),
    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,
    city(skc31),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).

cnf(clause23,negated_conjecture,
    ( hollywood(skc31)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause23) ).

cnf(clause48,negated_conjecture,
    ( barrel(skc30,skc29)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause48) ).

cnf(clause3,negated_conjecture,
    old(skc29),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

cnf(clause19,negated_conjecture,
    ( chevy(skc29)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause19) ).

cnf(clause20,negated_conjecture,
    ( car(skc29)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause20) ).

cnf(clause21,negated_conjecture,
    ( white(skc29)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause21) ).

cnf(clause22,negated_conjecture,
    ( dirty(skc29)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause22) ).

cnf(clause60,negated_conjecture,
    ( ~ ssSkC0
    | ~ in(X7,X8)
    | ~ front(X8)
    | ~ furniture(X8)
    | ~ seat(X8)
    | ~ fellow(X7)
    | ~ man(X7)
    | ~ young(X7)
    | ~ seat(X6)
    | ~ furniture(X6)
    | ~ front(X6)
    | ~ in(X5,X6)
    | ~ young(X5)
    | ~ man(X5)
    | ~ fellow(X5)
    | ~ in(X3,X4)
    | ~ city(X4)
    | ~ hollywood(X4)
    | ~ event(X3)
    | ~ barrel(X3,X2)
    | ~ down(X3,X1)
    | ~ old(X2)
    | ~ dirty(X2)
    | ~ white(X2)
    | ~ car(X2)
    | ~ chevy(X2)
    | ~ street(X1)
    | ~ way(X1)
    | ~ lonely(X1)
    | X7 = X5 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause60) ).

cnf(clause47,negated_conjecture,
    ( down(skc30,skc28)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause47) ).

cnf(clause4,negated_conjecture,
    street(skc28),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).

cnf(clause17,negated_conjecture,
    ( lonely(skc28)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause17) ).

cnf(clause18,negated_conjecture,
    ( way(skc28)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause18) ).

cnf(clause56,negated_conjecture,
    ( ~ ssSkC0
    | in(skc17,skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause56) ).

cnf(clause44,negated_conjecture,
    ( ~ ssSkC0
    | furniture(skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause44) ).

cnf(clause46,negated_conjecture,
    ( ~ ssSkC0
    | man(skc17) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause46) ).

cnf(clause45,negated_conjecture,
    ( ~ ssSkC0
    | young(skc17) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause45) ).

cnf(clause43,negated_conjecture,
    ( ~ ssSkC0
    | front(skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause43) ).

cnf(clause55,negated_conjecture,
    ( ~ ssSkC0
    | in(skc16,skc19) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause55) ).

cnf(clause40,negated_conjecture,
    ( ~ ssSkC0
    | furniture(skc19) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause40) ).

cnf(clause42,negated_conjecture,
    ( ~ ssSkC0
    | man(skc16) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause42) ).

cnf(clause41,negated_conjecture,
    ( ~ ssSkC0
    | fellow(skc16) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause41) ).

cnf(clause39,negated_conjecture,
    ( ~ ssSkC0
    | seat(skc19) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause39) ).

cnf(clause58,negated_conjecture,
    ( ~ ssSkC0
    | skc17 != skc16 ),
    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,
    ( ~ ssSkC0
    | in(skc22,skc23) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause54) ).

cnf(clause38,negated_conjecture,
    ( ~ ssSkC0
    | hollywood(skc23) ),
    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,
    ( ~ ssSkC0
    | barrel(skc22,skc21) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause53) ).

cnf(clause37,negated_conjecture,
    ( ~ ssSkC0
    | dirty(skc21) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause37) ).

cnf(clause36,negated_conjecture,
    ( ~ ssSkC0
    | white(skc21) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause36) ).

cnf(clause35,negated_conjecture,
    ( ~ ssSkC0
    | car(skc21) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause35) ).

cnf(clause34,negated_conjecture,
    ( ~ ssSkC0
    | chevy(skc21) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause34) ).

cnf(clause10,negated_conjecture,
    event(skc22),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).

cnf(clause9,negated_conjecture,
    city(skc23),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause9) ).

cnf(clause52,negated_conjecture,
    ( ~ ssSkC0
    | down(skc22,skc20) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause52) ).

cnf(clause33,negated_conjecture,
    ( ~ ssSkC0
    | way(skc20) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause33) ).

cnf(clause32,negated_conjecture,
    ( ~ ssSkC0
    | lonely(skc20) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause32) ).

cnf(clause11,negated_conjecture,
    old(skc21),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).

cnf(clause12,negated_conjecture,
    street(skc20),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause12) ).

cnf(c_0_60,negated_conjecture,
    ( ~ fellow(X7)
    | ~ man(X7)
    | ~ young(X7)
    | ~ seat(X8)
    | ~ furniture(X8)
    | ~ front(X8)
    | ~ in(X7,X8)
    | ~ young(X6)
    | ~ man(X6)
    | ~ fellow(X6)
    | ~ in(X6,X5)
    | ~ front(X5)
    | ~ furniture(X5)
    | ~ seat(X5)
    | ~ in(X3,X4)
    | ~ city(X4)
    | ~ hollywood(X4)
    | ~ event(X3)
    | ~ barrel(X3,X2)
    | ~ down(X3,X1)
    | ~ old(X2)
    | ~ dirty(X2)
    | ~ white(X2)
    | ~ car(X2)
    | ~ chevy(X2)
    | ~ street(X1)
    | ~ way(X1)
    | ~ lonely(X1)
    | X7 = X6
    | ssSkC0 ),
    inference(fof_simplification,[status(thm)],[clause59]) ).

cnf(c_0_61,negated_conjecture,
    ( ~ fellow(X7)
    | ~ man(X7)
    | ~ young(X7)
    | ~ seat(X8)
    | ~ furniture(X8)
    | ~ front(X8)
    | ~ in(X7,X8)
    | ~ young(X6)
    | ~ man(X6)
    | ~ fellow(X6)
    | ~ in(X6,X5)
    | ~ front(X5)
    | ~ furniture(X5)
    | ~ seat(X5)
    | ~ in(X3,X4)
    | ~ city(X4)
    | ~ hollywood(X4)
    | ~ event(X3)
    | ~ barrel(X3,X2)
    | ~ down(X3,X1)
    | ~ old(X2)
    | ~ dirty(X2)
    | ~ white(X2)
    | ~ car(X2)
    | ~ chevy(X2)
    | ~ street(X1)
    | ~ way(X1)
    | ~ lonely(X1)
    | X7 = X6
    | ssSkC0 ),
    c_0_60 ).

cnf(c_0_62,negated_conjecture,
    ( in(skc24,skc27)
    | ssSkC0 ),
    clause50 ).

cnf(c_0_63,negated_conjecture,
    young(skc24),
    clause8 ).

cnf(c_0_64,negated_conjecture,
    seat(skc27),
    clause5 ).

cnf(c_0_65,negated_conjecture,
    ( front(skc27)
    | ssSkC0 ),
    clause26 ).

cnf(c_0_66,negated_conjecture,
    ( fellow(skc24)
    | ssSkC0 ),
    clause24 ).

cnf(c_0_67,negated_conjecture,
    ( man(skc24)
    | ssSkC0 ),
    clause25 ).

cnf(c_0_68,negated_conjecture,
    ( furniture(skc27)
    | ssSkC0 ),
    clause27 ).

cnf(c_0_69,negated_conjecture,
    ( skc25 != skc24
    | ssSkC0 ),
    inference(fof_simplification,[status(thm)],[clause57]) ).

cnf(c_0_70,negated_conjecture,
    ( ~ city(X4)
    | ~ event(X3)
    | ~ old(X5)
    | ~ street(X6)
    | ~ seat(X2)
    | ~ front(X2)
    | ~ fellow(X1)
    | ~ young(X1)
    | ~ lonely(X6)
    | ~ way(X6)
    | ~ chevy(X5)
    | ~ car(X5)
    | ~ white(X5)
    | ~ dirty(X5)
    | ~ hollywood(X4)
    | ~ man(X1)
    | ~ furniture(X2)
    | ~ down(X3,X6)
    | ~ barrel(X3,X5)
    | ~ in(X3,X4)
    | ~ in(X1,X2)
    | ssSkC0
    | X1 = skc24 ),
    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_61,c_0_62]),c_0_63]),c_0_64])]),c_0_65]),c_0_66]),c_0_67]),c_0_68]) ).

cnf(c_0_71,negated_conjecture,
    ( in(skc25,skc26)
    | ssSkC0 ),
    clause51 ).

cnf(c_0_72,negated_conjecture,
    fellow(skc25),
    clause7 ).

cnf(c_0_73,negated_conjecture,
    front(skc26),
    clause6 ).

cnf(c_0_74,negated_conjecture,
    ( seat(skc26)
    | ssSkC0 ),
    clause30 ).

cnf(c_0_75,negated_conjecture,
    ( young(skc25)
    | ssSkC0 ),
    clause28 ).

cnf(c_0_76,negated_conjecture,
    ( man(skc25)
    | ssSkC0 ),
    clause29 ).

cnf(c_0_77,negated_conjecture,
    ( furniture(skc26)
    | ssSkC0 ),
    clause31 ).

cnf(c_0_78,negated_conjecture,
    ( skc25 != skc24
    | ssSkC0 ),
    c_0_69 ).

cnf(c_0_79,negated_conjecture,
    ( ~ city(X2)
    | ~ event(X1)
    | ~ old(X3)
    | ~ street(X4)
    | ~ lonely(X4)
    | ~ way(X4)
    | ~ chevy(X3)
    | ~ car(X3)
    | ~ white(X3)
    | ~ dirty(X3)
    | ~ hollywood(X2)
    | ~ down(X1,X4)
    | ~ barrel(X1,X3)
    | ~ in(X1,X2)
    | ssSkC0 ),
    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_70,c_0_71]),c_0_72]),c_0_73])]),c_0_74]),c_0_75]),c_0_76]),c_0_77]),c_0_78]) ).

cnf(c_0_80,negated_conjecture,
    ( in(skc30,skc31)
    | ssSkC0 ),
    clause49 ).

cnf(c_0_81,negated_conjecture,
    event(skc30),
    clause2 ).

cnf(c_0_82,negated_conjecture,
    city(skc31),
    clause1 ).

cnf(c_0_83,negated_conjecture,
    ( hollywood(skc31)
    | ssSkC0 ),
    clause23 ).

cnf(c_0_84,negated_conjecture,
    ( ~ old(X1)
    | ~ street(X2)
    | ~ lonely(X2)
    | ~ way(X2)
    | ~ chevy(X1)
    | ~ car(X1)
    | ~ white(X1)
    | ~ dirty(X1)
    | ~ down(skc30,X2)
    | ~ barrel(skc30,X1)
    | ssSkC0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82])]),c_0_83]) ).

cnf(c_0_85,negated_conjecture,
    ( barrel(skc30,skc29)
    | ssSkC0 ),
    clause48 ).

cnf(c_0_86,negated_conjecture,
    old(skc29),
    clause3 ).

cnf(c_0_87,negated_conjecture,
    ( chevy(skc29)
    | ssSkC0 ),
    clause19 ).

cnf(c_0_88,negated_conjecture,
    ( car(skc29)
    | ssSkC0 ),
    clause20 ).

cnf(c_0_89,negated_conjecture,
    ( white(skc29)
    | ssSkC0 ),
    clause21 ).

cnf(c_0_90,negated_conjecture,
    ( dirty(skc29)
    | ssSkC0 ),
    clause22 ).

cnf(c_0_91,negated_conjecture,
    ( ~ ssSkC0
    | ~ in(X7,X8)
    | ~ front(X8)
    | ~ furniture(X8)
    | ~ seat(X8)
    | ~ fellow(X7)
    | ~ man(X7)
    | ~ young(X7)
    | ~ seat(X6)
    | ~ furniture(X6)
    | ~ front(X6)
    | ~ in(X5,X6)
    | ~ young(X5)
    | ~ man(X5)
    | ~ fellow(X5)
    | ~ in(X3,X4)
    | ~ city(X4)
    | ~ hollywood(X4)
    | ~ event(X3)
    | ~ barrel(X3,X2)
    | ~ down(X3,X1)
    | ~ old(X2)
    | ~ dirty(X2)
    | ~ white(X2)
    | ~ car(X2)
    | ~ chevy(X2)
    | ~ street(X1)
    | ~ way(X1)
    | ~ lonely(X1)
    | X7 = X5 ),
    inference(fof_simplification,[status(thm)],[clause60]) ).

cnf(c_0_92,negated_conjecture,
    ( ~ street(X1)
    | ~ lonely(X1)
    | ~ way(X1)
    | ~ down(skc30,X1)
    | 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_84,c_0_85]),c_0_86])]),c_0_87]),c_0_88]),c_0_89]),c_0_90]) ).

cnf(c_0_93,negated_conjecture,
    ( down(skc30,skc28)
    | ssSkC0 ),
    clause47 ).

cnf(c_0_94,negated_conjecture,
    street(skc28),
    clause4 ).

cnf(c_0_95,negated_conjecture,
    ( lonely(skc28)
    | ssSkC0 ),
    clause17 ).

cnf(c_0_96,negated_conjecture,
    ( way(skc28)
    | ssSkC0 ),
    clause18 ).

cnf(c_0_97,negated_conjecture,
    ( ~ ssSkC0
    | in(skc17,skc18) ),
    inference(fof_simplification,[status(thm)],[clause56]) ).

cnf(c_0_98,negated_conjecture,
    ( ~ ssSkC0
    | furniture(skc18) ),
    inference(fof_simplification,[status(thm)],[clause44]) ).

cnf(c_0_99,negated_conjecture,
    ( ~ ssSkC0
    | man(skc17) ),
    inference(fof_simplification,[status(thm)],[clause46]) ).

cnf(c_0_100,negated_conjecture,
    ( ~ ssSkC0
    | young(skc17) ),
    inference(fof_simplification,[status(thm)],[clause45]) ).

cnf(c_0_101,negated_conjecture,
    ( ~ ssSkC0
    | front(skc18) ),
    inference(fof_simplification,[status(thm)],[clause43]) ).

cnf(c_0_102,negated_conjecture,
    ( ~ ssSkC0
    | ~ in(X7,X8)
    | ~ front(X8)
    | ~ furniture(X8)
    | ~ seat(X8)
    | ~ fellow(X7)
    | ~ man(X7)
    | ~ young(X7)
    | ~ seat(X6)
    | ~ furniture(X6)
    | ~ front(X6)
    | ~ in(X5,X6)
    | ~ young(X5)
    | ~ man(X5)
    | ~ fellow(X5)
    | ~ in(X3,X4)
    | ~ city(X4)
    | ~ hollywood(X4)
    | ~ event(X3)
    | ~ barrel(X3,X2)
    | ~ down(X3,X1)
    | ~ old(X2)
    | ~ dirty(X2)
    | ~ white(X2)
    | ~ car(X2)
    | ~ chevy(X2)
    | ~ street(X1)
    | ~ way(X1)
    | ~ lonely(X1)
    | X7 = X5 ),
    c_0_91 ).

cnf(c_0_103,negated_conjecture,
    ssSkC0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[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]) ).

cnf(c_0_104,negated_conjecture,
    ( ~ ssSkC0
    | in(skc17,skc18) ),
    c_0_97 ).

cnf(c_0_105,negated_conjecture,
    ( ~ ssSkC0
    | furniture(skc18) ),
    c_0_98 ).

cnf(c_0_106,negated_conjecture,
    ( ~ ssSkC0
    | man(skc17) ),
    c_0_99 ).

cnf(c_0_107,negated_conjecture,
    ( ~ ssSkC0
    | young(skc17) ),
    c_0_100 ).

cnf(c_0_108,negated_conjecture,
    ( ~ ssSkC0
    | front(skc18) ),
    c_0_101 ).

cnf(c_0_109,negated_conjecture,
    ( ~ ssSkC0
    | in(skc16,skc19) ),
    inference(fof_simplification,[status(thm)],[clause55]) ).

cnf(c_0_110,negated_conjecture,
    ( ~ ssSkC0
    | furniture(skc19) ),
    inference(fof_simplification,[status(thm)],[clause40]) ).

cnf(c_0_111,negated_conjecture,
    ( ~ ssSkC0
    | man(skc16) ),
    inference(fof_simplification,[status(thm)],[clause42]) ).

cnf(c_0_112,negated_conjecture,
    ( ~ ssSkC0
    | fellow(skc16) ),
    inference(fof_simplification,[status(thm)],[clause41]) ).

cnf(c_0_113,negated_conjecture,
    ( ~ ssSkC0
    | seat(skc19) ),
    inference(fof_simplification,[status(thm)],[clause39]) ).

cnf(c_0_114,negated_conjecture,
    ( ~ ssSkC0
    | skc17 != skc16 ),
    inference(fof_simplification,[status(thm)],[clause58]) ).

cnf(c_0_115,negated_conjecture,
    ( ~ city(X6)
    | ~ event(X5)
    | ~ old(X7)
    | ~ street(X8)
    | ~ seat(X4)
    | ~ seat(X3)
    | ~ front(X4)
    | ~ front(X3)
    | ~ fellow(X1)
    | ~ fellow(X2)
    | ~ young(X1)
    | ~ young(X2)
    | ~ lonely(X8)
    | ~ way(X8)
    | ~ chevy(X7)
    | ~ car(X7)
    | ~ white(X7)
    | ~ dirty(X7)
    | ~ hollywood(X6)
    | ~ man(X1)
    | ~ man(X2)
    | ~ furniture(X4)
    | ~ furniture(X3)
    | ~ down(X5,X8)
    | ~ barrel(X5,X7)
    | ~ in(X5,X6)
    | ~ in(X1,X4)
    | ~ in(X2,X3)
    | X1 = X2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103])]) ).

cnf(c_0_116,negated_conjecture,
    in(skc17,skc18),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_103])]) ).

cnf(c_0_117,negated_conjecture,
    furniture(skc18),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_103])]) ).

cnf(c_0_118,negated_conjecture,
    man(skc17),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_103])]) ).

cnf(c_0_119,negated_conjecture,
    young(skc17),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_103])]) ).

cnf(c_0_120,negated_conjecture,
    fellow(skc17),
    clause15 ).

cnf(c_0_121,negated_conjecture,
    front(skc18),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_103])]) ).

cnf(c_0_122,negated_conjecture,
    seat(skc18),
    clause14 ).

cnf(c_0_123,negated_conjecture,
    ( ~ ssSkC0
    | in(skc16,skc19) ),
    c_0_109 ).

cnf(c_0_124,negated_conjecture,
    ( ~ ssSkC0
    | furniture(skc19) ),
    c_0_110 ).

cnf(c_0_125,negated_conjecture,
    ( ~ ssSkC0
    | man(skc16) ),
    c_0_111 ).

cnf(c_0_126,negated_conjecture,
    ( ~ ssSkC0
    | fellow(skc16) ),
    c_0_112 ).

cnf(c_0_127,negated_conjecture,
    ( ~ ssSkC0
    | seat(skc19) ),
    c_0_113 ).

cnf(c_0_128,negated_conjecture,
    ( ~ ssSkC0
    | skc17 != skc16 ),
    c_0_114 ).

cnf(c_0_129,negated_conjecture,
    ( ~ ssSkC0
    | in(skc22,skc23) ),
    inference(fof_simplification,[status(thm)],[clause54]) ).

cnf(c_0_130,negated_conjecture,
    ( ~ ssSkC0
    | hollywood(skc23) ),
    inference(fof_simplification,[status(thm)],[clause38]) ).

cnf(c_0_131,negated_conjecture,
    ( ~ city(X4)
    | ~ event(X3)
    | ~ old(X5)
    | ~ street(X6)
    | ~ seat(X2)
    | ~ front(X2)
    | ~ fellow(X1)
    | ~ young(X1)
    | ~ lonely(X6)
    | ~ way(X6)
    | ~ chevy(X5)
    | ~ car(X5)
    | ~ white(X5)
    | ~ dirty(X5)
    | ~ hollywood(X4)
    | ~ man(X1)
    | ~ furniture(X2)
    | ~ down(X3,X6)
    | ~ barrel(X3,X5)
    | ~ in(X3,X4)
    | ~ in(X1,X2)
    | X1 = skc17 ),
    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_115,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_103])]) ).

cnf(c_0_133,negated_conjecture,
    furniture(skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_103])]) ).

cnf(c_0_134,negated_conjecture,
    man(skc16),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_103])]) ).

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_103])]) ).

cnf(c_0_137,negated_conjecture,
    front(skc19),
    clause13 ).

cnf(c_0_138,negated_conjecture,
    seat(skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_103])]) ).

cnf(c_0_139,negated_conjecture,
    skc16 != skc17,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_103])]) ).

cnf(c_0_140,negated_conjecture,
    ( ~ ssSkC0
    | in(skc22,skc23) ),
    c_0_129 ).

cnf(c_0_141,negated_conjecture,
    ( ~ ssSkC0
    | hollywood(skc23) ),
    c_0_130 ).

cnf(c_0_142,negated_conjecture,
    ( ~ ssSkC0
    | barrel(skc22,skc21) ),
    inference(fof_simplification,[status(thm)],[clause53]) ).

cnf(c_0_143,negated_conjecture,
    ( ~ ssSkC0
    | dirty(skc21) ),
    inference(fof_simplification,[status(thm)],[clause37]) ).

cnf(c_0_144,negated_conjecture,
    ( ~ ssSkC0
    | white(skc21) ),
    inference(fof_simplification,[status(thm)],[clause36]) ).

cnf(c_0_145,negated_conjecture,
    ( ~ ssSkC0
    | car(skc21) ),
    inference(fof_simplification,[status(thm)],[clause35]) ).

cnf(c_0_146,negated_conjecture,
    ( ~ ssSkC0
    | chevy(skc21) ),
    inference(fof_simplification,[status(thm)],[clause34]) ).

cnf(c_0_147,negated_conjecture,
    ( ~ city(X2)
    | ~ event(X1)
    | ~ old(X3)
    | ~ street(X4)
    | ~ lonely(X4)
    | ~ way(X4)
    | ~ chevy(X3)
    | ~ car(X3)
    | ~ white(X3)
    | ~ dirty(X3)
    | ~ hollywood(X2)
    | ~ down(X1,X4)
    | ~ barrel(X1,X3)
    | ~ in(X1,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_148,negated_conjecture,
    in(skc22,skc23),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_103])]) ).

cnf(c_0_149,negated_conjecture,
    hollywood(skc23),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_103])]) ).

cnf(c_0_150,negated_conjecture,
    event(skc22),
    clause10 ).

cnf(c_0_151,negated_conjecture,
    city(skc23),
    clause9 ).

cnf(c_0_152,negated_conjecture,
    ( ~ ssSkC0
    | barrel(skc22,skc21) ),
    c_0_142 ).

cnf(c_0_153,negated_conjecture,
    ( ~ ssSkC0
    | dirty(skc21) ),
    c_0_143 ).

cnf(c_0_154,negated_conjecture,
    ( ~ ssSkC0
    | white(skc21) ),
    c_0_144 ).

cnf(c_0_155,negated_conjecture,
    ( ~ ssSkC0
    | car(skc21) ),
    c_0_145 ).

cnf(c_0_156,negated_conjecture,
    ( ~ ssSkC0
    | chevy(skc21) ),
    c_0_146 ).

cnf(c_0_157,negated_conjecture,
    ( ~ ssSkC0
    | down(skc22,skc20) ),
    inference(fof_simplification,[status(thm)],[clause52]) ).

cnf(c_0_158,negated_conjecture,
    ( ~ ssSkC0
    | way(skc20) ),
    inference(fof_simplification,[status(thm)],[clause33]) ).

cnf(c_0_159,negated_conjecture,
    ( ~ ssSkC0
    | lonely(skc20) ),
    inference(fof_simplification,[status(thm)],[clause32]) ).

cnf(c_0_160,negated_conjecture,
    ( ~ old(X1)
    | ~ street(X2)
    | ~ lonely(X2)
    | ~ way(X2)
    | ~ chevy(X1)
    | ~ car(X1)
    | ~ white(X1)
    | ~ dirty(X1)
    | ~ down(skc22,X2)
    | ~ barrel(skc22,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_149]),c_0_150]),c_0_151])]) ).

cnf(c_0_161,negated_conjecture,
    barrel(skc22,skc21),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_103])]) ).

cnf(c_0_162,negated_conjecture,
    dirty(skc21),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_103])]) ).

cnf(c_0_163,negated_conjecture,
    white(skc21),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_154,c_0_103])]) ).

cnf(c_0_164,negated_conjecture,
    car(skc21),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_103])]) ).

cnf(c_0_165,negated_conjecture,
    chevy(skc21),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_156,c_0_103])]) ).

cnf(c_0_166,negated_conjecture,
    old(skc21),
    clause11 ).

cnf(c_0_167,negated_conjecture,
    ( ~ ssSkC0
    | down(skc22,skc20) ),
    c_0_157 ).

cnf(c_0_168,negated_conjecture,
    ( ~ ssSkC0
    | way(skc20) ),
    c_0_158 ).

cnf(c_0_169,negated_conjecture,
    ( ~ ssSkC0
    | lonely(skc20) ),
    c_0_159 ).

cnf(c_0_170,negated_conjecture,
    ( ~ street(X1)
    | ~ lonely(X1)
    | ~ way(X1)
    | ~ down(skc22,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_160,c_0_161]),c_0_162]),c_0_163]),c_0_164]),c_0_165]),c_0_166])]) ).

cnf(c_0_171,negated_conjecture,
    down(skc22,skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_167,c_0_103])]) ).

cnf(c_0_172,negated_conjecture,
    way(skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_168,c_0_103])]) ).

cnf(c_0_173,negated_conjecture,
    lonely(skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_169,c_0_103])]) ).

cnf(c_0_174,negated_conjecture,
    street(skc20),
    clause12 ).

cnf(c_0_175,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_172]),c_0_173]),c_0_174])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP007-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n008.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 01:32:23 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43  Running first-order theorem proving
% 0.16/0.43  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/benchmark/theBenchmark.p
% 0.16/0.49  % Version: 3.5.1
% 0.16/0.49  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.49  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.49  % Starting sh5l with 300s (1) cores
% 0.16/0.49  % new_bool_3 with pid 4064324 completed with status 0
% 0.16/0.49  % Result found by new_bool_3
% 0.16/0.49  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.49  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.49  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49  % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.16/0.49  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49  % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.49  % SubtermCWHack with pid 4064330 completed with status 0
% 0.16/0.49  % Result found by SubtermCWHack
% 0.16/0.49  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.49  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.49  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49  % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.16/0.49  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49  % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.49  % Preprocessing time       : 0.003 s
% 0.16/0.49  
% 0.16/0.49  % Proof found!
% 0.16/0.49  % SZS status Unsatisfiable
% 0.16/0.49  % SZS output start CNFRefutation
% See solution above
% 0.16/0.49  % Parsed axioms                        : 60
% 0.16/0.49  % Removed by relevancy pruning/SinE    : 0
% 0.16/0.49  % Initial clauses                      : 60
% 0.16/0.49  % Removed in clause preprocessing      : 0
% 0.16/0.49  % Initial clauses in saturation        : 60
% 0.16/0.49  % Processed clauses                    : 91
% 0.16/0.49  % ...of these trivial                  : 0
% 0.16/0.49  % ...subsumed                          : 0
% 0.16/0.49  % ...remaining for further processing  : 91
% 0.16/0.49  % Other redundant clauses eliminated   : 0
% 0.16/0.49  % Clauses deleted for lack of memory   : 0
% 0.16/0.49  % Backward-subsumed                    : 7
% 0.16/0.49  % Backward-rewritten                   : 44
% 0.16/0.49  % Generated clauses                    : 31
% 0.16/0.49  % ...of the previous two non-redundant : 48
% 0.16/0.49  % ...aggressively subsumed             : 0
% 0.16/0.49  % Contextual simplify-reflections      : 16
% 0.16/0.49  % Paramodulations                      : 31
% 0.16/0.49  % Factorizations                       : 0
% 0.16/0.49  % NegExts                              : 0
% 0.16/0.49  % Equation resolutions                 : 0
% 0.16/0.49  % Disequality decompositions           : 0
% 0.16/0.49  % Total rewrite steps                  : 100
% 0.16/0.49  % ...of those cached                   : 68
% 0.16/0.49  % Propositional unsat checks           : 0
% 0.16/0.49  %    Propositional check models        : 0
% 0.16/0.49  %    Propositional check unsatisfiable : 0
% 0.16/0.49  %    Propositional clauses             : 0
% 0.16/0.49  %    Propositional clauses after purity: 0
% 0.16/0.49  %    Propositional unsat core size     : 0
% 0.16/0.49  %    Propositional preprocessing time  : 0.000
% 0.16/0.49  %    Propositional encoding time       : 0.000
% 0.16/0.49  %    Propositional solver time         : 0.000
% 0.16/0.49  %    Success case prop preproc time    : 0.000
% 0.16/0.49  %    Success case prop encoding time   : 0.000
% 0.16/0.49  %    Success case prop solver time     : 0.000
% 0.16/0.49  % Current number of processed clauses  : 40
% 0.16/0.49  %    Positive orientable unit clauses  : 37
% 0.16/0.49  %    Positive unorientable unit clauses: 0
% 0.16/0.49  %    Negative unit clauses             : 1
% 0.16/0.49  %    Non-unit-clauses                  : 2
% 0.16/0.49  % Current number of unprocessed clauses: 6
% 0.16/0.49  % ...number of literals in the above   : 110
% 0.16/0.49  % Current number of archived formulas  : 0
% 0.16/0.49  % Current number of archived clauses   : 51
% 0.16/0.49  % Clause-clause subsumption calls (NU) : 2331
% 0.16/0.49  % Rec. Clause-clause subsumption calls : 642
% 0.16/0.49  % Non-unit clause-clause subsumptions  : 23
% 0.16/0.49  % Unit Clause-clause subsumption calls : 6
% 0.16/0.49  % Rewrite failures with RHS unbound    : 0
% 0.16/0.49  % BW rewrite match attempts            : 1
% 0.16/0.49  % BW rewrite match successes           : 1
% 0.16/0.49  % Condensation attempts                : 0
% 0.16/0.49  % Condensation successes               : 0
% 0.16/0.49  % Termbank termtop insertions          : 3750
% 0.16/0.49  % Search garbage collected termcells   : 154
% 0.16/0.49  
% 0.16/0.49  % -------------------------------------------------
% 0.16/0.49  % User time                : 0.019 s
% 0.16/0.49  % System time              : 0.003 s
% 0.16/0.49  % Total time               : 0.022 s
% 0.16/0.49  % Maximum resident set size: 3684 pages
% 0.16/0.49  
% 0.16/0.49  % -------------------------------------------------
% 0.16/0.49  % User time                : 0.024 s
% 0.16/0.49  % System time              : 0.010 s
% 0.16/0.49  % Total time               : 0.033 s
% 0.16/0.49  % Maximum resident set size: 4608 pages
% 0.16/0.49  % E exiting
%------------------------------------------------------------------------------