TSTP Solution File: NLP153-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP153-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:42:32 EDT 2023
% Result : Satisfiable 0.20s 0.51s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_106)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_88,axiom,
( way(X1,X2)
| ~ street(X1,X2) ),
clause36,
[final] ).
cnf(c_0_89,negated_conjecture,
street(skc5,skc7),
clause71,
[final] ).
cnf(c_0_90,axiom,
( relname(X1,X2)
| ~ placename(X1,X2) ),
clause38,
[final] ).
cnf(c_0_91,negated_conjecture,
placename(skc5,skc9),
clause70,
[final] ).
cnf(c_0_92,axiom,
( car(X1,X2)
| ~ chevy(X1,X2) ),
clause26,
[final] ).
cnf(c_0_93,negated_conjecture,
chevy(skc5,skc8),
clause79,
[final] ).
cnf(c_0_94,axiom,
( location(X1,X2)
| ~ city(X1,X2) ),
clause46,
[final] ).
cnf(c_0_95,negated_conjecture,
city(skc5,skc8),
clause80,
[final] ).
cnf(c_0_96,axiom,
( artifact(X1,X2)
| ~ way(X1,X2) ),
clause37,
[final] ).
cnf(c_0_97,negated_conjecture,
way(skc5,skc7),
inference(spm,[status(thm)],[c_0_88,c_0_89]),
[final] ).
cnf(c_0_98,axiom,
( relation(X1,X2)
| ~ relname(X1,X2) ),
clause39,
[final] ).
cnf(c_0_99,negated_conjecture,
relname(skc5,skc9),
inference(spm,[status(thm)],[c_0_90,c_0_91]),
[final] ).
cnf(c_0_100,axiom,
( vehicle(X1,X2)
| ~ car(X1,X2) ),
clause27,
[final] ).
cnf(c_0_101,negated_conjecture,
car(skc5,skc8),
inference(spm,[status(thm)],[c_0_92,c_0_93]),
[final] ).
cnf(c_0_102,axiom,
( object(X1,X2)
| ~ location(X1,X2) ),
clause47,
[final] ).
cnf(c_0_103,negated_conjecture,
location(skc5,skc8),
inference(spm,[status(thm)],[c_0_94,c_0_95]),
[final] ).
cnf(c_0_104,axiom,
( object(X1,X2)
| ~ artifact(X1,X2) ),
clause31,
[final] ).
cnf(c_0_105,negated_conjecture,
artifact(skc5,skc7),
inference(spm,[status(thm)],[c_0_96,c_0_97]),
[final] ).
cnf(c_0_107,axiom,
( group(X1,X2)
| ~ two(X1,X2) ),
clause17,
[final] ).
cnf(c_0_108,axiom,
( event(X1,X2)
| ~ barrel(X1,X2) ),
clause25,
[final] ).
cnf(c_0_109,axiom,
( placename(X1,X2)
| ~ hollywood_placename(X1,X2) ),
clause45,
[final] ).
cnf(c_0_110,axiom,
( abstraction(X1,X2)
| ~ relation(X1,X2) ),
clause40,
[final] ).
cnf(c_0_111,negated_conjecture,
relation(skc5,skc9),
inference(spm,[status(thm)],[c_0_98,c_0_99]),
[final] ).
cnf(c_0_112,axiom,
( eventuality(X1,X2)
| ~ event(X1,X2) ),
clause24,
[final] ).
cnf(c_0_113,negated_conjecture,
event(skc5,skc6),
clause75,
[final] ).
cnf(c_0_114,axiom,
( transport(X1,X2)
| ~ vehicle(X1,X2) ),
clause28,
[final] ).
cnf(c_0_115,negated_conjecture,
vehicle(skc5,skc8),
inference(spm,[status(thm)],[c_0_100,c_0_101]),
[final] ).
cnf(c_0_116,axiom,
( entity(X1,X2)
| ~ object(X1,X2) ),
clause32,
[final] ).
cnf(c_0_117,negated_conjecture,
object(skc5,skc8),
inference(spm,[status(thm)],[c_0_102,c_0_103]),
[final] ).
cnf(c_0_118,negated_conjecture,
object(skc5,skc7),
inference(spm,[status(thm)],[c_0_104,c_0_105]),
[final] ).
cnf(c_0_119,negated_conjecture,
( member(X1,skf5(X1,X2),X2)
| ~ ssSkP0(X2,X1)
| ~ agent(X1,X3,X4)
| ~ in(X1,X3,X4)
| ~ down(X1,X3,X5)
| ~ white(X1,X4)
| ~ dirty(X1,X4)
| ~ present(X1,X3)
| ~ lonely(X1,X5)
| ~ actual_world(X1)
| ~ of(X1,X6,X4)
| ~ old(X1,X4)
| ~ city(X1,X4)
| ~ hollywood_placename(X1,X6)
| ~ street(X1,X5)
| ~ chevy(X1,X4)
| ~ barrel(X1,X3)
| ~ two(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_106,c_0_107]),c_0_108]),c_0_109]),
[final] ).
cnf(c_0_120,negated_conjecture,
agent(skc5,skc6,skc8),
clause84,
[final] ).
cnf(c_0_121,negated_conjecture,
in(skc5,skc6,skc8),
clause83,
[final] ).
cnf(c_0_122,negated_conjecture,
white(skc5,skc8),
clause78,
[final] ).
cnf(c_0_123,negated_conjecture,
dirty(skc5,skc8),
clause77,
[final] ).
cnf(c_0_124,negated_conjecture,
present(skc5,skc6),
clause74,
[final] ).
cnf(c_0_125,negated_conjecture,
actual_world(skc5),
clause68,
[final] ).
cnf(c_0_126,negated_conjecture,
old(skc5,skc8),
clause76,
[final] ).
cnf(c_0_127,negated_conjecture,
barrel(skc5,skc6),
clause73,
[final] ).
cnf(c_0_128,axiom,
( general(X1,X2)
| ~ abstraction(X1,X2) ),
clause43,
[final] ).
cnf(c_0_129,negated_conjecture,
abstraction(skc5,skc9),
inference(spm,[status(thm)],[c_0_110,c_0_111]),
[final] ).
cnf(c_0_130,axiom,
( nonhuman(X1,X2)
| ~ abstraction(X1,X2) ),
clause42,
[final] ).
cnf(c_0_131,axiom,
( nonexistent(X1,X2)
| ~ eventuality(X1,X2) ),
clause21,
[final] ).
cnf(c_0_132,negated_conjecture,
eventuality(skc5,skc6),
inference(spm,[status(thm)],[c_0_112,c_0_113]),
[final] ).
cnf(c_0_133,axiom,
( thing(X1,X2)
| ~ abstraction(X1,X2) ),
clause41,
[final] ).
cnf(c_0_134,axiom,
( instrumentality(X1,X2)
| ~ transport(X1,X2) ),
clause29,
[final] ).
cnf(c_0_135,negated_conjecture,
transport(skc5,skc8),
inference(spm,[status(thm)],[c_0_114,c_0_115]),
[final] ).
cnf(c_0_136,axiom,
( thing(X1,X2)
| ~ eventuality(X1,X2) ),
clause19,
[final] ).
cnf(c_0_137,axiom,
( thing(X1,X2)
| ~ entity(X1,X2) ),
clause6,
[final] ).
cnf(c_0_138,negated_conjecture,
entity(skc5,skc8),
inference(spm,[status(thm)],[c_0_116,c_0_117]),
[final] ).
cnf(c_0_139,negated_conjecture,
entity(skc5,skc7),
inference(spm,[status(thm)],[c_0_116,c_0_118]),
[final] ).
cnf(c_0_141,negated_conjecture,
down(skc5,skc6,skc7),
clause82,
[final] ).
cnf(c_0_142,negated_conjecture,
lonely(skc5,skc7),
clause72,
[final] ).
cnf(c_0_143,axiom,
( two(X1,X3)
| member(X1,skf13(X2,X4,X3,X1),X3)
| X2 = X4
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X3) ),
clause66,
[final] ).
cnf(c_0_144,negated_conjecture,
( ssSkP0(X1,X2)
| member(X2,skf8(X2,X1),X1) ),
clause85,
[final] ).
cnf(c_0_145,axiom,
( X3 = X2
| ~ placename(X1,X2)
| ~ of(X1,X3,X4)
| ~ placename(X1,X3)
| ~ of(X1,X2,X4)
| ~ entity(X1,X4) ),
clause67,
[final] ).
cnf(c_0_146,negated_conjecture,
of(skc5,skc9,skc8),
clause81,
[final] ).
cnf(c_0_148,axiom,
( ~ general(X1,X2)
| ~ specific(X1,X2) ),
clause53,
[final] ).
cnf(c_0_149,negated_conjecture,
general(skc5,skc9),
inference(spm,[status(thm)],[c_0_128,c_0_129]),
[final] ).
cnf(c_0_150,axiom,
( ~ human(X1,X2)
| ~ nonhuman(X1,X2) ),
clause56,
[final] ).
cnf(c_0_151,negated_conjecture,
nonhuman(skc5,skc9),
inference(spm,[status(thm)],[c_0_130,c_0_129]),
[final] ).
cnf(c_0_152,axiom,
( ~ nonexistent(X1,X2)
| ~ existent(X1,X2) ),
clause57,
[final] ).
cnf(c_0_153,negated_conjecture,
nonexistent(skc5,skc6),
inference(spm,[status(thm)],[c_0_131,c_0_132]),
[final] ).
cnf(c_0_154,axiom,
( singleton(X1,X2)
| ~ thing(X1,X2) ),
clause7,
[final] ).
cnf(c_0_155,negated_conjecture,
thing(skc5,skc9),
inference(spm,[status(thm)],[c_0_133,c_0_129]),
[final] ).
cnf(c_0_156,axiom,
( unisex(X1,X2)
| ~ abstraction(X1,X2) ),
clause44,
[final] ).
cnf(c_0_157,axiom,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
clause30,
[final] ).
cnf(c_0_158,negated_conjecture,
instrumentality(skc5,skc8),
inference(spm,[status(thm)],[c_0_134,c_0_135]),
[final] ).
cnf(c_0_159,axiom,
( nonliving(X1,X2)
| ~ object(X1,X2) ),
clause33,
[final] ).
cnf(c_0_160,axiom,
( unisex(X1,X2)
| ~ object(X1,X2) ),
clause35,
[final] ).
cnf(c_0_161,axiom,
( unisex(X1,X2)
| ~ eventuality(X1,X2) ),
clause22,
[final] ).
cnf(c_0_162,axiom,
( impartial(X1,X2)
| ~ object(X1,X2) ),
clause34,
[final] ).
cnf(c_0_163,axiom,
( existent(X1,X2)
| ~ entity(X1,X2) ),
clause9,
[final] ).
cnf(c_0_164,axiom,
( specific(X1,X2)
| ~ eventuality(X1,X2) ),
clause20,
[final] ).
cnf(c_0_165,negated_conjecture,
thing(skc5,skc6),
inference(spm,[status(thm)],[c_0_136,c_0_132]),
[final] ).
cnf(c_0_166,negated_conjecture,
thing(skc5,skc8),
inference(spm,[status(thm)],[c_0_137,c_0_138]),
[final] ).
cnf(c_0_167,negated_conjecture,
thing(skc5,skc7),
inference(spm,[status(thm)],[c_0_137,c_0_139]),
[final] ).
cnf(c_0_168,axiom,
( specific(X1,X2)
| ~ entity(X1,X2) ),
clause8,
[final] ).
cnf(c_0_169,negated_conjecture,
( member(skc5,skf5(skc5,X1),X1)
| ~ ssSkP0(X1,skc5)
| ~ of(skc5,X2,skc8)
| ~ hollywood_placename(skc5,X2)
| ~ two(skc5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_142]),c_0_89])]),
[final] ).
cnf(c_0_170,negated_conjecture,
( X1 = skf8(X2,X3)
| ssSkP0(X3,X2)
| two(X2,X3)
| member(X2,skf13(X1,skf8(X2,X3),X3,X2),X3)
| ~ member(X2,X1,X3) ),
inference(spm,[status(thm)],[c_0_143,c_0_144]),
[final] ).
cnf(c_0_171,negated_conjecture,
( X1 = skc9
| ~ of(skc5,X1,skc8)
| ~ placename(skc5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_91]),c_0_138])]),
[final] ).
cnf(c_0_172,negated_conjecture,
( ~ ssSkP0(X1,X2)
| ~ agent(X2,X3,X4)
| ~ in(X2,X3,X4)
| ~ down(X2,X3,X5)
| ~ white(X2,X4)
| ~ dirty(X2,X4)
| ~ present(X2,X3)
| ~ lonely(X2,X5)
| ~ actual_world(X2)
| ~ of(X2,X6,X4)
| ~ young(X2,skf5(X2,X7))
| ~ old(X2,X4)
| ~ city(X2,X4)
| ~ hollywood_placename(X2,X6)
| ~ street(X2,X5)
| ~ chevy(X2,X4)
| ~ barrel(X2,X3)
| ~ two(X2,X1)
| ~ fellow(X2,skf5(X2,X7)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_147,c_0_107]),c_0_108]),c_0_109]),
[final] ).
cnf(c_0_173,axiom,
( two(X5,X6)
| X1 = X7
| skf13(X1,X2,X3,X4) != X1
| ~ member(X5,X1,X6)
| ~ member(X5,X7,X6) ),
clause65,
[final] ).
cnf(c_0_174,axiom,
( two(X5,X6)
| X1 = X2
| skf13(X1,X2,X3,X4) != X2
| ~ member(X5,X1,X6)
| ~ member(X5,X2,X6) ),
clause64,
[final] ).
cnf(c_0_175,axiom,
( X2 = skf10(X3,X1)
| X2 = skf12(X3,X1)
| ~ member(X1,X2,X3)
| ~ two(X1,X3) ),
clause63,
[final] ).
cnf(c_0_176,negated_conjecture,
( ssSkP0(X5,X1)
| ~ frontseat(X1,X2)
| ~ in(X1,X2,X2)
| ~ be(X1,X3,skf8(X1,X4),X2)
| ~ state(X1,X3) ),
clause86,
[final] ).
cnf(c_0_177,axiom,
( member(X1,skf10(X2,X1),X2)
| ~ two(X1,X2) ),
clause61,
[final] ).
cnf(c_0_178,axiom,
( member(X1,skf12(X2,X1),X2)
| ~ two(X1,X2) ),
clause60,
[final] ).
cnf(c_0_179,axiom,
( multiple(X1,X2)
| ~ set(X1,X2) ),
clause16,
[final] ).
cnf(c_0_180,axiom,
( male(X1,X2)
| ~ man(X1,X2) ),
clause14,
[final] ).
cnf(c_0_181,axiom,
( animate(X1,X2)
| ~ human_person(X1,X2) ),
clause13,
[final] ).
cnf(c_0_182,axiom,
( human(X1,X2)
| ~ human_person(X1,X2) ),
clause12,
[final] ).
cnf(c_0_183,axiom,
( living(X1,X2)
| ~ organism(X1,X2) ),
clause11,
[final] ).
cnf(c_0_184,axiom,
( impartial(X1,X2)
| ~ organism(X1,X2) ),
clause10,
[final] ).
cnf(c_0_185,axiom,
( X3 = X4
| ~ be(X1,X2,X3,X4) ),
clause59,
[final] ).
cnf(c_0_186,axiom,
( skf12(X1,X2) != skf10(X1,X2)
| ~ two(X2,X1) ),
clause62,
[final] ).
cnf(c_0_187,axiom,
( furniture(X1,X2)
| ~ seat(X1,X2) ),
clause49,
[final] ).
cnf(c_0_188,axiom,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
clause50,
[final] ).
cnf(c_0_189,axiom,
( organism(X1,X2)
| ~ human_person(X1,X2) ),
clause4,
[final] ).
cnf(c_0_190,axiom,
( set(X1,X2)
| ~ group(X1,X2) ),
clause15,
[final] ).
cnf(c_0_191,axiom,
( seat(X1,X2)
| ~ frontseat(X1,X2) ),
clause48,
[final] ).
cnf(c_0_192,axiom,
( eventuality(X1,X2)
| ~ state(X1,X2) ),
clause18,
[final] ).
cnf(c_0_193,axiom,
( entity(X1,X2)
| ~ organism(X1,X2) ),
clause5,
[final] ).
cnf(c_0_194,axiom,
( human_person(X1,X2)
| ~ man(X1,X2) ),
clause3,
[final] ).
cnf(c_0_195,axiom,
( man(X1,X2)
| ~ fellow(X1,X2) ),
clause2,
[final] ).
cnf(c_0_196,axiom,
( event(X1,X2)
| ~ state(X1,X2) ),
clause23,
[final] ).
cnf(c_0_197,axiom,
( ~ old(X1,X2)
| ~ young(X1,X2) ),
clause51,
[final] ).
cnf(c_0_198,axiom,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
clause52,
[final] ).
cnf(c_0_199,axiom,
( ~ nonliving(X1,X2)
| ~ animate(X1,X2) ),
clause58,
[final] ).
cnf(c_0_200,axiom,
( ~ living(X1,X2)
| ~ nonliving(X1,X2) ),
clause55,
[final] ).
cnf(c_0_201,axiom,
( ~ multiple(X1,X2)
| ~ singleton(X1,X2) ),
clause54,
[final] ).
cnf(c_0_202,negated_conjecture,
~ specific(skc5,skc9),
inference(spm,[status(thm)],[c_0_148,c_0_149]),
[final] ).
cnf(c_0_203,negated_conjecture,
~ human(skc5,skc9),
inference(spm,[status(thm)],[c_0_150,c_0_151]),
[final] ).
cnf(c_0_204,negated_conjecture,
~ existent(skc5,skc6),
inference(spm,[status(thm)],[c_0_152,c_0_153]),
[final] ).
cnf(c_0_205,axiom,
~ member(X1,X2,X2),
clause1,
[final] ).
cnf(c_0_206,negated_conjecture,
singleton(skc5,skc9),
inference(spm,[status(thm)],[c_0_154,c_0_155]),
[final] ).
cnf(c_0_207,negated_conjecture,
unisex(skc5,skc9),
inference(spm,[status(thm)],[c_0_156,c_0_129]),
[final] ).
cnf(c_0_208,negated_conjecture,
artifact(skc5,skc8),
inference(spm,[status(thm)],[c_0_157,c_0_158]),
[final] ).
cnf(c_0_209,negated_conjecture,
nonliving(skc5,skc7),
inference(spm,[status(thm)],[c_0_159,c_0_118]),
[final] ).
cnf(c_0_210,negated_conjecture,
nonliving(skc5,skc8),
inference(spm,[status(thm)],[c_0_159,c_0_117]),
[final] ).
cnf(c_0_211,negated_conjecture,
unisex(skc5,skc7),
inference(spm,[status(thm)],[c_0_160,c_0_118]),
[final] ).
cnf(c_0_212,negated_conjecture,
unisex(skc5,skc8),
inference(spm,[status(thm)],[c_0_160,c_0_117]),
[final] ).
cnf(c_0_213,negated_conjecture,
unisex(skc5,skc6),
inference(spm,[status(thm)],[c_0_161,c_0_132]),
[final] ).
cnf(c_0_214,negated_conjecture,
impartial(skc5,skc7),
inference(spm,[status(thm)],[c_0_162,c_0_118]),
[final] ).
cnf(c_0_215,negated_conjecture,
impartial(skc5,skc8),
inference(spm,[status(thm)],[c_0_162,c_0_117]),
[final] ).
cnf(c_0_216,negated_conjecture,
existent(skc5,skc7),
inference(spm,[status(thm)],[c_0_163,c_0_139]),
[final] ).
cnf(c_0_217,negated_conjecture,
existent(skc5,skc8),
inference(spm,[status(thm)],[c_0_163,c_0_138]),
[final] ).
cnf(c_0_218,negated_conjecture,
specific(skc5,skc6),
inference(spm,[status(thm)],[c_0_164,c_0_132]),
[final] ).
cnf(c_0_219,negated_conjecture,
singleton(skc5,skc6),
inference(spm,[status(thm)],[c_0_154,c_0_165]),
[final] ).
cnf(c_0_220,negated_conjecture,
singleton(skc5,skc8),
inference(spm,[status(thm)],[c_0_154,c_0_166]),
[final] ).
cnf(c_0_221,negated_conjecture,
singleton(skc5,skc7),
inference(spm,[status(thm)],[c_0_154,c_0_167]),
[final] ).
cnf(c_0_222,negated_conjecture,
specific(skc5,skc7),
inference(spm,[status(thm)],[c_0_168,c_0_139]),
[final] ).
cnf(c_0_223,negated_conjecture,
specific(skc5,skc8),
inference(spm,[status(thm)],[c_0_168,c_0_138]),
[final] ).
cnf(c_0_224,negated_conjecture,
hollywood_placename(skc5,skc9),
clause69,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP153-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 11:02:44 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.WzMTXHap81/E---3.1_16543.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16621 completed with status 1
% 0.20/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.20/0.51 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.20/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 16625 completed with status 9
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 130s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 16631 completed with status 1
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.20/0.51 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # No proof found!
% 0.20/0.51 # SZS status Satisfiable
% 0.20/0.51 # SZS output start Saturation
% See solution above
% 0.20/0.51 # Parsed axioms : 88
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 88
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 88
% 0.20/0.51 # Processed clauses : 223
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 223
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 1
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 50
% 0.20/0.51 # ...of the previous two non-redundant : 47
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 6
% 0.20/0.51 # Paramodulations : 50
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 16
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 134
% 0.20/0.51 # Positive orientable unit clauses : 57
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 4
% 0.20/0.51 # Non-unit-clauses : 73
% 0.20/0.51 # Current number of unprocessed clauses: 0
% 0.20/0.51 # ...number of literals in the above : 0
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 89
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 7848
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 2485
% 0.20/0.51 # Non-unit clause-clause subsumptions : 7
% 0.20/0.51 # Unit Clause-clause subsumption calls : 108
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 2846
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.024 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.029 s
% 0.20/0.51 # Maximum resident set size: 1796 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.063 s
% 0.20/0.51 # System time : 0.010 s
% 0.20/0.51 # Total time : 0.073 s
% 0.20/0.51 # Maximum resident set size: 1752 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------