%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP192-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:31 PM UTC 2026
% Result : Satisfiable 0.23s 15.55s
% Output : Saturation 0.23s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_92ERROR: Could not build tree for root c_0_93ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_93,negated_conjecture,
( ~ actual_world(X1)
| ~ state(X1,X11)
| ~ of(X1,X10,X12)
| ~ man(X1,X12)
| ~ be(X1,X11,X12,X8)
| ~ forename(X1,X10)
| ~ jules_forename(X1,X10)
| ~ of(X1,X9,X7)
| ~ hollywood_placename(X1,X9)
| ~ placename(X1,X9)
| ~ behind(X1,X8,X7)
| ~ in(X1,X5,X7)
| ~ down(X1,X5,X7)
| ~ lonely(X1,X7)
| ~ street(X1,X7)
| ~ city(X1,X7)
| ~ wheel(X1,X7)
| ~ agent(X1,X5,X6)
| ~ old(X1,X6)
| ~ dirty(X1,X6)
| ~ white(X1,X6)
| ~ chevy(X1,X6)
| ~ event(X1,X5)
| ~ present(X1,X5)
| ~ barrel(X1,X5)
| ~ frontseat(X1,X4)
| ~ ssSkP1(X4,X3,X1)
| ~ ssSkP2(X3,X2,X1)
| ~ ssSkP0(X3,X1)
| ~ group(X1,X3)
| ~ two(X1,X3)
| ~ group(X1,X2)
| member(X1,skf23(X1,X2),X2)
| ssSkC0 ),
c_0_92,
[final] ).
cnf(c_0_94,negated_conjecture,
( be(skc71,skc73,skc75,skc72)
| ssSkC0 ),
clause63,
[final] ).
cnf(c_0_95,negated_conjecture,
actual_world(skc71),
clause1,
[final] ).
cnf(c_0_96,negated_conjecture,
( man(skc71,skc75)
| ssSkC0 ),
clause23,
[final] ).
cnf(c_0_97,negated_conjecture,
( state(skc71,skc73)
| ssSkC0 ),
clause24,
[final] ).
cnf(c_0_99,negated_conjecture,
( forename(skc71,skc74)
| ssSkC0 ),
clause22,
[final] ).
cnf(c_0_100,negated_conjecture,
( jules_forename(skc71,skc74)
| ssSkC0 ),
clause21,
[final] ).
cnf(c_0_101,negated_conjecture,
( of(skc71,skc74,skc75)
| ssSkC0 ),
clause54,
[final] ).
cnf(c_0_102,negated_conjecture,
( ~ group(skc71,X1)
| ~ group(skc71,X7)
| ~ two(skc71,X7)
| ~ ssSkP0(X7,skc71)
| ~ frontseat(skc71,X6)
| ~ barrel(skc71,X4)
| ~ present(skc71,X4)
| ~ event(skc71,X4)
| ~ wheel(skc71,X3)
| ~ chevy(skc71,X5)
| ~ white(skc71,X5)
| ~ dirty(skc71,X5)
| ~ old(skc71,X5)
| ~ city(skc71,X3)
| ~ street(skc71,X3)
| ~ lonely(skc71,X3)
| ~ placename(skc71,X2)
| ~ hollywood_placename(skc71,X2)
| ~ ssSkP2(X7,X1,skc71)
| ~ ssSkP1(X6,X7,skc71)
| ~ agent(skc71,X4,X5)
| ~ behind(skc71,skc72,X3)
| ~ down(skc71,X4,X3)
| ~ in(skc71,X4,X3)
| ~ of(skc71,X2,X3)
| ssSkC0
| member(skc71,skf23(skc71,X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_101]),
[final] ).
cnf(c_0_103,negated_conjecture,
( hollywood_placename(skc71,skc78)
| ssSkC0 ),
clause20,
[final] ).
cnf(c_0_104,negated_conjecture,
( placename(skc71,skc78)
| ssSkC0 ),
clause19,
[final] ).
cnf(c_0_105,negated_conjecture,
( ~ group(skc71,X1)
| ~ group(skc71,X6)
| ~ two(skc71,X6)
| ~ ssSkP0(X6,skc71)
| ~ frontseat(skc71,X5)
| ~ barrel(skc71,X3)
| ~ present(skc71,X3)
| ~ event(skc71,X3)
| ~ wheel(skc71,X2)
| ~ chevy(skc71,X4)
| ~ white(skc71,X4)
| ~ dirty(skc71,X4)
| ~ old(skc71,X4)
| ~ city(skc71,X2)
| ~ street(skc71,X2)
| ~ lonely(skc71,X2)
| ~ ssSkP2(X6,X1,skc71)
| ~ ssSkP1(X5,X6,skc71)
| ~ agent(skc71,X3,X4)
| ~ behind(skc71,skc72,X2)
| ~ down(skc71,X3,X2)
| ~ in(skc71,X3,X2)
| ~ of(skc71,skc78,X2)
| ssSkC0
| member(skc71,skf23(skc71,X1),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),
[final] ).
cnf(c_0_106,negated_conjecture,
( lonely(skc71,skc77)
| ssSkC0 ),
clause18,
[final] ).
cnf(c_0_107,negated_conjecture,
( city(skc71,skc77)
| ssSkC0 ),
clause16,
[final] ).
cnf(c_0_108,negated_conjecture,
( street(skc71,skc77)
| ssSkC0 ),
clause17,
[final] ).
cnf(c_0_109,negated_conjecture,
( of(skc71,skc78,skc77)
| ssSkC0 ),
clause53,
[final] ).
cnf(c_0_164,negated_conjecture,
( ~ group(skc71,X1)
| ~ group(skc71,X5)
| ~ two(skc71,X5)
| ~ ssSkP0(X5,skc71)
| ~ frontseat(skc71,X4)
| ~ barrel(skc71,X2)
| ~ present(skc71,X2)
| ~ event(skc71,X2)
| ~ wheel(skc71,skc77)
| ~ chevy(skc71,X3)
| ~ white(skc71,X3)
| ~ dirty(skc71,X3)
| ~ old(skc71,X3)
| ~ ssSkP2(X5,X1,skc71)
| ~ ssSkP1(X4,X5,skc71)
| ~ agent(skc71,X2,X3)
| ~ behind(skc71,skc72,skc77)
| ~ down(skc71,X2,skc77)
| ~ in(skc71,X2,skc77)
| ssSkC0
| member(skc71,skf23(skc71,X1),X1) ),
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]),
[final] ).
cnf(c_0_165,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ state(X1,X12)
| ~ of(X1,X11,X13)
| ~ man(X1,X13)
| ~ be(X1,X12,X13,X8)
| ~ forename(X1,X11)
| ~ jules_forename(X1,X11)
| ~ of(X1,X10,X9)
| ~ hollywood_placename(X1,X10)
| ~ placename(X1,X10)
| ~ in(X1,X6,X9)
| ~ down(X1,X6,X9)
| ~ lonely(X1,X9)
| ~ street(X1,X9)
| ~ city(X1,X9)
| ~ behind(X1,X8,X7)
| ~ agent(X1,X6,X7)
| ~ old(X1,X7)
| ~ dirty(X1,X7)
| ~ white(X1,X7)
| ~ chevy(X1,X7)
| ~ wheel(X1,X7)
| ~ event(X1,X6)
| ~ present(X1,X6)
| ~ barrel(X1,X6)
| ~ frontseat(X1,X5)
| ~ ssSkP1(X5,X4,X1)
| ~ ssSkP2(X4,X3,X1)
| ~ ssSkP0(X4,X1)
| ~ group(X1,X4)
| ~ two(X1,X4)
| ~ group(X1,X3)
| ~ coat(X1,skf10(X1,X2))
| ~ black(X1,skf10(X1,X2))
| ~ cheap(X1,skf10(X1,X2)) ),
c_0_110,
[final] ).
cnf(c_0_166,negated_conjecture,
( ~ actual_world(X1)
| ~ state(X1,X12)
| ~ of(X1,X11,X13)
| ~ man(X1,X13)
| ~ be(X1,X12,X13,X9)
| ~ forename(X1,X11)
| ~ jules_forename(X1,X11)
| ~ of(X1,X10,X8)
| ~ hollywood_placename(X1,X10)
| ~ placename(X1,X10)
| ~ behind(X1,X9,X8)
| ~ in(X1,X6,X8)
| ~ down(X1,X6,X8)
| ~ lonely(X1,X8)
| ~ street(X1,X8)
| ~ city(X1,X8)
| ~ wheel(X1,X8)
| ~ agent(X1,X6,X7)
| ~ old(X1,X7)
| ~ dirty(X1,X7)
| ~ white(X1,X7)
| ~ chevy(X1,X7)
| ~ event(X1,X6)
| ~ present(X1,X6)
| ~ barrel(X1,X6)
| ~ frontseat(X1,X5)
| ~ ssSkP1(X5,X4,X1)
| ~ ssSkP2(X4,X3,X1)
| ~ ssSkP0(X4,X1)
| ~ group(X1,X4)
| ~ two(X1,X4)
| ~ group(X1,X3)
| ~ coat(X1,skf23(X1,X2))
| ~ black(X1,skf23(X1,X2))
| ~ cheap(X1,skf23(X1,X2))
| ssSkC0 ),
c_0_111,
[final] ).
cnf(c_0_167,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ state(X1,X11)
| ~ of(X1,X10,X12)
| ~ man(X1,X12)
| ~ be(X1,X11,X12,X7)
| ~ forename(X1,X10)
| ~ jules_forename(X1,X10)
| ~ of(X1,X9,X8)
| ~ hollywood_placename(X1,X9)
| ~ placename(X1,X9)
| ~ in(X1,X5,X8)
| ~ down(X1,X5,X8)
| ~ lonely(X1,X8)
| ~ street(X1,X8)
| ~ city(X1,X8)
| ~ behind(X1,X7,X6)
| ~ agent(X1,X5,X6)
| ~ old(X1,X6)
| ~ dirty(X1,X6)
| ~ white(X1,X6)
| ~ chevy(X1,X6)
| ~ wheel(X1,X6)
| ~ event(X1,X5)
| ~ present(X1,X5)
| ~ barrel(X1,X5)
| ~ frontseat(X1,X4)
| ~ ssSkP1(X4,X3,X1)
| ~ ssSkP2(X3,X2,X1)
| ~ ssSkP0(X3,X1)
| ~ group(X1,X3)
| ~ two(X1,X3)
| ~ group(X1,X2)
| member(X1,skf10(X1,X2),X2) ),
c_0_112,
[final] ).
cnf(c_0_168,negated_conjecture,
( ~ event(X1,X2)
| ~ agent(X1,X2,skf21(X3,X1,X4))
| ~ patient(X1,X2,skf19(X3,X1,X4))
| ~ present(X1,X2)
| ~ nonreflexive(X1,X2)
| ~ wear(X1,X2)
| ssSkP2(X3,X5,X1) ),
c_0_113,
[final] ).
cnf(c_0_169,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| be(X1,skf13(X1,X5,X2),X2,skf12(X2,X1,X5)) ),
c_0_114,
[final] ).
cnf(c_0_170,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| patient(X1,skf17(X1,X2,X4),X4) ),
c_0_115,
[final] ).
cnf(c_0_171,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| agent(X1,skf17(X1,X2,X6),X2) ),
c_0_116,
[final] ).
cnf(c_0_172,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| nonreflexive(X1,skf17(X1,X6,X7)) ),
c_0_117,
[final] ).
cnf(c_0_173,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| wear(X1,skf17(X1,X6,X7)) ),
c_0_118,
[final] ).
cnf(c_0_174,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| event(X1,skf17(X1,X6,X7)) ),
c_0_119,
[final] ).
cnf(c_0_175,negated_conjecture,
( ~ state(X1,X4)
| ~ be(X1,X4,skf16(X3,X1,X5),X2)
| ~ in(X1,X2,X3)
| ssSkP1(X3,X6,X1) ),
c_0_120,
[final] ).
cnf(c_0_176,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| present(X1,skf17(X1,X6,X7)) ),
c_0_121,
[final] ).
cnf(c_0_177,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| in(X1,skf12(X2,X1,X4),X4) ),
c_0_122,
[final] ).
cnf(c_0_178,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| state(X1,skf13(X1,X5,X6)) ),
c_0_123,
[final] ).
cnf(c_0_179,negated_conjecture,
( member(X3,skf16(X1,X3,X2),X2)
| ssSkP1(X1,X2,X3) ),
clause72,
[final] ).
cnf(c_0_180,negated_conjecture,
( member(X3,skf19(X1,X3,X2),X2)
| ssSkP2(X1,X2,X3) ),
clause74,
[final] ).
cnf(c_0_181,negated_conjecture,
( member(X3,skf21(X1,X3,X4),X1)
| ssSkP2(X1,X2,X3) ),
clause73,
[final] ).
cnf(c_0_182,negated_conjecture,
( member(X2,skf11(X2,X1),X1)
| ssSkP0(X1,X2) ),
clause65,
[final] ).
cnf(c_0_183,negated_conjecture,
( ~ fellow(X1,skf11(X1,X2))
| ~ young(X1,skf11(X1,X2))
| ssSkP0(X3,X1) ),
c_0_124,
[final] ).
cnf(c_0_184,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ member(X1,X2,X3)
| young(X1,X2) ),
c_0_125,
[final] ).
cnf(c_0_185,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ member(X1,X2,X3)
| fellow(X1,X2) ),
c_0_126,
[final] ).
cnf(c_0_186,negated_conjecture,
( ~ member(skc71,X1,skc80)
| cheap(skc71,X1)
| ssSkC0 ),
c_0_127,
[final] ).
cnf(c_0_187,negated_conjecture,
( ~ member(skc71,X1,skc80)
| black(skc71,X1)
| ssSkC0 ),
c_0_128,
[final] ).
cnf(c_0_188,negated_conjecture,
( ~ member(skc71,X1,skc80)
| coat(skc71,X1)
| ssSkC0 ),
c_0_129,
[final] ).
cnf(c_0_189,negated_conjecture,
( ~ ssSkC0
| ~ member(skc24,X1,skc33)
| cheap(skc24,X1) ),
c_0_130,
[final] ).
cnf(c_0_190,negated_conjecture,
( ~ ssSkC0
| ~ member(skc24,X1,skc33)
| black(skc24,X1) ),
c_0_131,
[final] ).
cnf(c_0_191,negated_conjecture,
( ~ ssSkC0
| ~ member(skc24,X1,skc33)
| coat(skc24,X1) ),
c_0_132,
[final] ).
cnf(c_0_192,negated_conjecture,
( ~ ssSkC0
| be(skc24,skc26,skc28,skc25) ),
c_0_133,
[final] ).
cnf(c_0_193,negated_conjecture,
( in(skc71,skc76,skc77)
| ssSkC0 ),
clause52,
[final] ).
cnf(c_0_194,negated_conjecture,
( down(skc71,skc76,skc77)
| ssSkC0 ),
clause51,
[final] ).
cnf(c_0_195,negated_conjecture,
( behind(skc71,skc72,skc79)
| ssSkC0 ),
clause50,
[final] ).
cnf(c_0_196,negated_conjecture,
( agent(skc71,skc76,skc79)
| ssSkC0 ),
clause49,
[final] ).
cnf(c_0_197,negated_conjecture,
( ssSkP1(skc82,skc81,skc71)
| ssSkC0 ),
clause48,
[final] ).
cnf(c_0_198,negated_conjecture,
( ~ ssSkC0
| of(skc24,skc27,skc28) ),
c_0_134,
[final] ).
cnf(c_0_199,negated_conjecture,
( ~ ssSkC0
| of(skc24,skc31,skc30) ),
c_0_135,
[final] ).
cnf(c_0_200,negated_conjecture,
( ~ ssSkC0
| in(skc24,skc29,skc30) ),
c_0_136,
[final] ).
cnf(c_0_201,negated_conjecture,
( ssSkP2(skc81,skc80,skc71)
| ssSkC0 ),
clause47,
[final] ).
cnf(c_0_202,negated_conjecture,
( ~ ssSkC0
| down(skc24,skc29,skc30) ),
c_0_137,
[final] ).
cnf(c_0_203,negated_conjecture,
( ~ ssSkC0
| behind(skc24,skc25,skc30) ),
c_0_138,
[final] ).
cnf(c_0_204,negated_conjecture,
( ~ ssSkC0
| agent(skc24,skc29,skc32) ),
c_0_139,
[final] ).
cnf(c_0_205,negated_conjecture,
( ~ ssSkC0
| ssSkP1(skc35,skc34,skc24) ),
c_0_140,
[final] ).
cnf(c_0_206,negated_conjecture,
( ~ ssSkC0
| ssSkP2(skc34,skc33,skc24) ),
c_0_141,
[final] ).
cnf(c_0_207,negated_conjecture,
( old(skc71,skc79)
| ssSkC0 ),
clause15,
[final] ).
cnf(c_0_208,negated_conjecture,
( dirty(skc71,skc79)
| ssSkC0 ),
clause14,
[final] ).
cnf(c_0_209,negated_conjecture,
( white(skc71,skc79)
| ssSkC0 ),
clause13,
[final] ).
cnf(c_0_210,negated_conjecture,
( chevy(skc71,skc79)
| ssSkC0 ),
clause12,
[final] ).
cnf(c_0_211,negated_conjecture,
( wheel(skc71,skc79)
| ssSkC0 ),
clause11,
[final] ).
cnf(c_0_212,negated_conjecture,
( event(skc71,skc76)
| ssSkC0 ),
clause10,
[final] ).
cnf(c_0_213,negated_conjecture,
( ~ ssSkC0
| state(skc24,skc26) ),
c_0_142,
[final] ).
cnf(c_0_214,negated_conjecture,
( present(skc71,skc76)
| ssSkC0 ),
clause9,
[final] ).
cnf(c_0_215,negated_conjecture,
( ~ ssSkC0
| man(skc24,skc28) ),
c_0_143,
[final] ).
cnf(c_0_216,negated_conjecture,
( ~ ssSkC0
| forename(skc24,skc27) ),
c_0_144,
[final] ).
cnf(c_0_217,negated_conjecture,
( ~ ssSkC0
| jules_forename(skc24,skc27) ),
c_0_145,
[final] ).
cnf(c_0_218,negated_conjecture,
( ~ ssSkC0
| hollywood_placename(skc24,skc31) ),
c_0_146,
[final] ).
cnf(c_0_219,negated_conjecture,
( barrel(skc71,skc76)
| ssSkC0 ),
clause8,
[final] ).
cnf(c_0_220,negated_conjecture,
( frontseat(skc71,skc82)
| ssSkC0 ),
clause7,
[final] ).
cnf(c_0_221,negated_conjecture,
( ~ ssSkC0
| placename(skc24,skc31) ),
c_0_147,
[final] ).
cnf(c_0_222,negated_conjecture,
( ~ ssSkC0
| lonely(skc24,skc30) ),
c_0_148,
[final] ).
cnf(c_0_223,negated_conjecture,
( ~ ssSkC0
| street(skc24,skc30) ),
c_0_149,
[final] ).
cnf(c_0_224,negated_conjecture,
( ~ ssSkC0
| city(skc24,skc30) ),
c_0_150,
[final] ).
cnf(c_0_225,negated_conjecture,
( ssSkP0(skc81,skc71)
| ssSkC0 ),
clause6,
[final] ).
cnf(c_0_226,negated_conjecture,
( ~ ssSkC0
| old(skc24,skc32) ),
c_0_151,
[final] ).
cnf(c_0_227,negated_conjecture,
( ~ ssSkC0
| dirty(skc24,skc32) ),
c_0_152,
[final] ).
cnf(c_0_228,negated_conjecture,
( ~ ssSkC0
| white(skc24,skc32) ),
c_0_153,
[final] ).
cnf(c_0_229,negated_conjecture,
( ~ ssSkC0
| chevy(skc24,skc32) ),
c_0_154,
[final] ).
cnf(c_0_230,negated_conjecture,
( two(skc71,skc81)
| ssSkC0 ),
clause4,
[final] ).
cnf(c_0_231,negated_conjecture,
( group(skc71,skc81)
| ssSkC0 ),
clause5,
[final] ).
cnf(c_0_232,negated_conjecture,
( ~ ssSkC0
| wheel(skc24,skc30) ),
c_0_155,
[final] ).
cnf(c_0_233,negated_conjecture,
( ~ ssSkC0
| event(skc24,skc29) ),
c_0_156,
[final] ).
cnf(c_0_234,negated_conjecture,
( ~ ssSkC0
| present(skc24,skc29) ),
c_0_157,
[final] ).
cnf(c_0_235,negated_conjecture,
( ~ ssSkC0
| barrel(skc24,skc29) ),
c_0_158,
[final] ).
cnf(c_0_236,negated_conjecture,
( group(skc71,skc80)
| ssSkC0 ),
clause3,
[final] ).
cnf(c_0_237,negated_conjecture,
( ~ ssSkC0
| frontseat(skc24,skc35) ),
c_0_159,
[final] ).
cnf(c_0_238,negated_conjecture,
( ~ ssSkC0
| ssSkP0(skc34,skc24) ),
c_0_160,
[final] ).
cnf(c_0_239,negated_conjecture,
( ~ ssSkC0
| two(skc24,skc34) ),
c_0_161,
[final] ).
cnf(c_0_240,negated_conjecture,
( ~ ssSkC0
| group(skc24,skc34) ),
c_0_162,
[final] ).
cnf(c_0_241,negated_conjecture,
( ~ ssSkC0
| group(skc24,skc33) ),
c_0_163,
[final] ).
cnf(c_0_242,negated_conjecture,
actual_world(skc24),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NLP192-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/15.47 % Computer : n006.cluster.edu
% 0.18/15.47 % Model : x86_64 x86_64
% 0.18/15.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/15.47 % Memory : 8046.5625MB
% 0.18/15.47 % OS : Linux 6.8.0-71-generic
% 0.18/15.47 % CPULimit : 300
% 0.18/15.47 % WCLimit : 300
% 0.18/15.47 % DateTime : Mon Sep 21 01:47:13 UTC 2026
% 0.18/15.47 % CPUTime :
% 0.18/15.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/15.52 Running first-order theorem proving
% 0.23/15.52 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.23/15.55 % Version: 3.5.1
% 0.23/15.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/15.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/15.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/15.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/15.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/15.55 % Starting sh5l with 300s (1) cores
% 0.23/15.55 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1756955 completed with status 1
% 0.23/15.55 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/15.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/15.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/15.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/15.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/15.55 % No SInE strategy applied
% 0.23/15.55 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.23/15.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/15.55 % Starting SubtermCWHack with 136s (1) cores
% 0.23/15.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/15.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.23/15.55 % Starting new_bool_3 with 136s (1) cores
% 0.23/15.55 % Starting new_bool_1 with 136s (1) cores
% 0.23/15.55 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1756962 completed with status 1
% 0.23/15.55 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.23/15.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/15.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/15.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/15.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/15.55 % No SInE strategy applied
% 0.23/15.55 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.23/15.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/15.55 % Starting SubtermCWHack with 136s (1) cores
% 0.23/15.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/15.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.23/15.55 % Preprocessing time : 0.001 s
% 0.23/15.55 % Presaturation interreduction done
% 0.23/15.55
% 0.23/15.55 % No proof found!
% 0.23/15.55 % SZS status Satisfiable
% 0.23/15.55 % SZS output start Saturation
% See solution above
% 0.23/15.55 % Parsed axioms : 92
% 0.23/15.55 % Removed by relevancy pruning/SinE : 0
% 0.23/15.55 % Initial clauses : 92
% 0.23/15.55 % Removed in clause preprocessing : 0
% 0.23/15.55 % Initial clauses in saturation : 92
% 0.23/15.55 % Processed clauses : 188
% 0.23/15.55 % ...of these trivial : 0
% 0.23/15.55 % ...subsumed : 0
% 0.23/15.55 % ...remaining for further processing : 188
% 0.23/15.55 % Other redundant clauses eliminated : 0
% 0.23/15.55 % Clauses deleted for lack of memory : 0
% 0.23/15.55 % Backward-subsumed : 1
% 0.23/15.55 % Backward-rewritten : 0
% 0.23/15.55 % Generated clauses : 4
% 0.23/15.55 % ...of the previous two non-redundant : 4
% 0.23/15.55 % ...aggressively subsumed : 0
% 0.23/15.55 % Contextual simplify-reflections : 8
% 0.23/15.55 % Paramodulations : 4
% 0.23/15.55 % Factorizations : 0
% 0.23/15.55 % NegExts : 0
% 0.23/15.55 % Equation resolutions : 0
% 0.23/15.55 % Disequality decompositions : 0
% 0.23/15.55 % Total rewrite steps : 1
% 0.23/15.55 % ...of those cached : 0
% 0.23/15.55 % Propositional unsat checks : 0
% 0.23/15.55 % Propositional check models : 0
% 0.23/15.55 % Propositional check unsatisfiable : 0
% 0.23/15.55 % Propositional clauses : 0
% 0.23/15.55 % Propositional clauses after purity: 0
% 0.23/15.55 % Propositional unsat core size : 0
% 0.23/15.55 % Propositional preprocessing time : 0.000
% 0.23/15.55 % Propositional encoding time : 0.000
% 0.23/15.55 % Propositional solver time : 0.000
% 0.23/15.55 % Success case prop preproc time : 0.000
% 0.23/15.55 % Success case prop encoding time : 0.000
% 0.23/15.55 % Success case prop solver time : 0.000
% 0.23/15.55 % Current number of processed clauses : 95
% 0.23/15.55 % Positive orientable unit clauses : 2
% 0.23/15.55 % Positive unorientable unit clauses: 0
% 0.23/15.55 % Negative unit clauses : 0
% 0.23/15.55 % Non-unit-clauses : 93
% 0.23/15.55 % Current number of unprocessed clauses: 0
% 0.23/15.55 % ...number of literals in the above : 0
% 0.23/15.55 % Current number of archived formulas : 0
% 0.23/15.55 % Current number of archived clauses : 93
% 0.23/15.55 % Clause-clause subsumption calls (NU) : 6936
% 0.23/15.55 % Rec. Clause-clause subsumption calls : 1599
% 0.23/15.55 % Non-unit clause-clause subsumptions : 9
% 0.23/15.55 % Unit Clause-clause subsumption calls : 0
% 0.23/15.55 % Rewrite failures with RHS unbound : 0
% 0.23/15.55 % BW rewrite match attempts : 0
% 0.23/15.55 % BW rewrite match successes : 0
% 0.23/15.55 % Condensation attempts : 0
% 0.23/15.55 % Condensation successes : 0
% 0.23/15.55 % Termbank termtop insertions : 6171
% 0.23/15.55 % Search garbage collected termcells : 407
% 0.23/15.55
% 0.23/15.55 % -------------------------------------------------
% 0.23/15.55 % User time : 0.012 s
% 0.23/15.55 % System time : 0.004 s
% 0.23/15.55 % Total time : 0.015 s
% 0.23/15.55 % Maximum resident set size: 3752 pages
% 0.23/15.55
% 0.23/15.55 % -------------------------------------------------
% 0.23/15.55 % User time : 0.051 s
% 0.23/15.55 % System time : 0.018 s
% 0.23/15.55 % Total time : 0.069 s
% 0.23/15.55 % Maximum resident set size: 4864 pages
% 0.23/15.55 % E exiting
%------------------------------------------------------------------------------