%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP233-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 : 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:35:46 PM UTC 2026
% Result : Satisfiable 0.21s 0.63s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_85ERROR: Could not build tree for root c_0_89ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_88,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ of(X1,X13,X14)
| ~ man(X1,X14)
| ~ agent(X1,X12,X14)
| ~ forename(X1,X13)
| ~ vincent_forename(X1,X13)
| ~ theme(X1,X12,X5)
| ~ event(X1,X12)
| ~ present(X1,X12)
| ~ think_believe_consider(X1,X12)
| ~ of(X1,X11,X9)
| ~ jules_forename(X1,X11)
| ~ forename(X1,X11)
| ~ event(X5,X10)
| ~ agent(X5,X10,X9)
| ~ present(X5,X10)
| ~ smoke(X5,X10)
| ~ agent(X1,X7,X9)
| ~ man(X1,X9)
| ~ of(X1,X8,X9)
| ~ vincent_forename(X1,X8)
| ~ forename(X1,X8)
| ~ think_believe_consider(X1,X7)
| ~ present(X1,X7)
| ~ event(X1,X7)
| ~ theme(X1,X7,X6)
| ~ proposition(X1,X6)
| ~ accessible_world(X1,X6)
| ~ accessible_world(X1,X5)
| ~ proposition(X1,X5)
| ~ forename(X1,X4)
| ~ jules_forename(X1,X4)
| ~ of(X1,X4,X3)
| ~ man(X1,X3)
| ~ be(X1,X2,X3,X3)
| ~ state(X1,X2)
| man(X6,skf7(X6)) ),
c_0_84,
[final] ).
cnf(c_0_89,negated_conjecture,
( ~ ssSkC0
| be(skc28,skc35,skc36,skc36) ),
c_0_85,
[final] ).
cnf(c_0_90,negated_conjecture,
actual_world(skc28),
clause2,
[final] ).
cnf(c_0_91,negated_conjecture,
( ~ ssSkC0
| state(skc28,skc35) ),
c_0_86,
[final] ).
cnf(c_0_92,negated_conjecture,
( ~ ssSkC0
| man(skc28,skc36) ),
c_0_87,
[final] ).
cnf(c_0_97,negated_conjecture,
( ~ ssSkC0
| of(skc28,skc37,skc36) ),
c_0_93,
[final] ).
cnf(c_0_98,negated_conjecture,
( ~ ssSkC0
| jules_forename(skc28,skc37) ),
c_0_94,
[final] ).
cnf(c_0_99,negated_conjecture,
( ~ ssSkC0
| forename(skc28,skc37) ),
c_0_95,
[final] ).
cnf(c_0_105,negated_conjecture,
( ~ ssSkC0
| ~ man(skc28,X5)
| ~ man(skc28,X3)
| ~ jules_forename(skc28,X9)
| ~ forename(skc28,X10)
| ~ forename(skc28,X9)
| ~ forename(skc28,X8)
| ~ proposition(skc28,X6)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X6)
| ~ accessible_world(skc28,X1)
| ~ event(X6,X7)
| ~ event(skc28,X4)
| ~ event(skc28,X2)
| ~ present(X6,X7)
| ~ present(skc28,X4)
| ~ present(skc28,X2)
| ~ think_believe_consider(skc28,X4)
| ~ think_believe_consider(skc28,X2)
| ~ vincent_forename(skc28,X10)
| ~ vincent_forename(skc28,X8)
| ~ smoke(X6,X7)
| ~ of(skc28,X10,X5)
| ~ of(skc28,X9,X5)
| ~ of(skc28,X8,X3)
| ~ theme(skc28,X4,X1)
| ~ theme(skc28,X2,X6)
| ~ agent(X6,X7,X5)
| ~ agent(skc28,X4,X5)
| ~ agent(skc28,X2,X3)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98]),c_0_99]),
[final] ).
cnf(c_0_106,negated_conjecture,
( ~ ssSkC0
| agent(skc28,skc30,skc32) ),
c_0_100,
[final] ).
cnf(c_0_107,negated_conjecture,
( ~ ssSkC0
| man(skc28,skc32) ),
c_0_101,
[final] ).
cnf(c_0_108,negated_conjecture,
( ~ ssSkC0
| event(skc28,skc30) ),
c_0_102,
[final] ).
cnf(c_0_109,negated_conjecture,
( ~ ssSkC0
| present(skc28,skc30) ),
c_0_103,
[final] ).
cnf(c_0_110,negated_conjecture,
( ~ ssSkC0
| think_believe_consider(skc28,skc30) ),
c_0_104,
[final] ).
cnf(c_0_114,negated_conjecture,
( ~ ssSkC0
| ~ man(skc28,X3)
| ~ jules_forename(skc28,X7)
| ~ forename(skc28,X8)
| ~ forename(skc28,X7)
| ~ forename(skc28,X6)
| ~ proposition(skc28,X4)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X4)
| ~ accessible_world(skc28,X1)
| ~ event(X4,X5)
| ~ event(skc28,X2)
| ~ present(X4,X5)
| ~ present(skc28,X2)
| ~ think_believe_consider(skc28,X2)
| ~ vincent_forename(skc28,X8)
| ~ vincent_forename(skc28,X6)
| ~ smoke(X4,X5)
| ~ of(skc28,X8,X3)
| ~ of(skc28,X7,X3)
| ~ of(skc28,X6,skc32)
| ~ theme(skc28,X2,X1)
| ~ theme(skc28,skc30,X4)
| ~ agent(X4,X5,X3)
| ~ agent(skc28,X2,X3)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107]),c_0_108]),c_0_109]),c_0_110]),
[final] ).
cnf(c_0_115,negated_conjecture,
( ~ ssSkC0
| theme(skc28,skc30,skc29) ),
c_0_111,
[final] ).
cnf(c_0_116,negated_conjecture,
( ~ ssSkC0
| proposition(skc28,skc29) ),
c_0_112,
[final] ).
cnf(c_0_117,negated_conjecture,
( ~ ssSkC0
| accessible_world(skc28,skc29) ),
c_0_113,
[final] ).
cnf(c_0_128,negated_conjecture,
( ~ ssSkC0
| of(skc28,skc31,skc32) ),
c_0_118,
[final] ).
cnf(c_0_129,negated_conjecture,
( ~ ssSkC0
| forename(skc28,skc31) ),
c_0_119,
[final] ).
cnf(c_0_130,negated_conjecture,
( ~ ssSkC0
| vincent_forename(skc28,skc31) ),
c_0_120,
[final] ).
cnf(c_0_131,negated_conjecture,
( ~ actual_world(X1)
| ~ theme(X1,X12,X9)
| ~ event(X1,X12)
| ~ present(X1,X12)
| ~ think_believe_consider(X1,X12)
| ~ of(X1,X14,X11)
| ~ jules_forename(X1,X14)
| ~ forename(X1,X14)
| ~ event(X9,X13)
| ~ agent(X9,X13,X11)
| ~ present(X9,X13)
| ~ smoke(X9,X13)
| ~ agent(X1,X12,X11)
| ~ man(X1,X11)
| ~ of(X1,X10,X11)
| ~ vincent_forename(X1,X10)
| ~ forename(X1,X10)
| ~ accessible_world(X1,X9)
| ~ proposition(X1,X9)
| ~ forename(X1,X8)
| ~ jules_forename(X1,X8)
| ~ of(X1,X8,X7)
| ~ man(X1,X7)
| ~ be(X1,X6,X7,X7)
| ~ state(X1,X6)
| ~ agent(X1,X3,X5)
| ~ man(X1,X5)
| ~ of(X1,X4,X5)
| ~ vincent_forename(X1,X4)
| ~ forename(X1,X4)
| ~ think_believe_consider(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ theme(X1,X3,X2)
| ~ proposition(X1,X2)
| ~ accessible_world(X1,X2)
| man(X2,skf12(X2))
| ssSkC0 ),
c_0_121,
[final] ).
cnf(c_0_132,negated_conjecture,
( be(skc45,skc57,skc58,skc58)
| ssSkC0 ),
clause71,
[final] ).
cnf(c_0_133,negated_conjecture,
actual_world(skc45),
clause1,
[final] ).
cnf(c_0_134,negated_conjecture,
( state(skc45,skc57)
| ssSkC0 ),
clause3,
[final] ).
cnf(c_0_135,negated_conjecture,
( man(skc45,skc58)
| ssSkC0 ),
clause4,
[final] ).
cnf(c_0_136,negated_conjecture,
( ~ ssSkC0
| agent(skc28,skc39,skc41) ),
c_0_122,
[final] ).
cnf(c_0_137,negated_conjecture,
( ~ ssSkC0
| man(skc28,skc41) ),
c_0_123,
[final] ).
cnf(c_0_138,negated_conjecture,
( ~ ssSkC0
| event(skc28,skc39) ),
c_0_124,
[final] ).
cnf(c_0_139,negated_conjecture,
( ~ ssSkC0
| present(skc28,skc39) ),
c_0_125,
[final] ).
cnf(c_0_140,negated_conjecture,
( ~ ssSkC0
| think_believe_consider(skc28,skc39) ),
c_0_126,
[final] ).
cnf(c_0_144,negated_conjecture,
( ~ ssSkC0
| ~ man(skc28,X3)
| ~ jules_forename(skc28,X5)
| ~ forename(skc28,X6)
| ~ forename(skc28,X5)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X1)
| ~ event(skc29,X4)
| ~ event(skc28,X2)
| ~ present(skc29,X4)
| ~ present(skc28,X2)
| ~ think_believe_consider(skc28,X2)
| ~ vincent_forename(skc28,X6)
| ~ smoke(skc29,X4)
| ~ of(skc28,X6,X3)
| ~ of(skc28,X5,X3)
| ~ theme(skc28,X2,X1)
| ~ agent(skc29,X4,X3)
| ~ agent(skc28,X2,X3)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129]),c_0_130]),
[final] ).
cnf(c_0_150,negated_conjecture,
( of(skc45,skc59,skc58)
| ssSkC0 ),
clause53,
[final] ).
cnf(c_0_151,negated_conjecture,
( jules_forename(skc45,skc59)
| ssSkC0 ),
clause5,
[final] ).
cnf(c_0_152,negated_conjecture,
( forename(skc45,skc59)
| ssSkC0 ),
clause6,
[final] ).
cnf(c_0_153,negated_conjecture,
( ~ ssSkC0
| ~ man(skc28,X3)
| ~ jules_forename(skc28,X7)
| ~ forename(skc28,X8)
| ~ forename(skc28,X7)
| ~ forename(skc28,X6)
| ~ proposition(skc28,X4)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X4)
| ~ accessible_world(skc28,X1)
| ~ event(X4,X5)
| ~ event(skc28,X2)
| ~ present(X4,X5)
| ~ present(skc28,X2)
| ~ think_believe_consider(skc28,X2)
| ~ vincent_forename(skc28,X8)
| ~ vincent_forename(skc28,X6)
| ~ smoke(X4,X5)
| ~ of(skc28,X8,X3)
| ~ of(skc28,X7,X3)
| ~ of(skc28,X6,skc41)
| ~ theme(skc28,X2,X1)
| ~ theme(skc28,skc39,X4)
| ~ agent(X4,X5,X3)
| ~ agent(skc28,X2,X3)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_136]),c_0_137]),c_0_138]),c_0_139]),c_0_140]),
[final] ).
cnf(c_0_154,negated_conjecture,
( ~ ssSkC0
| theme(skc28,skc39,skc38) ),
c_0_141,
[final] ).
cnf(c_0_155,negated_conjecture,
( ~ ssSkC0
| proposition(skc28,skc38) ),
c_0_142,
[final] ).
cnf(c_0_156,negated_conjecture,
( ~ ssSkC0
| accessible_world(skc28,skc38) ),
c_0_143,
[final] ).
cnf(c_0_161,negated_conjecture,
( ~ ssSkC0
| agent(skc29,skc34,skc32) ),
c_0_145,
[final] ).
cnf(c_0_162,negated_conjecture,
( ~ ssSkC0
| event(skc29,skc34) ),
c_0_146,
[final] ).
cnf(c_0_163,negated_conjecture,
( ~ ssSkC0
| present(skc29,skc34) ),
c_0_147,
[final] ).
cnf(c_0_164,negated_conjecture,
( ~ ssSkC0
| smoke(skc29,skc34) ),
c_0_148,
[final] ).
cnf(c_0_165,negated_conjecture,
( ~ man(skc45,X5)
| ~ man(skc45,X3)
| ~ jules_forename(skc45,X8)
| ~ forename(skc45,X10)
| ~ forename(skc45,X9)
| ~ forename(skc45,X8)
| ~ proposition(skc45,X1)
| ~ proposition(skc45,X6)
| ~ accessible_world(skc45,X1)
| ~ accessible_world(skc45,X6)
| ~ event(X6,X7)
| ~ event(skc45,X4)
| ~ event(skc45,X2)
| ~ present(X6,X7)
| ~ present(skc45,X4)
| ~ present(skc45,X2)
| ~ think_believe_consider(skc45,X4)
| ~ think_believe_consider(skc45,X2)
| ~ vincent_forename(skc45,X10)
| ~ vincent_forename(skc45,X9)
| ~ smoke(X6,X7)
| ~ of(skc45,X10,X5)
| ~ of(skc45,X9,X3)
| ~ of(skc45,X8,X3)
| ~ theme(skc45,X4,X1)
| ~ theme(skc45,X2,X6)
| ~ agent(X6,X7,X3)
| ~ agent(skc45,X4,X5)
| ~ agent(skc45,X2,X3)
| ssSkC0
| man(X1,skf12(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_151]),c_0_152]),
[final] ).
cnf(c_0_166,negated_conjecture,
( agent(skc45,skc51,skc53)
| ssSkC0 ),
clause56,
[final] ).
cnf(c_0_167,negated_conjecture,
( man(skc45,skc53)
| ssSkC0 ),
clause16,
[final] ).
cnf(c_0_168,negated_conjecture,
( event(skc45,skc51)
| ssSkC0 ),
clause11,
[final] ).
cnf(c_0_169,negated_conjecture,
( present(skc45,skc51)
| ssSkC0 ),
clause12,
[final] ).
cnf(c_0_170,negated_conjecture,
( think_believe_consider(skc45,skc51)
| ssSkC0 ),
clause13,
[final] ).
cnf(c_0_172,negated_conjecture,
( ~ ssSkC0
| of(skc28,skc40,skc41) ),
c_0_157,
[final] ).
cnf(c_0_173,negated_conjecture,
( ~ ssSkC0
| forename(skc28,skc40) ),
c_0_158,
[final] ).
cnf(c_0_174,negated_conjecture,
( ~ ssSkC0
| vincent_forename(skc28,skc40) ),
c_0_159,
[final] ).
cnf(c_0_175,negated_conjecture,
( ~ ssSkC0
| ~ jules_forename(skc28,X2)
| ~ forename(skc28,X3)
| ~ forename(skc28,X2)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X1)
| ~ vincent_forename(skc28,X3)
| ~ of(skc28,X3,skc32)
| ~ of(skc28,X2,skc32)
| ~ theme(skc28,skc30,X1)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_162]),c_0_163]),c_0_164]),
[final] ).
cnf(c_0_183,negated_conjecture,
( ~ man(skc45,X3)
| ~ jules_forename(skc45,X6)
| ~ forename(skc45,X8)
| ~ forename(skc45,X7)
| ~ forename(skc45,X6)
| ~ proposition(skc45,X1)
| ~ proposition(skc45,X4)
| ~ accessible_world(skc45,X1)
| ~ accessible_world(skc45,X4)
| ~ event(X4,X5)
| ~ event(skc45,X2)
| ~ present(X4,X5)
| ~ present(skc45,X2)
| ~ think_believe_consider(skc45,X2)
| ~ vincent_forename(skc45,X8)
| ~ vincent_forename(skc45,X7)
| ~ smoke(X4,X5)
| ~ of(skc45,X8,X3)
| ~ of(skc45,X7,skc53)
| ~ of(skc45,X6,skc53)
| ~ theme(skc45,X2,X1)
| ~ theme(skc45,skc51,X4)
| ~ agent(X4,X5,skc53)
| ~ agent(skc45,X2,X3)
| ssSkC0
| man(X1,skf12(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_166]),c_0_167]),c_0_168]),c_0_169]),c_0_170]),
[final] ).
cnf(c_0_184,negated_conjecture,
( theme(skc45,skc51,skc50)
| ssSkC0 ),
clause54,
[final] ).
cnf(c_0_185,negated_conjecture,
( proposition(skc45,skc50)
| ssSkC0 ),
clause10,
[final] ).
cnf(c_0_186,negated_conjecture,
( accessible_world(skc45,skc50)
| ssSkC0 ),
clause9,
[final] ).
cnf(c_0_190,negated_conjecture,
( agent(skc45,skc47,skc49)
| ssSkC0 ),
clause60,
[final] ).
cnf(c_0_191,negated_conjecture,
( man(skc45,skc49)
| ssSkC0 ),
clause27,
[final] ).
cnf(c_0_192,negated_conjecture,
( event(skc45,skc47)
| ssSkC0 ),
clause24,
[final] ).
cnf(c_0_193,negated_conjecture,
( present(skc45,skc47)
| ssSkC0 ),
clause23,
[final] ).
cnf(c_0_194,negated_conjecture,
( think_believe_consider(skc45,skc47)
| ssSkC0 ),
clause22,
[final] ).
cnf(c_0_195,negated_conjecture,
( ~ ssSkC0
| ~ man(skc28,X3)
| ~ jules_forename(skc28,X5)
| ~ forename(skc28,X6)
| ~ forename(skc28,X5)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X1)
| ~ event(skc38,X4)
| ~ event(skc28,X2)
| ~ present(skc38,X4)
| ~ present(skc28,X2)
| ~ think_believe_consider(skc28,X2)
| ~ vincent_forename(skc28,X6)
| ~ smoke(skc38,X4)
| ~ of(skc28,X6,X3)
| ~ of(skc28,X5,X3)
| ~ theme(skc28,X2,X1)
| ~ agent(skc38,X4,X3)
| ~ agent(skc28,X2,X3)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_172]),c_0_173]),c_0_174]),
[final] ).
cnf(c_0_200,negated_conjecture,
( ~ ssSkC0
| of(skc28,skc33,skc32) ),
c_0_176,
[final] ).
cnf(c_0_201,negated_conjecture,
( ~ ssSkC0
| jules_forename(skc28,skc33) ),
c_0_177,
[final] ).
cnf(c_0_202,negated_conjecture,
( ~ ssSkC0
| forename(skc28,skc33) ),
c_0_178,
[final] ).
cnf(c_0_203,negated_conjecture,
( ~ actual_world(X3)
| ~ theme(X3,X13,X10)
| ~ event(X3,X13)
| ~ present(X3,X13)
| ~ think_believe_consider(X3,X13)
| ~ of(X3,X15,X12)
| ~ jules_forename(X3,X15)
| ~ forename(X3,X15)
| ~ event(X10,X14)
| ~ agent(X10,X14,X12)
| ~ present(X10,X14)
| ~ smoke(X10,X14)
| ~ agent(X3,X13,X12)
| ~ man(X3,X12)
| ~ of(X3,X11,X12)
| ~ vincent_forename(X3,X11)
| ~ forename(X3,X11)
| ~ accessible_world(X3,X10)
| ~ proposition(X3,X10)
| ~ forename(X3,X9)
| ~ jules_forename(X3,X9)
| ~ of(X3,X9,X8)
| ~ man(X3,X8)
| ~ be(X3,X7,X8,X8)
| ~ state(X3,X7)
| ~ agent(X3,X4,X6)
| ~ man(X3,X6)
| ~ of(X3,X5,X6)
| ~ vincent_forename(X3,X5)
| ~ forename(X3,X5)
| ~ think_believe_consider(X3,X4)
| ~ present(X3,X4)
| ~ event(X3,X4)
| ~ theme(X3,X4,X1)
| ~ proposition(X3,X1)
| ~ accessible_world(X3,X1)
| ~ event(X1,X2)
| ~ agent(X1,X2,skf12(X1))
| ~ present(X1,X2)
| ~ smoke(X1,X2)
| ssSkC0 ),
c_0_179,
[final] ).
cnf(c_0_204,negated_conjecture,
( ~ man(skc50,X1)
| agent(skc50,skf10(X1),X1)
| ssSkC0 ),
c_0_180,
[final] ).
cnf(c_0_205,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ of(X1,X14,X15)
| ~ man(X1,X15)
| ~ agent(X1,X13,X15)
| ~ forename(X1,X14)
| ~ vincent_forename(X1,X14)
| ~ theme(X1,X13,X5)
| ~ event(X1,X13)
| ~ present(X1,X13)
| ~ think_believe_consider(X1,X13)
| ~ of(X1,X12,X10)
| ~ jules_forename(X1,X12)
| ~ forename(X1,X12)
| ~ event(X5,X11)
| ~ agent(X5,X11,X10)
| ~ present(X5,X11)
| ~ smoke(X5,X11)
| ~ agent(X1,X8,X10)
| ~ man(X1,X10)
| ~ of(X1,X9,X10)
| ~ vincent_forename(X1,X9)
| ~ forename(X1,X9)
| ~ think_believe_consider(X1,X8)
| ~ present(X1,X8)
| ~ event(X1,X8)
| ~ theme(X1,X8,X6)
| ~ proposition(X1,X6)
| ~ accessible_world(X1,X6)
| ~ event(X6,X7)
| ~ agent(X6,X7,skf7(X6))
| ~ present(X6,X7)
| ~ smoke(X6,X7)
| ~ accessible_world(X1,X5)
| ~ proposition(X1,X5)
| ~ forename(X1,X4)
| ~ jules_forename(X1,X4)
| ~ of(X1,X4,X3)
| ~ man(X1,X3)
| ~ be(X1,X2,X3,X3)
| ~ state(X1,X2) ),
c_0_181,
[final] ).
cnf(c_0_206,negated_conjecture,
( ~ ssSkC0
| ~ man(skc38,X1)
| agent(skc38,skf5(X1),X1) ),
c_0_182,
[final] ).
cnf(c_0_207,negated_conjecture,
( ~ man(skc45,X4)
| ~ jules_forename(skc45,X5)
| ~ forename(skc45,X7)
| ~ forename(skc45,X6)
| ~ forename(skc45,X5)
| ~ proposition(skc45,X1)
| ~ accessible_world(skc45,X1)
| ~ event(skc50,X2)
| ~ event(skc45,X3)
| ~ present(skc50,X2)
| ~ present(skc45,X3)
| ~ think_believe_consider(skc45,X3)
| ~ vincent_forename(skc45,X7)
| ~ vincent_forename(skc45,X6)
| ~ smoke(skc50,X2)
| ~ of(skc45,X7,X4)
| ~ of(skc45,X6,skc53)
| ~ of(skc45,X5,skc53)
| ~ theme(skc45,X3,X1)
| ~ agent(skc45,X3,X4)
| ~ agent(skc50,X2,skc53)
| ssSkC0
| man(X1,skf12(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185]),c_0_186]),
[final] ).
cnf(c_0_208,negated_conjecture,
( ~ man(skc50,X1)
| event(skc50,skf10(X2))
| ssSkC0 ),
c_0_187,
[final] ).
cnf(c_0_209,negated_conjecture,
( ~ man(skc50,X1)
| present(skc50,skf10(X2))
| ssSkC0 ),
c_0_188,
[final] ).
cnf(c_0_210,negated_conjecture,
( ~ man(skc50,X1)
| smoke(skc50,skf10(X2))
| ssSkC0 ),
c_0_189,
[final] ).
cnf(c_0_211,negated_conjecture,
( ~ man(skc45,X3)
| ~ jules_forename(skc45,X6)
| ~ forename(skc45,X8)
| ~ forename(skc45,X7)
| ~ forename(skc45,X6)
| ~ proposition(skc45,X1)
| ~ proposition(skc45,X4)
| ~ accessible_world(skc45,X1)
| ~ accessible_world(skc45,X4)
| ~ event(X4,X5)
| ~ event(skc45,X2)
| ~ present(X4,X5)
| ~ present(skc45,X2)
| ~ think_believe_consider(skc45,X2)
| ~ vincent_forename(skc45,X8)
| ~ vincent_forename(skc45,X7)
| ~ smoke(X4,X5)
| ~ of(skc45,X8,X3)
| ~ of(skc45,X7,skc49)
| ~ of(skc45,X6,skc49)
| ~ theme(skc45,X2,X1)
| ~ theme(skc45,skc47,X4)
| ~ agent(X4,X5,skc49)
| ~ agent(skc45,X2,X3)
| ssSkC0
| man(X1,skf12(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_190]),c_0_191]),c_0_192]),c_0_193]),c_0_194]),
[final] ).
cnf(c_0_212,negated_conjecture,
( theme(skc45,skc47,skc46)
| ssSkC0 ),
clause59,
[final] ).
cnf(c_0_213,negated_conjecture,
( proposition(skc45,skc46)
| ssSkC0 ),
clause7,
[final] ).
cnf(c_0_214,negated_conjecture,
( accessible_world(skc45,skc46)
| ssSkC0 ),
clause8,
[final] ).
cnf(c_0_215,negated_conjecture,
( ~ ssSkC0
| ~ jules_forename(skc28,X3)
| ~ forename(skc28,X4)
| ~ forename(skc28,X3)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X1)
| ~ event(skc38,X2)
| ~ present(skc38,X2)
| ~ vincent_forename(skc28,X4)
| ~ smoke(skc38,X2)
| ~ of(skc28,X4,skc41)
| ~ of(skc28,X3,skc41)
| ~ theme(skc28,skc39,X1)
| ~ agent(skc38,X2,skc41)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_195,c_0_136]),c_0_137]),c_0_138]),c_0_139]),c_0_140]),
[final] ).
cnf(c_0_216,negated_conjecture,
( ~ ssSkC0
| ~ man(skc38,X1)
| event(skc38,skf5(X2)) ),
c_0_196,
[final] ).
cnf(c_0_217,negated_conjecture,
( ~ ssSkC0
| ~ man(skc38,X1)
| present(skc38,skf5(X2)) ),
c_0_197,
[final] ).
cnf(c_0_218,negated_conjecture,
( ~ ssSkC0
| ~ man(skc38,X1)
| smoke(skc38,skf5(X2)) ),
c_0_198,
[final] ).
cnf(c_0_220,negated_conjecture,
( ~ actual_world(X1)
| ~ state(X1,X2)
| ~ man(X1,X9)
| ~ man(X1,X3)
| ~ man(X1,X6)
| ~ jules_forename(X1,X12)
| ~ jules_forename(X1,X10)
| ~ forename(X1,X13)
| ~ forename(X1,X12)
| ~ forename(X1,X11)
| ~ forename(X1,X10)
| ~ proposition(X1,X4)
| ~ proposition(X1,skc50)
| ~ accessible_world(X1,X4)
| ~ accessible_world(X1,skc50)
| ~ event(X1,X8)
| ~ event(X1,X7)
| ~ event(X4,X5)
| ~ event(skc50,skf10(skf12(skc50)))
| ~ present(X1,X8)
| ~ present(X1,X7)
| ~ present(X4,X5)
| ~ present(skc50,skf10(skf12(skc50)))
| ~ think_believe_consider(X1,X8)
| ~ think_believe_consider(X1,X7)
| ~ vincent_forename(X1,X13)
| ~ vincent_forename(X1,X11)
| ~ smoke(X4,X5)
| ~ smoke(skc50,skf10(skf12(skc50)))
| ~ of(X1,X13,X9)
| ~ of(X1,X12,X3)
| ~ of(X1,X11,X6)
| ~ of(X1,X10,X6)
| ~ theme(X1,X7,X4)
| ~ theme(X1,X8,skc50)
| ~ agent(X1,X8,X9)
| ~ agent(X1,X7,X6)
| ~ agent(X4,X5,X6)
| ~ be(X1,X2,X3,X3)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_203,c_0_204]),c_0_131]),
[final] ).
cnf(c_0_221,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkC0
| ~ state(X1,X2)
| ~ man(X1,X3)
| ~ man(X1,X6)
| ~ man(X1,X8)
| ~ jules_forename(X1,X13)
| ~ jules_forename(X1,X11)
| ~ forename(X1,X13)
| ~ forename(X1,X12)
| ~ forename(X1,X11)
| ~ forename(X1,X10)
| ~ proposition(X1,X4)
| ~ proposition(X1,skc38)
| ~ accessible_world(X1,X4)
| ~ accessible_world(X1,skc38)
| ~ event(X1,X9)
| ~ event(X1,X7)
| ~ event(X4,X5)
| ~ event(skc38,skf5(skf7(skc38)))
| ~ present(X1,X9)
| ~ present(X1,X7)
| ~ present(X4,X5)
| ~ present(skc38,skf5(skf7(skc38)))
| ~ think_believe_consider(X1,X9)
| ~ think_believe_consider(X1,X7)
| ~ vincent_forename(X1,X12)
| ~ vincent_forename(X1,X10)
| ~ smoke(X4,X5)
| ~ smoke(skc38,skf5(skf7(skc38)))
| ~ of(X1,X13,X3)
| ~ of(X1,X12,X6)
| ~ of(X1,X11,X6)
| ~ of(X1,X10,X8)
| ~ theme(X1,X7,X4)
| ~ theme(X1,X9,skc38)
| ~ agent(X1,X9,X6)
| ~ agent(X1,X7,X8)
| ~ agent(X4,X5,X6)
| ~ be(X1,X2,X3,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_205,c_0_206]),c_0_88]),
[final] ).
cnf(c_0_222,negated_conjecture,
( ~ man(skc45,X3)
| ~ man(skc50,skc53)
| ~ jules_forename(skc45,X4)
| ~ forename(skc45,X6)
| ~ forename(skc45,X5)
| ~ forename(skc45,X4)
| ~ proposition(skc45,X1)
| ~ accessible_world(skc45,X1)
| ~ event(skc45,X2)
| ~ present(skc45,X2)
| ~ think_believe_consider(skc45,X2)
| ~ vincent_forename(skc45,X6)
| ~ vincent_forename(skc45,X5)
| ~ of(skc45,X6,X3)
| ~ of(skc45,X5,skc53)
| ~ of(skc45,X4,skc53)
| ~ theme(skc45,X2,X1)
| ~ agent(skc45,X2,X3)
| ssSkC0
| man(X1,skf12(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_204]),c_0_208]),c_0_209]),c_0_210]),
[final] ).
cnf(c_0_223,negated_conjecture,
( ~ man(skc45,X4)
| ~ jules_forename(skc45,X5)
| ~ forename(skc45,X7)
| ~ forename(skc45,X6)
| ~ forename(skc45,X5)
| ~ proposition(skc45,X1)
| ~ accessible_world(skc45,X1)
| ~ event(skc46,X2)
| ~ event(skc45,X3)
| ~ present(skc46,X2)
| ~ present(skc45,X3)
| ~ think_believe_consider(skc45,X3)
| ~ vincent_forename(skc45,X7)
| ~ vincent_forename(skc45,X6)
| ~ smoke(skc46,X2)
| ~ of(skc45,X7,X4)
| ~ of(skc45,X6,skc49)
| ~ of(skc45,X5,skc49)
| ~ theme(skc45,X3,X1)
| ~ agent(skc45,X3,X4)
| ~ agent(skc46,X2,skc49)
| ssSkC0
| man(X1,skf12(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_211,c_0_212]),c_0_213]),c_0_214]),
[final] ).
cnf(c_0_224,negated_conjecture,
( ~ ssSkC0
| ~ man(skc38,skc41)
| ~ jules_forename(skc28,X2)
| ~ forename(skc28,X3)
| ~ forename(skc28,X2)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X1)
| ~ vincent_forename(skc28,X3)
| ~ of(skc28,X3,skc41)
| ~ of(skc28,X2,skc41)
| ~ theme(skc28,skc39,X1)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_206]),c_0_216]),c_0_217]),c_0_218]),
[final] ).
cnf(c_0_225,negated_conjecture,
( ~ ssSkC0
| ~ jules_forename(skc28,X3)
| ~ forename(skc28,X4)
| ~ forename(skc28,X3)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X1)
| ~ event(skc29,X2)
| ~ present(skc29,X2)
| ~ vincent_forename(skc28,X4)
| ~ smoke(skc29,X2)
| ~ of(skc28,X4,skc41)
| ~ of(skc28,X3,skc41)
| ~ theme(skc28,skc39,X1)
| ~ agent(skc29,X2,skc41)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_136]),c_0_137]),c_0_138]),c_0_139]),c_0_140]),
[final] ).
cnf(c_0_226,negated_conjecture,
( ~ ssSkC0
| man(skc29,skf7(skc29)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_128]),c_0_129]),c_0_130]),
[final] ).
cnf(c_0_227,negated_conjecture,
( agent(skc46,skc55,skc53)
| ssSkC0 ),
clause57,
[final] ).
cnf(c_0_228,negated_conjecture,
( of(skc45,skc48,skc49)
| ssSkC0 ),
clause61,
[final] ).
cnf(c_0_229,negated_conjecture,
( of(skc45,skc54,skc53)
| ssSkC0 ),
clause58,
[final] ).
cnf(c_0_230,negated_conjecture,
( of(skc45,skc52,skc53)
| ssSkC0 ),
clause55,
[final] ).
cnf(c_0_231,negated_conjecture,
( smoke(skc46,skc55)
| ssSkC0 ),
clause17,
[final] ).
cnf(c_0_232,negated_conjecture,
( vincent_forename(skc45,skc48)
| ssSkC0 ),
clause25,
[final] ).
cnf(c_0_233,negated_conjecture,
( vincent_forename(skc45,skc52)
| ssSkC0 ),
clause15,
[final] ).
cnf(c_0_234,negated_conjecture,
( present(skc46,skc55)
| ssSkC0 ),
clause18,
[final] ).
cnf(c_0_235,negated_conjecture,
( event(skc46,skc55)
| ssSkC0 ),
clause19,
[final] ).
cnf(c_0_236,negated_conjecture,
( forename(skc45,skc48)
| ssSkC0 ),
clause26,
[final] ).
cnf(c_0_237,negated_conjecture,
( forename(skc45,skc54)
| ssSkC0 ),
clause20,
[final] ).
cnf(c_0_238,negated_conjecture,
( forename(skc45,skc52)
| ssSkC0 ),
clause14,
[final] ).
cnf(c_0_239,negated_conjecture,
( jules_forename(skc45,skc54)
| ssSkC0 ),
clause21,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP233-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n008.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:53:54 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.21/0.63 % Version: 3.5.1
% 0.21/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.63 % Starting sh5l with 300s (1) cores
% 0.21/0.63 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4098343 completed with status 1
% 0.21/0.63 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.63 % No SInE strategy applied
% 0.21/0.63 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.21/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.21/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.21/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.21/0.63 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4098348 completed with status 1
% 0.21/0.63 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.63 % No SInE strategy applied
% 0.21/0.63 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.21/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.63 % Preprocessing time : 0.005 s
% 0.21/0.63 % Presaturation interreduction done
% 0.21/0.63
% 0.21/0.63 % No proof found!
% 0.21/0.63 % SZS status Satisfiable
% 0.21/0.63 % SZS output start Saturation
% See solution above
% 0.21/0.63 % Parsed axioms : 84
% 0.21/0.63 % Removed by relevancy pruning/SinE : 0
% 0.21/0.63 % Initial clauses : 84
% 0.21/0.63 % Removed in clause preprocessing : 0
% 0.21/0.63 % Initial clauses in saturation : 84
% 0.21/0.63 % Processed clauses : 200
% 0.21/0.63 % ...of these trivial : 4
% 0.21/0.63 % ...subsumed : 1
% 0.21/0.63 % ...remaining for further processing : 195
% 0.21/0.63 % Other redundant clauses eliminated : 0
% 0.21/0.63 % Clauses deleted for lack of memory : 0
% 0.21/0.63 % Backward-subsumed : 9
% 0.21/0.63 % Backward-rewritten : 0
% 0.21/0.63 % Generated clauses : 33
% 0.21/0.63 % ...of the previous two non-redundant : 33
% 0.21/0.63 % ...aggressively subsumed : 0
% 0.21/0.63 % Contextual simplify-reflections : 67
% 0.21/0.63 % Paramodulations : 33
% 0.21/0.63 % Factorizations : 0
% 0.21/0.63 % NegExts : 0
% 0.21/0.63 % Equation resolutions : 0
% 0.21/0.63 % Disequality decompositions : 0
% 0.21/0.63 % Total rewrite steps : 4
% 0.21/0.63 % ...of those cached : 2
% 0.21/0.63 % Propositional unsat checks : 0
% 0.21/0.63 % Propositional check models : 0
% 0.21/0.63 % Propositional check unsatisfiable : 0
% 0.21/0.63 % Propositional clauses : 0
% 0.21/0.63 % Propositional clauses after purity: 0
% 0.21/0.63 % Propositional unsat core size : 0
% 0.21/0.63 % Propositional preprocessing time : 0.000
% 0.21/0.63 % Propositional encoding time : 0.000
% 0.21/0.63 % Propositional solver time : 0.000
% 0.21/0.63 % Success case prop preproc time : 0.000
% 0.21/0.63 % Success case prop encoding time : 0.000
% 0.21/0.63 % Success case prop solver time : 0.000
% 0.21/0.63 % Current number of processed clauses : 102
% 0.21/0.63 % Positive orientable unit clauses : 2
% 0.21/0.63 % Positive unorientable unit clauses: 0
% 0.21/0.63 % Negative unit clauses : 0
% 0.21/0.63 % Non-unit-clauses : 100
% 0.21/0.63 % Current number of unprocessed clauses: 0
% 0.21/0.63 % ...number of literals in the above : 0
% 0.21/0.63 % Current number of archived formulas : 0
% 0.21/0.63 % Current number of archived clauses : 93
% 0.21/0.63 % Clause-clause subsumption calls (NU) : 17086
% 0.21/0.63 % Rec. Clause-clause subsumption calls : 2074
% 0.21/0.63 % Non-unit clause-clause subsumptions : 77
% 0.21/0.63 % Unit Clause-clause subsumption calls : 0
% 0.21/0.63 % Rewrite failures with RHS unbound : 0
% 0.21/0.63 % BW rewrite match attempts : 0
% 0.21/0.63 % BW rewrite match successes : 0
% 0.21/0.63 % Condensation attempts : 0
% 0.21/0.63 % Condensation successes : 0
% 0.21/0.63 % Termbank termtop insertions : 9587
% 0.21/0.63 % Search garbage collected termcells : 473
% 0.21/0.63
% 0.21/0.63 % -------------------------------------------------
% 0.21/0.63 % User time : 0.067 s
% 0.21/0.63 % System time : 0.007 s
% 0.21/0.63 % Total time : 0.074 s
% 0.21/0.63 % Maximum resident set size: 3960 pages
% 0.21/0.63
% 0.21/0.63 % -------------------------------------------------
% 0.21/0.63 % User time : 0.518 s
% 0.21/0.63 % System time : 0.026 s
% 0.21/0.63 % Total time : 0.544 s
% 0.21/0.63 % Maximum resident set size: 5120 pages
% 0.21/0.63 % E exiting
%------------------------------------------------------------------------------