TSTP Solution File: NLP167-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP167-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:44:52 EDT 2023
% Result : Satisfiable 0.64s 0.55s
% Output : Saturation 0.64s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_80,negated_conjecture,
actual_world(skc61),
clause1,
[final] ).
cnf(c_0_127,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_81]),c_0_79]),
[final] ).
cnf(c_0_131,negated_conjecture,
( member(X1,skf10(X1,X2),X2)
| ~ ssSkP2(X3,X2,X1)
| ~ down(X1,X4,X5)
| ~ of(X1,X6,X7)
| ~ agent(X1,X4,X7)
| ~ in(X1,X4,X7)
| ~ ssSkP1(X7,X8,X1)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ barrel(X1,X4)
| ~ placename(X1,X6)
| ~ hollywood_placename(X1,X6)
| ~ frontseat(X1,X7)
| ~ city(X1,X7)
| ~ chevy(X1,X7)
| ~ white(X1,X7)
| ~ dirty(X1,X7)
| ~ old(X1,X7)
| ~ ssSkP0(X8,X1)
| ~ group(X1,X2)
| ~ group(X1,X3)
| ~ group(X1,X8)
| ~ two(X1,X8)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127])]),
[final] ).
cnf(c_0_132,negated_conjecture,
ssSkP2(skc19,skc18,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_127])]),
[final] ).
cnf(c_0_133,negated_conjecture,
group(skc17,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_127])]),
[final] ).
cnf(c_0_134,negated_conjecture,
group(skc17,skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_127])]),
[final] ).
cnf(c_0_135,negated_conjecture,
actual_world(skc17),
clause2,
[final] ).
cnf(c_0_138,negated_conjecture,
( ssSkP2(X1,X2,X3)
| member(X3,skf19(X1,X3,X2),X2) ),
clause60,
[final] ).
cnf(c_0_143,negated_conjecture,
( member(skc17,skf10(skc17,skc18),skc18)
| ~ down(skc17,X1,X2)
| ~ of(skc17,X3,X4)
| ~ agent(skc17,X1,X4)
| ~ in(skc17,X1,X4)
| ~ ssSkP1(X4,X5,skc17)
| ~ lonely(skc17,X2)
| ~ street(skc17,X2)
| ~ event(skc17,X1)
| ~ present(skc17,X1)
| ~ barrel(skc17,X1)
| ~ placename(skc17,X3)
| ~ hollywood_placename(skc17,X3)
| ~ frontseat(skc17,X4)
| ~ city(skc17,X4)
| ~ chevy(skc17,X4)
| ~ white(skc17,X4)
| ~ dirty(skc17,X4)
| ~ old(skc17,X4)
| ~ ssSkP0(X5,skc17)
| ~ group(skc17,X5)
| ~ two(skc17,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]),c_0_134]),c_0_135])]),
[final] ).
cnf(c_0_144,negated_conjecture,
lonely(skc17,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_136,c_0_127])]),
[final] ).
cnf(c_0_145,negated_conjecture,
street(skc17,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_127])]),
[final] ).
cnf(c_0_146,negated_conjecture,
( ssSkP2(X1,X2,X3)
| member(X3,skf21(X1,X3,X4),X1) ),
clause59,
[final] ).
cnf(c_0_147,negated_conjecture,
( member(X1,skf19(X2,X1,X3),X3)
| member(X1,skf10(X1,X3),X3)
| ~ down(X1,X4,X5)
| ~ of(X1,X6,X7)
| ~ agent(X1,X4,X7)
| ~ in(X1,X4,X7)
| ~ ssSkP1(X7,X8,X1)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ barrel(X1,X4)
| ~ placename(X1,X6)
| ~ hollywood_placename(X1,X6)
| ~ frontseat(X1,X7)
| ~ city(X1,X7)
| ~ chevy(X1,X7)
| ~ white(X1,X7)
| ~ dirty(X1,X7)
| ~ old(X1,X7)
| ~ ssSkP0(X8,X1)
| ~ group(X1,X3)
| ~ group(X1,X2)
| ~ group(X1,X8)
| ~ two(X1,X8)
| ~ actual_world(X1) ),
inference(spm,[status(thm)],[c_0_131,c_0_138]),
[final] ).
cnf(c_0_148,negated_conjecture,
down(skc17,skc21,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_139,c_0_127])]),
[final] ).
cnf(c_0_149,negated_conjecture,
event(skc17,skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_127])]),
[final] ).
cnf(c_0_150,negated_conjecture,
present(skc17,skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_127])]),
[final] ).
cnf(c_0_151,negated_conjecture,
barrel(skc17,skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_127])]),
[final] ).
cnf(c_0_154,negated_conjecture,
( member(skc17,skf10(skc17,skc18),skc18)
| ~ down(skc17,X1,skc22)
| ~ of(skc17,X2,X3)
| ~ agent(skc17,X1,X3)
| ~ in(skc17,X1,X3)
| ~ ssSkP1(X3,X4,skc17)
| ~ event(skc17,X1)
| ~ present(skc17,X1)
| ~ barrel(skc17,X1)
| ~ placename(skc17,X2)
| ~ hollywood_placename(skc17,X2)
| ~ frontseat(skc17,X3)
| ~ city(skc17,X3)
| ~ chevy(skc17,X3)
| ~ white(skc17,X3)
| ~ dirty(skc17,X3)
| ~ old(skc17,X3)
| ~ ssSkP0(X4,skc17)
| ~ group(skc17,X4)
| ~ two(skc17,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_145])]),
[final] ).
cnf(c_0_155,negated_conjecture,
( member(X1,skf21(X2,X1,X3),X2)
| member(X1,skf10(X1,X4),X4)
| ~ down(X1,X5,X6)
| ~ of(X1,X7,X8)
| ~ agent(X1,X5,X8)
| ~ in(X1,X5,X8)
| ~ ssSkP1(X8,X9,X1)
| ~ lonely(X1,X6)
| ~ street(X1,X6)
| ~ event(X1,X5)
| ~ present(X1,X5)
| ~ barrel(X1,X5)
| ~ placename(X1,X7)
| ~ hollywood_placename(X1,X7)
| ~ frontseat(X1,X8)
| ~ city(X1,X8)
| ~ chevy(X1,X8)
| ~ white(X1,X8)
| ~ dirty(X1,X8)
| ~ old(X1,X8)
| ~ ssSkP0(X9,X1)
| ~ group(X1,X4)
| ~ group(X1,X2)
| ~ group(X1,X9)
| ~ two(X1,X9)
| ~ actual_world(X1) ),
inference(spm,[status(thm)],[c_0_131,c_0_146]),
[final] ).
cnf(c_0_156,negated_conjecture,
( member(skc17,skf19(X1,skc17,X2),X2)
| member(skc17,skf10(skc17,X2),X2)
| ~ of(skc17,X3,X4)
| ~ agent(skc17,skc21,X4)
| ~ in(skc17,skc21,X4)
| ~ ssSkP1(X4,X5,skc17)
| ~ placename(skc17,X3)
| ~ hollywood_placename(skc17,X3)
| ~ frontseat(skc17,X4)
| ~ city(skc17,X4)
| ~ chevy(skc17,X4)
| ~ white(skc17,X4)
| ~ dirty(skc17,X4)
| ~ old(skc17,X4)
| ~ ssSkP0(X5,skc17)
| ~ group(skc17,X2)
| ~ group(skc17,X1)
| ~ group(skc17,X5)
| ~ two(skc17,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_144]),c_0_145]),c_0_149]),c_0_150]),c_0_151]),c_0_135])]),
[final] ).
cnf(c_0_157,negated_conjecture,
placename(skc17,skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_127])]),
[final] ).
cnf(c_0_158,negated_conjecture,
hollywood_placename(skc17,skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_127])]),
[final] ).
cnf(c_0_165,negated_conjecture,
( member(skc17,skf10(skc17,skc18),skc18)
| ~ of(skc17,X1,X2)
| ~ agent(skc17,skc21,X2)
| ~ in(skc17,skc21,X2)
| ~ ssSkP1(X2,X3,skc17)
| ~ placename(skc17,X1)
| ~ hollywood_placename(skc17,X1)
| ~ frontseat(skc17,X2)
| ~ city(skc17,X2)
| ~ chevy(skc17,X2)
| ~ white(skc17,X2)
| ~ dirty(skc17,X2)
| ~ old(skc17,X2)
| ~ ssSkP0(X3,skc17)
| ~ group(skc17,X3)
| ~ two(skc17,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_149]),c_0_148]),c_0_150]),c_0_151])]),
[final] ).
cnf(c_0_166,negated_conjecture,
( member(skc17,skf21(X1,skc17,X2),X1)
| member(skc17,skf10(skc17,X3),X3)
| ~ of(skc17,X4,X5)
| ~ agent(skc17,skc21,X5)
| ~ in(skc17,skc21,X5)
| ~ ssSkP1(X5,X6,skc17)
| ~ placename(skc17,X4)
| ~ hollywood_placename(skc17,X4)
| ~ frontseat(skc17,X5)
| ~ city(skc17,X5)
| ~ chevy(skc17,X5)
| ~ white(skc17,X5)
| ~ dirty(skc17,X5)
| ~ old(skc17,X5)
| ~ ssSkP0(X6,skc17)
| ~ group(skc17,X3)
| ~ group(skc17,X1)
| ~ group(skc17,X6)
| ~ two(skc17,X6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_148]),c_0_144]),c_0_145]),c_0_149]),c_0_150]),c_0_151]),c_0_135])]),
[final] ).
cnf(c_0_167,negated_conjecture,
( member(skc17,skf19(X1,skc17,X2),X2)
| member(skc17,skf10(skc17,X2),X2)
| ~ of(skc17,skc23,X3)
| ~ agent(skc17,skc21,X3)
| ~ in(skc17,skc21,X3)
| ~ ssSkP1(X3,X4,skc17)
| ~ frontseat(skc17,X3)
| ~ city(skc17,X3)
| ~ chevy(skc17,X3)
| ~ white(skc17,X3)
| ~ dirty(skc17,X3)
| ~ old(skc17,X3)
| ~ ssSkP0(X4,skc17)
| ~ group(skc17,X2)
| ~ group(skc17,X1)
| ~ group(skc17,X4)
| ~ two(skc17,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_158])]),
[final] ).
cnf(c_0_168,negated_conjecture,
frontseat(skc17,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_159,c_0_127])]),
[final] ).
cnf(c_0_169,negated_conjecture,
agent(skc17,skc21,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_160,c_0_127])]),
[final] ).
cnf(c_0_170,negated_conjecture,
chevy(skc17,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_161,c_0_127])]),
[final] ).
cnf(c_0_171,negated_conjecture,
white(skc17,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_162,c_0_127])]),
[final] ).
cnf(c_0_172,negated_conjecture,
dirty(skc17,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_127])]),
[final] ).
cnf(c_0_173,negated_conjecture,
old(skc17,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_127])]),
[final] ).
cnf(c_0_174,negated_conjecture,
( member(skc17,skf10(skc17,skc18),skc18)
| ~ of(skc17,skc23,X1)
| ~ agent(skc17,skc21,X1)
| ~ in(skc17,skc21,X1)
| ~ ssSkP1(X1,X2,skc17)
| ~ frontseat(skc17,X1)
| ~ city(skc17,X1)
| ~ chevy(skc17,X1)
| ~ white(skc17,X1)
| ~ dirty(skc17,X1)
| ~ old(skc17,X1)
| ~ ssSkP0(X2,skc17)
| ~ group(skc17,X2)
| ~ two(skc17,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_157]),c_0_158])]),
[final] ).
cnf(c_0_175,negated_conjecture,
( member(skc17,skf21(X1,skc17,X2),X1)
| member(skc17,skf10(skc17,X3),X3)
| ~ of(skc17,skc23,X4)
| ~ agent(skc17,skc21,X4)
| ~ in(skc17,skc21,X4)
| ~ ssSkP1(X4,X5,skc17)
| ~ frontseat(skc17,X4)
| ~ city(skc17,X4)
| ~ chevy(skc17,X4)
| ~ white(skc17,X4)
| ~ dirty(skc17,X4)
| ~ old(skc17,X4)
| ~ ssSkP0(X5,skc17)
| ~ group(skc17,X3)
| ~ group(skc17,X1)
| ~ group(skc17,X5)
| ~ two(skc17,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_157]),c_0_158])]),
[final] ).
cnf(c_0_187,negated_conjecture,
( member(skc17,skf19(X1,skc17,X2),X2)
| member(skc17,skf10(skc17,X2),X2)
| ~ of(skc17,skc23,skc25)
| ~ in(skc17,skc21,skc25)
| ~ ssSkP1(skc25,X3,skc17)
| ~ city(skc17,skc25)
| ~ ssSkP0(X3,skc17)
| ~ group(skc17,X2)
| ~ group(skc17,X1)
| ~ group(skc17,X3)
| ~ two(skc17,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_169]),c_0_170]),c_0_171]),c_0_172]),c_0_173])]),
[final] ).
cnf(c_0_188,negated_conjecture,
( member(skc17,skf10(skc17,skc18),skc18)
| ~ of(skc17,skc23,skc25)
| ~ in(skc17,skc21,skc25)
| ~ ssSkP1(skc25,X1,skc17)
| ~ city(skc17,skc25)
| ~ ssSkP0(X1,skc17)
| ~ group(skc17,X1)
| ~ two(skc17,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_168]),c_0_169]),c_0_170]),c_0_171]),c_0_172]),c_0_173])]),
[final] ).
cnf(c_0_189,negated_conjecture,
( member(skc17,skf21(X1,skc17,X2),X1)
| member(skc17,skf10(skc17,X3),X3)
| ~ of(skc17,skc23,skc25)
| ~ in(skc17,skc21,skc25)
| ~ ssSkP1(skc25,X4,skc17)
| ~ city(skc17,skc25)
| ~ ssSkP0(X4,skc17)
| ~ group(skc17,X3)
| ~ group(skc17,X1)
| ~ group(skc17,X4)
| ~ two(skc17,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_168]),c_0_169]),c_0_170]),c_0_171]),c_0_172]),c_0_173])]),
[final] ).
cnf(c_0_190,negated_conjecture,
( coat(skc17,X1)
| ~ member(skc17,X1,skc18) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_176,c_0_127])]),
[final] ).
cnf(c_0_191,negated_conjecture,
( black(skc17,X1)
| ~ member(skc17,X1,skc18) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_177,c_0_127])]),
[final] ).
cnf(c_0_192,negated_conjecture,
( cheap(skc17,X1)
| ~ member(skc17,X1,skc18) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_178,c_0_127])]),
[final] ).
cnf(c_0_193,negated_conjecture,
( ~ cheap(X1,skf10(X1,X2))
| ~ black(X1,skf10(X1,X2))
| ~ coat(X1,skf10(X1,X2))
| ~ ssSkP2(X3,X4,X1)
| ~ down(X1,X5,X6)
| ~ of(X1,X7,X8)
| ~ agent(X1,X5,X8)
| ~ in(X1,X5,X8)
| ~ ssSkP1(X8,X9,X1)
| ~ lonely(X1,X6)
| ~ street(X1,X6)
| ~ event(X1,X5)
| ~ present(X1,X5)
| ~ barrel(X1,X5)
| ~ placename(X1,X7)
| ~ hollywood_placename(X1,X7)
| ~ frontseat(X1,X8)
| ~ city(X1,X8)
| ~ chevy(X1,X8)
| ~ white(X1,X8)
| ~ dirty(X1,X8)
| ~ old(X1,X8)
| ~ ssSkP0(X9,X1)
| ~ group(X1,X4)
| ~ group(X1,X3)
| ~ group(X1,X9)
| ~ two(X1,X9)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_127])]),
[final] ).
cnf(c_0_194,negated_conjecture,
( be(X1,skf13(X1,X5,X2),X2,skf12(X2,X1,X5))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause66,
[final] ).
cnf(c_0_195,negated_conjecture,
( ssSkP2(X3,X5,X1)
| ~ wear(X1,X2)
| ~ nonreflexive(X1,X2)
| ~ present(X1,X2)
| ~ patient(X1,X2,skf19(X3,X1,X4))
| ~ agent(X1,X2,skf21(X3,X1,X4))
| ~ event(X1,X2) ),
clause74,
[final] ).
cnf(c_0_196,negated_conjecture,
( patient(X1,skf17(X1,X2,X4),X4)
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause73,
[final] ).
cnf(c_0_197,negated_conjecture,
( agent(X1,skf17(X1,X2,X6),X2)
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause71,
[final] ).
cnf(c_0_198,negated_conjecture,
( nonreflexive(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause68,
[final] ).
cnf(c_0_199,negated_conjecture,
( wear(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause67,
[final] ).
cnf(c_0_200,negated_conjecture,
( event(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause70,
[final] ).
cnf(c_0_201,negated_conjecture,
( present(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause69,
[final] ).
cnf(c_0_202,negated_conjecture,
( in(X1,skf12(X2,X1,X4),X4)
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause65,
[final] ).
cnf(c_0_203,negated_conjecture,
( ssSkP1(X3,X6,X1)
| ~ in(X1,X2,X3)
| ~ be(X1,X4,skf16(X3,X1,X5),X2)
| ~ state(X1,X4) ),
clause72,
[final] ).
cnf(c_0_204,negated_conjecture,
( state(X1,skf13(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause64,
[final] ).
cnf(c_0_205,negated_conjecture,
( ssSkP1(X1,X2,X3)
| member(X3,skf16(X1,X3,X2),X2) ),
clause58,
[final] ).
cnf(c_0_206,negated_conjecture,
( ssSkP0(X3,X1)
| ~ young(X1,skf11(X1,X2))
| ~ fellow(X1,skf11(X1,X2)) ),
clause63,
[final] ).
cnf(c_0_207,negated_conjecture,
( ssSkP0(X1,X2)
| member(X2,skf11(X2,X1),X1) ),
clause51,
[final] ).
cnf(c_0_208,negated_conjecture,
( young(X1,X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X3,X1) ),
clause62,
[final] ).
cnf(c_0_209,negated_conjecture,
( fellow(X1,X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X3,X1) ),
clause61,
[final] ).
cnf(c_0_210,negated_conjecture,
ssSkP1(skc25,skc20,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_180,c_0_127])]),
[final] ).
cnf(c_0_211,negated_conjecture,
in(skc17,skc21,skc24),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_181,c_0_127])]),
[final] ).
cnf(c_0_212,negated_conjecture,
of(skc17,skc23,skc24),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_182,c_0_127])]),
[final] ).
cnf(c_0_213,negated_conjecture,
two(skc17,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_127])]),
[final] ).
cnf(c_0_214,negated_conjecture,
group(skc17,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_184,c_0_127])]),
[final] ).
cnf(c_0_215,negated_conjecture,
ssSkP0(skc20,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_185,c_0_127])]),
[final] ).
cnf(c_0_216,negated_conjecture,
city(skc17,skc24),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_186,c_0_127])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP167-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 11:39:36 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.3Fs40YAu60/E---3.1_21515.p
% 0.64/0.55 # Version: 3.1pre001
% 0.64/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.64/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.64/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.64/0.55 # Starting sh5l with 300s (1) cores
% 0.64/0.55 # new_bool_1 with pid 21594 completed with status 1
% 0.64/0.55 # Result found by new_bool_1
% 0.64/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.64/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.64/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.64/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.55 # Search class: FGHNF-FFMM32-SFFFFFNN
% 0.64/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 0.64/0.55 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 21602 completed with status 1
% 0.64/0.55 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.64/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.64/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.64/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.64/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.55 # Search class: FGHNF-FFMM32-SFFFFFNN
% 0.64/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 0.64/0.55 # Preprocessing time : 0.003 s
% 0.64/0.55 # Presaturation interreduction done
% 0.64/0.55
% 0.64/0.55 # No proof found!
% 0.64/0.55 # SZS status Satisfiable
% 0.64/0.55 # SZS output start Saturation
% See solution above
% 0.64/0.55 # Parsed axioms : 78
% 0.64/0.55 # Removed by relevancy pruning/SinE : 0
% 0.64/0.55 # Initial clauses : 78
% 0.64/0.55 # Removed in clause preprocessing : 0
% 0.64/0.55 # Initial clauses in saturation : 78
% 0.64/0.55 # Processed clauses : 447
% 0.64/0.55 # ...of these trivial : 0
% 0.64/0.55 # ...subsumed : 59
% 0.64/0.55 # ...remaining for further processing : 388
% 0.64/0.55 # Other redundant clauses eliminated : 0
% 0.64/0.55 # Clauses deleted for lack of memory : 0
% 0.64/0.55 # Backward-subsumed : 52
% 0.64/0.55 # Backward-rewritten : 195
% 0.64/0.55 # Generated clauses : 335
% 0.64/0.55 # ...of the previous two non-redundant : 364
% 0.64/0.55 # ...aggressively subsumed : 0
% 0.64/0.55 # Contextual simplify-reflections : 79
% 0.64/0.55 # Paramodulations : 335
% 0.64/0.55 # Factorizations : 0
% 0.64/0.55 # NegExts : 0
% 0.64/0.55 # Equation resolutions : 0
% 0.64/0.55 # Total rewrite steps : 236
% 0.64/0.55 # Propositional unsat checks : 0
% 0.64/0.55 # Propositional check models : 0
% 0.64/0.55 # Propositional check unsatisfiable : 0
% 0.64/0.55 # Propositional clauses : 0
% 0.64/0.55 # Propositional clauses after purity: 0
% 0.64/0.55 # Propositional unsat core size : 0
% 0.64/0.55 # Propositional preprocessing time : 0.000
% 0.64/0.55 # Propositional encoding time : 0.000
% 0.64/0.55 # Propositional solver time : 0.000
% 0.64/0.55 # Success case prop preproc time : 0.000
% 0.64/0.55 # Success case prop encoding time : 0.000
% 0.64/0.55 # Success case prop solver time : 0.000
% 0.64/0.55 # Current number of processed clauses : 63
% 0.64/0.55 # Positive orientable unit clauses : 27
% 0.64/0.55 # Positive unorientable unit clauses: 0
% 0.64/0.55 # Negative unit clauses : 0
% 0.64/0.55 # Non-unit-clauses : 36
% 0.64/0.55 # Current number of unprocessed clauses: 0
% 0.64/0.55 # ...number of literals in the above : 0
% 0.64/0.55 # Current number of archived formulas : 0
% 0.64/0.55 # Current number of archived clauses : 325
% 0.64/0.55 # Clause-clause subsumption calls (NU) : 34039
% 0.64/0.55 # Rec. Clause-clause subsumption calls : 6704
% 0.64/0.55 # Non-unit clause-clause subsumptions : 190
% 0.64/0.55 # Unit Clause-clause subsumption calls : 28
% 0.64/0.55 # Rewrite failures with RHS unbound : 0
% 0.64/0.55 # BW rewrite match attempts : 1
% 0.64/0.55 # BW rewrite match successes : 1
% 0.64/0.55 # Condensation attempts : 0
% 0.64/0.55 # Condensation successes : 0
% 0.64/0.55 # Termbank termtop insertions : 17335
% 0.64/0.55
% 0.64/0.55 # -------------------------------------------------
% 0.64/0.55 # User time : 0.059 s
% 0.64/0.55 # System time : 0.003 s
% 0.64/0.55 # Total time : 0.062 s
% 0.64/0.55 # Maximum resident set size: 1984 pages
% 0.64/0.55
% 0.64/0.55 # -------------------------------------------------
% 0.64/0.55 # User time : 0.062 s
% 0.64/0.55 # System time : 0.004 s
% 0.64/0.55 # Total time : 0.067 s
% 0.64/0.55 # Maximum resident set size: 1864 pages
% 0.64/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------