TSTP Solution File: NLP234-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP234-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Tue May 21 00:55:26 EDT 2024
% Result : Satisfiable 0.17s 0.48s
% Output : Saturation 0.17s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_88,negated_conjecture,
actual_world(skc47),
clause1,
[final] ).
cnf(c_0_156,negated_conjecture,
actual_world(skc29),
clause2,
[final] ).
cnf(c_0_243,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_130]),c_0_131]),c_0_132]),
[final] ).
cnf(c_0_257,negated_conjecture,
( ~ be(X1,X2,X3,X3)
| ~ agent(X4,X5,skf7(X4))
| ~ agent(X6,X7,X8)
| ~ agent(X1,X9,X10)
| ~ agent(X1,X11,X8)
| ~ theme(X1,X9,X6)
| ~ theme(X1,X11,X4)
| ~ of(X1,X12,X10)
| ~ of(X1,X13,X8)
| ~ of(X1,X14,X8)
| ~ of(X1,X15,X3)
| ~ smoke(X4,X5)
| ~ smoke(X6,X7)
| ~ vincent_forename(X1,X12)
| ~ vincent_forename(X1,X14)
| ~ think_believe_consider(X1,X9)
| ~ think_believe_consider(X1,X11)
| ~ present(X4,X5)
| ~ present(X6,X7)
| ~ present(X1,X9)
| ~ present(X1,X11)
| ~ event(X4,X5)
| ~ event(X6,X7)
| ~ event(X1,X9)
| ~ event(X1,X11)
| ~ accessible_world(X1,X4)
| ~ accessible_world(X1,X6)
| ~ proposition(X1,X4)
| ~ proposition(X1,X6)
| ~ forename(X1,X12)
| ~ forename(X1,X13)
| ~ forename(X1,X14)
| ~ forename(X1,X15)
| ~ jules_forename(X1,X13)
| ~ jules_forename(X1,X15)
| ~ man(X1,X10)
| ~ man(X1,X8)
| ~ man(X1,X3)
| ~ state(X1,X2)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_227,c_0_243])]),
[final] ).
cnf(c_0_258,negated_conjecture,
( man(X1,skf7(X1))
| ~ be(X2,X3,X4,X4)
| ~ agent(X5,X6,X7)
| ~ agent(X2,X8,X9)
| ~ agent(X2,X10,X7)
| ~ theme(X2,X8,X5)
| ~ theme(X2,X10,X1)
| ~ of(X2,X11,X9)
| ~ of(X2,X12,X7)
| ~ of(X2,X13,X7)
| ~ of(X2,X14,X4)
| ~ smoke(X5,X6)
| ~ vincent_forename(X2,X11)
| ~ vincent_forename(X2,X13)
| ~ think_believe_consider(X2,X8)
| ~ think_believe_consider(X2,X10)
| ~ present(X5,X6)
| ~ present(X2,X8)
| ~ present(X2,X10)
| ~ event(X5,X6)
| ~ event(X2,X8)
| ~ event(X2,X10)
| ~ accessible_world(X2,X1)
| ~ accessible_world(X2,X5)
| ~ proposition(X2,X1)
| ~ proposition(X2,X5)
| ~ forename(X2,X11)
| ~ forename(X2,X12)
| ~ forename(X2,X13)
| ~ forename(X2,X14)
| ~ jules_forename(X2,X12)
| ~ jules_forename(X2,X14)
| ~ man(X2,X9)
| ~ man(X2,X7)
| ~ man(X2,X4)
| ~ state(X2,X3)
| ~ actual_world(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_154,c_0_243])]),
[final] ).
cnf(c_0_259,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc29,X2,X3)
| ~ agent(skc29,X4,X5)
| ~ agent(X6,X7,X5)
| ~ theme(skc29,X2,X6)
| ~ theme(skc29,X4,X1)
| ~ of(skc29,X8,X3)
| ~ of(skc29,X9,X5)
| ~ of(skc29,X10,X5)
| ~ smoke(X6,X7)
| ~ vincent_forename(skc29,X8)
| ~ vincent_forename(skc29,X10)
| ~ think_believe_consider(skc29,X2)
| ~ think_believe_consider(skc29,X4)
| ~ present(skc29,X2)
| ~ present(skc29,X4)
| ~ present(X6,X7)
| ~ event(skc29,X2)
| ~ event(skc29,X4)
| ~ event(X6,X7)
| ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X6)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X6)
| ~ forename(skc29,X8)
| ~ forename(skc29,X9)
| ~ forename(skc29,X10)
| ~ jules_forename(skc29,X9)
| ~ man(skc29,X3)
| ~ man(skc29,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_178,c_0_243])]),
[final] ).
cnf(c_0_260,negated_conjecture,
( ~ be(X1,X2,X3,X3)
| ~ agent(X4,X5,X6)
| ~ agent(X1,X7,X8)
| ~ agent(X1,X9,X6)
| ~ theme(X1,X9,skc40)
| ~ theme(X1,X7,X4)
| ~ of(X1,X10,X8)
| ~ of(X1,X11,X6)
| ~ of(X1,X12,X6)
| ~ of(X1,X13,X3)
| ~ smoke(skc40,skf5(skf7(skc40)))
| ~ smoke(X4,X5)
| ~ vincent_forename(X1,X10)
| ~ vincent_forename(X1,X12)
| ~ think_believe_consider(X1,X7)
| ~ think_believe_consider(X1,X9)
| ~ present(skc40,skf5(skf7(skc40)))
| ~ present(X4,X5)
| ~ present(X1,X7)
| ~ present(X1,X9)
| ~ event(skc40,skf5(skf7(skc40)))
| ~ event(X4,X5)
| ~ event(X1,X7)
| ~ event(X1,X9)
| ~ accessible_world(X1,skc40)
| ~ accessible_world(X1,X4)
| ~ proposition(X1,skc40)
| ~ proposition(X1,X4)
| ~ forename(X1,X10)
| ~ forename(X1,X11)
| ~ forename(X1,X12)
| ~ forename(X1,X13)
| ~ jules_forename(X1,X11)
| ~ jules_forename(X1,X13)
| ~ man(X1,X8)
| ~ man(X1,X6)
| ~ man(X1,X3)
| ~ state(X1,X2)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_244,c_0_243])]),
[final] ).
cnf(c_0_261,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc29,X2,X3)
| ~ agent(X4,X5,X3)
| ~ theme(skc29,skc31,X4)
| ~ theme(skc29,X2,X1)
| ~ of(skc29,X6,skc33)
| ~ of(skc29,X7,X3)
| ~ of(skc29,X8,X3)
| ~ smoke(X4,X5)
| ~ vincent_forename(skc29,X6)
| ~ vincent_forename(skc29,X8)
| ~ think_believe_consider(skc29,X2)
| ~ present(skc29,X2)
| ~ present(X4,X5)
| ~ event(skc29,X2)
| ~ event(X4,X5)
| ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X4)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X4)
| ~ forename(skc29,X6)
| ~ forename(skc29,X7)
| ~ forename(skc29,X8)
| ~ jules_forename(skc29,X7)
| ~ man(skc29,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_204,c_0_243])]),
[final] ).
cnf(c_0_262,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc29,X2,X3)
| ~ agent(X4,X5,X3)
| ~ theme(skc29,skc41,X4)
| ~ theme(skc29,X2,X1)
| ~ of(skc29,X6,skc43)
| ~ of(skc29,X7,X3)
| ~ of(skc29,X8,X3)
| ~ smoke(X4,X5)
| ~ vincent_forename(skc29,X6)
| ~ vincent_forename(skc29,X8)
| ~ think_believe_consider(skc29,X2)
| ~ present(skc29,X2)
| ~ present(X4,X5)
| ~ event(skc29,X2)
| ~ event(X4,X5)
| ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X4)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X4)
| ~ forename(skc29,X6)
| ~ forename(skc29,X7)
| ~ forename(skc29,X8)
| ~ jules_forename(skc29,X7)
| ~ man(skc29,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_196,c_0_243])]),
[final] ).
cnf(c_0_263,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc29,X2,X3)
| ~ agent(skc30,X4,X3)
| ~ theme(skc29,X2,X1)
| ~ of(skc29,X5,X3)
| ~ of(skc29,X6,X3)
| ~ smoke(skc30,X4)
| ~ vincent_forename(skc29,X6)
| ~ think_believe_consider(skc29,X2)
| ~ present(skc29,X2)
| ~ present(skc30,X4)
| ~ event(skc29,X2)
| ~ event(skc30,X4)
| ~ accessible_world(skc29,X1)
| ~ proposition(skc29,X1)
| ~ forename(skc29,X5)
| ~ forename(skc29,X6)
| ~ jules_forename(skc29,X5)
| ~ man(skc29,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_243])]),
[final] ).
cnf(c_0_264,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc30,X2,skc33)
| ~ theme(skc29,skc31,X1)
| ~ of(skc29,X3,skc33)
| ~ of(skc29,X4,skc33)
| ~ smoke(skc30,X2)
| ~ vincent_forename(skc29,X4)
| ~ present(skc30,X2)
| ~ event(skc30,X2)
| ~ accessible_world(skc29,X1)
| ~ proposition(skc29,X1)
| ~ forename(skc29,X3)
| ~ forename(skc29,X4)
| ~ jules_forename(skc29,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_243])]),
[final] ).
cnf(c_0_265,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc29,X2,X3)
| ~ agent(skc40,X4,X3)
| ~ theme(skc29,X2,X1)
| ~ of(skc29,X5,X3)
| ~ of(skc29,X6,X3)
| ~ smoke(skc40,X4)
| ~ vincent_forename(skc29,X6)
| ~ think_believe_consider(skc29,X2)
| ~ present(skc29,X2)
| ~ present(skc40,X4)
| ~ event(skc29,X2)
| ~ event(skc40,X4)
| ~ accessible_world(skc29,X1)
| ~ proposition(skc29,X1)
| ~ forename(skc29,X5)
| ~ forename(skc29,X6)
| ~ jules_forename(skc29,X5)
| ~ man(skc29,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_243])]),
[final] ).
cnf(c_0_266,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc30,X2,skc43)
| ~ theme(skc29,skc41,X1)
| ~ of(skc29,X3,skc43)
| ~ of(skc29,X4,skc43)
| ~ smoke(skc30,X2)
| ~ vincent_forename(skc29,X4)
| ~ present(skc30,X2)
| ~ event(skc30,X2)
| ~ accessible_world(skc29,X1)
| ~ proposition(skc29,X1)
| ~ forename(skc29,X3)
| ~ forename(skc29,X4)
| ~ jules_forename(skc29,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_246,c_0_243])]),
[final] ).
cnf(c_0_267,negated_conjecture,
( agent(skc40,skf5(X1),X1)
| ~ man(skc40,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_243])]),
[final] ).
cnf(c_0_268,negated_conjecture,
( event(skc40,skf5(X1))
| ~ man(skc40,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_243])]),
[final] ).
cnf(c_0_269,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc40,X2,skc33)
| ~ theme(skc29,skc31,X1)
| ~ of(skc29,X3,skc33)
| ~ of(skc29,X4,skc33)
| ~ smoke(skc40,X2)
| ~ vincent_forename(skc29,X4)
| ~ present(skc40,X2)
| ~ event(skc40,X2)
| ~ accessible_world(skc29,X1)
| ~ proposition(skc29,X1)
| ~ forename(skc29,X3)
| ~ forename(skc29,X4)
| ~ jules_forename(skc29,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_243])]),
[final] ).
cnf(c_0_270,negated_conjecture,
( present(skc40,skf5(X1))
| ~ man(skc40,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_232,c_0_243])]),
[final] ).
cnf(c_0_271,negated_conjecture,
( smoke(skc40,skf5(X1))
| ~ man(skc40,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_243])]),
[final] ).
cnf(c_0_272,negated_conjecture,
( man(X1,skf7(X1))
| ~ theme(skc29,skc31,X1)
| ~ of(skc29,X2,skc33)
| ~ of(skc29,X3,skc33)
| ~ vincent_forename(skc29,X3)
| ~ accessible_world(skc29,X1)
| ~ proposition(skc29,X1)
| ~ forename(skc29,X2)
| ~ forename(skc29,X3)
| ~ jules_forename(skc29,X2)
| ~ man(skc40,skc33) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_247,c_0_243])]),
[final] ).
cnf(c_0_273,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc40,X2,skc43)
| ~ theme(skc29,skc41,X1)
| ~ of(skc29,X3,skc43)
| ~ of(skc29,X4,skc43)
| ~ smoke(skc40,X2)
| ~ vincent_forename(skc29,X4)
| ~ present(skc40,X2)
| ~ event(skc40,X2)
| ~ accessible_world(skc29,X1)
| ~ proposition(skc29,X1)
| ~ forename(skc29,X3)
| ~ forename(skc29,X4)
| ~ jules_forename(skc29,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_243])]),
[final] ).
cnf(c_0_274,negated_conjecture,
( man(X1,skf7(X1))
| ~ theme(skc29,skc41,X1)
| ~ of(skc29,X2,skc43)
| ~ of(skc29,X3,skc43)
| ~ vincent_forename(skc29,X3)
| ~ accessible_world(skc29,X1)
| ~ proposition(skc29,X1)
| ~ forename(skc29,X2)
| ~ forename(skc29,X3)
| ~ jules_forename(skc29,X2)
| ~ man(skc40,skc43) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_248,c_0_243])]),
[final] ).
cnf(c_0_275,negated_conjecture,
be(skc29,skc37,skc38,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_243])]),
[final] ).
cnf(c_0_276,negated_conjecture,
of(skc29,skc42,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_243])]),
[final] ).
cnf(c_0_277,negated_conjecture,
of(skc29,skc39,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_243])]),
[final] ).
cnf(c_0_278,negated_conjecture,
of(skc29,skc34,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_249,c_0_243])]),
[final] ).
cnf(c_0_279,negated_conjecture,
of(skc29,skc32,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_243])]),
[final] ).
cnf(c_0_280,negated_conjecture,
theme(skc29,skc41,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_197,c_0_243])]),
[final] ).
cnf(c_0_281,negated_conjecture,
theme(skc29,skc31,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_205,c_0_243])]),
[final] ).
cnf(c_0_282,negated_conjecture,
agent(skc29,skc41,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_243])]),
[final] ).
cnf(c_0_283,negated_conjecture,
agent(skc29,skc31,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_188,c_0_243])]),
[final] ).
cnf(c_0_284,negated_conjecture,
agent(skc30,skc36,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_250,c_0_243])]),
[final] ).
cnf(c_0_285,negated_conjecture,
state(skc29,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_157,c_0_243])]),
[final] ).
cnf(c_0_286,negated_conjecture,
man(skc29,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_180,c_0_243])]),
[final] ).
cnf(c_0_287,negated_conjecture,
man(skc29,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_158,c_0_243])]),
[final] ).
cnf(c_0_288,negated_conjecture,
man(skc29,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_251,c_0_243])]),
[final] ).
cnf(c_0_289,negated_conjecture,
man(skc29,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_189,c_0_243])]),
[final] ).
cnf(c_0_290,negated_conjecture,
jules_forename(skc29,skc39),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_165,c_0_243])]),
[final] ).
cnf(c_0_291,negated_conjecture,
jules_forename(skc29,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_252,c_0_243])]),
[final] ).
cnf(c_0_292,negated_conjecture,
forename(skc29,skc42),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_243])]),
[final] ).
cnf(c_0_293,negated_conjecture,
forename(skc29,skc39),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_243])]),
[final] ).
cnf(c_0_294,negated_conjecture,
forename(skc29,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_253,c_0_243])]),
[final] ).
cnf(c_0_295,negated_conjecture,
forename(skc29,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_243])]),
[final] ).
cnf(c_0_296,negated_conjecture,
proposition(skc29,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_198,c_0_243])]),
[final] ).
cnf(c_0_297,negated_conjecture,
proposition(skc29,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_206,c_0_243])]),
[final] ).
cnf(c_0_298,negated_conjecture,
accessible_world(skc29,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_199,c_0_243])]),
[final] ).
cnf(c_0_299,negated_conjecture,
accessible_world(skc29,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_207,c_0_243])]),
[final] ).
cnf(c_0_300,negated_conjecture,
event(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_181,c_0_243])]),
[final] ).
cnf(c_0_301,negated_conjecture,
event(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_190,c_0_243])]),
[final] ).
cnf(c_0_302,negated_conjecture,
event(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_254,c_0_243])]),
[final] ).
cnf(c_0_303,negated_conjecture,
present(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_182,c_0_243])]),
[final] ).
cnf(c_0_304,negated_conjecture,
present(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_191,c_0_243])]),
[final] ).
cnf(c_0_305,negated_conjecture,
present(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_255,c_0_243])]),
[final] ).
cnf(c_0_306,negated_conjecture,
think_believe_consider(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_243])]),
[final] ).
cnf(c_0_307,negated_conjecture,
think_believe_consider(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_192,c_0_243])]),
[final] ).
cnf(c_0_308,negated_conjecture,
vincent_forename(skc29,skc42),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_214,c_0_243])]),
[final] ).
cnf(c_0_309,negated_conjecture,
vincent_forename(skc29,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_243])]),
[final] ).
cnf(c_0_310,negated_conjecture,
smoke(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_256,c_0_243])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NLP234-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n015.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Sun May 19 22:22:23 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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/benchmark/theBenchmark.p
% 0.17/0.48 # Version: 3.1.0
% 0.17/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2436 completed with status 1
% 0.17/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.48 # Starting sh5l with 136s (1) cores
% 0.17/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2444 completed with status 1
% 0.17/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.48 # Preprocessing time : 0.004 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # No proof found!
% 0.17/0.48 # SZS status Satisfiable
% 0.17/0.48 # SZS output start Saturation
% See solution above
% 0.17/0.48 # Parsed axioms : 85
% 0.17/0.48 # Removed by relevancy pruning/SinE : 0
% 0.17/0.48 # Initial clauses : 85
% 0.17/0.48 # Removed in clause preprocessing : 0
% 0.17/0.48 # Initial clauses in saturation : 85
% 0.17/0.48 # Processed clauses : 299
% 0.17/0.48 # ...of these trivial : 4
% 0.17/0.48 # ...subsumed : 14
% 0.17/0.48 # ...remaining for further processing : 281
% 0.17/0.48 # Other redundant clauses eliminated : 0
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 33
% 0.17/0.48 # Backward-rewritten : 106
% 0.17/0.48 # Generated clauses : 81
% 0.17/0.48 # ...of the previous two non-redundant : 135
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 138
% 0.17/0.48 # Paramodulations : 81
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 0
% 0.17/0.48 # Disequality decompositions : 0
% 0.17/0.48 # Total rewrite steps : 143
% 0.17/0.48 # ...of those cached : 126
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 57
% 0.17/0.48 # Positive orientable unit clauses : 39
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 0
% 0.17/0.48 # Non-unit-clauses : 18
% 0.17/0.48 # Current number of unprocessed clauses: 0
% 0.17/0.48 # ...number of literals in the above : 0
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 224
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 30432
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 2379
% 0.17/0.48 # Non-unit clause-clause subsumptions : 185
% 0.17/0.48 # Unit Clause-clause subsumption calls : 0
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 3
% 0.17/0.48 # BW rewrite match successes : 1
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 14319
% 0.17/0.48 # Search garbage collected termcells : 466
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.034 s
% 0.17/0.48 # System time : 0.006 s
% 0.17/0.48 # Total time : 0.040 s
% 0.17/0.48 # Maximum resident set size: 1920 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.170 s
% 0.17/0.48 # System time : 0.020 s
% 0.17/0.48 # Total time : 0.190 s
% 0.17/0.48 # Maximum resident set size: 1900 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E exiting
%------------------------------------------------------------------------------