%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP165-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:23 PM UTC 2026
% Result : Satisfiable 0.13s 0.44s
% Output : Saturation 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_78ERROR: Could not build tree for root c_0_142ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_79,negated_conjecture,
( ~ actual_world(X2)
| ~ group(X2,X9)
| ~ ssSkP2(X9,X8,X2)
| ~ group(X2,X8)
| ~ frontseat(X2,X7)
| ~ street(X2,X7)
| ~ lonely(X2,X7)
| ~ down(X2,X4,X7)
| ~ ssSkP1(X7,X1,X2)
| ~ in(X2,X4,X6)
| ~ city(X2,X6)
| ~ of(X2,X5,X6)
| ~ hollywood_placename(X2,X5)
| ~ placename(X2,X5)
| ~ barrel(X2,X4)
| ~ present(X2,X4)
| ~ event(X2,X4)
| ~ agent(X2,X4,X3)
| ~ old(X2,X3)
| ~ dirty(X2,X3)
| ~ white(X2,X3)
| ~ chevy(X2,X3)
| ~ two(X2,X1)
| ~ group(X2,X1)
| ~ ssSkP0(X1,X2)
| member(X2,skf23(X2,X8),X8)
| ssSkC0 ),
c_0_78,
[final] ).
cnf(c_0_80,negated_conjecture,
( member(X3,skf19(X1,X3,X2),X2)
| ssSkP2(X1,X2,X3) ),
clause60,
[final] ).
cnf(c_0_81,negated_conjecture,
( member(X3,skf21(X1,X3,X4),X1)
| ssSkP2(X1,X2,X3) ),
clause59,
[final] ).
cnf(c_0_82,negated_conjecture,
( ssSkP2(skc65,skc64,skc63)
| ssSkC0 ),
clause44,
[final] ).
cnf(c_0_83,negated_conjecture,
actual_world(skc63),
clause1,
[final] ).
cnf(c_0_84,negated_conjecture,
( group(skc63,skc64)
| ssSkC0 ),
clause20,
[final] ).
cnf(c_0_85,negated_conjecture,
( group(skc63,skc65)
| ssSkC0 ),
clause19,
[final] ).
cnf(c_0_86,negated_conjecture,
( ~ actual_world(X1)
| ~ frontseat(X1,X5)
| ~ two(X1,X9)
| ~ group(X1,X9)
| ~ group(X1,X3)
| ~ group(X1,X2)
| ~ ssSkP0(X9,X1)
| ~ old(X1,X8)
| ~ dirty(X1,X8)
| ~ white(X1,X8)
| ~ chevy(X1,X8)
| ~ barrel(X1,X4)
| ~ present(X1,X4)
| ~ event(X1,X4)
| ~ hollywood_placename(X1,X6)
| ~ placename(X1,X6)
| ~ city(X1,X7)
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ ssSkP1(X5,X9,X1)
| ~ agent(X1,X4,X8)
| ~ in(X1,X4,X7)
| ~ of(X1,X6,X7)
| ~ down(X1,X4,X5)
| ssSkC0
| member(X1,skf23(X1,X3),X3)
| member(X1,skf19(X2,X1,X3),X3) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]),
[final] ).
cnf(c_0_87,negated_conjecture,
( down(skc63,skc66,skc67)
| ssSkC0 ),
clause43,
[final] ).
cnf(c_0_88,negated_conjecture,
( barrel(skc63,skc66)
| ssSkC0 ),
clause11,
[final] ).
cnf(c_0_89,negated_conjecture,
( present(skc63,skc66)
| ssSkC0 ),
clause12,
[final] ).
cnf(c_0_90,negated_conjecture,
( event(skc63,skc66)
| ssSkC0 ),
clause13,
[final] ).
cnf(c_0_91,negated_conjecture,
( street(skc63,skc67)
| ssSkC0 ),
clause17,
[final] ).
cnf(c_0_92,negated_conjecture,
( lonely(skc63,skc67)
| ssSkC0 ),
clause18,
[final] ).
cnf(c_0_93,negated_conjecture,
( ~ actual_world(X1)
| ~ frontseat(X1,X6)
| ~ two(X1,X10)
| ~ group(X1,X10)
| ~ group(X1,X4)
| ~ group(X1,X2)
| ~ ssSkP0(X10,X1)
| ~ old(X1,X9)
| ~ dirty(X1,X9)
| ~ white(X1,X9)
| ~ chevy(X1,X9)
| ~ barrel(X1,X5)
| ~ present(X1,X5)
| ~ event(X1,X5)
| ~ hollywood_placename(X1,X7)
| ~ placename(X1,X7)
| ~ city(X1,X8)
| ~ street(X1,X6)
| ~ lonely(X1,X6)
| ~ ssSkP1(X6,X10,X1)
| ~ agent(X1,X5,X9)
| ~ in(X1,X5,X8)
| ~ of(X1,X7,X8)
| ~ down(X1,X5,X6)
| ssSkC0
| member(X1,skf23(X1,X4),X4)
| member(X1,skf21(X2,X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_79,c_0_81]),
[final] ).
cnf(c_0_94,negated_conjecture,
( ~ frontseat(skc63,X2)
| ~ two(skc63,X6)
| ~ group(skc63,X6)
| ~ ssSkP0(X6,skc63)
| ~ old(skc63,X5)
| ~ dirty(skc63,X5)
| ~ white(skc63,X5)
| ~ chevy(skc63,X5)
| ~ barrel(skc63,X1)
| ~ present(skc63,X1)
| ~ event(skc63,X1)
| ~ hollywood_placename(skc63,X3)
| ~ placename(skc63,X3)
| ~ city(skc63,X4)
| ~ street(skc63,X2)
| ~ lonely(skc63,X2)
| ~ ssSkP1(X2,X6,skc63)
| ~ agent(skc63,X1,X5)
| ~ in(skc63,X1,X4)
| ~ of(skc63,X3,X4)
| ~ down(skc63,X1,X2)
| ssSkC0
| member(skc63,skf23(skc63,skc64),skc64) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_82]),c_0_83])]),c_0_84]),c_0_85]),
[final] ).
cnf(c_0_142,negated_conjecture,
( ~ frontseat(skc63,skc67)
| ~ two(skc63,X6)
| ~ group(skc63,X6)
| ~ group(skc63,X2)
| ~ group(skc63,X1)
| ~ ssSkP0(X6,skc63)
| ~ old(skc63,X5)
| ~ dirty(skc63,X5)
| ~ white(skc63,X5)
| ~ chevy(skc63,X5)
| ~ hollywood_placename(skc63,X3)
| ~ placename(skc63,X3)
| ~ city(skc63,X4)
| ~ ssSkP1(skc67,X6,skc63)
| ~ agent(skc63,skc66,X5)
| ~ in(skc63,skc66,X4)
| ~ of(skc63,X3,X4)
| ssSkC0
| member(skc63,skf23(skc63,X2),X2)
| member(skc63,skf19(X1,skc63,X2),X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_83])]),c_0_88]),c_0_89]),c_0_90]),c_0_91]),c_0_92]),
[final] ).
cnf(c_0_143,negated_conjecture,
( ~ frontseat(skc63,skc67)
| ~ two(skc63,X7)
| ~ group(skc63,X7)
| ~ group(skc63,X3)
| ~ group(skc63,X1)
| ~ ssSkP0(X7,skc63)
| ~ old(skc63,X6)
| ~ dirty(skc63,X6)
| ~ white(skc63,X6)
| ~ chevy(skc63,X6)
| ~ hollywood_placename(skc63,X4)
| ~ placename(skc63,X4)
| ~ city(skc63,X5)
| ~ ssSkP1(skc67,X7,skc63)
| ~ agent(skc63,skc66,X6)
| ~ in(skc63,skc66,X5)
| ~ of(skc63,X4,X5)
| ssSkC0
| member(skc63,skf23(skc63,X3),X3)
| member(skc63,skf21(X1,skc63,X2),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_87]),c_0_83])]),c_0_88]),c_0_89]),c_0_90]),c_0_91]),c_0_92]),
[final] ).
cnf(c_0_144,negated_conjecture,
( ~ frontseat(skc63,skc67)
| ~ two(skc63,X5)
| ~ group(skc63,X5)
| ~ ssSkP0(X5,skc63)
| ~ old(skc63,X4)
| ~ dirty(skc63,X4)
| ~ white(skc63,X4)
| ~ chevy(skc63,X4)
| ~ barrel(skc63,X1)
| ~ present(skc63,X1)
| ~ event(skc63,X1)
| ~ hollywood_placename(skc63,X2)
| ~ placename(skc63,X2)
| ~ city(skc63,X3)
| ~ ssSkP1(skc67,X5,skc63)
| ~ agent(skc63,X1,X4)
| ~ in(skc63,X1,X3)
| ~ of(skc63,X2,X3)
| ~ down(skc63,X1,skc67)
| ssSkC0
| member(skc63,skf23(skc63,skc64),skc64) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_92]),c_0_91]),
[final] ).
cnf(c_0_145,negated_conjecture,
( ~ actual_world(X2)
| ~ group(X2,X10)
| ~ ssSkP2(X10,X8,X2)
| ~ coat(X2,skf23(X2,X9))
| ~ black(X2,skf23(X2,X9))
| ~ cheap(X2,skf23(X2,X9))
| ~ group(X2,X8)
| ~ frontseat(X2,X7)
| ~ street(X2,X7)
| ~ lonely(X2,X7)
| ~ down(X2,X4,X7)
| ~ ssSkP1(X7,X1,X2)
| ~ in(X2,X4,X6)
| ~ city(X2,X6)
| ~ of(X2,X5,X6)
| ~ hollywood_placename(X2,X5)
| ~ placename(X2,X5)
| ~ barrel(X2,X4)
| ~ present(X2,X4)
| ~ event(X2,X4)
| ~ agent(X2,X4,X3)
| ~ old(X2,X3)
| ~ dirty(X2,X3)
| ~ white(X2,X3)
| ~ chevy(X2,X3)
| ~ two(X2,X1)
| ~ group(X2,X1)
| ~ ssSkP0(X1,X2)
| ssSkC0 ),
c_0_95,
[final] ).
cnf(c_0_146,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ group(X1,X10)
| ~ coat(X1,skf10(X1,X11))
| ~ black(X1,skf10(X1,X11))
| ~ cheap(X1,skf10(X1,X11))
| ~ group(X1,X9)
| ~ ssSkP2(X9,X10,X1)
| ~ down(X1,X4,X8)
| ~ lonely(X1,X8)
| ~ street(X1,X8)
| ~ of(X1,X6,X7)
| ~ city(X1,X7)
| ~ in(X1,X4,X7)
| ~ placename(X1,X6)
| ~ hollywood_placename(X1,X6)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ barrel(X1,X4)
| ~ chevy(X1,X5)
| ~ white(X1,X5)
| ~ dirty(X1,X5)
| ~ old(X1,X5)
| ~ agent(X1,X4,X5)
| ~ ssSkP0(X3,X1)
| ~ group(X1,X3)
| ~ two(X1,X3)
| ~ ssSkP1(X2,X3,X1)
| ~ frontseat(X1,X2) ),
c_0_96,
[final] ).
cnf(c_0_147,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ group(X1,X10)
| ~ group(X1,X9)
| ~ ssSkP2(X9,X10,X1)
| ~ down(X1,X4,X8)
| ~ lonely(X1,X8)
| ~ street(X1,X8)
| ~ of(X1,X6,X7)
| ~ city(X1,X7)
| ~ in(X1,X4,X7)
| ~ placename(X1,X6)
| ~ hollywood_placename(X1,X6)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ barrel(X1,X4)
| ~ chevy(X1,X5)
| ~ white(X1,X5)
| ~ dirty(X1,X5)
| ~ old(X1,X5)
| ~ agent(X1,X4,X5)
| ~ ssSkP0(X3,X1)
| ~ group(X1,X3)
| ~ two(X1,X3)
| ~ ssSkP1(X2,X3,X1)
| ~ frontseat(X1,X2)
| member(X1,skf10(X1,X10),X10) ),
c_0_97,
[final] ).
cnf(c_0_148,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| be(X1,skf13(X1,X5,X2),X2,skf12(X2,X1,X5)) ),
c_0_98,
[final] ).
cnf(c_0_149,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_99,
[final] ).
cnf(c_0_150,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| patient(X1,skf17(X1,X2,X4),X4) ),
c_0_100,
[final] ).
cnf(c_0_151,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| agent(X1,skf17(X1,X2,X6),X2) ),
c_0_101,
[final] ).
cnf(c_0_152,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| nonreflexive(X1,skf17(X1,X6,X7)) ),
c_0_102,
[final] ).
cnf(c_0_153,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| wear(X1,skf17(X1,X6,X7)) ),
c_0_103,
[final] ).
cnf(c_0_154,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| event(X1,skf17(X1,X6,X7)) ),
c_0_104,
[final] ).
cnf(c_0_155,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| present(X1,skf17(X1,X6,X7)) ),
c_0_105,
[final] ).
cnf(c_0_156,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| in(X1,skf12(X2,X1,X4),X4) ),
c_0_106,
[final] ).
cnf(c_0_157,negated_conjecture,
( ~ state(X1,X4)
| ~ be(X1,X4,skf16(X3,X1,X5),X2)
| ~ in(X1,X2,X3)
| ssSkP1(X3,X6,X1) ),
c_0_107,
[final] ).
cnf(c_0_158,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| state(X1,skf13(X1,X5,X6)) ),
c_0_108,
[final] ).
cnf(c_0_159,negated_conjecture,
( member(X3,skf16(X1,X3,X2),X2)
| ssSkP1(X1,X2,X3) ),
clause58,
[final] ).
cnf(c_0_160,negated_conjecture,
( ~ fellow(X1,skf11(X1,X2))
| ~ young(X1,skf11(X1,X2))
| ssSkP0(X3,X1) ),
c_0_109,
[final] ).
cnf(c_0_161,negated_conjecture,
( member(X2,skf11(X2,X1),X1)
| ssSkP0(X1,X2) ),
clause51,
[final] ).
cnf(c_0_162,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ member(X1,X2,X3)
| young(X1,X2) ),
c_0_110,
[final] ).
cnf(c_0_163,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ member(X1,X2,X3)
| fellow(X1,X2) ),
c_0_111,
[final] ).
cnf(c_0_164,negated_conjecture,
( ~ member(skc63,X1,skc64)
| cheap(skc63,X1)
| ssSkC0 ),
c_0_112,
[final] ).
cnf(c_0_165,negated_conjecture,
( ~ member(skc63,X1,skc64)
| black(skc63,X1)
| ssSkC0 ),
c_0_113,
[final] ).
cnf(c_0_166,negated_conjecture,
( ~ member(skc63,X1,skc64)
| coat(skc63,X1)
| ssSkC0 ),
c_0_114,
[final] ).
cnf(c_0_167,negated_conjecture,
( ~ ssSkC0
| ~ member(skc19,X1,skc20)
| cheap(skc19,X1) ),
c_0_115,
[final] ).
cnf(c_0_168,negated_conjecture,
( ~ ssSkC0
| ~ member(skc19,X1,skc20)
| black(skc19,X1) ),
c_0_116,
[final] ).
cnf(c_0_169,negated_conjecture,
( ~ ssSkC0
| ~ member(skc19,X1,skc20)
| coat(skc19,X1) ),
c_0_117,
[final] ).
cnf(c_0_170,negated_conjecture,
( of(skc63,skc68,skc69)
| ssSkC0 ),
clause42,
[final] ).
cnf(c_0_171,negated_conjecture,
( in(skc63,skc66,skc69)
| ssSkC0 ),
clause41,
[final] ).
cnf(c_0_172,negated_conjecture,
( ~ ssSkC0
| ssSkP2(skc21,skc20,skc19) ),
c_0_118,
[final] ).
cnf(c_0_173,negated_conjecture,
( ~ ssSkC0
| down(skc19,skc23,skc24) ),
c_0_119,
[final] ).
cnf(c_0_174,negated_conjecture,
( agent(skc63,skc66,skc70)
| ssSkC0 ),
clause40,
[final] ).
cnf(c_0_175,negated_conjecture,
( ~ ssSkC0
| of(skc19,skc25,skc26) ),
c_0_120,
[final] ).
cnf(c_0_176,negated_conjecture,
( ~ ssSkC0
| in(skc19,skc23,skc26) ),
c_0_121,
[final] ).
cnf(c_0_177,negated_conjecture,
( ~ ssSkC0
| agent(skc19,skc23,skc27) ),
c_0_122,
[final] ).
cnf(c_0_178,negated_conjecture,
( ~ ssSkC0
| ssSkP1(skc24,skc22,skc19) ),
c_0_123,
[final] ).
cnf(c_0_179,negated_conjecture,
( ssSkP1(skc72,skc71,skc63)
| ssSkC0 ),
clause39,
[final] ).
cnf(c_0_180,negated_conjecture,
( city(skc63,skc69)
| ssSkC0 ),
clause16,
[final] ).
cnf(c_0_181,negated_conjecture,
( placename(skc63,skc68)
| ssSkC0 ),
clause15,
[final] ).
cnf(c_0_182,negated_conjecture,
( hollywood_placename(skc63,skc68)
| ssSkC0 ),
clause14,
[final] ).
cnf(c_0_183,negated_conjecture,
( chevy(skc63,skc70)
| ssSkC0 ),
clause10,
[final] ).
cnf(c_0_184,negated_conjecture,
( white(skc63,skc70)
| ssSkC0 ),
clause9,
[final] ).
cnf(c_0_185,negated_conjecture,
( dirty(skc63,skc70)
| ssSkC0 ),
clause8,
[final] ).
cnf(c_0_186,negated_conjecture,
( old(skc63,skc70)
| ssSkC0 ),
clause7,
[final] ).
cnf(c_0_187,negated_conjecture,
( ssSkP0(skc71,skc63)
| ssSkC0 ),
clause6,
[final] ).
cnf(c_0_188,negated_conjecture,
( ~ ssSkC0
| lonely(skc19,skc24) ),
c_0_124,
[final] ).
cnf(c_0_189,negated_conjecture,
( ~ ssSkC0
| street(skc19,skc24) ),
c_0_125,
[final] ).
cnf(c_0_190,negated_conjecture,
( ~ ssSkC0
| city(skc19,skc26) ),
c_0_126,
[final] ).
cnf(c_0_191,negated_conjecture,
( ~ ssSkC0
| placename(skc19,skc25) ),
c_0_127,
[final] ).
cnf(c_0_192,negated_conjecture,
( ~ ssSkC0
| hollywood_placename(skc19,skc25) ),
c_0_128,
[final] ).
cnf(c_0_193,negated_conjecture,
( ~ ssSkC0
| event(skc19,skc23) ),
c_0_129,
[final] ).
cnf(c_0_194,negated_conjecture,
( ~ ssSkC0
| present(skc19,skc23) ),
c_0_130,
[final] ).
cnf(c_0_195,negated_conjecture,
( group(skc63,skc71)
| ssSkC0 ),
clause5,
[final] ).
cnf(c_0_196,negated_conjecture,
( ~ ssSkC0
| barrel(skc19,skc23) ),
c_0_131,
[final] ).
cnf(c_0_197,negated_conjecture,
( ~ ssSkC0
| chevy(skc19,skc27) ),
c_0_132,
[final] ).
cnf(c_0_198,negated_conjecture,
( ~ ssSkC0
| white(skc19,skc27) ),
c_0_133,
[final] ).
cnf(c_0_199,negated_conjecture,
( ~ ssSkC0
| dirty(skc19,skc27) ),
c_0_134,
[final] ).
cnf(c_0_200,negated_conjecture,
( two(skc63,skc71)
| ssSkC0 ),
clause4,
[final] ).
cnf(c_0_201,negated_conjecture,
( ~ ssSkC0
| old(skc19,skc27) ),
c_0_135,
[final] ).
cnf(c_0_202,negated_conjecture,
( ~ ssSkC0
| ssSkP0(skc22,skc19) ),
c_0_136,
[final] ).
cnf(c_0_203,negated_conjecture,
( ~ ssSkC0
| group(skc19,skc21) ),
c_0_137,
[final] ).
cnf(c_0_204,negated_conjecture,
( ~ ssSkC0
| group(skc19,skc20) ),
c_0_138,
[final] ).
cnf(c_0_205,negated_conjecture,
( frontseat(skc63,skc72)
| ssSkC0 ),
clause3,
[final] ).
cnf(c_0_206,negated_conjecture,
( ~ ssSkC0
| group(skc19,skc22) ),
c_0_139,
[final] ).
cnf(c_0_207,negated_conjecture,
( ~ ssSkC0
| two(skc19,skc22) ),
c_0_140,
[final] ).
cnf(c_0_208,negated_conjecture,
( ~ ssSkC0
| frontseat(skc19,skc24) ),
c_0_141,
[final] ).
cnf(c_0_209,negated_conjecture,
actual_world(skc19),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP165-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n001.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:50:13 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1949416 completed with status 1
% 0.13/0.44 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.13/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1949424 completed with status 1
% 0.13/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.13/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.13/0.44 % Preprocessing time : 0.001 s
% 0.13/0.44 % Presaturation interreduction done
% 0.13/0.44
% 0.13/0.44 % No proof found!
% 0.13/0.44 % SZS status Satisfiable
% 0.13/0.44 % SZS output start Saturation
% See solution above
% 0.13/0.44 % Parsed axioms : 78
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 78
% 0.13/0.44 % Removed in clause preprocessing : 0
% 0.13/0.44 % Initial clauses in saturation : 78
% 0.13/0.44 % Processed clauses : 162
% 0.13/0.44 % ...of these trivial : 0
% 0.13/0.44 % ...subsumed : 0
% 0.13/0.44 % ...remaining for further processing : 162
% 0.13/0.44 % Other redundant clauses eliminated : 0
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 0
% 0.13/0.44 % Backward-rewritten : 0
% 0.13/0.44 % Generated clauses : 6
% 0.13/0.44 % ...of the previous two non-redundant : 6
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 13
% 0.13/0.44 % Paramodulations : 6
% 0.13/0.44 % Factorizations : 0
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 0
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 3
% 0.13/0.44 % ...of those cached : 2
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 84
% 0.13/0.44 % Positive orientable unit clauses : 2
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 0
% 0.13/0.44 % Non-unit-clauses : 82
% 0.13/0.44 % Current number of unprocessed clauses: 0
% 0.13/0.44 % ...number of literals in the above : 0
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 78
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 5367
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 1242
% 0.13/0.44 % Non-unit clause-clause subsumptions : 13
% 0.13/0.44 % Unit Clause-clause subsumption calls : 0
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 0
% 0.13/0.44 % BW rewrite match successes : 0
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 5538
% 0.13/0.44 % Search garbage collected termcells : 327
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.010 s
% 0.13/0.44 % System time : 0.005 s
% 0.13/0.44 % Total time : 0.015 s
% 0.13/0.44 % Maximum resident set size: 3732 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.036 s
% 0.13/0.44 % System time : 0.017 s
% 0.13/0.44 % Total time : 0.053 s
% 0.13/0.44 % Maximum resident set size: 4608 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------