TSTP Solution File: NLP258+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP258+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:55:46 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 55 ( 18 unt; 0 def)
% Number of atoms : 703 ( 0 equ)
% Maximal formula atoms : 104 ( 12 avg)
% Number of connectives : 1161 ( 513 ~; 491 |; 149 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 80 ( 13 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-12 aty)
% Number of variables : 259 ( 0 sgn 37 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ( ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6,X7,X8] :
( of(X1,X3,X2)
& man(X1,X2)
& vincent_forename(X1,X3)
& forename(X1,X3)
& proposition(X1,X5)
& agent(X1,X4,X2)
& theme(X1,X4,X5)
& event(X1,X4)
& present(X1,X4)
& think_believe_consider(X1,X4)
& accessible_world(X1,X5)
& ! [X9] :
( man(X5,X9)
=> ? [X10] :
( event(X5,X10)
& agent(X5,X10,X9)
& present(X5,X10)
& smoke(X5,X10) ) )
& of(X1,X6,X7)
& man(X1,X7)
& jules_forename(X1,X6)
& forename(X1,X6)
& man(X1,X7)
& state(X1,X8)
& be(X1,X8,X7,X7) ) )
& ~ ? [X11] :
( actual_world(X11)
& ? [X12,X13,X2,X3,X4,X5,X6,X7,X8,X14,X15] :
( of(X11,X12,X7)
& jules_forename(X11,X12)
& forename(X11,X12)
& of(X11,X13,X2)
& vincent_forename(X11,X13)
& forename(X11,X13)
& of(X11,X3,X2)
& man(X11,X2)
& vincent_forename(X11,X3)
& forename(X11,X3)
& proposition(X11,X5)
& agent(X11,X4,X2)
& theme(X11,X4,X5)
& event(X11,X4)
& present(X11,X4)
& think_believe_consider(X11,X4)
& accessible_world(X11,X5)
& ! [X9] :
( man(X5,X9)
=> ? [X10] :
( event(X5,X10)
& agent(X5,X10,X9)
& present(X5,X10)
& smoke(X5,X10) ) )
& of(X11,X6,X7)
& man(X11,X7)
& jules_forename(X11,X6)
& forename(X11,X6)
& man(X11,X7)
& state(X11,X8)
& be(X11,X8,X7,X7)
& proposition(X11,X15)
& agent(X11,X14,X2)
& theme(X11,X14,X15)
& event(X11,X14)
& present(X11,X14)
& think_believe_consider(X11,X14)
& accessible_world(X11,X15)
& ? [X16] :
( event(X15,X16)
& agent(X15,X16,X7)
& present(X15,X16)
& smoke(X15,X16) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1,X2] :
( jules_forename(X1,X2)
=> forename(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
fof(ax2,axiom,
! [X1,X2] :
( vincent_forename(X1,X2)
=> forename(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
fof(ax30,axiom,
! [X1,X2] :
( smoke(X1,X2)
=> event(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax30) ).
fof(ax49,axiom,
! [X1,X2,X3] :
( ( accessible_world(X2,X3)
& man(X2,X1) )
=> man(X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(c_0_5,negated_conjecture,
~ ~ ( ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6,X7,X8] :
( of(X1,X3,X2)
& man(X1,X2)
& vincent_forename(X1,X3)
& forename(X1,X3)
& proposition(X1,X5)
& agent(X1,X4,X2)
& theme(X1,X4,X5)
& event(X1,X4)
& present(X1,X4)
& think_believe_consider(X1,X4)
& accessible_world(X1,X5)
& ! [X9] :
( man(X5,X9)
=> ? [X10] :
( event(X5,X10)
& agent(X5,X10,X9)
& present(X5,X10)
& smoke(X5,X10) ) )
& of(X1,X6,X7)
& man(X1,X7)
& jules_forename(X1,X6)
& forename(X1,X6)
& man(X1,X7)
& state(X1,X8)
& be(X1,X8,X7,X7) ) )
& ~ ? [X11] :
( actual_world(X11)
& ? [X12,X13,X2,X3,X4,X5,X6,X7,X8,X14,X15] :
( of(X11,X12,X7)
& jules_forename(X11,X12)
& forename(X11,X12)
& of(X11,X13,X2)
& vincent_forename(X11,X13)
& forename(X11,X13)
& of(X11,X3,X2)
& man(X11,X2)
& vincent_forename(X11,X3)
& forename(X11,X3)
& proposition(X11,X5)
& agent(X11,X4,X2)
& theme(X11,X4,X5)
& event(X11,X4)
& present(X11,X4)
& think_believe_consider(X11,X4)
& accessible_world(X11,X5)
& ! [X9] :
( man(X5,X9)
=> ? [X10] :
( event(X5,X10)
& agent(X5,X10,X9)
& present(X5,X10)
& smoke(X5,X10) ) )
& of(X11,X6,X7)
& man(X11,X7)
& jules_forename(X11,X6)
& forename(X11,X6)
& man(X11,X7)
& state(X11,X8)
& be(X11,X8,X7,X7)
& proposition(X11,X15)
& agent(X11,X14,X2)
& theme(X11,X14,X15)
& event(X11,X14)
& present(X11,X14)
& think_believe_consider(X11,X14)
& accessible_world(X11,X15)
& ? [X16] :
( event(X15,X16)
& agent(X15,X16,X7)
& present(X15,X16)
& smoke(X15,X16) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,negated_conjecture,
! [X25,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X40,X41] :
( actual_world(esk1_0)
& of(esk1_0,esk3_0,esk2_0)
& man(esk1_0,esk2_0)
& vincent_forename(esk1_0,esk3_0)
& forename(esk1_0,esk3_0)
& proposition(esk1_0,esk5_0)
& agent(esk1_0,esk4_0,esk2_0)
& theme(esk1_0,esk4_0,esk5_0)
& event(esk1_0,esk4_0)
& present(esk1_0,esk4_0)
& think_believe_consider(esk1_0,esk4_0)
& accessible_world(esk1_0,esk5_0)
& ( event(esk5_0,esk9_1(X25))
| ~ man(esk5_0,X25) )
& ( agent(esk5_0,esk9_1(X25),X25)
| ~ man(esk5_0,X25) )
& ( present(esk5_0,esk9_1(X25))
| ~ man(esk5_0,X25) )
& ( smoke(esk5_0,esk9_1(X25))
| ~ man(esk5_0,X25) )
& of(esk1_0,esk6_0,esk7_0)
& man(esk1_0,esk7_0)
& jules_forename(esk1_0,esk6_0)
& forename(esk1_0,esk6_0)
& man(esk1_0,esk7_0)
& state(esk1_0,esk8_0)
& be(esk1_0,esk8_0,esk7_0,esk7_0)
& ( man(X33,esk10_12(X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38))
| ~ of(X27,X28,X35)
| ~ jules_forename(X27,X28)
| ~ forename(X27,X28)
| ~ of(X27,X29,X30)
| ~ vincent_forename(X27,X29)
| ~ forename(X27,X29)
| ~ of(X27,X31,X30)
| ~ man(X27,X30)
| ~ vincent_forename(X27,X31)
| ~ forename(X27,X31)
| ~ proposition(X27,X33)
| ~ agent(X27,X32,X30)
| ~ theme(X27,X32,X33)
| ~ event(X27,X32)
| ~ present(X27,X32)
| ~ think_believe_consider(X27,X32)
| ~ accessible_world(X27,X33)
| ~ of(X27,X34,X35)
| ~ man(X27,X35)
| ~ jules_forename(X27,X34)
| ~ forename(X27,X34)
| ~ man(X27,X35)
| ~ state(X27,X36)
| ~ be(X27,X36,X35,X35)
| ~ proposition(X27,X38)
| ~ agent(X27,X37,X30)
| ~ theme(X27,X37,X38)
| ~ event(X27,X37)
| ~ present(X27,X37)
| ~ think_believe_consider(X27,X37)
| ~ accessible_world(X27,X38)
| ~ event(X38,X41)
| ~ agent(X38,X41,X35)
| ~ present(X38,X41)
| ~ smoke(X38,X41)
| ~ actual_world(X27) )
& ( ~ event(X33,X40)
| ~ agent(X33,X40,esk10_12(X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38))
| ~ present(X33,X40)
| ~ smoke(X33,X40)
| ~ of(X27,X28,X35)
| ~ jules_forename(X27,X28)
| ~ forename(X27,X28)
| ~ of(X27,X29,X30)
| ~ vincent_forename(X27,X29)
| ~ forename(X27,X29)
| ~ of(X27,X31,X30)
| ~ man(X27,X30)
| ~ vincent_forename(X27,X31)
| ~ forename(X27,X31)
| ~ proposition(X27,X33)
| ~ agent(X27,X32,X30)
| ~ theme(X27,X32,X33)
| ~ event(X27,X32)
| ~ present(X27,X32)
| ~ think_believe_consider(X27,X32)
| ~ accessible_world(X27,X33)
| ~ of(X27,X34,X35)
| ~ man(X27,X35)
| ~ jules_forename(X27,X34)
| ~ forename(X27,X34)
| ~ man(X27,X35)
| ~ state(X27,X36)
| ~ be(X27,X36,X35,X35)
| ~ proposition(X27,X38)
| ~ agent(X27,X37,X30)
| ~ theme(X27,X37,X38)
| ~ event(X27,X37)
| ~ present(X27,X37)
| ~ think_believe_consider(X27,X37)
| ~ accessible_world(X27,X38)
| ~ event(X38,X41)
| ~ agent(X38,X41,X35)
| ~ present(X38,X41)
| ~ smoke(X38,X41)
| ~ actual_world(X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ event(X1,X2)
| ~ agent(X1,X2,esk10_12(X3,X4,X5,X6,X7,X8,X1,X9,X10,X11,X12,X13))
| ~ present(X1,X2)
| ~ smoke(X1,X2)
| ~ of(X3,X4,X10)
| ~ jules_forename(X3,X4)
| ~ forename(X3,X4)
| ~ of(X3,X5,X6)
| ~ vincent_forename(X3,X5)
| ~ forename(X3,X5)
| ~ of(X3,X7,X6)
| ~ man(X3,X6)
| ~ vincent_forename(X3,X7)
| ~ forename(X3,X7)
| ~ proposition(X3,X1)
| ~ agent(X3,X8,X6)
| ~ theme(X3,X8,X1)
| ~ event(X3,X8)
| ~ present(X3,X8)
| ~ think_believe_consider(X3,X8)
| ~ accessible_world(X3,X1)
| ~ of(X3,X9,X10)
| ~ man(X3,X10)
| ~ jules_forename(X3,X9)
| ~ forename(X3,X9)
| ~ man(X3,X10)
| ~ state(X3,X11)
| ~ be(X3,X11,X10,X10)
| ~ proposition(X3,X13)
| ~ agent(X3,X12,X6)
| ~ theme(X3,X12,X13)
| ~ event(X3,X12)
| ~ present(X3,X12)
| ~ think_believe_consider(X3,X12)
| ~ accessible_world(X3,X13)
| ~ event(X13,X14)
| ~ agent(X13,X14,X10)
| ~ present(X13,X14)
| ~ smoke(X13,X14)
| ~ actual_world(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X103,X104] :
( ~ jules_forename(X103,X104)
| forename(X103,X104) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])]) ).
fof(c_0_9,plain,
! [X116,X117] :
( ~ vincent_forename(X116,X117)
| forename(X116,X117) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2])])]) ).
fof(c_0_10,plain,
! [X42,X43] :
( ~ smoke(X42,X43)
| event(X42,X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax30])])]) ).
cnf(c_0_11,negated_conjecture,
( man(X1,esk10_12(X2,X3,X4,X5,X6,X7,X1,X8,X9,X10,X11,X12))
| ~ of(X2,X3,X9)
| ~ jules_forename(X2,X3)
| ~ forename(X2,X3)
| ~ of(X2,X4,X5)
| ~ vincent_forename(X2,X4)
| ~ forename(X2,X4)
| ~ of(X2,X6,X5)
| ~ man(X2,X5)
| ~ vincent_forename(X2,X6)
| ~ forename(X2,X6)
| ~ proposition(X2,X1)
| ~ agent(X2,X7,X5)
| ~ theme(X2,X7,X1)
| ~ event(X2,X7)
| ~ present(X2,X7)
| ~ think_believe_consider(X2,X7)
| ~ accessible_world(X2,X1)
| ~ of(X2,X8,X9)
| ~ man(X2,X9)
| ~ jules_forename(X2,X8)
| ~ forename(X2,X8)
| ~ man(X2,X9)
| ~ state(X2,X10)
| ~ be(X2,X10,X9,X9)
| ~ proposition(X2,X12)
| ~ agent(X2,X11,X5)
| ~ theme(X2,X11,X12)
| ~ event(X2,X11)
| ~ present(X2,X11)
| ~ think_believe_consider(X2,X11)
| ~ accessible_world(X2,X12)
| ~ event(X12,X13)
| ~ agent(X12,X13,X9)
| ~ present(X12,X13)
| ~ smoke(X12,X13)
| ~ actual_world(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ actual_world(X3)
| ~ jules_forename(X3,X9)
| ~ jules_forename(X3,X4)
| ~ forename(X3,X9)
| ~ forename(X3,X7)
| ~ forename(X3,X5)
| ~ forename(X3,X4)
| ~ vincent_forename(X3,X7)
| ~ vincent_forename(X3,X5)
| ~ man(X3,X10)
| ~ man(X3,X6)
| ~ state(X3,X11)
| ~ event(X13,X14)
| ~ event(X3,X12)
| ~ event(X3,X8)
| ~ event(X1,X2)
| ~ proposition(X3,X13)
| ~ proposition(X3,X1)
| ~ smoke(X13,X14)
| ~ smoke(X1,X2)
| ~ accessible_world(X3,X13)
| ~ accessible_world(X3,X1)
| ~ think_believe_consider(X3,X12)
| ~ think_believe_consider(X3,X8)
| ~ present(X13,X14)
| ~ present(X3,X12)
| ~ present(X3,X8)
| ~ present(X1,X2)
| ~ of(X3,X9,X10)
| ~ of(X3,X7,X6)
| ~ of(X3,X5,X6)
| ~ of(X3,X4,X10)
| ~ theme(X3,X12,X13)
| ~ theme(X3,X8,X1)
| ~ agent(X13,X14,X10)
| ~ agent(X3,X12,X6)
| ~ agent(X3,X8,X6)
| ~ be(X3,X11,X10,X10)
| ~ agent(X1,X2,esk10_12(X3,X4,X5,X6,X7,X8,X1,X9,X10,X11,X12,X13)) ),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( forename(X1,X2)
| ~ jules_forename(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( forename(X1,X2)
| ~ vincent_forename(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( event(X1,X2)
| ~ smoke(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( man(X1,esk10_12(X2,X3,X4,X5,X6,X7,X1,X8,X9,X10,X11,X12))
| ~ actual_world(X2)
| ~ jules_forename(X2,X8)
| ~ jules_forename(X2,X3)
| ~ forename(X2,X8)
| ~ forename(X2,X6)
| ~ forename(X2,X4)
| ~ forename(X2,X3)
| ~ vincent_forename(X2,X6)
| ~ vincent_forename(X2,X4)
| ~ man(X2,X9)
| ~ man(X2,X5)
| ~ state(X2,X10)
| ~ event(X12,X13)
| ~ event(X2,X11)
| ~ event(X2,X7)
| ~ proposition(X2,X12)
| ~ proposition(X2,X1)
| ~ smoke(X12,X13)
| ~ accessible_world(X2,X12)
| ~ accessible_world(X2,X1)
| ~ think_believe_consider(X2,X11)
| ~ think_believe_consider(X2,X7)
| ~ present(X12,X13)
| ~ present(X2,X11)
| ~ present(X2,X7)
| ~ of(X2,X8,X9)
| ~ of(X2,X6,X5)
| ~ of(X2,X4,X5)
| ~ of(X2,X3,X9)
| ~ theme(X2,X11,X12)
| ~ theme(X2,X7,X1)
| ~ agent(X12,X13,X9)
| ~ agent(X2,X11,X5)
| ~ agent(X2,X7,X5)
| ~ be(X2,X10,X9,X9) ),
inference(cn,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ actual_world(X1)
| ~ present(X2,X3)
| ~ present(X1,X4)
| ~ present(X1,X5)
| ~ present(X6,X7)
| ~ agent(X6,X7,esk10_12(X1,X8,X9,X10,X11,X5,X6,X12,X13,X14,X4,X2))
| ~ agent(X2,X3,X13)
| ~ agent(X1,X4,X10)
| ~ agent(X1,X5,X10)
| ~ think_believe_consider(X1,X4)
| ~ think_believe_consider(X1,X5)
| ~ theme(X1,X4,X2)
| ~ theme(X1,X5,X6)
| ~ be(X1,X14,X13,X13)
| ~ of(X1,X12,X13)
| ~ of(X1,X11,X10)
| ~ of(X1,X9,X10)
| ~ of(X1,X8,X13)
| ~ accessible_world(X1,X2)
| ~ accessible_world(X1,X6)
| ~ smoke(X2,X3)
| ~ smoke(X6,X7)
| ~ proposition(X1,X2)
| ~ proposition(X1,X6)
| ~ event(X1,X4)
| ~ event(X1,X5)
| ~ state(X1,X14)
| ~ man(X1,X13)
| ~ man(X1,X10)
| ~ vincent_forename(X1,X11)
| ~ vincent_forename(X1,X9)
| ~ jules_forename(X1,X12)
| ~ jules_forename(X1,X8) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_14]),c_0_13]),c_0_15]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( agent(esk5_0,esk9_1(X1),X1)
| ~ man(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( man(X1,esk10_12(X2,X3,X4,X5,X6,X7,X1,X8,X9,X10,X11,X12))
| ~ actual_world(X2)
| ~ present(X12,X13)
| ~ present(X2,X11)
| ~ present(X2,X7)
| ~ agent(X12,X13,X9)
| ~ agent(X2,X11,X5)
| ~ agent(X2,X7,X5)
| ~ think_believe_consider(X2,X11)
| ~ think_believe_consider(X2,X7)
| ~ theme(X2,X11,X12)
| ~ theme(X2,X7,X1)
| ~ be(X2,X10,X9,X9)
| ~ of(X2,X8,X9)
| ~ of(X2,X6,X5)
| ~ of(X2,X4,X5)
| ~ of(X2,X3,X9)
| ~ accessible_world(X2,X12)
| ~ accessible_world(X2,X1)
| ~ smoke(X12,X13)
| ~ proposition(X2,X12)
| ~ proposition(X2,X1)
| ~ event(X2,X11)
| ~ event(X2,X7)
| ~ state(X2,X10)
| ~ man(X2,X9)
| ~ man(X2,X5)
| ~ vincent_forename(X2,X6)
| ~ vincent_forename(X2,X4)
| ~ jules_forename(X2,X8)
| ~ jules_forename(X2,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_16,c_0_13]),c_0_14]),c_0_14]),c_0_13]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ actual_world(X1)
| ~ present(esk5_0,esk9_1(esk10_12(X1,X2,X3,X4,X5,X6,esk5_0,X7,X8,X9,X10,X11)))
| ~ present(X11,X12)
| ~ present(X1,X10)
| ~ present(X1,X6)
| ~ agent(X11,X12,X8)
| ~ agent(X1,X10,X4)
| ~ agent(X1,X6,X4)
| ~ think_believe_consider(X1,X10)
| ~ think_believe_consider(X1,X6)
| ~ theme(X1,X6,esk5_0)
| ~ theme(X1,X10,X11)
| ~ be(X1,X9,X8,X8)
| ~ of(X1,X7,X8)
| ~ of(X1,X5,X4)
| ~ of(X1,X3,X4)
| ~ of(X1,X2,X8)
| ~ accessible_world(X1,esk5_0)
| ~ accessible_world(X1,X11)
| ~ smoke(esk5_0,esk9_1(esk10_12(X1,X2,X3,X4,X5,X6,esk5_0,X7,X8,X9,X10,X11)))
| ~ smoke(X11,X12)
| ~ proposition(X1,esk5_0)
| ~ proposition(X1,X11)
| ~ event(X1,X10)
| ~ event(X1,X6)
| ~ state(X1,X9)
| ~ man(X1,X8)
| ~ man(X1,X4)
| ~ vincent_forename(X1,X5)
| ~ vincent_forename(X1,X3)
| ~ jules_forename(X1,X7)
| ~ jules_forename(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( smoke(esk5_0,esk9_1(X1))
| ~ man(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
( ~ actual_world(X1)
| ~ present(esk5_0,esk9_1(esk10_12(X1,X2,X3,X4,X5,X6,esk5_0,X7,X8,X9,X10,X11)))
| ~ present(X11,X12)
| ~ present(X1,X10)
| ~ present(X1,X6)
| ~ agent(X11,X12,X8)
| ~ agent(X1,X10,X4)
| ~ agent(X1,X6,X4)
| ~ think_believe_consider(X1,X10)
| ~ think_believe_consider(X1,X6)
| ~ theme(X1,X6,esk5_0)
| ~ theme(X1,X10,X11)
| ~ be(X1,X9,X8,X8)
| ~ of(X1,X7,X8)
| ~ of(X1,X5,X4)
| ~ of(X1,X3,X4)
| ~ of(X1,X2,X8)
| ~ accessible_world(X1,esk5_0)
| ~ accessible_world(X1,X11)
| ~ smoke(X11,X12)
| ~ proposition(X1,esk5_0)
| ~ proposition(X1,X11)
| ~ event(X1,X10)
| ~ event(X1,X6)
| ~ state(X1,X9)
| ~ man(X1,X8)
| ~ man(X1,X4)
| ~ vincent_forename(X1,X5)
| ~ vincent_forename(X1,X3)
| ~ jules_forename(X1,X7)
| ~ jules_forename(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( present(esk5_0,esk9_1(X1))
| ~ man(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( ~ actual_world(X1)
| ~ present(X2,X3)
| ~ present(X1,X4)
| ~ present(X1,X5)
| ~ agent(X2,X3,X6)
| ~ agent(X1,X4,X7)
| ~ agent(X1,X5,X7)
| ~ think_believe_consider(X1,X4)
| ~ think_believe_consider(X1,X5)
| ~ theme(X1,X5,esk5_0)
| ~ theme(X1,X4,X2)
| ~ be(X1,X8,X6,X6)
| ~ of(X1,X9,X6)
| ~ of(X1,X10,X7)
| ~ of(X1,X11,X7)
| ~ of(X1,X12,X6)
| ~ accessible_world(X1,esk5_0)
| ~ accessible_world(X1,X2)
| ~ smoke(X2,X3)
| ~ proposition(X1,esk5_0)
| ~ proposition(X1,X2)
| ~ event(X1,X4)
| ~ event(X1,X5)
| ~ state(X1,X8)
| ~ man(X1,X6)
| ~ man(X1,X7)
| ~ vincent_forename(X1,X10)
| ~ vincent_forename(X1,X11)
| ~ jules_forename(X1,X9)
| ~ jules_forename(X1,X12) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
theme(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
actual_world(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
present(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
think_believe_consider(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
accessible_world(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
proposition(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,negated_conjecture,
event(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
( ~ present(esk1_0,X1)
| ~ present(X2,X3)
| ~ agent(esk1_0,esk4_0,X4)
| ~ agent(esk1_0,X1,X4)
| ~ agent(X2,X3,X5)
| ~ think_believe_consider(esk1_0,X1)
| ~ theme(esk1_0,X1,X2)
| ~ be(esk1_0,X6,X5,X5)
| ~ of(esk1_0,X7,X5)
| ~ of(esk1_0,X8,X4)
| ~ of(esk1_0,X9,X4)
| ~ of(esk1_0,X10,X5)
| ~ accessible_world(esk1_0,X2)
| ~ smoke(X2,X3)
| ~ proposition(esk1_0,X2)
| ~ event(esk1_0,X1)
| ~ state(esk1_0,X6)
| ~ man(esk1_0,X5)
| ~ man(esk1_0,X4)
| ~ vincent_forename(esk1_0,X8)
| ~ vincent_forename(esk1_0,X9)
| ~ jules_forename(esk1_0,X7)
| ~ jules_forename(esk1_0,X10) ),
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_24,c_0_25]),c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_33,negated_conjecture,
agent(esk1_0,esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_34,negated_conjecture,
man(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
( ~ present(esk1_0,X1)
| ~ present(X2,X3)
| ~ agent(esk1_0,X1,esk2_0)
| ~ agent(X2,X3,X4)
| ~ think_believe_consider(esk1_0,X1)
| ~ theme(esk1_0,X1,X2)
| ~ be(esk1_0,X5,X4,X4)
| ~ of(esk1_0,X6,esk2_0)
| ~ of(esk1_0,X7,esk2_0)
| ~ of(esk1_0,X8,X4)
| ~ of(esk1_0,X9,X4)
| ~ accessible_world(esk1_0,X2)
| ~ smoke(X2,X3)
| ~ proposition(esk1_0,X2)
| ~ event(esk1_0,X1)
| ~ state(esk1_0,X5)
| ~ man(esk1_0,X4)
| ~ vincent_forename(esk1_0,X6)
| ~ vincent_forename(esk1_0,X7)
| ~ jules_forename(esk1_0,X8)
| ~ jules_forename(esk1_0,X9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_36,negated_conjecture,
be(esk1_0,esk8_0,esk7_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_37,negated_conjecture,
state(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_38,negated_conjecture,
man(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_39,negated_conjecture,
( ~ present(esk1_0,X1)
| ~ present(X2,X3)
| ~ agent(esk1_0,X1,esk2_0)
| ~ agent(X2,X3,esk7_0)
| ~ think_believe_consider(esk1_0,X1)
| ~ theme(esk1_0,X1,X2)
| ~ of(esk1_0,X4,esk2_0)
| ~ of(esk1_0,X5,esk2_0)
| ~ of(esk1_0,X6,esk7_0)
| ~ of(esk1_0,X7,esk7_0)
| ~ accessible_world(esk1_0,X2)
| ~ smoke(X2,X3)
| ~ proposition(esk1_0,X2)
| ~ event(esk1_0,X1)
| ~ vincent_forename(esk1_0,X4)
| ~ vincent_forename(esk1_0,X5)
| ~ jules_forename(esk1_0,X6)
| ~ jules_forename(esk1_0,X7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_40,negated_conjecture,
( ~ present(esk5_0,X1)
| ~ agent(esk5_0,X1,esk7_0)
| ~ of(esk1_0,X2,esk2_0)
| ~ of(esk1_0,X3,esk2_0)
| ~ of(esk1_0,X4,esk7_0)
| ~ of(esk1_0,X5,esk7_0)
| ~ smoke(esk5_0,X1)
| ~ vincent_forename(esk1_0,X2)
| ~ vincent_forename(esk1_0,X3)
| ~ jules_forename(esk1_0,X4)
| ~ jules_forename(esk1_0,X5) ),
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_39,c_0_25]),c_0_27]),c_0_33]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_41,negated_conjecture,
( ~ agent(esk5_0,esk9_1(X1),esk7_0)
| ~ of(esk1_0,X2,esk2_0)
| ~ of(esk1_0,X3,esk2_0)
| ~ of(esk1_0,X4,esk7_0)
| ~ of(esk1_0,X5,esk7_0)
| ~ man(esk5_0,X1)
| ~ vincent_forename(esk1_0,X2)
| ~ vincent_forename(esk1_0,X3)
| ~ jules_forename(esk1_0,X4)
| ~ jules_forename(esk1_0,X5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_21]),c_0_23]) ).
cnf(c_0_42,negated_conjecture,
( ~ of(esk1_0,X1,esk2_0)
| ~ of(esk1_0,X2,esk2_0)
| ~ of(esk1_0,X3,esk7_0)
| ~ of(esk1_0,X4,esk7_0)
| ~ man(esk5_0,esk7_0)
| ~ vincent_forename(esk1_0,X1)
| ~ vincent_forename(esk1_0,X2)
| ~ jules_forename(esk1_0,X3)
| ~ jules_forename(esk1_0,X4) ),
inference(spm,[status(thm)],[c_0_41,c_0_18]) ).
cnf(c_0_43,negated_conjecture,
vincent_forename(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_44,negated_conjecture,
of(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_45,negated_conjecture,
( ~ of(esk1_0,X1,esk2_0)
| ~ of(esk1_0,X2,esk7_0)
| ~ of(esk1_0,X3,esk7_0)
| ~ man(esk5_0,esk7_0)
| ~ vincent_forename(esk1_0,X1)
| ~ jules_forename(esk1_0,X2)
| ~ jules_forename(esk1_0,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_46,negated_conjecture,
( ~ of(esk1_0,X1,esk7_0)
| ~ of(esk1_0,X2,esk7_0)
| ~ man(esk5_0,esk7_0)
| ~ jules_forename(esk1_0,X1)
| ~ jules_forename(esk1_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_43]),c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
jules_forename(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_48,negated_conjecture,
of(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_49,plain,
! [X97,X98,X99] :
( ~ accessible_world(X98,X99)
| ~ man(X98,X97)
| man(X99,X97) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])]) ).
cnf(c_0_50,negated_conjecture,
( ~ of(esk1_0,X1,esk7_0)
| ~ man(esk5_0,esk7_0)
| ~ jules_forename(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_51,plain,
( man(X2,X3)
| ~ accessible_world(X1,X2)
| ~ man(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_52,negated_conjecture,
~ man(esk5_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_47]),c_0_48])]) ).
cnf(c_0_53,negated_conjecture,
( man(esk5_0,X1)
| ~ man(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_29]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NLP258+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 21:48:52 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 28871 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHHSF-FFMM33-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # SAT001_MinMin_p005000_rr_RG with pid 28874 completed with status 0
% 0.21/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHHSF-FFMM33-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # Preprocessing time : 0.004 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 72
% 0.21/0.54 # Removed by relevancy pruning/SinE : 20
% 0.21/0.54 # Initial clauses : 76
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 76
% 0.21/0.54 # Processed clauses : 272
% 0.21/0.54 # ...of these trivial : 1
% 0.21/0.54 # ...subsumed : 18
% 0.21/0.54 # ...remaining for further processing : 253
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 8
% 0.21/0.54 # Backward-rewritten : 0
% 0.21/0.54 # Generated clauses : 156
% 0.21/0.54 # ...of the previous two non-redundant : 153
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 15
% 0.21/0.54 # Paramodulations : 156
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 49
% 0.21/0.54 # ...of those cached : 35
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 170
% 0.21/0.54 # Positive orientable unit clauses : 22
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 11
% 0.21/0.54 # Non-unit-clauses : 137
% 0.21/0.54 # Current number of unprocessed clauses: 32
% 0.21/0.54 # ...number of literals in the above : 400
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 83
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 25934
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 4667
% 0.21/0.54 # Non-unit clause-clause subsumptions : 31
% 0.21/0.54 # Unit Clause-clause subsumption calls : 253
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 0
% 0.21/0.54 # BW rewrite match successes : 0
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 11590
% 0.21/0.54 # Search garbage collected termcells : 1691
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.031 s
% 0.21/0.54 # System time : 0.007 s
% 0.21/0.54 # Total time : 0.038 s
% 0.21/0.54 # Maximum resident set size: 2156 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.032 s
% 0.21/0.54 # System time : 0.010 s
% 0.21/0.54 # Total time : 0.043 s
% 0.21/0.54 # Maximum resident set size: 1812 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------