%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP135-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 : n004.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:14 PM UTC 2026
% Result : Satisfiable 0.14s 10.46s
% Output : Saturation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_60ERROR: Could not build tree for root c_0_71ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_71,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ ssSkP1(X6,X1)
| ~ two(X1,X6)
| ~ group(X1,X6)
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ down(X1,X3,X5)
| ~ barrel(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ of(X1,X4,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X3,X2)
| ~ agent(X1,X3,X2)
| ~ old(X1,X2)
| ~ dirty(X1,X2)
| ~ white(X1,X2)
| ~ chevy(X1,X2)
| ~ city(X1,X2)
| member(X1,skf9(X1,X6),X6) ),
c_0_60,
[final] ).
cnf(c_0_72,negated_conjecture,
( ~ ssSkC0
| down(skc12,skc14,skc15) ),
c_0_61,
[final] ).
cnf(c_0_73,negated_conjecture,
actual_world(skc12),
clause2,
[final] ).
cnf(c_0_74,negated_conjecture,
( ~ ssSkC0
| event(skc12,skc14) ),
c_0_62,
[final] ).
cnf(c_0_75,negated_conjecture,
( ~ ssSkC0
| present(skc12,skc14) ),
c_0_63,
[final] ).
cnf(c_0_76,negated_conjecture,
( ~ ssSkC0
| barrel(skc12,skc14) ),
c_0_64,
[final] ).
cnf(c_0_77,negated_conjecture,
( ~ ssSkC0
| lonely(skc12,skc15) ),
c_0_65,
[final] ).
cnf(c_0_78,negated_conjecture,
( ~ ssSkC0
| street(skc12,skc15) ),
c_0_66,
[final] ).
cnf(c_0_92,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP0(X6,X1)
| ~ two(X1,X6)
| ~ group(X1,X6)
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ down(X1,X3,X5)
| ~ barrel(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ of(X1,X4,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X3,X2)
| ~ agent(X1,X3,X2)
| ~ old(X1,X2)
| ~ dirty(X1,X2)
| ~ white(X1,X2)
| ~ chevy(X1,X2)
| ~ city(X1,X2)
| member(X1,skf21(X1,X6),X6)
| ssSkC0 ),
c_0_67,
[final] ).
cnf(c_0_93,negated_conjecture,
( down(skc42,skc44,skc45)
| ssSkC0 ),
clause36,
[final] ).
cnf(c_0_94,negated_conjecture,
actual_world(skc42),
clause1,
[final] ).
cnf(c_0_95,negated_conjecture,
( event(skc42,skc44)
| ssSkC0 ),
clause10,
[final] ).
cnf(c_0_96,negated_conjecture,
( present(skc42,skc44)
| ssSkC0 ),
clause11,
[final] ).
cnf(c_0_97,negated_conjecture,
( barrel(skc42,skc44)
| ssSkC0 ),
clause12,
[final] ).
cnf(c_0_98,negated_conjecture,
( lonely(skc42,skc45)
| ssSkC0 ),
clause13,
[final] ).
cnf(c_0_99,negated_conjecture,
( street(skc42,skc45)
| ssSkC0 ),
clause14,
[final] ).
cnf(c_0_100,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ ssSkP1(X7,X1)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ fellow(X1,skf9(X1,X6))
| ~ young(X1,skf9(X1,X6))
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ down(X1,X3,X5)
| ~ barrel(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ of(X1,X4,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X3,X2)
| ~ agent(X1,X3,X2)
| ~ old(X1,X2)
| ~ dirty(X1,X2)
| ~ white(X1,X2)
| ~ chevy(X1,X2)
| ~ city(X1,X2) ),
c_0_68,
[final] ).
cnf(c_0_101,negated_conjecture,
( ~ ssSkC0
| ~ member(skc12,X1,skc13)
| young(skc12,X1) ),
c_0_69,
[final] ).
cnf(c_0_102,negated_conjecture,
( ~ ssSkC0
| ~ member(skc12,X1,skc13)
| fellow(skc12,X1) ),
c_0_70,
[final] ).
cnf(c_0_104,negated_conjecture,
( ~ ssSkC0
| of(skc12,skc17,skc16) ),
c_0_79,
[final] ).
cnf(c_0_105,negated_conjecture,
( ~ ssSkC0
| city(skc12,skc16) ),
c_0_80,
[final] ).
cnf(c_0_106,negated_conjecture,
( ~ ssSkC0
| chevy(skc12,skc16) ),
c_0_81,
[final] ).
cnf(c_0_107,negated_conjecture,
( ~ ssSkC0
| white(skc12,skc16) ),
c_0_82,
[final] ).
cnf(c_0_108,negated_conjecture,
( ~ ssSkC0
| dirty(skc12,skc16) ),
c_0_83,
[final] ).
cnf(c_0_109,negated_conjecture,
( ~ ssSkC0
| old(skc12,skc16) ),
c_0_84,
[final] ).
cnf(c_0_110,negated_conjecture,
( ~ ssSkC0
| placename(skc12,skc17) ),
c_0_85,
[final] ).
cnf(c_0_111,negated_conjecture,
( ~ ssSkC0
| hollywood_placename(skc12,skc17) ),
c_0_86,
[final] ).
cnf(c_0_112,negated_conjecture,
( ~ ssSkC0
| agent(skc12,skc14,skc16) ),
c_0_87,
[final] ).
cnf(c_0_113,negated_conjecture,
( ~ ssSkC0
| in(skc12,skc14,skc16) ),
c_0_88,
[final] ).
cnf(c_0_116,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP0(X7,X1)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ fellow(X1,skf21(X1,X6))
| ~ young(X1,skf21(X1,X6))
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ down(X1,X3,X5)
| ~ barrel(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ of(X1,X4,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X3,X2)
| ~ agent(X1,X3,X2)
| ~ old(X1,X2)
| ~ dirty(X1,X2)
| ~ white(X1,X2)
| ~ chevy(X1,X2)
| ~ city(X1,X2)
| ssSkC0 ),
c_0_89,
[final] ).
cnf(c_0_117,negated_conjecture,
( ~ member(skc42,X1,skc43)
| young(skc42,X1)
| ssSkC0 ),
c_0_90,
[final] ).
cnf(c_0_118,negated_conjecture,
( ~ member(skc42,X1,skc43)
| fellow(skc42,X1)
| ssSkC0 ),
c_0_91,
[final] ).
cnf(c_0_120,negated_conjecture,
( of(skc42,skc47,skc46)
| ssSkC0 ),
clause35,
[final] ).
cnf(c_0_121,negated_conjecture,
( city(skc42,skc46)
| ssSkC0 ),
clause3,
[final] ).
cnf(c_0_122,negated_conjecture,
( chevy(skc42,skc46)
| ssSkC0 ),
clause4,
[final] ).
cnf(c_0_123,negated_conjecture,
( white(skc42,skc46)
| ssSkC0 ),
clause5,
[final] ).
cnf(c_0_124,negated_conjecture,
( dirty(skc42,skc46)
| ssSkC0 ),
clause6,
[final] ).
cnf(c_0_125,negated_conjecture,
( old(skc42,skc46)
| ssSkC0 ),
clause7,
[final] ).
cnf(c_0_126,negated_conjecture,
( placename(skc42,skc47)
| ssSkC0 ),
clause8,
[final] ).
cnf(c_0_127,negated_conjecture,
( hollywood_placename(skc42,skc47)
| ssSkC0 ),
clause9,
[final] ).
cnf(c_0_128,negated_conjecture,
( agent(skc42,skc44,skc46)
| ssSkC0 ),
clause33,
[final] ).
cnf(c_0_129,negated_conjecture,
( in(skc42,skc44,skc46)
| ssSkC0 ),
clause34,
[final] ).
cnf(c_0_130,negated_conjecture,
( ~ ssSkC0
| ~ city(skc12,X5)
| ~ chevy(skc12,X5)
| ~ white(skc12,X5)
| ~ dirty(skc12,X5)
| ~ old(skc12,X5)
| ~ placename(skc12,X4)
| ~ hollywood_placename(skc12,X4)
| ~ event(skc12,X2)
| ~ present(skc12,X2)
| ~ barrel(skc12,X2)
| ~ lonely(skc12,X3)
| ~ street(skc12,X3)
| ~ group(skc12,X6)
| ~ two(skc12,X6)
| ~ ssSkP1(X6,skc12)
| ~ agent(skc12,X2,X5)
| ~ in(skc12,X2,X5)
| ~ of(skc12,X4,X5)
| ~ down(skc12,X2,X3)
| ~ member(skc12,skf9(skc12,X1),skc13) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_73])]),c_0_102]),
[final] ).
cnf(c_0_131,negated_conjecture,
( ~ ssSkC0
| ~ group(skc12,X1)
| ~ two(skc12,X1)
| ~ ssSkP1(X1,skc12)
| member(skc12,skf9(skc12,X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]),c_0_106]),c_0_107]),c_0_108]),c_0_109]),c_0_110]),c_0_111]),c_0_112]),c_0_113]),
[final] ).
cnf(c_0_132,negated_conjecture,
( ~ ssSkC0
| group(skc12,skc13) ),
c_0_114,
[final] ).
cnf(c_0_133,negated_conjecture,
( ~ ssSkC0
| two(skc12,skc13) ),
c_0_115,
[final] ).
cnf(c_0_134,negated_conjecture,
( ~ city(skc42,X5)
| ~ chevy(skc42,X5)
| ~ white(skc42,X5)
| ~ dirty(skc42,X5)
| ~ old(skc42,X5)
| ~ placename(skc42,X4)
| ~ hollywood_placename(skc42,X4)
| ~ event(skc42,X2)
| ~ present(skc42,X2)
| ~ barrel(skc42,X2)
| ~ lonely(skc42,X3)
| ~ street(skc42,X3)
| ~ group(skc42,X6)
| ~ two(skc42,X6)
| ~ ssSkP0(X6,skc42)
| ~ agent(skc42,X2,X5)
| ~ in(skc42,X2,X5)
| ~ of(skc42,X4,X5)
| ~ down(skc42,X2,X3)
| ~ member(skc42,skf21(skc42,X1),skc43)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_94])]),c_0_118]),
[final] ).
cnf(c_0_135,negated_conjecture,
( ~ group(skc42,X1)
| ~ two(skc42,X1)
| ~ ssSkP0(X1,skc42)
| ssSkC0
| member(skc42,skf21(skc42,X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_121]),c_0_122]),c_0_123]),c_0_124]),c_0_125]),c_0_126]),c_0_127]),c_0_128]),c_0_129]),
[final] ).
cnf(c_0_136,negated_conjecture,
( group(skc42,skc43)
| ssSkC0 ),
clause15,
[final] ).
cnf(c_0_137,negated_conjecture,
( two(skc42,skc43)
| ssSkC0 ),
clause16,
[final] ).
cnf(c_0_143,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ~ member(X1,X2,X3)
| in(X1,skf15(X1,X4),skf15(X1,X4)) ),
c_0_138,
[final] ).
cnf(c_0_144,negated_conjecture,
( member(X2,skf14(X2,X1),X1)
| ssSkP0(X1,X2) ),
clause42,
[final] ).
cnf(c_0_145,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ~ member(X1,X2,X3)
| state(X1,skf16(X1,X4)) ),
c_0_139,
[final] ).
cnf(c_0_146,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ~ member(X1,X2,X3)
| frontseat(X1,skf15(X1,X4)) ),
c_0_140,
[final] ).
cnf(c_0_153,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ssSkP0(X3,X1)
| in(X1,skf15(X1,X2),skf15(X1,X2)) ),
inference(spm,[status(thm)],[c_0_143,c_0_144]),
[final] ).
cnf(c_0_154,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ssSkP0(X3,X1)
| state(X1,skf16(X1,X2)) ),
inference(spm,[status(thm)],[c_0_145,c_0_144]),
[final] ).
cnf(c_0_155,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ssSkP0(X3,X1)
| frontseat(X1,skf15(X1,X2)) ),
inference(spm,[status(thm)],[c_0_146,c_0_144]),
[final] ).
cnf(c_0_157,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| be(X1,skf11(X1,X2),X2,skf10(X2,X1)) ),
c_0_147,
[final] ).
cnf(c_0_158,negated_conjecture,
( member(X2,skf19(X2,X1),X1)
| ssSkP1(X1,X2) ),
clause43,
[final] ).
cnf(c_0_159,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| state(X1,skf11(X1,X4)) ),
c_0_148,
[final] ).
cnf(c_0_161,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ~ member(X1,X2,X3)
| be(X1,skf16(X1,X2),X2,skf15(X1,X2)) ),
c_0_149,
[final] ).
cnf(c_0_164,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| in(X1,skf10(X2,X1),X2) ),
c_0_152,
[final] ).
cnf(c_0_166,negated_conjecture,
( ssSkP1(skc43,skc42)
| ssSkC0 ),
clause17,
[final] ).
cnf(c_0_169,negated_conjecture,
( ~ state(X1,X3)
| ~ be(X1,X3,skf19(X1,X4),X2)
| ~ in(X1,X2,X2)
| ~ frontseat(X1,X2)
| ssSkP1(X5,X1) ),
c_0_156,
[final] ).
cnf(c_0_170,negated_conjecture,
( ~ ssSkP0(X2,X1)
| ~ frontseat(X1,skf19(X1,X2))
| ssSkP1(X2,X1)
| be(X1,skf11(X1,skf19(X1,X2)),skf19(X1,X2),skf10(skf19(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_157,c_0_158]),
[final] ).
cnf(c_0_171,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,skf19(X1,X3))
| ssSkP1(X3,X1)
| state(X1,skf11(X1,X2)) ),
inference(spm,[status(thm)],[c_0_159,c_0_158]),
[final] ).
cnf(c_0_172,negated_conjecture,
( ~ state(X1,X4)
| ~ be(X1,X4,skf14(X1,X3),X2)
| ~ in(X1,X2,skf14(X1,X3))
| ssSkP0(X5,X1) ),
c_0_160,
[final] ).
cnf(c_0_173,negated_conjecture,
( ~ ssSkP1(X2,X1)
| ssSkP0(X2,X1)
| be(X1,skf16(X1,skf14(X1,X2)),skf14(X1,X2),skf15(X1,skf14(X1,X2))) ),
inference(spm,[status(thm)],[c_0_161,c_0_144]),
[final] ).
cnf(c_0_175,negated_conjecture,
( ~ ssSkC0
| ~ ssSkP1(skc13,skc12) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_133]),c_0_132]),
[final] ).
cnf(c_0_176,negated_conjecture,
( ~ ssSkP0(skc43,skc42)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_137]),c_0_136]),
[final] ).
cnf(c_0_177,negated_conjecture,
( ~ ssSkC0
| ~ group(skc12,X1)
| ~ two(skc12,X1)
| ~ ssSkP1(X1,skc12)
| ~ ssSkP0(X1,skc12)
| ~ frontseat(skc12,skf9(skc12,X1))
| be(skc12,skf11(skc12,skf9(skc12,X1)),skf9(skc12,X1),skf10(skf9(skc12,X1),skc12)) ),
inference(spm,[status(thm)],[c_0_157,c_0_131]),
[final] ).
cnf(c_0_178,negated_conjecture,
( ~ ssSkC0
| ~ group(skc12,X1)
| ~ two(skc12,X1)
| ~ ssSkP1(X1,skc12)
| ~ ssSkP0(X1,skc12)
| ~ frontseat(skc12,skf9(skc12,X1))
| in(skc12,skf10(skf9(skc12,X1),skc12),skf9(skc12,X1)) ),
inference(spm,[status(thm)],[c_0_164,c_0_131]),
[final] ).
cnf(c_0_179,negated_conjecture,
( ~ ssSkC0
| ~ group(skc12,X1)
| ~ two(skc12,X1)
| ~ ssSkP1(X1,skc12)
| be(skc12,skf16(skc12,skf9(skc12,X1)),skf9(skc12,X1),skf15(skc12,skf9(skc12,X1))) ),
inference(spm,[status(thm)],[c_0_161,c_0_131]),
[final] ).
cnf(c_0_180,negated_conjecture,
( ~ ssSkC0
| ~ group(skc12,X2)
| ~ two(skc12,X2)
| ~ ssSkP1(X2,skc12)
| ~ ssSkP0(X2,skc12)
| ~ frontseat(skc12,skf9(skc12,X2))
| state(skc12,skf11(skc12,X1)) ),
inference(spm,[status(thm)],[c_0_159,c_0_131]),
[final] ).
cnf(c_0_181,negated_conjecture,
( ~ ssSkC0
| ~ group(skc12,X2)
| ~ two(skc12,X2)
| ~ ssSkP1(X2,skc12)
| in(skc12,skf15(skc12,X1),skf15(skc12,X1)) ),
inference(spm,[status(thm)],[c_0_143,c_0_131]),
[final] ).
cnf(c_0_182,negated_conjecture,
( ~ ssSkC0
| ~ group(skc12,X2)
| ~ two(skc12,X2)
| ~ ssSkP1(X2,skc12)
| state(skc12,skf16(skc12,X1)) ),
inference(spm,[status(thm)],[c_0_145,c_0_131]),
[final] ).
cnf(c_0_183,negated_conjecture,
( ~ ssSkC0
| ~ group(skc12,X2)
| ~ two(skc12,X2)
| ~ ssSkP1(X2,skc12)
| frontseat(skc12,skf15(skc12,X1)) ),
inference(spm,[status(thm)],[c_0_146,c_0_131]),
[final] ).
cnf(c_0_184,negated_conjecture,
( ~ group(skc42,X1)
| ~ two(skc42,X1)
| ~ ssSkP0(X1,skc42)
| ~ frontseat(skc42,skf21(skc42,X1))
| ssSkC0
| be(skc42,skf11(skc42,skf21(skc42,X1)),skf21(skc42,X1),skf10(skf21(skc42,X1),skc42)) ),
inference(spm,[status(thm)],[c_0_157,c_0_135]),
[final] ).
cnf(c_0_185,negated_conjecture,
( ~ group(skc42,X1)
| ~ two(skc42,X1)
| ~ ssSkP1(X1,skc42)
| ~ ssSkP0(X1,skc42)
| ssSkC0
| be(skc42,skf16(skc42,skf21(skc42,X1)),skf21(skc42,X1),skf15(skc42,skf21(skc42,X1))) ),
inference(spm,[status(thm)],[c_0_161,c_0_135]),
[final] ).
cnf(c_0_186,negated_conjecture,
( ~ group(skc42,X1)
| ~ two(skc42,X1)
| ~ ssSkP0(X1,skc42)
| ~ frontseat(skc42,skf21(skc42,X1))
| ssSkC0
| in(skc42,skf10(skf21(skc42,X1),skc42),skf21(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_164,c_0_135]),
[final] ).
cnf(c_0_187,negated_conjecture,
( ssSkC0
| in(skc42,skf15(skc42,X1),skf15(skc42,X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_137]),c_0_136]),c_0_166]),
[final] ).
cnf(c_0_188,negated_conjecture,
( ~ group(skc42,X2)
| ~ two(skc42,X2)
| ~ ssSkP0(X2,skc42)
| ~ frontseat(skc42,skf21(skc42,X2))
| ssSkC0
| state(skc42,skf11(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_159,c_0_135]),
[final] ).
cnf(c_0_189,negated_conjecture,
( ssSkC0
| state(skc42,skf16(skc42,X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_137]),c_0_136]),c_0_166]),
[final] ).
cnf(c_0_190,negated_conjecture,
( ssSkC0
| frontseat(skc42,skf15(skc42,X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_137]),c_0_136]),c_0_166]),
[final] ).
cnf(c_0_191,negated_conjecture,
( ~ ssSkP0(X1,X2)
| ~ in(X2,skf10(skf19(X2,X1),X2),skf10(skf19(X2,X1),X2))
| ~ frontseat(X2,skf19(X2,X1))
| ~ frontseat(X2,skf10(skf19(X2,X1),X2))
| ssSkP1(X3,X2)
| ssSkP1(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_171]),
[final] ).
cnf(c_0_192,negated_conjecture,
( ~ ssSkP1(X1,X2)
| ~ in(X2,skf15(X2,skf14(X2,X1)),skf14(X2,X1))
| ssSkP0(X3,X2)
| ssSkP0(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_173]),c_0_154]),
[final] ).
cnf(c_0_193,negated_conjecture,
( ~ ssSkP0(X2,X1)
| ~ frontseat(X1,skf19(X1,X2))
| ssSkP1(X2,X1)
| in(X1,skf10(skf19(X1,X2),X1),skf19(X1,X2)) ),
inference(spm,[status(thm)],[c_0_164,c_0_158]),
[final] ).
cnf(c_0_194,negated_conjecture,
( frontseat(X2,skf14(X2,X3))
| ssSkP0(X1,X2) ),
clause41,
[final] ).
cnf(c_0_195,negated_conjecture,
( ~ ssSkC0
| ssSkP0(skc13,skc12) ),
c_0_174,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP135-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/10.38 % Computer : n004.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.38 % CPULimit : 300
% 0.11/10.38 % WCLimit : 300
% 0.11/10.38 % DateTime : Mon Sep 21 01:42:29 UTC 2026
% 0.11/10.38 % CPUTime :
% 0.11/10.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/10.43 Running first-order theorem proving
% 0.14/10.43 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.14/10.46 % Version: 3.5.1
% 0.14/10.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/10.46 % Starting sh5l with 300s (1) cores
% 0.14/10.46 % new_bool_3 with pid 1997434 completed with status 1
% 0.14/10.46 % Result found by new_bool_3
% 0.14/10.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/10.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/10.46 % Search class: FGHNF-FFMM22-SFFFFFNN
% 0.14/10.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/10.46 % Starting SubtermCWHack with 31s (1) cores
% 0.14/10.46 % SubtermCWHack with pid 1997441 completed with status 1
% 0.14/10.46 % Result found by SubtermCWHack
% 0.14/10.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/10.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/10.46 % Search class: FGHNF-FFMM22-SFFFFFNN
% 0.14/10.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/10.46 % Starting SubtermCWHack with 31s (1) cores
% 0.14/10.46 % Preprocessing time : 0.001 s
% 0.14/10.46
% 0.14/10.46 % No proof found!
% 0.14/10.46 % SZS status Satisfiable
% 0.14/10.46 % SZS output start Saturation
% See solution above
% 0.14/10.46 % Parsed axioms : 60
% 0.14/10.46 % Removed by relevancy pruning/SinE : 0
% 0.14/10.46 % Initial clauses : 60
% 0.14/10.46 % Removed in clause preprocessing : 0
% 0.14/10.46 % Initial clauses in saturation : 60
% 0.14/10.46 % Processed clauses : 108
% 0.14/10.46 % ...of these trivial : 2
% 0.14/10.46 % ...subsumed : 0
% 0.14/10.46 % ...remaining for further processing : 106
% 0.14/10.46 % Other redundant clauses eliminated : 0
% 0.14/10.46 % Clauses deleted for lack of memory : 0
% 0.14/10.46 % Backward-subsumed : 17
% 0.14/10.46 % Backward-rewritten : 0
% 0.14/10.46 % Generated clauses : 57
% 0.14/10.46 % ...of the previous two non-redundant : 48
% 0.14/10.46 % ...aggressively subsumed : 0
% 0.14/10.46 % Contextual simplify-reflections : 78
% 0.14/10.46 % Paramodulations : 57
% 0.14/10.46 % Factorizations : 0
% 0.14/10.46 % NegExts : 0
% 0.14/10.46 % Equation resolutions : 0
% 0.14/10.46 % Disequality decompositions : 0
% 0.14/10.46 % Total rewrite steps : 8
% 0.14/10.46 % ...of those cached : 6
% 0.14/10.46 % Propositional unsat checks : 0
% 0.14/10.46 % Propositional check models : 0
% 0.14/10.46 % Propositional check unsatisfiable : 0
% 0.14/10.46 % Propositional clauses : 0
% 0.14/10.46 % Propositional clauses after purity: 0
% 0.14/10.46 % Propositional unsat core size : 0
% 0.14/10.46 % Propositional preprocessing time : 0.000
% 0.14/10.46 % Propositional encoding time : 0.000
% 0.14/10.46 % Propositional solver time : 0.000
% 0.14/10.46 % Success case prop preproc time : 0.000
% 0.14/10.46 % Success case prop encoding time : 0.000
% 0.14/10.46 % Success case prop solver time : 0.000
% 0.14/10.46 % Current number of processed clauses : 89
% 0.14/10.46 % Positive orientable unit clauses : 2
% 0.14/10.46 % Positive unorientable unit clauses: 0
% 0.14/10.46 % Negative unit clauses : 0
% 0.14/10.46 % Non-unit-clauses : 87
% 0.14/10.46 % Current number of unprocessed clauses: 0
% 0.14/10.46 % ...number of literals in the above : 0
% 0.14/10.46 % Current number of archived formulas : 0
% 0.14/10.46 % Current number of archived clauses : 17
% 0.14/10.46 % Clause-clause subsumption calls (NU) : 5585
% 0.14/10.46 % Rec. Clause-clause subsumption calls : 713
% 0.14/10.46 % Non-unit clause-clause subsumptions : 95
% 0.14/10.46 % Unit Clause-clause subsumption calls : 0
% 0.14/10.46 % Rewrite failures with RHS unbound : 0
% 0.14/10.46 % BW rewrite match attempts : 0
% 0.14/10.46 % BW rewrite match successes : 0
% 0.14/10.46 % Condensation attempts : 0
% 0.14/10.46 % Condensation successes : 0
% 0.14/10.46 % Termbank termtop insertions : 5996
% 0.14/10.46 % Search garbage collected termcells : 217
% 0.14/10.46
% 0.14/10.46 % -------------------------------------------------
% 0.14/10.46 % User time : 0.010 s
% 0.14/10.46 % System time : 0.003 s
% 0.14/10.46 % Total time : 0.013 s
% 0.14/10.46 % Maximum resident set size: 3696 pages
% 0.14/10.46
% 0.14/10.46 % -------------------------------------------------
% 0.14/10.46 % User time : 0.013 s
% 0.14/10.46 % System time : 0.007 s
% 0.14/10.46 % Total time : 0.020 s
% 0.14/10.46 % Maximum resident set size: 4608 pages
% 0.14/10.46 % E exiting
%------------------------------------------------------------------------------