%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP191-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:31 PM UTC 2026
% Result : Satisfiable 0.10s 0.48s
% Output : Saturation 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1ERROR: Could not build tree for root c_0_95ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_95,negated_conjecture,
actual_world(skc73),
clause1,
[final] ).
cnf(c_0_164,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_117]),c_0_94]),
[final] ).
cnf(c_0_171,negated_conjecture,
( ~ actual_world(X1)
| ~ group(X1,X2)
| ~ group(X1,X12)
| ~ two(X1,X12)
| ~ ssSkP0(X12,X1)
| ~ frontseat(X1,X11)
| ~ barrel(X1,X9)
| ~ present(X1,X9)
| ~ event(X1,X9)
| ~ wheel(X1,X10)
| ~ chevy(X1,X10)
| ~ white(X1,X10)
| ~ dirty(X1,X10)
| ~ old(X1,X10)
| ~ city(X1,X8)
| ~ street(X1,X8)
| ~ lonely(X1,X8)
| ~ placename(X1,X7)
| ~ hollywood_placename(X1,X7)
| ~ jules_forename(X1,X6)
| ~ forename(X1,X6)
| ~ man(X1,X4)
| ~ state(X1,X3)
| ~ ssSkP2(X12,X2,X1)
| ~ ssSkP1(X11,X12,X1)
| ~ agent(X1,X9,X10)
| ~ behind(X1,X5,X10)
| ~ down(X1,X9,X8)
| ~ in(X1,X9,X8)
| ~ of(X1,X7,X8)
| ~ of(X1,X6,X4)
| ~ be(X1,X3,X4,X5)
| member(X1,skf10(X1,X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_164])]),
[final] ).
cnf(c_0_172,negated_conjecture,
be(skc25,skc27,skc29,skc26),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_165,c_0_164])]),
[final] ).
cnf(c_0_173,negated_conjecture,
state(skc25,skc27),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_164])]),
[final] ).
cnf(c_0_174,negated_conjecture,
man(skc25,skc29),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_167,c_0_164])]),
[final] ).
cnf(c_0_175,negated_conjecture,
actual_world(skc25),
clause2,
[final] ).
cnf(c_0_182,negated_conjecture,
forename(skc25,skc28),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_176,c_0_164])]),
[final] ).
cnf(c_0_183,negated_conjecture,
of(skc25,skc28,skc29),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_177,c_0_164])]),
[final] ).
cnf(c_0_184,negated_conjecture,
jules_forename(skc25,skc28),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_178,c_0_164])]),
[final] ).
cnf(c_0_191,negated_conjecture,
( ~ group(skc25,X1)
| ~ group(skc25,X7)
| ~ two(skc25,X7)
| ~ ssSkP0(X7,skc25)
| ~ frontseat(skc25,X6)
| ~ barrel(skc25,X4)
| ~ present(skc25,X4)
| ~ event(skc25,X4)
| ~ wheel(skc25,X5)
| ~ chevy(skc25,X5)
| ~ white(skc25,X5)
| ~ dirty(skc25,X5)
| ~ old(skc25,X5)
| ~ city(skc25,X3)
| ~ street(skc25,X3)
| ~ lonely(skc25,X3)
| ~ placename(skc25,X2)
| ~ hollywood_placename(skc25,X2)
| ~ ssSkP2(X7,X1,skc25)
| ~ ssSkP1(X6,X7,skc25)
| ~ agent(skc25,X4,X5)
| ~ behind(skc25,skc26,X5)
| ~ down(skc25,X4,X3)
| ~ in(skc25,X4,X3)
| ~ of(skc25,X2,X3)
| member(skc25,skf10(skc25,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_182]),c_0_183]),c_0_184])]),
[final] ).
cnf(c_0_192,negated_conjecture,
hollywood_placename(skc25,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_185,c_0_164])]),
[final] ).
cnf(c_0_193,negated_conjecture,
placename(skc25,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_186,c_0_164])]),
[final] ).
cnf(c_0_202,negated_conjecture,
( ~ group(skc25,X1)
| ~ group(skc25,X6)
| ~ two(skc25,X6)
| ~ ssSkP0(X6,skc25)
| ~ frontseat(skc25,X5)
| ~ barrel(skc25,X3)
| ~ present(skc25,X3)
| ~ event(skc25,X3)
| ~ wheel(skc25,X4)
| ~ chevy(skc25,X4)
| ~ white(skc25,X4)
| ~ dirty(skc25,X4)
| ~ old(skc25,X4)
| ~ city(skc25,X2)
| ~ street(skc25,X2)
| ~ lonely(skc25,X2)
| ~ ssSkP2(X6,X1,skc25)
| ~ ssSkP1(X5,X6,skc25)
| ~ agent(skc25,X3,X4)
| ~ behind(skc25,skc26,X4)
| ~ down(skc25,X3,X2)
| ~ in(skc25,X3,X2)
| ~ of(skc25,skc36,X2)
| member(skc25,skf10(skc25,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_192]),c_0_193])]),
[final] ).
cnf(c_0_203,negated_conjecture,
lonely(skc25,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_194,c_0_164])]),
[final] ).
cnf(c_0_204,negated_conjecture,
of(skc25,skc36,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_195,c_0_164])]),
[final] ).
cnf(c_0_205,negated_conjecture,
street(skc25,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_196,c_0_164])]),
[final] ).
cnf(c_0_206,negated_conjecture,
city(skc25,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_197,c_0_164])]),
[final] ).
cnf(c_0_230,negated_conjecture,
( ~ group(skc25,X1)
| ~ group(skc25,X5)
| ~ two(skc25,X5)
| ~ ssSkP0(X5,skc25)
| ~ frontseat(skc25,X4)
| ~ barrel(skc25,X2)
| ~ present(skc25,X2)
| ~ event(skc25,X2)
| ~ wheel(skc25,X3)
| ~ chevy(skc25,X3)
| ~ white(skc25,X3)
| ~ dirty(skc25,X3)
| ~ old(skc25,X3)
| ~ ssSkP2(X5,X1,skc25)
| ~ ssSkP1(X4,X5,skc25)
| ~ agent(skc25,X2,X3)
| ~ behind(skc25,skc26,X3)
| ~ down(skc25,X2,skc35)
| ~ in(skc25,X2,skc35)
| member(skc25,skf10(skc25,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_203]),c_0_204]),c_0_205]),c_0_206])]),
[final] ).
cnf(c_0_231,negated_conjecture,
old(skc25,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_207,c_0_164])]),
[final] ).
cnf(c_0_232,negated_conjecture,
dirty(skc25,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_208,c_0_164])]),
[final] ).
cnf(c_0_233,negated_conjecture,
white(skc25,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_209,c_0_164])]),
[final] ).
cnf(c_0_234,negated_conjecture,
chevy(skc25,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_164])]),
[final] ).
cnf(c_0_268,negated_conjecture,
( ~ group(skc25,X1)
| ~ group(skc25,X4)
| ~ two(skc25,X4)
| ~ ssSkP0(X4,skc25)
| ~ frontseat(skc25,X3)
| ~ barrel(skc25,X2)
| ~ present(skc25,X2)
| ~ event(skc25,X2)
| ~ wheel(skc25,skc37)
| ~ ssSkP2(X4,X1,skc25)
| ~ ssSkP1(X3,X4,skc25)
| ~ agent(skc25,X2,skc37)
| ~ behind(skc25,skc26,skc37)
| ~ down(skc25,X2,skc35)
| ~ in(skc25,X2,skc35)
| member(skc25,skf10(skc25,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232]),c_0_233]),c_0_234])]),
[final] ).
cnf(c_0_269,negated_conjecture,
( ~ member(skc25,X1,skc31)
| coat(skc25,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_235,c_0_164])]),
[final] ).
cnf(c_0_270,negated_conjecture,
( ~ member(skc25,X1,skc31)
| black(skc25,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_164])]),
[final] ).
cnf(c_0_271,negated_conjecture,
( ~ member(skc25,X1,skc31)
| cheap(skc25,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_164])]),
[final] ).
cnf(c_0_272,negated_conjecture,
( ~ actual_world(X1)
| ~ group(X1,X13)
| ~ group(X1,X12)
| ~ two(X1,X12)
| ~ ssSkP0(X12,X1)
| ~ frontseat(X1,X11)
| ~ barrel(X1,X9)
| ~ present(X1,X9)
| ~ event(X1,X9)
| ~ wheel(X1,X10)
| ~ chevy(X1,X10)
| ~ white(X1,X10)
| ~ dirty(X1,X10)
| ~ old(X1,X10)
| ~ city(X1,X8)
| ~ street(X1,X8)
| ~ lonely(X1,X8)
| ~ placename(X1,X7)
| ~ hollywood_placename(X1,X7)
| ~ jules_forename(X1,X6)
| ~ forename(X1,X6)
| ~ man(X1,X4)
| ~ state(X1,X3)
| ~ ssSkP2(X12,X13,X1)
| ~ ssSkP1(X11,X12,X1)
| ~ agent(X1,X9,X10)
| ~ behind(X1,X5,X10)
| ~ down(X1,X9,X8)
| ~ in(X1,X9,X8)
| ~ of(X1,X7,X8)
| ~ of(X1,X6,X4)
| ~ be(X1,X3,X4,X5)
| ~ coat(X1,skf10(X1,X2))
| ~ black(X1,skf10(X1,X2))
| ~ cheap(X1,skf10(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_164])]),
[final] ).
cnf(c_0_273,negated_conjecture,
( ~ event(X1,X2)
| ~ agent(X1,X2,skf21(X3,X1,X4))
| ~ patient(X1,X2,skf19(X3,X1,X4))
| ~ present(X1,X2)
| ~ nonreflexive(X1,X2)
| ~ wear(X1,X2)
| ssSkP2(X3,X5,X1) ),
c_0_239,
[final] ).
cnf(c_0_274,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| be(X1,skf13(X1,X5,X2),X2,skf12(X2,X1,X5)) ),
c_0_240,
[final] ).
cnf(c_0_275,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| patient(X1,skf17(X1,X2,X4),X4) ),
c_0_241,
[final] ).
cnf(c_0_276,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| agent(X1,skf17(X1,X2,X6),X2) ),
c_0_242,
[final] ).
cnf(c_0_277,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| nonreflexive(X1,skf17(X1,X6,X7)) ),
c_0_243,
[final] ).
cnf(c_0_278,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| wear(X1,skf17(X1,X6,X7)) ),
c_0_244,
[final] ).
cnf(c_0_279,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| event(X1,skf17(X1,X6,X7)) ),
c_0_245,
[final] ).
cnf(c_0_280,negated_conjecture,
( ~ state(X1,X4)
| ~ be(X1,X4,skf16(X3,X1,X5),X2)
| ~ in(X1,X2,X3)
| ssSkP1(X3,X6,X1) ),
c_0_246,
[final] ).
cnf(c_0_281,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| present(X1,skf17(X1,X6,X7)) ),
c_0_247,
[final] ).
cnf(c_0_282,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| in(X1,skf12(X2,X1,X4),X4) ),
c_0_248,
[final] ).
cnf(c_0_283,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| state(X1,skf13(X1,X5,X6)) ),
c_0_249,
[final] ).
cnf(c_0_284,negated_conjecture,
( member(X3,skf16(X1,X3,X2),X2)
| ssSkP1(X1,X2,X3) ),
clause72,
[final] ).
cnf(c_0_285,negated_conjecture,
( member(X3,skf19(X1,X3,X2),X2)
| ssSkP2(X1,X2,X3) ),
clause74,
[final] ).
cnf(c_0_286,negated_conjecture,
( member(X3,skf21(X1,X3,X4),X1)
| ssSkP2(X1,X2,X3) ),
clause73,
[final] ).
cnf(c_0_287,negated_conjecture,
( member(X2,skf11(X2,X1),X1)
| ssSkP0(X1,X2) ),
clause65,
[final] ).
cnf(c_0_288,negated_conjecture,
( ~ fellow(X1,skf11(X1,X2))
| ~ young(X1,skf11(X1,X2))
| ssSkP0(X3,X1) ),
c_0_250,
[final] ).
cnf(c_0_289,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ member(X1,X2,X3)
| young(X1,X2) ),
c_0_251,
[final] ).
cnf(c_0_290,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ member(X1,X2,X3)
| fellow(X1,X2) ),
c_0_252,
[final] ).
cnf(c_0_291,negated_conjecture,
ssSkP2(skc32,skc31,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_253,c_0_164])]),
[final] ).
cnf(c_0_292,negated_conjecture,
ssSkP1(skc33,skc32,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_254,c_0_164])]),
[final] ).
cnf(c_0_293,negated_conjecture,
agent(skc25,skc34,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_255,c_0_164])]),
[final] ).
cnf(c_0_294,negated_conjecture,
behind(skc25,skc26,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_256,c_0_164])]),
[final] ).
cnf(c_0_295,negated_conjecture,
down(skc25,skc34,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_257,c_0_164])]),
[final] ).
cnf(c_0_296,negated_conjecture,
in(skc25,skc34,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_258,c_0_164])]),
[final] ).
cnf(c_0_297,negated_conjecture,
group(skc25,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_259,c_0_164])]),
[final] ).
cnf(c_0_298,negated_conjecture,
group(skc25,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_260,c_0_164])]),
[final] ).
cnf(c_0_299,negated_conjecture,
two(skc25,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_261,c_0_164])]),
[final] ).
cnf(c_0_300,negated_conjecture,
ssSkP0(skc32,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_262,c_0_164])]),
[final] ).
cnf(c_0_301,negated_conjecture,
frontseat(skc25,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_263,c_0_164])]),
[final] ).
cnf(c_0_302,negated_conjecture,
barrel(skc25,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_264,c_0_164])]),
[final] ).
cnf(c_0_303,negated_conjecture,
present(skc25,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_265,c_0_164])]),
[final] ).
cnf(c_0_304,negated_conjecture,
event(skc25,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_266,c_0_164])]),
[final] ).
cnf(c_0_305,negated_conjecture,
wheel(skc25,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_267,c_0_164])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP191-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n005.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 01:47:04 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.48 % Version: 3.5.1
% 0.10/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.48 % Starting sh5l with 300s (1) cores
% 0.10/0.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2289453 completed with status 1
% 0.10/0.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.10/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.48 % No SInE strategy applied
% 0.10/0.48 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.10/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.10/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.10/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2289459 completed with status 1
% 0.10/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.10/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.48 % No SInE strategy applied
% 0.10/0.48 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.10/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.10/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.10/0.48 % Preprocessing time : 0.002 s
% 0.10/0.48 % Presaturation interreduction done
% 0.10/0.48
% 0.10/0.48 % No proof found!
% 0.10/0.48 % SZS status Satisfiable
% 0.10/0.48 % SZS output start Saturation
% See solution above
% 0.10/0.48 % Parsed axioms : 92
% 0.10/0.48 % Removed by relevancy pruning/SinE : 0
% 0.10/0.48 % Initial clauses : 92
% 0.10/0.48 % Removed in clause preprocessing : 0
% 0.10/0.48 % Initial clauses in saturation : 92
% 0.10/0.48 % Processed clauses : 369
% 0.10/0.48 % ...of these trivial : 0
% 0.10/0.48 % ...subsumed : 28
% 0.10/0.48 % ...remaining for further processing : 341
% 0.10/0.48 % Other redundant clauses eliminated : 0
% 0.10/0.48 % Clauses deleted for lack of memory : 0
% 0.10/0.48 % Backward-subsumed : 23
% 0.10/0.48 % Backward-rewritten : 165
% 0.10/0.48 % Generated clauses : 166
% 0.10/0.48 % ...of the previous two non-redundant : 202
% 0.10/0.48 % ...aggressively subsumed : 0
% 0.10/0.48 % Contextual simplify-reflections : 82
% 0.10/0.48 % Paramodulations : 166
% 0.10/0.48 % Factorizations : 0
% 0.10/0.48 % NegExts : 0
% 0.10/0.48 % Equation resolutions : 0
% 0.10/0.48 % Disequality decompositions : 0
% 0.10/0.48 % Total rewrite steps : 182
% 0.10/0.48 % ...of those cached : 168
% 0.10/0.48 % Propositional unsat checks : 0
% 0.10/0.48 % Propositional check models : 0
% 0.10/0.48 % Propositional check unsatisfiable : 0
% 0.10/0.48 % Propositional clauses : 0
% 0.10/0.48 % Propositional clauses after purity: 0
% 0.10/0.48 % Propositional unsat core size : 0
% 0.10/0.48 % Propositional preprocessing time : 0.000
% 0.10/0.48 % Propositional encoding time : 0.000
% 0.10/0.48 % Propositional solver time : 0.000
% 0.10/0.48 % Success case prop preproc time : 0.000
% 0.10/0.48 % Success case prop encoding time : 0.000
% 0.10/0.48 % Success case prop solver time : 0.000
% 0.10/0.48 % Current number of processed clauses : 61
% 0.10/0.48 % Positive orientable unit clauses : 34
% 0.10/0.48 % Positive unorientable unit clauses: 0
% 0.10/0.48 % Negative unit clauses : 0
% 0.10/0.48 % Non-unit-clauses : 27
% 0.10/0.48 % Current number of unprocessed clauses: 0
% 0.10/0.48 % ...number of literals in the above : 0
% 0.10/0.48 % Current number of archived formulas : 0
% 0.10/0.48 % Current number of archived clauses : 280
% 0.10/0.48 % Clause-clause subsumption calls (NU) : 40683
% 0.10/0.48 % Rec. Clause-clause subsumption calls : 6743
% 0.10/0.48 % Non-unit clause-clause subsumptions : 133
% 0.10/0.48 % Unit Clause-clause subsumption calls : 16
% 0.10/0.48 % Rewrite failures with RHS unbound : 0
% 0.10/0.48 % BW rewrite match attempts : 1
% 0.10/0.48 % BW rewrite match successes : 1
% 0.10/0.48 % Condensation attempts : 0
% 0.10/0.48 % Condensation successes : 0
% 0.10/0.48 % Termbank termtop insertions : 15659
% 0.10/0.48 % Search garbage collected termcells : 461
% 0.10/0.48
% 0.10/0.48 % -------------------------------------------------
% 0.10/0.48 % User time : 0.031 s
% 0.10/0.48 % System time : 0.003 s
% 0.10/0.48 % Total time : 0.034 s
% 0.10/0.48 % Maximum resident set size: 3500 pages
% 0.10/0.48
% 0.10/0.48 % -------------------------------------------------
% 0.10/0.48 % User time : 0.152 s
% 0.10/0.48 % System time : 0.017 s
% 0.10/0.48 % Total time : 0.169 s
% 0.10/0.48 % Maximum resident set size: 4608 pages
% 0.10/0.48 % E exiting
%------------------------------------------------------------------------------