%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NLP251-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:38:24 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.47s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 25
% Syntax : Number of clauses : 78 ( 37 unt; 0 nHn; 68 RR)
% Number of literals : 539 ( 0 equ; 476 neg)
% Maximal clause size : 41 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-1 aty)
% Number of variables : 238 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause52,axiom,
( ~ man(X1,X3)
| ~ accessible_world(X1,X2)
| man(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause52) ).
cnf(clause91,negated_conjecture,
( ~ man(skc12,X1)
| present(skc12,skf2(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause91) ).
cnf(clause83,negated_conjecture,
accessible_world(skc8,skc12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause83) ).
cnf(clause90,negated_conjecture,
( ~ man(skc12,X1)
| smoke(skc12,skf2(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause90) ).
cnf(clause95,negated_conjecture,
( ~ actual_world(X1)
| ~ think_believe_consider(X1,X15)
| ~ present(X1,X15)
| ~ event(X1,X15)
| ~ theme(X1,X15,X10)
| ~ of(X1,X14,X16)
| ~ man(X1,X16)
| ~ agent(X1,X15,X16)
| ~ forename(X1,X14)
| ~ vincent_forename(X1,X14)
| ~ of(X1,X11,X13)
| ~ man(X1,X13)
| ~ event(X10,X12)
| ~ agent(X10,X12,X13)
| ~ present(X10,X12)
| ~ smoke(X10,X12)
| ~ forename(X1,X11)
| ~ jules_forename(X1,X11)
| ~ proposition(X1,X10)
| ~ accessible_world(X1,X10)
| ~ of(X1,X9,X8)
| ~ jules_forename(X1,X9)
| ~ forename(X1,X9)
| ~ be(X1,X7,X8,X8)
| ~ man(X1,X8)
| ~ state(X1,X7)
| ~ of(X1,X5,X6)
| ~ man(X1,X6)
| ~ agent(X1,X4,X6)
| ~ forename(X1,X5)
| ~ vincent_forename(X1,X5)
| ~ theme(X1,X4,X2)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ think_believe_consider(X1,X4)
| ~ event(X2,X3)
| ~ agent(X2,X3,skf4(X2))
| ~ present(X2,X3)
| ~ smoke(X2,X3)
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause95) ).
cnf(clause1,axiom,
( ~ smoke(X1,X2)
| event(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
cnf(clause29,axiom,
( ~ vincent_forename(X1,X2)
| forename(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).
cnf(clause30,axiom,
( ~ jules_forename(X1,X2)
| forename(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).
cnf(clause94,negated_conjecture,
( ~ actual_world(X1)
| ~ think_believe_consider(X1,X14)
| ~ present(X1,X14)
| ~ event(X1,X14)
| ~ theme(X1,X14,X9)
| ~ of(X1,X13,X15)
| ~ man(X1,X15)
| ~ agent(X1,X14,X15)
| ~ forename(X1,X13)
| ~ vincent_forename(X1,X13)
| ~ of(X1,X10,X12)
| ~ man(X1,X12)
| ~ event(X9,X11)
| ~ agent(X9,X11,X12)
| ~ present(X9,X11)
| ~ smoke(X9,X11)
| ~ forename(X1,X10)
| ~ jules_forename(X1,X10)
| ~ proposition(X1,X9)
| ~ accessible_world(X1,X9)
| ~ of(X1,X8,X7)
| ~ jules_forename(X1,X8)
| ~ forename(X1,X8)
| ~ be(X1,X6,X7,X7)
| ~ man(X1,X7)
| ~ state(X1,X6)
| ~ of(X1,X4,X5)
| ~ man(X1,X5)
| ~ agent(X1,X3,X5)
| ~ forename(X1,X4)
| ~ vincent_forename(X1,X4)
| ~ theme(X1,X3,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ think_believe_consider(X1,X3)
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2)
| man(X2,skf4(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause94) ).
cnf(clause93,negated_conjecture,
( ~ man(skc12,X1)
| agent(skc12,skf2(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause93) ).
cnf(clause81,negated_conjecture,
man(skc8,skc10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause81) ).
cnf(clause87,negated_conjecture,
theme(skc8,skc13,skc12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause87) ).
cnf(clause72,negated_conjecture,
actual_world(skc8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause72) ).
cnf(clause78,negated_conjecture,
think_believe_consider(skc8,skc13),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause78) ).
cnf(clause77,negated_conjecture,
present(skc8,skc13),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause77) ).
cnf(clause84,negated_conjecture,
proposition(skc8,skc12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause84) ).
cnf(clause76,negated_conjecture,
event(skc8,skc13),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause76) ).
cnf(clause86,negated_conjecture,
agent(skc8,skc13,skc15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause86) ).
cnf(clause73,negated_conjecture,
man(skc8,skc15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause73) ).
cnf(clause89,negated_conjecture,
be(skc8,skc9,skc10,skc10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause89) ).
cnf(clause82,negated_conjecture,
state(skc8,skc9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause82) ).
cnf(clause85,negated_conjecture,
of(skc8,skc14,skc15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).
cnf(clause75,negated_conjecture,
vincent_forename(skc8,skc14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause75) ).
cnf(clause88,negated_conjecture,
of(skc8,skc11,skc10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause88) ).
cnf(clause79,negated_conjecture,
jules_forename(skc8,skc11),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause79) ).
cnf(c_0_25,plain,
( ~ man(X1,X3)
| ~ accessible_world(X1,X2)
| man(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause52]) ).
cnf(c_0_26,negated_conjecture,
( ~ man(skc12,X1)
| present(skc12,skf2(X2)) ),
inference(fof_simplification,[status(thm)],[clause91]) ).
cnf(c_0_27,plain,
( ~ man(X1,X3)
| ~ accessible_world(X1,X2)
| man(X2,X3) ),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
accessible_world(skc8,skc12),
clause83 ).
cnf(c_0_29,negated_conjecture,
( ~ man(skc12,X1)
| smoke(skc12,skf2(X2)) ),
inference(fof_simplification,[status(thm)],[clause90]) ).
cnf(c_0_30,negated_conjecture,
( ~ actual_world(X1)
| ~ think_believe_consider(X1,X15)
| ~ present(X1,X15)
| ~ event(X1,X15)
| ~ theme(X1,X15,X10)
| ~ of(X1,X14,X16)
| ~ man(X1,X16)
| ~ agent(X1,X15,X16)
| ~ forename(X1,X14)
| ~ vincent_forename(X1,X14)
| ~ of(X1,X11,X13)
| ~ man(X1,X13)
| ~ event(X10,X12)
| ~ agent(X10,X12,X13)
| ~ present(X10,X12)
| ~ smoke(X10,X12)
| ~ forename(X1,X11)
| ~ jules_forename(X1,X11)
| ~ proposition(X1,X10)
| ~ accessible_world(X1,X10)
| ~ of(X1,X9,X8)
| ~ jules_forename(X1,X9)
| ~ forename(X1,X9)
| ~ be(X1,X7,X8,X8)
| ~ man(X1,X8)
| ~ state(X1,X7)
| ~ of(X1,X5,X6)
| ~ man(X1,X6)
| ~ agent(X1,X4,X6)
| ~ forename(X1,X5)
| ~ vincent_forename(X1,X5)
| ~ theme(X1,X4,X2)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ think_believe_consider(X1,X4)
| ~ event(X2,X3)
| ~ agent(X2,X3,skf4(X2))
| ~ present(X2,X3)
| ~ smoke(X2,X3)
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause95]) ).
cnf(c_0_31,plain,
( ~ smoke(X1,X2)
| event(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause1]) ).
cnf(c_0_32,plain,
( ~ vincent_forename(X1,X2)
| forename(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause29]) ).
cnf(c_0_33,plain,
( ~ jules_forename(X1,X2)
| forename(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause30]) ).
cnf(c_0_34,negated_conjecture,
( ~ man(skc12,X1)
| present(skc12,skf2(X2)) ),
c_0_26 ).
cnf(c_0_35,negated_conjecture,
( ~ man(skc8,X1)
| man(skc12,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( ~ man(skc12,X1)
| smoke(skc12,skf2(X2)) ),
c_0_29 ).
cnf(c_0_37,negated_conjecture,
( ~ actual_world(X1)
| ~ think_believe_consider(X1,X14)
| ~ present(X1,X14)
| ~ event(X1,X14)
| ~ theme(X1,X14,X9)
| ~ of(X1,X13,X15)
| ~ man(X1,X15)
| ~ agent(X1,X14,X15)
| ~ forename(X1,X13)
| ~ vincent_forename(X1,X13)
| ~ of(X1,X10,X12)
| ~ man(X1,X12)
| ~ event(X9,X11)
| ~ agent(X9,X11,X12)
| ~ present(X9,X11)
| ~ smoke(X9,X11)
| ~ forename(X1,X10)
| ~ jules_forename(X1,X10)
| ~ proposition(X1,X9)
| ~ accessible_world(X1,X9)
| ~ of(X1,X8,X7)
| ~ jules_forename(X1,X8)
| ~ forename(X1,X8)
| ~ be(X1,X6,X7,X7)
| ~ man(X1,X7)
| ~ state(X1,X6)
| ~ of(X1,X4,X5)
| ~ man(X1,X5)
| ~ agent(X1,X3,X5)
| ~ forename(X1,X4)
| ~ vincent_forename(X1,X4)
| ~ theme(X1,X3,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ think_believe_consider(X1,X3)
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2)
| man(X2,skf4(X2)) ),
inference(fof_simplification,[status(thm)],[clause94]) ).
cnf(c_0_38,negated_conjecture,
( ~ actual_world(X1)
| ~ think_believe_consider(X1,X15)
| ~ present(X1,X15)
| ~ event(X1,X15)
| ~ theme(X1,X15,X10)
| ~ of(X1,X14,X16)
| ~ man(X1,X16)
| ~ agent(X1,X15,X16)
| ~ forename(X1,X14)
| ~ vincent_forename(X1,X14)
| ~ of(X1,X11,X13)
| ~ man(X1,X13)
| ~ event(X10,X12)
| ~ agent(X10,X12,X13)
| ~ present(X10,X12)
| ~ smoke(X10,X12)
| ~ forename(X1,X11)
| ~ jules_forename(X1,X11)
| ~ proposition(X1,X10)
| ~ accessible_world(X1,X10)
| ~ of(X1,X9,X8)
| ~ jules_forename(X1,X9)
| ~ forename(X1,X9)
| ~ be(X1,X7,X8,X8)
| ~ man(X1,X8)
| ~ state(X1,X7)
| ~ of(X1,X5,X6)
| ~ man(X1,X6)
| ~ agent(X1,X4,X6)
| ~ forename(X1,X5)
| ~ vincent_forename(X1,X5)
| ~ theme(X1,X4,X2)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ think_believe_consider(X1,X4)
| ~ event(X2,X3)
| ~ agent(X2,X3,skf4(X2))
| ~ present(X2,X3)
| ~ smoke(X2,X3)
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2) ),
c_0_30 ).
cnf(c_0_39,plain,
( ~ smoke(X1,X2)
| event(X1,X2) ),
c_0_31 ).
cnf(c_0_40,plain,
( ~ vincent_forename(X1,X2)
| forename(X1,X2) ),
c_0_32 ).
cnf(c_0_41,plain,
( ~ jules_forename(X1,X2)
| forename(X1,X2) ),
c_0_33 ).
cnf(c_0_42,negated_conjecture,
( ~ man(skc12,X1)
| agent(skc12,skf2(X1),X1) ),
inference(fof_simplification,[status(thm)],[clause93]) ).
cnf(c_0_43,negated_conjecture,
( ~ man(skc8,X2)
| present(skc12,skf2(X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,negated_conjecture,
man(skc8,skc10),
clause81 ).
cnf(c_0_45,negated_conjecture,
( ~ man(skc8,X2)
| smoke(skc12,skf2(X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_46,negated_conjecture,
( ~ actual_world(X1)
| ~ think_believe_consider(X1,X14)
| ~ present(X1,X14)
| ~ event(X1,X14)
| ~ theme(X1,X14,X9)
| ~ of(X1,X13,X15)
| ~ man(X1,X15)
| ~ agent(X1,X14,X15)
| ~ forename(X1,X13)
| ~ vincent_forename(X1,X13)
| ~ of(X1,X10,X12)
| ~ man(X1,X12)
| ~ event(X9,X11)
| ~ agent(X9,X11,X12)
| ~ present(X9,X11)
| ~ smoke(X9,X11)
| ~ forename(X1,X10)
| ~ jules_forename(X1,X10)
| ~ proposition(X1,X9)
| ~ accessible_world(X1,X9)
| ~ of(X1,X8,X7)
| ~ jules_forename(X1,X8)
| ~ forename(X1,X8)
| ~ be(X1,X6,X7,X7)
| ~ man(X1,X7)
| ~ state(X1,X6)
| ~ of(X1,X4,X5)
| ~ man(X1,X5)
| ~ agent(X1,X3,X5)
| ~ forename(X1,X4)
| ~ vincent_forename(X1,X4)
| ~ theme(X1,X3,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ think_believe_consider(X1,X3)
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2)
| man(X2,skf4(X2)) ),
c_0_37 ).
cnf(c_0_47,negated_conjecture,
( ~ smoke(X13,X14)
| ~ smoke(X11,X15)
| ~ event(X1,X12)
| ~ event(X1,X10)
| ~ proposition(X1,X13)
| ~ proposition(X1,X11)
| ~ state(X1,X16)
| ~ man(X1,X9)
| ~ man(X1,X7)
| ~ man(X1,X5)
| ~ man(X1,X3)
| ~ vincent_forename(X1,X8)
| ~ vincent_forename(X1,X2)
| ~ jules_forename(X1,X6)
| ~ jules_forename(X1,X4)
| ~ be(X1,X16,X7,X7)
| ~ accessible_world(X1,X13)
| ~ accessible_world(X1,X11)
| ~ present(X1,X12)
| ~ present(X1,X10)
| ~ present(X13,X14)
| ~ present(X11,X15)
| ~ think_believe_consider(X1,X12)
| ~ think_believe_consider(X1,X10)
| ~ agent(X1,X12,X9)
| ~ agent(X1,X10,X3)
| ~ agent(X11,X15,X5)
| ~ agent(X13,X14,skf4(X13))
| ~ theme(X1,X12,X13)
| ~ theme(X1,X10,X11)
| ~ of(X1,X8,X9)
| ~ of(X1,X6,X7)
| ~ of(X1,X4,X5)
| ~ of(X1,X2,X3)
| ~ actual_world(X1) ),
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_38,c_0_39]),c_0_39]),c_0_40]),c_0_41]),c_0_41]),c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( ~ man(skc12,X1)
| agent(skc12,skf2(X1),X1) ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
present(skc12,skf2(X1)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
smoke(skc12,skf2(X1)),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( ~ smoke(X12,X14)
| ~ event(X2,X13)
| ~ event(X2,X11)
| ~ proposition(X2,X1)
| ~ proposition(X2,X12)
| ~ state(X2,X15)
| ~ man(X2,X10)
| ~ man(X2,X8)
| ~ man(X2,X6)
| ~ man(X2,X4)
| ~ vincent_forename(X2,X9)
| ~ vincent_forename(X2,X3)
| ~ jules_forename(X2,X7)
| ~ jules_forename(X2,X5)
| ~ be(X2,X15,X8,X8)
| ~ accessible_world(X2,X1)
| ~ accessible_world(X2,X12)
| ~ present(X2,X13)
| ~ present(X2,X11)
| ~ present(X12,X14)
| ~ think_believe_consider(X2,X13)
| ~ think_believe_consider(X2,X11)
| ~ agent(X2,X13,X10)
| ~ agent(X2,X11,X4)
| ~ agent(X12,X14,X6)
| ~ theme(X2,X13,X1)
| ~ theme(X2,X11,X12)
| ~ of(X2,X9,X10)
| ~ of(X2,X7,X8)
| ~ of(X2,X5,X6)
| ~ of(X2,X3,X4)
| ~ actual_world(X2)
| man(X1,skf4(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_46,c_0_39]),c_0_40]),c_0_41]),c_0_41]),c_0_40]) ).
cnf(c_0_52,negated_conjecture,
( ~ smoke(X12,X13)
| ~ event(X1,X10)
| ~ event(X1,X11)
| ~ proposition(X1,X12)
| ~ proposition(X1,skc12)
| ~ state(X1,X14)
| ~ man(X1,X9)
| ~ man(X1,X7)
| ~ man(X1,X5)
| ~ man(X1,X3)
| ~ vincent_forename(X1,X8)
| ~ vincent_forename(X1,X2)
| ~ jules_forename(X1,X6)
| ~ jules_forename(X1,X4)
| ~ be(X1,X14,X7,X7)
| ~ accessible_world(X1,X12)
| ~ accessible_world(X1,skc12)
| ~ present(X1,X10)
| ~ present(X1,X11)
| ~ present(X12,X13)
| ~ think_believe_consider(X1,X10)
| ~ think_believe_consider(X1,X11)
| ~ agent(X1,X10,X9)
| ~ agent(X1,X11,X3)
| ~ agent(X12,X13,X5)
| ~ theme(X1,X11,X12)
| ~ theme(X1,X10,skc12)
| ~ of(X1,X8,X9)
| ~ of(X1,X6,X7)
| ~ of(X1,X4,X5)
| ~ of(X1,X2,X3)
| ~ actual_world(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]),c_0_51]) ).
cnf(c_0_53,negated_conjecture,
theme(skc8,skc13,skc12),
clause87 ).
cnf(c_0_54,negated_conjecture,
actual_world(skc8),
clause72 ).
cnf(c_0_55,negated_conjecture,
think_believe_consider(skc8,skc13),
clause78 ).
cnf(c_0_56,negated_conjecture,
present(skc8,skc13),
clause77 ).
cnf(c_0_57,negated_conjecture,
proposition(skc8,skc12),
clause84 ).
cnf(c_0_58,negated_conjecture,
event(skc8,skc13),
clause76 ).
cnf(c_0_59,negated_conjecture,
( ~ smoke(X10,X11)
| ~ event(skc8,X9)
| ~ proposition(skc8,X10)
| ~ state(skc8,X12)
| ~ man(skc8,X8)
| ~ man(skc8,X6)
| ~ man(skc8,X4)
| ~ man(skc8,X2)
| ~ vincent_forename(skc8,X7)
| ~ vincent_forename(skc8,X1)
| ~ jules_forename(skc8,X5)
| ~ jules_forename(skc8,X3)
| ~ be(skc8,X12,X6,X6)
| ~ accessible_world(skc8,X10)
| ~ present(X10,X11)
| ~ present(skc8,X9)
| ~ think_believe_consider(skc8,X9)
| ~ agent(X10,X11,X4)
| ~ agent(skc8,X9,X2)
| ~ agent(skc8,skc13,X8)
| ~ theme(skc8,X9,X10)
| ~ of(skc8,X7,X8)
| ~ of(skc8,X5,X6)
| ~ of(skc8,X3,X4)
| ~ of(skc8,X1,X2) ),
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_52,c_0_53]),c_0_54]),c_0_55]),c_0_56]),c_0_28]),c_0_57]),c_0_58])]) ).
cnf(c_0_60,negated_conjecture,
agent(skc8,skc13,skc15),
clause86 ).
cnf(c_0_61,negated_conjecture,
man(skc8,skc15),
clause73 ).
cnf(c_0_62,negated_conjecture,
( ~ smoke(X9,X10)
| ~ event(skc8,X8)
| ~ proposition(skc8,X9)
| ~ state(skc8,X11)
| ~ man(skc8,X7)
| ~ man(skc8,X5)
| ~ man(skc8,X3)
| ~ vincent_forename(skc8,X1)
| ~ vincent_forename(skc8,X2)
| ~ jules_forename(skc8,X6)
| ~ jules_forename(skc8,X4)
| ~ be(skc8,X11,X7,X7)
| ~ accessible_world(skc8,X9)
| ~ present(X9,X10)
| ~ present(skc8,X8)
| ~ think_believe_consider(skc8,X8)
| ~ agent(X9,X10,X5)
| ~ agent(skc8,X8,X3)
| ~ theme(skc8,X8,X9)
| ~ of(skc8,X6,X7)
| ~ of(skc8,X4,X5)
| ~ of(skc8,X2,X3)
| ~ of(skc8,X1,skc15) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).
cnf(c_0_63,negated_conjecture,
be(skc8,skc9,skc10,skc10),
clause89 ).
cnf(c_0_64,negated_conjecture,
state(skc8,skc9),
clause82 ).
cnf(c_0_65,negated_conjecture,
( ~ smoke(X8,X9)
| ~ event(skc8,X7)
| ~ proposition(skc8,X8)
| ~ man(skc8,X6)
| ~ man(skc8,X4)
| ~ vincent_forename(skc8,X1)
| ~ vincent_forename(skc8,X3)
| ~ jules_forename(skc8,X2)
| ~ jules_forename(skc8,X5)
| ~ accessible_world(skc8,X8)
| ~ present(X8,X9)
| ~ present(skc8,X7)
| ~ think_believe_consider(skc8,X7)
| ~ agent(X8,X9,X6)
| ~ agent(skc8,X7,X4)
| ~ theme(skc8,X7,X8)
| ~ of(skc8,X5,X6)
| ~ of(skc8,X3,X4)
| ~ of(skc8,X2,skc10)
| ~ of(skc8,X1,skc15) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_44]),c_0_64])]) ).
cnf(c_0_66,negated_conjecture,
of(skc8,skc14,skc15),
clause85 ).
cnf(c_0_67,negated_conjecture,
vincent_forename(skc8,skc14),
clause75 ).
cnf(c_0_68,negated_conjecture,
( ~ smoke(X6,X7)
| ~ event(skc8,X5)
| ~ proposition(skc8,X6)
| ~ man(skc8,X4)
| ~ vincent_forename(skc8,X1)
| ~ jules_forename(skc8,X2)
| ~ jules_forename(skc8,X3)
| ~ accessible_world(skc8,X6)
| ~ present(X6,X7)
| ~ present(skc8,X5)
| ~ think_believe_consider(skc8,X5)
| ~ agent(X6,X7,X4)
| ~ agent(skc8,X5,skc15)
| ~ theme(skc8,X5,X6)
| ~ of(skc8,X3,X4)
| ~ of(skc8,X2,skc10)
| ~ of(skc8,X1,skc15) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_61])]) ).
cnf(c_0_69,negated_conjecture,
of(skc8,skc11,skc10),
clause88 ).
cnf(c_0_70,negated_conjecture,
jules_forename(skc8,skc11),
clause79 ).
cnf(c_0_71,negated_conjecture,
( ~ smoke(X4,X5)
| ~ event(skc8,X3)
| ~ proposition(skc8,X4)
| ~ vincent_forename(skc8,X1)
| ~ jules_forename(skc8,X2)
| ~ accessible_world(skc8,X4)
| ~ present(X4,X5)
| ~ present(skc8,X3)
| ~ think_believe_consider(skc8,X3)
| ~ agent(X4,X5,skc10)
| ~ agent(skc8,X3,skc15)
| ~ theme(skc8,X3,X4)
| ~ of(skc8,X2,skc10)
| ~ of(skc8,X1,skc15) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_44])]) ).
cnf(c_0_72,negated_conjecture,
( ~ smoke(skc12,X3)
| ~ vincent_forename(skc8,X1)
| ~ jules_forename(skc8,X2)
| ~ present(skc12,X3)
| ~ agent(skc12,X3,skc10)
| ~ of(skc8,X2,skc10)
| ~ of(skc8,X1,skc15) ),
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_71,c_0_53]),c_0_60]),c_0_55]),c_0_56]),c_0_28]),c_0_57]),c_0_58])]) ).
cnf(c_0_73,negated_conjecture,
( ~ smoke(skc12,X2)
| ~ vincent_forename(skc8,X1)
| ~ present(skc12,X2)
| ~ agent(skc12,X2,skc10)
| ~ of(skc8,X1,skc15) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_70]),c_0_69])]) ).
cnf(c_0_74,negated_conjecture,
( ~ smoke(skc12,X1)
| ~ present(skc12,X1)
| ~ agent(skc12,X1,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_67]),c_0_66])]) ).
cnf(c_0_75,negated_conjecture,
~ agent(skc12,skf2(X1),skc10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_50]),c_0_49])]) ).
cnf(c_0_76,negated_conjecture,
~ man(skc12,skc10),
inference(spm,[status(thm)],[c_0_75,c_0_48]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_35]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP251-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 01:55:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.47 % Version: 3.5.1
% 0.10/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % Starting sh5l with 300s (1) cores
% 0.10/0.47 % new_bool_3 with pid 731739 completed with status 0
% 0.10/0.47 % Result found by new_bool_3
% 0.10/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.47 % Search class: FHHSF-FFMM11-SFFFFFNN
% 0.10/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.47 % SubtermCWHack with pid 731745 completed with status 0
% 0.10/0.47 % Result found by SubtermCWHack
% 0.10/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.47 % Search class: FHHSF-FFMM11-SFFFFFNN
% 0.10/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.47 % Preprocessing time : 0.001 s
% 0.10/0.47
% 0.10/0.47 % Proof found!
% 0.10/0.47 % SZS status Unsatisfiable
% 0.10/0.47 % SZS output start CNFRefutation
% See solution above
% 0.10/0.47 % Parsed axioms : 95
% 0.10/0.47 % Removed by relevancy pruning/SinE : 27
% 0.10/0.47 % Initial clauses : 68
% 0.10/0.47 % Removed in clause preprocessing : 0
% 0.10/0.47 % Initial clauses in saturation : 68
% 0.10/0.47 % Processed clauses : 257
% 0.10/0.47 % ...of these trivial : 0
% 0.10/0.47 % ...subsumed : 65
% 0.10/0.47 % ...remaining for further processing : 192
% 0.10/0.47 % Other redundant clauses eliminated : 0
% 0.10/0.47 % Clauses deleted for lack of memory : 0
% 0.10/0.47 % Backward-subsumed : 11
% 0.10/0.47 % Backward-rewritten : 5
% 0.10/0.47 % Generated clauses : 243
% 0.10/0.47 % ...of the previous two non-redundant : 240
% 0.10/0.47 % ...aggressively subsumed : 0
% 0.10/0.47 % Contextual simplify-reflections : 12
% 0.10/0.47 % Paramodulations : 243
% 0.10/0.47 % Factorizations : 0
% 0.10/0.47 % NegExts : 0
% 0.10/0.47 % Equation resolutions : 0
% 0.10/0.47 % Disequality decompositions : 0
% 0.10/0.47 % Total rewrite steps : 376
% 0.10/0.47 % ...of those cached : 355
% 0.10/0.47 % Propositional unsat checks : 0
% 0.10/0.47 % Propositional check models : 0
% 0.10/0.47 % Propositional check unsatisfiable : 0
% 0.10/0.47 % Propositional clauses : 0
% 0.10/0.47 % Propositional clauses after purity: 0
% 0.10/0.47 % Propositional unsat core size : 0
% 0.10/0.47 % Propositional preprocessing time : 0.000
% 0.10/0.47 % Propositional encoding time : 0.000
% 0.10/0.47 % Propositional solver time : 0.000
% 0.10/0.47 % Success case prop preproc time : 0.000
% 0.10/0.47 % Success case prop encoding time : 0.000
% 0.10/0.47 % Success case prop solver time : 0.000
% 0.10/0.47 % Current number of processed clauses : 176
% 0.10/0.47 % Positive orientable unit clauses : 25
% 0.10/0.47 % Positive unorientable unit clauses: 0
% 0.10/0.47 % Negative unit clauses : 2
% 0.10/0.47 % Non-unit-clauses : 149
% 0.10/0.47 % Current number of unprocessed clauses: 48
% 0.10/0.47 % ...number of literals in the above : 1140
% 0.10/0.47 % Current number of archived formulas : 0
% 0.10/0.47 % Current number of archived clauses : 16
% 0.10/0.47 % Clause-clause subsumption calls (NU) : 79955
% 0.10/0.47 % Rec. Clause-clause subsumption calls : 2671
% 0.10/0.47 % Non-unit clause-clause subsumptions : 86
% 0.10/0.47 % Unit Clause-clause subsumption calls : 174
% 0.10/0.47 % Rewrite failures with RHS unbound : 0
% 0.10/0.47 % BW rewrite match attempts : 3
% 0.10/0.47 % BW rewrite match successes : 3
% 0.10/0.47 % Condensation attempts : 0
% 0.10/0.47 % Condensation successes : 0
% 0.10/0.47 % Termbank termtop insertions : 18560
% 0.10/0.47 % Search garbage collected termcells : 492
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.035 s
% 0.10/0.47 % System time : 0.002 s
% 0.10/0.47 % Total time : 0.037 s
% 0.10/0.47 % Maximum resident set size: 3740 pages
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.038 s
% 0.10/0.47 % System time : 0.007 s
% 0.10/0.47 % Total time : 0.045 s
% 0.10/0.47 % Maximum resident set size: 4608 pages
% 0.10/0.47 % E exiting
%------------------------------------------------------------------------------