TSTP Solution File: NLP194-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP194-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:43:48 EDT 2024
% Result : Satisfiable 0.18s 0.47s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_92)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_93,negated_conjecture,
( ssSkC0
| member(X1,skf24(X1,X2),X2)
| ~ group(X1,X2)
| ~ two(X1,X3)
| ~ group(X1,X3)
| ~ ssSkP0(X3,X1)
| ~ ssSkP2(X3,X2,X1)
| ~ ssSkP1(X4,X3,X1)
| ~ frontseat(X1,X4)
| ~ barrel(X1,X5)
| ~ present(X1,X5)
| ~ event(X1,X5)
| ~ chevy(X1,X6)
| ~ white(X1,X6)
| ~ dirty(X1,X6)
| ~ old(X1,X6)
| ~ agent(X1,X5,X6)
| ~ wheel(X1,X7)
| ~ city(X1,X7)
| ~ street(X1,X7)
| ~ lonely(X1,X7)
| ~ down(X1,X5,X7)
| ~ in(X1,X5,X7)
| ~ behind(X1,X8,X7)
| ~ placename(X1,X9)
| ~ hollywood_placename(X1,X9)
| ~ of(X1,X9,X7)
| ~ jules_forename(X1,X10)
| ~ forename(X1,X10)
| ~ be(X1,X11,X12,X8)
| ~ man(X1,X12)
| ~ of(X1,X10,X12)
| ~ state(X1,X11)
| ~ actual_world(X1) ),
c_0_92,
[final] ).
cnf(c_0_94,negated_conjecture,
( ssSkC0
| be(skc71,skc73,skc75,skc72) ),
clause63,
[final] ).
cnf(c_0_95,negated_conjecture,
actual_world(skc71),
clause1,
[final] ).
cnf(c_0_96,negated_conjecture,
( ssSkC0
| man(skc71,skc75) ),
clause23,
[final] ).
cnf(c_0_97,negated_conjecture,
( ssSkC0
| state(skc71,skc73) ),
clause24,
[final] ).
cnf(c_0_99,negated_conjecture,
( ssSkC0
| forename(skc71,skc74) ),
clause22,
[final] ).
cnf(c_0_100,negated_conjecture,
( ssSkC0
| jules_forename(skc71,skc74) ),
clause21,
[final] ).
cnf(c_0_101,negated_conjecture,
( ssSkC0
| of(skc71,skc74,skc75) ),
clause54,
[final] ).
cnf(c_0_102,negated_conjecture,
( member(skc71,skf24(skc71,X1),X1)
| ssSkC0
| ~ ssSkP1(X2,X3,skc71)
| ~ behind(skc71,skc72,X4)
| ~ ssSkP2(X3,X1,skc71)
| ~ of(skc71,X5,X4)
| ~ in(skc71,X6,X4)
| ~ down(skc71,X6,X4)
| ~ agent(skc71,X6,X7)
| ~ wheel(skc71,X4)
| ~ frontseat(skc71,X2)
| ~ ssSkP0(X3,skc71)
| ~ two(skc71,X3)
| ~ group(skc71,X3)
| ~ group(skc71,X1)
| ~ hollywood_placename(skc71,X5)
| ~ placename(skc71,X5)
| ~ lonely(skc71,X4)
| ~ street(skc71,X4)
| ~ city(skc71,X4)
| ~ old(skc71,X7)
| ~ dirty(skc71,X7)
| ~ white(skc71,X7)
| ~ chevy(skc71,X7)
| ~ event(skc71,X6)
| ~ present(skc71,X6)
| ~ barrel(skc71,X6) ),
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,
( ssSkC0
| wheel(skc71,skc78) ),
clause20,
[final] ).
cnf(c_0_104,negated_conjecture,
( ssSkC0
| behind(skc71,skc72,skc78) ),
clause52,
[final] ).
cnf(c_0_159,negated_conjecture,
( member(skc71,skf24(skc71,X1),X1)
| ssSkC0
| ~ ssSkP1(X2,X3,skc71)
| ~ ssSkP2(X3,X1,skc71)
| ~ of(skc71,X4,skc78)
| ~ in(skc71,X5,skc78)
| ~ down(skc71,X5,skc78)
| ~ agent(skc71,X5,X6)
| ~ frontseat(skc71,X2)
| ~ ssSkP0(X3,skc71)
| ~ two(skc71,X3)
| ~ group(skc71,X3)
| ~ group(skc71,X1)
| ~ hollywood_placename(skc71,X4)
| ~ placename(skc71,X4)
| ~ lonely(skc71,skc78)
| ~ street(skc71,skc78)
| ~ city(skc71,skc78)
| ~ old(skc71,X6)
| ~ dirty(skc71,X6)
| ~ white(skc71,X6)
| ~ chevy(skc71,X6)
| ~ event(skc71,X5)
| ~ present(skc71,X5)
| ~ barrel(skc71,X5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),
[final] ).
cnf(c_0_160,negated_conjecture,
( ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ cheap(X1,skf10(X1,X6))
| ~ black(X1,skf10(X1,X6))
| ~ coat(X1,skf10(X1,X6))
| ~ group(X1,X7)
| ~ two(X1,X8)
| ~ group(X1,X8)
| ~ ssSkP0(X8,X1)
| ~ ssSkP2(X8,X7,X1)
| ~ behind(X1,X9,X10)
| ~ ssSkP1(X10,X8,X1)
| ~ frontseat(X1,X10)
| ~ wheel(X1,X10)
| ~ jules_forename(X1,X11)
| ~ forename(X1,X11)
| ~ be(X1,X12,X13,X9)
| ~ man(X1,X13)
| ~ of(X1,X11,X13)
| ~ state(X1,X12)
| ~ actual_world(X1)
| ~ ssSkC0 ),
c_0_105,
[final] ).
cnf(c_0_161,negated_conjecture,
( ssSkC0
| ~ cheap(X1,skf24(X1,X2))
| ~ black(X1,skf24(X1,X2))
| ~ coat(X1,skf24(X1,X2))
| ~ group(X1,X3)
| ~ two(X1,X4)
| ~ group(X1,X4)
| ~ ssSkP0(X4,X1)
| ~ ssSkP2(X4,X3,X1)
| ~ ssSkP1(X5,X4,X1)
| ~ frontseat(X1,X5)
| ~ barrel(X1,X6)
| ~ present(X1,X6)
| ~ event(X1,X6)
| ~ chevy(X1,X7)
| ~ white(X1,X7)
| ~ dirty(X1,X7)
| ~ old(X1,X7)
| ~ agent(X1,X6,X7)
| ~ wheel(X1,X8)
| ~ city(X1,X8)
| ~ street(X1,X8)
| ~ lonely(X1,X8)
| ~ down(X1,X6,X8)
| ~ in(X1,X6,X8)
| ~ behind(X1,X9,X8)
| ~ placename(X1,X10)
| ~ hollywood_placename(X1,X10)
| ~ of(X1,X10,X8)
| ~ jules_forename(X1,X11)
| ~ forename(X1,X11)
| ~ be(X1,X12,X13,X9)
| ~ man(X1,X13)
| ~ of(X1,X11,X13)
| ~ state(X1,X12)
| ~ actual_world(X1) ),
c_0_106,
[final] ).
cnf(c_0_162,negated_conjecture,
( member(X1,skf10(X1,X6),X6)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ group(X1,X6)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ ssSkP0(X7,X1)
| ~ ssSkP2(X7,X6,X1)
| ~ behind(X1,X8,X9)
| ~ ssSkP1(X9,X7,X1)
| ~ frontseat(X1,X9)
| ~ wheel(X1,X9)
| ~ jules_forename(X1,X10)
| ~ forename(X1,X10)
| ~ be(X1,X11,X12,X8)
| ~ man(X1,X12)
| ~ of(X1,X10,X12)
| ~ state(X1,X11)
| ~ actual_world(X1)
| ~ ssSkC0 ),
c_0_107,
[final] ).
cnf(c_0_163,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) ),
c_0_108,
[final] ).
cnf(c_0_164,negated_conjecture,
( be(X1,skf13(X1,X5,X2),X2,skf12(X2,X1,X5))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_109,
[final] ).
cnf(c_0_165,negated_conjecture,
( patient(X1,skf17(X1,X2,X4),X4)
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
c_0_110,
[final] ).
cnf(c_0_166,negated_conjecture,
( agent(X1,skf17(X1,X2,X6),X2)
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
c_0_111,
[final] ).
cnf(c_0_167,negated_conjecture,
( nonreflexive(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
c_0_112,
[final] ).
cnf(c_0_168,negated_conjecture,
( wear(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
c_0_113,
[final] ).
cnf(c_0_169,negated_conjecture,
( event(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
c_0_114,
[final] ).
cnf(c_0_170,negated_conjecture,
( ssSkP1(X3,X6,X1)
| ~ in(X1,X2,X3)
| ~ be(X1,X4,skf16(X3,X1,X5),X2)
| ~ state(X1,X4) ),
c_0_115,
[final] ).
cnf(c_0_171,negated_conjecture,
( present(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
c_0_116,
[final] ).
cnf(c_0_172,negated_conjecture,
( in(X1,skf12(X2,X1,X4),X4)
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_117,
[final] ).
cnf(c_0_173,negated_conjecture,
( state(X1,skf13(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_118,
[final] ).
cnf(c_0_174,negated_conjecture,
( ssSkP1(X1,X2,X3)
| member(X3,skf16(X1,X3,X2),X2) ),
clause72,
[final] ).
cnf(c_0_175,negated_conjecture,
( ssSkP2(X1,X2,X3)
| member(X3,skf19(X1,X3,X2),X2) ),
clause74,
[final] ).
cnf(c_0_176,negated_conjecture,
( ssSkP2(X1,X2,X3)
| member(X3,skf21(X1,X3,X4),X1) ),
clause73,
[final] ).
cnf(c_0_177,negated_conjecture,
( ssSkP0(X1,X2)
| member(X2,skf11(X2,X1),X1) ),
clause65,
[final] ).
cnf(c_0_178,negated_conjecture,
( ssSkP0(X3,X1)
| ~ young(X1,skf11(X1,X2))
| ~ fellow(X1,skf11(X1,X2)) ),
c_0_119,
[final] ).
cnf(c_0_179,negated_conjecture,
( young(X1,X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X3,X1) ),
c_0_120,
[final] ).
cnf(c_0_180,negated_conjecture,
( fellow(X1,X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X3,X1) ),
c_0_121,
[final] ).
cnf(c_0_181,negated_conjecture,
( ssSkC0
| cheap(skc71,X1)
| ~ member(skc71,X1,skc76) ),
c_0_122,
[final] ).
cnf(c_0_182,negated_conjecture,
( ssSkC0
| black(skc71,X1)
| ~ member(skc71,X1,skc76) ),
c_0_123,
[final] ).
cnf(c_0_183,negated_conjecture,
( ssSkC0
| coat(skc71,X1)
| ~ member(skc71,X1,skc76) ),
c_0_124,
[final] ).
cnf(c_0_184,negated_conjecture,
( cheap(skc24,X1)
| ~ member(skc24,X1,skc33)
| ~ ssSkC0 ),
c_0_125,
[final] ).
cnf(c_0_185,negated_conjecture,
( black(skc24,X1)
| ~ member(skc24,X1,skc33)
| ~ ssSkC0 ),
c_0_126,
[final] ).
cnf(c_0_186,negated_conjecture,
( coat(skc24,X1)
| ~ member(skc24,X1,skc33)
| ~ ssSkC0 ),
c_0_127,
[final] ).
cnf(c_0_187,negated_conjecture,
( be(skc24,skc26,skc28,skc25)
| ~ ssSkC0 ),
c_0_128,
[final] ).
cnf(c_0_188,negated_conjecture,
( ssSkC0
| ssSkP1(skc78,skc77,skc71) ),
clause53,
[final] ).
cnf(c_0_189,negated_conjecture,
( ssSkC0
| ssSkP2(skc77,skc76,skc71) ),
clause51,
[final] ).
cnf(c_0_190,negated_conjecture,
( ssSkC0
| of(skc71,skc81,skc80) ),
clause50,
[final] ).
cnf(c_0_191,negated_conjecture,
( ssSkC0
| in(skc71,skc79,skc80) ),
clause49,
[final] ).
cnf(c_0_192,negated_conjecture,
( ssSkC0
| down(skc71,skc79,skc80) ),
clause48,
[final] ).
cnf(c_0_193,negated_conjecture,
( ssSkP1(skc35,skc34,skc24)
| ~ ssSkC0 ),
c_0_129,
[final] ).
cnf(c_0_194,negated_conjecture,
( behind(skc24,skc25,skc30)
| ~ ssSkC0 ),
c_0_130,
[final] ).
cnf(c_0_195,negated_conjecture,
( ssSkP2(skc34,skc33,skc24)
| ~ ssSkC0 ),
c_0_131,
[final] ).
cnf(c_0_196,negated_conjecture,
( ssSkC0
| agent(skc71,skc79,skc82) ),
clause47,
[final] ).
cnf(c_0_197,negated_conjecture,
( of(skc24,skc27,skc28)
| ~ ssSkC0 ),
c_0_132,
[final] ).
cnf(c_0_198,negated_conjecture,
( of(skc24,skc31,skc30)
| ~ ssSkC0 ),
c_0_133,
[final] ).
cnf(c_0_199,negated_conjecture,
( in(skc24,skc29,skc30)
| ~ ssSkC0 ),
c_0_134,
[final] ).
cnf(c_0_200,negated_conjecture,
( down(skc24,skc29,skc30)
| ~ ssSkC0 ),
c_0_135,
[final] ).
cnf(c_0_201,negated_conjecture,
( agent(skc24,skc29,skc32)
| ~ ssSkC0 ),
c_0_136,
[final] ).
cnf(c_0_202,negated_conjecture,
( ssSkC0
| frontseat(skc71,skc78) ),
clause19,
[final] ).
cnf(c_0_203,negated_conjecture,
( ssSkC0
| ssSkP0(skc77,skc71) ),
clause18,
[final] ).
cnf(c_0_204,negated_conjecture,
( ssSkC0
| two(skc71,skc77) ),
clause16,
[final] ).
cnf(c_0_205,negated_conjecture,
( ssSkC0
| group(skc71,skc77) ),
clause17,
[final] ).
cnf(c_0_206,negated_conjecture,
( ssSkC0
| group(skc71,skc76) ),
clause15,
[final] ).
cnf(c_0_207,negated_conjecture,
( ssSkC0
| hollywood_placename(skc71,skc81) ),
clause14,
[final] ).
cnf(c_0_208,negated_conjecture,
( ssSkC0
| placename(skc71,skc81) ),
clause13,
[final] ).
cnf(c_0_209,negated_conjecture,
( ssSkC0
| lonely(skc71,skc80) ),
clause12,
[final] ).
cnf(c_0_210,negated_conjecture,
( ssSkC0
| street(skc71,skc80) ),
clause11,
[final] ).
cnf(c_0_211,negated_conjecture,
( ssSkC0
| city(skc71,skc80) ),
clause10,
[final] ).
cnf(c_0_212,negated_conjecture,
( state(skc24,skc26)
| ~ ssSkC0 ),
c_0_137,
[final] ).
cnf(c_0_213,negated_conjecture,
( ssSkC0
| old(skc71,skc82) ),
clause9,
[final] ).
cnf(c_0_214,negated_conjecture,
( man(skc24,skc28)
| ~ ssSkC0 ),
c_0_138,
[final] ).
cnf(c_0_215,negated_conjecture,
( forename(skc24,skc27)
| ~ ssSkC0 ),
c_0_139,
[final] ).
cnf(c_0_216,negated_conjecture,
( jules_forename(skc24,skc27)
| ~ ssSkC0 ),
c_0_140,
[final] ).
cnf(c_0_217,negated_conjecture,
( wheel(skc24,skc30)
| ~ ssSkC0 ),
c_0_141,
[final] ).
cnf(c_0_218,negated_conjecture,
( ssSkC0
| dirty(skc71,skc82) ),
clause8,
[final] ).
cnf(c_0_219,negated_conjecture,
( ssSkC0
| white(skc71,skc82) ),
clause7,
[final] ).
cnf(c_0_220,negated_conjecture,
( frontseat(skc24,skc35)
| ~ ssSkC0 ),
c_0_142,
[final] ).
cnf(c_0_221,negated_conjecture,
( ssSkP0(skc34,skc24)
| ~ ssSkC0 ),
c_0_143,
[final] ).
cnf(c_0_222,negated_conjecture,
( two(skc24,skc34)
| ~ ssSkC0 ),
c_0_144,
[final] ).
cnf(c_0_223,negated_conjecture,
( group(skc24,skc34)
| ~ ssSkC0 ),
c_0_145,
[final] ).
cnf(c_0_224,negated_conjecture,
( ssSkC0
| chevy(skc71,skc82) ),
clause6,
[final] ).
cnf(c_0_225,negated_conjecture,
( group(skc24,skc33)
| ~ ssSkC0 ),
c_0_146,
[final] ).
cnf(c_0_226,negated_conjecture,
( hollywood_placename(skc24,skc31)
| ~ ssSkC0 ),
c_0_147,
[final] ).
cnf(c_0_227,negated_conjecture,
( placename(skc24,skc31)
| ~ ssSkC0 ),
c_0_148,
[final] ).
cnf(c_0_228,negated_conjecture,
( lonely(skc24,skc30)
| ~ ssSkC0 ),
c_0_149,
[final] ).
cnf(c_0_229,negated_conjecture,
( ssSkC0
| event(skc71,skc79) ),
clause5,
[final] ).
cnf(c_0_230,negated_conjecture,
( ssSkC0
| present(skc71,skc79) ),
clause4,
[final] ).
cnf(c_0_231,negated_conjecture,
( street(skc24,skc30)
| ~ ssSkC0 ),
c_0_150,
[final] ).
cnf(c_0_232,negated_conjecture,
( city(skc24,skc30)
| ~ ssSkC0 ),
c_0_151,
[final] ).
cnf(c_0_233,negated_conjecture,
( old(skc24,skc32)
| ~ ssSkC0 ),
c_0_152,
[final] ).
cnf(c_0_234,negated_conjecture,
( dirty(skc24,skc32)
| ~ ssSkC0 ),
c_0_153,
[final] ).
cnf(c_0_235,negated_conjecture,
( ssSkC0
| barrel(skc71,skc79) ),
clause3,
[final] ).
cnf(c_0_236,negated_conjecture,
( white(skc24,skc32)
| ~ ssSkC0 ),
c_0_154,
[final] ).
cnf(c_0_237,negated_conjecture,
( chevy(skc24,skc32)
| ~ ssSkC0 ),
c_0_155,
[final] ).
cnf(c_0_238,negated_conjecture,
( event(skc24,skc29)
| ~ ssSkC0 ),
c_0_156,
[final] ).
cnf(c_0_239,negated_conjecture,
( present(skc24,skc29)
| ~ ssSkC0 ),
c_0_157,
[final] ).
cnf(c_0_240,negated_conjecture,
( barrel(skc24,skc29)
| ~ ssSkC0 ),
c_0_158,
[final] ).
cnf(c_0_241,negated_conjecture,
actual_world(skc24),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NLP194-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n006.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri May 3 08:27:34 EDT 2024
% 0.18/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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/tmp/tmp.sAJdGBMiPa/E---3.1_15746.p
% 0.18/0.47 # Version: 3.1.0
% 0.18/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_3 with pid 15837 completed with status 1
% 0.18/0.47 # Result found by new_bool_3
% 0.18/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHNF-FFMM32-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 0.18/0.47 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 15842 completed with status 1
% 0.18/0.47 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.18/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHNF-FFMM32-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.002 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # No proof found!
% 0.18/0.47 # SZS status Satisfiable
% 0.18/0.47 # SZS output start Saturation
% See solution above
% 0.18/0.47 # Parsed axioms : 92
% 0.18/0.47 # Removed by relevancy pruning/SinE : 0
% 0.18/0.47 # Initial clauses : 92
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 92
% 0.18/0.47 # Processed clauses : 187
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 0
% 0.18/0.47 # ...remaining for further processing : 187
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 1
% 0.18/0.47 # Backward-rewritten : 0
% 0.18/0.47 # Generated clauses : 3
% 0.18/0.47 # ...of the previous two non-redundant : 3
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 5
% 0.18/0.47 # Paramodulations : 3
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 1
% 0.18/0.47 # ...of those cached : 0
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 94
% 0.18/0.47 # Positive orientable unit clauses : 2
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 0
% 0.18/0.47 # Non-unit-clauses : 92
% 0.18/0.47 # Current number of unprocessed clauses: 0
% 0.18/0.47 # ...number of literals in the above : 0
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 93
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 9803
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 2744
% 0.18/0.47 # Non-unit clause-clause subsumptions : 6
% 0.18/0.47 # Unit Clause-clause subsumption calls : 0
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 0
% 0.18/0.47 # BW rewrite match successes : 0
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 5407
% 0.18/0.47 # Search garbage collected termcells : 443
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.014 s
% 0.18/0.47 # System time : 0.002 s
% 0.18/0.47 # Total time : 0.016 s
% 0.18/0.47 # Maximum resident set size: 2132 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.018 s
% 0.18/0.47 # System time : 0.004 s
% 0.18/0.47 # Total time : 0.021 s
% 0.18/0.47 # Maximum resident set size: 1812 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------