%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP238-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 : n006.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:48 PM UTC 2026
% Result : Satisfiable 0.14s 0.44s
% Output : Saturation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause71ERROR: Could not build tree for root c_0_86ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_85,negated_conjecture,
( ~ actual_world(X1)
| ~ of(X1,X12,X13)
| ~ man(X1,X13)
| ~ agent(X1,X11,X13)
| ~ forename(X1,X12)
| ~ vincent_forename(X1,X12)
| ~ theme(X1,X11,X7)
| ~ event(X1,X11)
| ~ present(X1,X11)
| ~ think_believe_consider(X1,X11)
| ~ accessible_world(X1,X7)
| ~ proposition(X1,X7)
| ~ forename(X1,X10)
| ~ jules_forename(X1,X10)
| ~ of(X1,X10,X9)
| ~ man(X1,X9)
| ~ be(X1,X6,X9,X9)
| ~ event(X7,X8)
| ~ agent(X7,X8,X9)
| ~ present(X7,X8)
| ~ smoke(X7,X8)
| ~ 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,skf11(X2))
| ssSkC0 ),
c_0_84,
[final] ).
cnf(c_0_86,negated_conjecture,
( be(skc45,skc48,skc49,skc49)
| ssSkC0 ),
clause71,
[final] ).
cnf(c_0_87,negated_conjecture,
actual_world(skc45),
clause1,
[final] ).
cnf(c_0_88,negated_conjecture,
( man(skc45,skc49)
| ssSkC0 ),
clause25,
[final] ).
cnf(c_0_89,negated_conjecture,
( state(skc45,skc48)
| ssSkC0 ),
clause22,
[final] ).
cnf(c_0_103,negated_conjecture,
( of(skc45,skc50,skc49)
| ssSkC0 ),
clause61,
[final] ).
cnf(c_0_104,negated_conjecture,
( forename(skc45,skc50)
| ssSkC0 ),
clause27,
[final] ).
cnf(c_0_105,negated_conjecture,
( jules_forename(skc45,skc50)
| ssSkC0 ),
clause26,
[final] ).
cnf(c_0_107,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X3)
| ~ forename(X3,X15)
| ~ jules_forename(X3,X15)
| ~ of(X3,X15,X14)
| ~ man(X3,X14)
| ~ be(X3,X12,X14,X14)
| ~ agent(X3,X11,X14)
| ~ of(X3,X13,X14)
| ~ vincent_forename(X3,X13)
| ~ forename(X3,X13)
| ~ state(X3,X12)
| ~ theme(X3,X11,X8)
| ~ event(X3,X11)
| ~ present(X3,X11)
| ~ think_believe_consider(X3,X11)
| ~ accessible_world(X3,X8)
| ~ proposition(X3,X8)
| ~ of(X3,X7,X10)
| ~ man(X3,X10)
| ~ event(X8,X9)
| ~ agent(X8,X9,X10)
| ~ present(X8,X9)
| ~ smoke(X8,X9)
| ~ forename(X3,X7)
| ~ jules_forename(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,skf7(X1))
| ~ present(X1,X2)
| ~ smoke(X1,X2) ),
c_0_90,
[final] ).
cnf(c_0_108,negated_conjecture,
( ~ ssSkC0
| ~ man(skc38,X1)
| agent(skc38,skf5(X1),X1) ),
c_0_91,
[final] ).
cnf(c_0_109,negated_conjecture,
( ~ ssSkC0
| ~ man(skc38,X1)
| event(skc38,skf5(X2)) ),
c_0_92,
[final] ).
cnf(c_0_110,negated_conjecture,
( ~ ssSkC0
| ~ man(skc38,X1)
| present(skc38,skf5(X2)) ),
c_0_93,
[final] ).
cnf(c_0_111,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ forename(X1,X14)
| ~ jules_forename(X1,X14)
| ~ of(X1,X14,X13)
| ~ man(X1,X13)
| ~ be(X1,X11,X13,X13)
| ~ agent(X1,X10,X13)
| ~ of(X1,X12,X13)
| ~ vincent_forename(X1,X12)
| ~ forename(X1,X12)
| ~ state(X1,X11)
| ~ theme(X1,X10,X7)
| ~ event(X1,X10)
| ~ present(X1,X10)
| ~ think_believe_consider(X1,X10)
| ~ accessible_world(X1,X7)
| ~ proposition(X1,X7)
| ~ of(X1,X6,X9)
| ~ man(X1,X9)
| ~ event(X7,X8)
| ~ agent(X7,X8,X9)
| ~ present(X7,X8)
| ~ smoke(X7,X8)
| ~ forename(X1,X6)
| ~ jules_forename(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,skf7(X2)) ),
c_0_94,
[final] ).
cnf(c_0_112,negated_conjecture,
( ~ actual_world(X3)
| ~ of(X3,X13,X14)
| ~ man(X3,X14)
| ~ agent(X3,X12,X14)
| ~ forename(X3,X13)
| ~ vincent_forename(X3,X13)
| ~ theme(X3,X12,X8)
| ~ event(X3,X12)
| ~ present(X3,X12)
| ~ think_believe_consider(X3,X12)
| ~ accessible_world(X3,X8)
| ~ proposition(X3,X8)
| ~ forename(X3,X11)
| ~ jules_forename(X3,X11)
| ~ of(X3,X11,X10)
| ~ man(X3,X10)
| ~ be(X3,X7,X10,X10)
| ~ event(X8,X9)
| ~ agent(X8,X9,X10)
| ~ present(X8,X9)
| ~ smoke(X8,X9)
| ~ 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,skf11(X1))
| ~ present(X1,X2)
| ~ smoke(X1,X2)
| ssSkC0 ),
c_0_95,
[final] ).
cnf(c_0_113,negated_conjecture,
( ~ man(skc55,X1)
| agent(skc55,skf9(X1),X1)
| ssSkC0 ),
c_0_96,
[final] ).
cnf(c_0_114,negated_conjecture,
( ~ man(skc55,X1)
| event(skc55,skf9(X2))
| ssSkC0 ),
c_0_97,
[final] ).
cnf(c_0_115,negated_conjecture,
( ~ man(skc55,X1)
| present(skc55,skf9(X2))
| ssSkC0 ),
c_0_98,
[final] ).
cnf(c_0_116,negated_conjecture,
( ~ ssSkC0
| be(skc28,skc33,skc34,skc34) ),
c_0_99,
[final] ).
cnf(c_0_117,negated_conjecture,
actual_world(skc28),
clause2,
[final] ).
cnf(c_0_118,negated_conjecture,
( ~ ssSkC0
| man(skc28,skc34) ),
c_0_100,
[final] ).
cnf(c_0_119,negated_conjecture,
( ~ ssSkC0
| state(skc28,skc33) ),
c_0_101,
[final] ).
cnf(c_0_120,negated_conjecture,
( ~ accessible_world(skc45,X1)
| ~ accessible_world(skc45,X2)
| ~ proposition(skc45,X1)
| ~ proposition(skc45,X2)
| ~ event(X2,X3)
| ~ event(skc45,X6)
| ~ event(skc45,X4)
| ~ present(X2,X3)
| ~ present(skc45,X6)
| ~ present(skc45,X4)
| ~ think_believe_consider(skc45,X6)
| ~ think_believe_consider(skc45,X4)
| ~ forename(skc45,X9)
| ~ forename(skc45,X8)
| ~ vincent_forename(skc45,X9)
| ~ vincent_forename(skc45,X8)
| ~ man(skc45,X7)
| ~ man(skc45,X5)
| ~ smoke(X2,X3)
| ~ theme(skc45,X6,X1)
| ~ theme(skc45,X4,X2)
| ~ of(skc45,X9,X7)
| ~ of(skc45,X8,X5)
| ~ agent(skc45,X6,X7)
| ~ agent(skc45,X4,X5)
| ~ agent(X2,X3,skc49)
| ssSkC0
| man(X1,skf11(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),c_0_105]),
[final] ).
cnf(c_0_121,negated_conjecture,
( accessible_world(skc45,skc55)
| ssSkC0 ),
clause3,
[final] ).
cnf(c_0_122,negated_conjecture,
( proposition(skc45,skc55)
| ssSkC0 ),
clause4,
[final] ).
cnf(c_0_123,negated_conjecture,
( ~ man(skc55,X1)
| smoke(skc55,skf9(X2))
| ssSkC0 ),
c_0_106,
[final] ).
cnf(c_0_124,negated_conjecture,
( agent(skc45,skc47,skc49)
| ssSkC0 ),
clause60,
[final] ).
cnf(c_0_125,negated_conjecture,
( event(skc45,skc47)
| ssSkC0 ),
clause21,
[final] ).
cnf(c_0_126,negated_conjecture,
( present(skc45,skc47)
| ssSkC0 ),
clause20,
[final] ).
cnf(c_0_160,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkC0
| ~ accessible_world(X1,X4)
| ~ accessible_world(X1,skc38)
| ~ proposition(X1,X4)
| ~ proposition(X1,skc38)
| ~ event(X1,X8)
| ~ event(X1,X7)
| ~ event(X4,X5)
| ~ present(X1,X8)
| ~ present(X1,X7)
| ~ present(X4,X5)
| ~ think_believe_consider(X1,X8)
| ~ think_believe_consider(X1,X7)
| ~ forename(X1,X13)
| ~ forename(X1,X12)
| ~ forename(X1,X11)
| ~ forename(X1,X10)
| ~ vincent_forename(X1,X13)
| ~ vincent_forename(X1,X11)
| ~ man(X1,X9)
| ~ man(X1,X6)
| ~ man(X1,X3)
| ~ jules_forename(X1,X12)
| ~ jules_forename(X1,X10)
| ~ smoke(X4,X5)
| ~ smoke(skc38,skf5(skf7(skc38)))
| ~ state(X1,X2)
| ~ theme(X1,X7,X4)
| ~ theme(X1,X8,skc38)
| ~ of(X1,X13,X9)
| ~ of(X1,X12,X6)
| ~ of(X1,X11,X3)
| ~ of(X1,X10,X3)
| ~ agent(X1,X8,X9)
| ~ agent(X1,X7,X3)
| ~ agent(X4,X5,X6)
| ~ be(X1,X2,X3,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_110]),c_0_111]),
[final] ).
cnf(c_0_161,negated_conjecture,
( ~ actual_world(X1)
| ~ accessible_world(X1,X4)
| ~ accessible_world(X1,skc55)
| ~ proposition(X1,X4)
| ~ proposition(X1,skc55)
| ~ event(X1,X8)
| ~ event(X1,X6)
| ~ event(X4,X5)
| ~ present(X1,X8)
| ~ present(X1,X6)
| ~ present(X4,X5)
| ~ think_believe_consider(X1,X8)
| ~ think_believe_consider(X1,X6)
| ~ forename(X1,X12)
| ~ forename(X1,X11)
| ~ forename(X1,X10)
| ~ vincent_forename(X1,X12)
| ~ vincent_forename(X1,X10)
| ~ man(X1,X9)
| ~ man(X1,X3)
| ~ man(X1,X7)
| ~ jules_forename(X1,X11)
| ~ smoke(X4,X5)
| ~ smoke(skc55,skf9(skf11(skc55)))
| ~ state(X1,X2)
| ~ theme(X1,X6,X4)
| ~ theme(X1,X8,skc55)
| ~ of(X1,X12,X9)
| ~ of(X1,X11,X3)
| ~ of(X1,X10,X7)
| ~ agent(X1,X8,X9)
| ~ agent(X1,X6,X7)
| ~ agent(X4,X5,X3)
| ~ be(X1,X2,X3,X3)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]),c_0_115]),c_0_85]),
[final] ).
cnf(c_0_162,negated_conjecture,
( ~ ssSkC0
| ~ accessible_world(skc28,X1)
| ~ accessible_world(skc28,X5)
| ~ proposition(skc28,X1)
| ~ proposition(skc28,X5)
| ~ event(X5,X6)
| ~ event(skc28,X3)
| ~ event(skc28,X2)
| ~ present(X5,X6)
| ~ present(skc28,X3)
| ~ present(skc28,X2)
| ~ think_believe_consider(skc28,X3)
| ~ think_believe_consider(skc28,X2)
| ~ forename(skc28,X11)
| ~ forename(skc28,X10)
| ~ forename(skc28,X9)
| ~ forename(skc28,X8)
| ~ vincent_forename(skc28,X11)
| ~ vincent_forename(skc28,X9)
| ~ man(skc28,X4)
| ~ man(skc28,X7)
| ~ jules_forename(skc28,X10)
| ~ jules_forename(skc28,X8)
| ~ smoke(X5,X6)
| ~ theme(skc28,X3,X1)
| ~ theme(skc28,X2,X5)
| ~ of(skc28,X11,X4)
| ~ of(skc28,X10,X7)
| ~ of(skc28,X9,skc34)
| ~ of(skc28,X8,skc34)
| ~ agent(X5,X6,X7)
| ~ agent(skc28,X3,X4)
| ~ agent(skc28,X2,skc34)
| man(X1,skf7(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_116]),c_0_117])]),c_0_118]),c_0_119]),
[final] ).
cnf(c_0_163,negated_conjecture,
( ~ accessible_world(skc45,X1)
| ~ proposition(skc45,X1)
| ~ event(skc45,X4)
| ~ event(skc45,X2)
| ~ present(skc45,X4)
| ~ present(skc45,X2)
| ~ think_believe_consider(skc45,X4)
| ~ think_believe_consider(skc45,X2)
| ~ forename(skc45,X7)
| ~ forename(skc45,X6)
| ~ vincent_forename(skc45,X7)
| ~ vincent_forename(skc45,X6)
| ~ man(skc45,X5)
| ~ man(skc45,X3)
| ~ man(skc55,skc49)
| ~ theme(skc45,X4,X1)
| ~ theme(skc45,X2,skc55)
| ~ of(skc45,X7,X5)
| ~ of(skc45,X6,X3)
| ~ agent(skc45,X4,X5)
| ~ agent(skc45,X2,X3)
| ssSkC0
| man(X1,skf11(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_113]),c_0_121]),c_0_122]),c_0_114]),c_0_115]),c_0_123]),
[final] ).
cnf(c_0_164,negated_conjecture,
( ~ accessible_world(skc45,X1)
| ~ accessible_world(skc45,skc45)
| ~ proposition(skc45,X1)
| ~ proposition(skc45,skc45)
| ~ event(skc45,X4)
| ~ event(skc45,X2)
| ~ present(skc45,X4)
| ~ present(skc45,X2)
| ~ think_believe_consider(skc45,X4)
| ~ think_believe_consider(skc45,X2)
| ~ forename(skc45,X7)
| ~ forename(skc45,X6)
| ~ vincent_forename(skc45,X7)
| ~ vincent_forename(skc45,X6)
| ~ man(skc45,X5)
| ~ man(skc45,X3)
| ~ smoke(skc45,skc47)
| ~ theme(skc45,X4,X1)
| ~ theme(skc45,X2,skc45)
| ~ of(skc45,X7,X5)
| ~ of(skc45,X6,X3)
| ~ agent(skc45,X4,X5)
| ~ agent(skc45,X2,X3)
| ssSkC0
| man(X1,skf11(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_124]),c_0_125]),c_0_126]),
[final] ).
cnf(c_0_165,negated_conjecture,
( ~ ssSkC0
| ~ man(skc38,X1)
| smoke(skc38,skf5(X2)) ),
c_0_127,
[final] ).
cnf(c_0_166,negated_conjecture,
( agent(skc46,skc54,skc53)
| ssSkC0 ),
clause56,
[final] ).
cnf(c_0_167,negated_conjecture,
( agent(skc45,skc56,skc58)
| ssSkC0 ),
clause55,
[final] ).
cnf(c_0_168,negated_conjecture,
( of(skc45,skc51,skc49)
| ssSkC0 ),
clause59,
[final] ).
cnf(c_0_169,negated_conjecture,
( of(skc45,skc52,skc53)
| ssSkC0 ),
clause57,
[final] ).
cnf(c_0_170,negated_conjecture,
( of(skc45,skc57,skc58)
| ssSkC0 ),
clause54,
[final] ).
cnf(c_0_171,negated_conjecture,
( theme(skc45,skc47,skc46)
| ssSkC0 ),
clause58,
[final] ).
cnf(c_0_172,negated_conjecture,
( ~ ssSkC0
| agent(skc29,skc36,skc34) ),
c_0_128,
[final] ).
cnf(c_0_173,negated_conjecture,
( ~ ssSkC0
| agent(skc28,skc30,skc32) ),
c_0_129,
[final] ).
cnf(c_0_174,negated_conjecture,
( theme(skc45,skc56,skc55)
| ssSkC0 ),
clause53,
[final] ).
cnf(c_0_175,negated_conjecture,
( ~ ssSkC0
| agent(skc28,skc39,skc41) ),
c_0_130,
[final] ).
cnf(c_0_176,negated_conjecture,
( ~ ssSkC0
| of(skc28,skc31,skc32) ),
c_0_131,
[final] ).
cnf(c_0_177,negated_conjecture,
( ~ ssSkC0
| of(skc28,skc35,skc34) ),
c_0_132,
[final] ).
cnf(c_0_178,negated_conjecture,
( ~ ssSkC0
| of(skc28,skc37,skc34) ),
c_0_133,
[final] ).
cnf(c_0_179,negated_conjecture,
( ~ ssSkC0
| of(skc28,skc40,skc41) ),
c_0_134,
[final] ).
cnf(c_0_180,negated_conjecture,
( ~ ssSkC0
| theme(skc28,skc30,skc29) ),
c_0_135,
[final] ).
cnf(c_0_181,negated_conjecture,
( ~ ssSkC0
| theme(skc28,skc39,skc38) ),
c_0_136,
[final] ).
cnf(c_0_182,negated_conjecture,
( smoke(skc46,skc54)
| ssSkC0 ),
clause13,
[final] ).
cnf(c_0_183,negated_conjecture,
( jules_forename(skc45,skc52)
| ssSkC0 ),
clause11,
[final] ).
cnf(c_0_184,negated_conjecture,
( man(skc45,skc53)
| ssSkC0 ),
clause16,
[final] ).
cnf(c_0_185,negated_conjecture,
( man(skc45,skc58)
| ssSkC0 ),
clause10,
[final] ).
cnf(c_0_186,negated_conjecture,
( vincent_forename(skc45,skc51)
| ssSkC0 ),
clause24,
[final] ).
cnf(c_0_187,negated_conjecture,
( vincent_forename(skc45,skc57)
| ssSkC0 ),
clause9,
[final] ).
cnf(c_0_188,negated_conjecture,
( forename(skc45,skc51)
| ssSkC0 ),
clause23,
[final] ).
cnf(c_0_189,negated_conjecture,
( forename(skc45,skc52)
| ssSkC0 ),
clause12,
[final] ).
cnf(c_0_190,negated_conjecture,
( forename(skc45,skc57)
| ssSkC0 ),
clause8,
[final] ).
cnf(c_0_191,negated_conjecture,
( think_believe_consider(skc45,skc47)
| ssSkC0 ),
clause19,
[final] ).
cnf(c_0_192,negated_conjecture,
( think_believe_consider(skc45,skc56)
| ssSkC0 ),
clause7,
[final] ).
cnf(c_0_193,negated_conjecture,
( present(skc46,skc54)
| ssSkC0 ),
clause14,
[final] ).
cnf(c_0_194,negated_conjecture,
( ~ ssSkC0
| smoke(skc29,skc36) ),
c_0_137,
[final] ).
cnf(c_0_195,negated_conjecture,
( present(skc45,skc56)
| ssSkC0 ),
clause6,
[final] ).
cnf(c_0_196,negated_conjecture,
( event(skc46,skc54)
| ssSkC0 ),
clause15,
[final] ).
cnf(c_0_197,negated_conjecture,
( ~ ssSkC0
| jules_forename(skc28,skc35) ),
c_0_138,
[final] ).
cnf(c_0_198,negated_conjecture,
( ~ ssSkC0
| jules_forename(skc28,skc37) ),
c_0_139,
[final] ).
cnf(c_0_199,negated_conjecture,
( ~ ssSkC0
| man(skc28,skc32) ),
c_0_140,
[final] ).
cnf(c_0_200,negated_conjecture,
( ~ ssSkC0
| man(skc28,skc41) ),
c_0_141,
[final] ).
cnf(c_0_201,negated_conjecture,
( ~ ssSkC0
| vincent_forename(skc28,skc31) ),
c_0_142,
[final] ).
cnf(c_0_202,negated_conjecture,
( ~ ssSkC0
| vincent_forename(skc28,skc40) ),
c_0_143,
[final] ).
cnf(c_0_203,negated_conjecture,
( ~ ssSkC0
| forename(skc28,skc31) ),
c_0_144,
[final] ).
cnf(c_0_204,negated_conjecture,
( event(skc45,skc56)
| ssSkC0 ),
clause5,
[final] ).
cnf(c_0_205,negated_conjecture,
( proposition(skc45,skc46)
| ssSkC0 ),
clause17,
[final] ).
cnf(c_0_206,negated_conjecture,
( ~ ssSkC0
| forename(skc28,skc35) ),
c_0_145,
[final] ).
cnf(c_0_207,negated_conjecture,
( ~ ssSkC0
| forename(skc28,skc37) ),
c_0_146,
[final] ).
cnf(c_0_208,negated_conjecture,
( ~ ssSkC0
| forename(skc28,skc40) ),
c_0_147,
[final] ).
cnf(c_0_209,negated_conjecture,
( ~ ssSkC0
| think_believe_consider(skc28,skc30) ),
c_0_148,
[final] ).
cnf(c_0_210,negated_conjecture,
( ~ ssSkC0
| think_believe_consider(skc28,skc39) ),
c_0_149,
[final] ).
cnf(c_0_211,negated_conjecture,
( ~ ssSkC0
| present(skc29,skc36) ),
c_0_150,
[final] ).
cnf(c_0_212,negated_conjecture,
( ~ ssSkC0
| present(skc28,skc30) ),
c_0_151,
[final] ).
cnf(c_0_213,negated_conjecture,
( ~ ssSkC0
| present(skc28,skc39) ),
c_0_152,
[final] ).
cnf(c_0_214,negated_conjecture,
( accessible_world(skc45,skc46)
| ssSkC0 ),
clause18,
[final] ).
cnf(c_0_215,negated_conjecture,
( ~ ssSkC0
| event(skc29,skc36) ),
c_0_153,
[final] ).
cnf(c_0_216,negated_conjecture,
( ~ ssSkC0
| event(skc28,skc30) ),
c_0_154,
[final] ).
cnf(c_0_217,negated_conjecture,
( ~ ssSkC0
| event(skc28,skc39) ),
c_0_155,
[final] ).
cnf(c_0_218,negated_conjecture,
( ~ ssSkC0
| proposition(skc28,skc29) ),
c_0_156,
[final] ).
cnf(c_0_219,negated_conjecture,
( ~ ssSkC0
| proposition(skc28,skc38) ),
c_0_157,
[final] ).
cnf(c_0_220,negated_conjecture,
( ~ ssSkC0
| accessible_world(skc28,skc29) ),
c_0_158,
[final] ).
cnf(c_0_221,negated_conjecture,
( ~ ssSkC0
| accessible_world(skc28,skc38) ),
c_0_159,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP238-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.35 % Computer : n006.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 01:53:12 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1766099 completed with status 1
% 0.14/0.44 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.44 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1766105 completed with status 1
% 0.14/0.44 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.44 % Preprocessing time : 0.003 s
% 0.14/0.44 % Presaturation interreduction done
% 0.14/0.44
% 0.14/0.44 % No proof found!
% 0.14/0.44 % SZS status Satisfiable
% 0.14/0.44 % SZS output start Saturation
% See solution above
% 0.14/0.45 % Parsed axioms : 84
% 0.14/0.45 % Removed by relevancy pruning/SinE : 0
% 0.14/0.45 % Initial clauses : 84
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 84
% 0.14/0.45 % Processed clauses : 179
% 0.14/0.45 % ...of these trivial : 4
% 0.14/0.45 % ...subsumed : 0
% 0.14/0.45 % ...remaining for further processing : 175
% 0.14/0.45 % Other redundant clauses eliminated : 0
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 1
% 0.14/0.45 % Backward-rewritten : 0
% 0.14/0.45 % Generated clauses : 13
% 0.14/0.45 % ...of the previous two non-redundant : 12
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 19
% 0.14/0.45 % Paramodulations : 13
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 0
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 4
% 0.14/0.45 % ...of those cached : 2
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 90
% 0.14/0.45 % Positive orientable unit clauses : 2
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 0
% 0.14/0.45 % Non-unit-clauses : 88
% 0.14/0.45 % Current number of unprocessed clauses: 0
% 0.14/0.45 % ...number of literals in the above : 0
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 85
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 4242
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 1399
% 0.14/0.45 % Non-unit clause-clause subsumptions : 20
% 0.14/0.45 % Unit Clause-clause subsumption calls : 0
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 0
% 0.14/0.45 % BW rewrite match successes : 0
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 6815
% 0.14/0.45 % Search garbage collected termcells : 393
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.025 s
% 0.14/0.45 % System time : 0.004 s
% 0.14/0.45 % Total time : 0.029 s
% 0.14/0.45 % Maximum resident set size: 3736 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.121 s
% 0.14/0.45 % System time : 0.016 s
% 0.14/0.45 % Total time : 0.137 s
% 0.14/0.45 % Maximum resident set size: 4608 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------