%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP232-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:46 PM UTC 2026
% Result : Satisfiable 0.14s 0.50s
% Output : Saturation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1ERROR: Could not build tree for root c_0_85ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_85,negated_conjecture,
actual_world(skc47),
clause1,
[final] ).
cnf(c_0_106,negated_conjecture,
actual_world(skc29),
clause2,
[final] ).
cnf(c_0_253,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_243,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_263,negated_conjecture,
( ~ actual_world(X1)
| ~ accessible_world(X1,X4)
| ~ accessible_world(X1,X6)
| ~ proposition(X1,X4)
| ~ proposition(X1,X6)
| ~ event(X4,X5)
| ~ event(X1,X10)
| ~ event(X1,X8)
| ~ event(X6,X7)
| ~ present(X4,X5)
| ~ present(X1,X10)
| ~ present(X1,X8)
| ~ present(X6,X7)
| ~ think_believe_consider(X1,X10)
| ~ think_believe_consider(X1,X8)
| ~ forename(X1,X14)
| ~ forename(X1,X13)
| ~ forename(X1,X12)
| ~ vincent_forename(X1,X14)
| ~ vincent_forename(X1,X12)
| ~ man(X1,X11)
| ~ man(X1,X3)
| ~ man(X1,X9)
| ~ state(X1,X2)
| ~ jules_forename(X1,X13)
| ~ smoke(X4,X5)
| ~ smoke(X6,X7)
| ~ theme(X1,X10,X4)
| ~ theme(X1,X8,X6)
| ~ of(X1,X14,X11)
| ~ of(X1,X13,X3)
| ~ of(X1,X12,X9)
| ~ agent(X1,X10,X11)
| ~ agent(X1,X8,X9)
| ~ agent(X6,X7,X3)
| ~ agent(X4,X5,skf7(X4))
| ~ be(X1,X2,X3,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_253])]),
[final] ).
cnf(c_0_264,negated_conjecture,
( ~ actual_world(X2)
| ~ accessible_world(X2,X1)
| ~ accessible_world(X2,X5)
| ~ proposition(X2,X1)
| ~ proposition(X2,X5)
| ~ event(X2,X9)
| ~ event(X2,X7)
| ~ event(X5,X6)
| ~ present(X2,X9)
| ~ present(X2,X7)
| ~ present(X5,X6)
| ~ think_believe_consider(X2,X9)
| ~ think_believe_consider(X2,X7)
| ~ forename(X2,X13)
| ~ forename(X2,X12)
| ~ forename(X2,X11)
| ~ vincent_forename(X2,X13)
| ~ vincent_forename(X2,X11)
| ~ man(X2,X10)
| ~ man(X2,X4)
| ~ man(X2,X8)
| ~ state(X2,X3)
| ~ jules_forename(X2,X12)
| ~ smoke(X5,X6)
| ~ theme(X2,X9,X1)
| ~ theme(X2,X7,X5)
| ~ of(X2,X13,X10)
| ~ of(X2,X12,X4)
| ~ of(X2,X11,X8)
| ~ agent(X2,X9,X10)
| ~ agent(X2,X7,X8)
| ~ agent(X5,X6,X4)
| ~ be(X2,X3,X4,X4)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_253])]),
[final] ).
cnf(c_0_265,negated_conjecture,
( ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X2)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X2)
| ~ event(X2,X3)
| ~ event(skc29,X6)
| ~ event(skc29,X4)
| ~ present(X2,X3)
| ~ present(skc29,X6)
| ~ present(skc29,X4)
| ~ think_believe_consider(skc29,X6)
| ~ think_believe_consider(skc29,X4)
| ~ forename(skc29,X10)
| ~ forename(skc29,X8)
| ~ forename(skc29,X9)
| ~ vincent_forename(skc29,X10)
| ~ vincent_forename(skc29,X9)
| ~ man(skc29,X7)
| ~ man(skc29,X5)
| ~ jules_forename(skc29,X8)
| ~ smoke(X2,X3)
| ~ theme(skc29,X6,X1)
| ~ theme(skc29,X4,X2)
| ~ of(skc29,X10,X7)
| ~ of(skc29,X9,X5)
| ~ of(skc29,X8,skc38)
| ~ agent(skc29,X6,X7)
| ~ agent(skc29,X4,X5)
| ~ agent(X2,X3,skc38)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_253])]),
[final] ).
cnf(c_0_266,negated_conjecture,
( ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X2)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X2)
| ~ event(X2,X3)
| ~ event(skc29,X4)
| ~ present(X2,X3)
| ~ present(skc29,X4)
| ~ think_believe_consider(skc29,X4)
| ~ forename(skc29,X8)
| ~ forename(skc29,X6)
| ~ forename(skc29,X7)
| ~ vincent_forename(skc29,X8)
| ~ vincent_forename(skc29,X7)
| ~ man(skc29,X5)
| ~ jules_forename(skc29,X6)
| ~ smoke(X2,X3)
| ~ theme(skc29,X4,X1)
| ~ theme(skc29,skc31,X2)
| ~ of(skc29,X8,X5)
| ~ of(skc29,X7,skc33)
| ~ of(skc29,X6,skc38)
| ~ agent(skc29,X4,X5)
| ~ agent(X2,X3,skc38)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_253])]),
[final] ).
cnf(c_0_267,negated_conjecture,
( ~ actual_world(X1)
| ~ accessible_world(X1,X4)
| ~ accessible_world(X1,skc40)
| ~ proposition(X1,X4)
| ~ proposition(X1,skc40)
| ~ event(X1,X8)
| ~ event(X1,X6)
| ~ event(X4,X5)
| ~ present(X1,X8)
| ~ present(X1,X6)
| ~ present(X4,X5)
| ~ think_believe_consider(X1,X8)
| ~ think_believe_consider(X1,X6)
| ~ forename(X1,X12)
| ~ forename(X1,X11)
| ~ forename(X1,X10)
| ~ vincent_forename(X1,X12)
| ~ vincent_forename(X1,X10)
| ~ man(X1,X9)
| ~ man(X1,X3)
| ~ man(X1,X7)
| ~ state(X1,X2)
| ~ jules_forename(X1,X11)
| ~ smoke(X4,X5)
| ~ smoke(skc40,skf5(skf7(skc40)))
| ~ theme(X1,X6,X4)
| ~ theme(X1,X8,skc40)
| ~ of(X1,X12,X9)
| ~ of(X1,X11,X3)
| ~ of(X1,X10,X7)
| ~ agent(X1,X8,X9)
| ~ agent(X1,X6,X7)
| ~ agent(X4,X5,X3)
| ~ be(X1,X2,X3,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_253])]),
[final] ).
cnf(c_0_268,negated_conjecture,
( ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X2)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X2)
| ~ event(X2,X3)
| ~ event(skc29,X4)
| ~ present(X2,X3)
| ~ present(skc29,X4)
| ~ think_believe_consider(skc29,X4)
| ~ forename(skc29,X8)
| ~ forename(skc29,X6)
| ~ forename(skc29,X7)
| ~ vincent_forename(skc29,X8)
| ~ vincent_forename(skc29,X7)
| ~ man(skc29,X5)
| ~ jules_forename(skc29,X6)
| ~ smoke(X2,X3)
| ~ theme(skc29,X4,X1)
| ~ theme(skc29,skc41,X2)
| ~ of(skc29,X8,X5)
| ~ of(skc29,X7,skc43)
| ~ of(skc29,X6,skc38)
| ~ agent(skc29,X4,X5)
| ~ agent(X2,X3,skc38)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_253])]),
[final] ).
cnf(c_0_269,negated_conjecture,
( ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X2)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X2)
| ~ event(X2,X3)
| ~ present(X2,X3)
| ~ smoke(X2,X3)
| ~ theme(skc29,skc31,X1)
| ~ theme(skc29,skc31,X2)
| ~ agent(X2,X3,skc38)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_254,c_0_253])]),
[final] ).
cnf(c_0_270,negated_conjecture,
( ~ man(skc40,X1)
| agent(skc40,skf5(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_211,c_0_253])]),
[final] ).
cnf(c_0_271,negated_conjecture,
( ~ man(skc40,X2)
| event(skc40,skf5(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_253])]),
[final] ).
cnf(c_0_272,negated_conjecture,
( ~ man(skc40,X2)
| present(skc40,skf5(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_253])]),
[final] ).
cnf(c_0_273,negated_conjecture,
( ~ man(skc40,X2)
| smoke(skc40,skf5(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_214,c_0_253])]),
[final] ).
cnf(c_0_274,negated_conjecture,
( ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X2)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X2)
| ~ event(X2,X3)
| ~ present(X2,X3)
| ~ smoke(X2,X3)
| ~ theme(skc29,skc41,X1)
| ~ theme(skc29,skc41,X2)
| ~ agent(X2,X3,skc38)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_255,c_0_253])]),
[final] ).
cnf(c_0_275,negated_conjecture,
( ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X2)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X2)
| ~ event(X2,X3)
| ~ present(X2,X3)
| ~ smoke(X2,X3)
| ~ theme(skc29,skc41,X1)
| ~ theme(skc29,skc31,X2)
| ~ agent(X2,X3,skc38)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_198,c_0_253])]),
[final] ).
cnf(c_0_276,negated_conjecture,
( ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X2)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X2)
| ~ event(X2,X3)
| ~ present(X2,X3)
| ~ smoke(X2,X3)
| ~ theme(skc29,skc31,X1)
| ~ theme(skc29,skc41,X2)
| ~ agent(X2,X3,skc38)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_256,c_0_253])]),
[final] ).
cnf(c_0_277,negated_conjecture,
~ agent(skc30,skc36,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_257,c_0_253])]),
[final] ).
cnf(c_0_278,negated_conjecture,
be(skc29,skc37,skc38,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_253])]),
[final] ).
cnf(c_0_279,negated_conjecture,
theme(skc29,skc41,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_253])]),
[final] ).
cnf(c_0_280,negated_conjecture,
theme(skc29,skc31,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_204,c_0_253])]),
[final] ).
cnf(c_0_281,negated_conjecture,
of(skc29,skc42,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_177,c_0_253])]),
[final] ).
cnf(c_0_282,negated_conjecture,
of(skc29,skc39,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_146,c_0_253])]),
[final] ).
cnf(c_0_283,negated_conjecture,
of(skc29,skc34,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_258,c_0_253])]),
[final] ).
cnf(c_0_284,negated_conjecture,
of(skc29,skc32,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_157,c_0_253])]),
[final] ).
cnf(c_0_285,negated_conjecture,
agent(skc29,skc41,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_253])]),
[final] ).
cnf(c_0_286,negated_conjecture,
agent(skc29,skc31,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_253])]),
[final] ).
cnf(c_0_287,negated_conjecture,
agent(skc30,skc36,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_259,c_0_253])]),
[final] ).
cnf(c_0_288,negated_conjecture,
accessible_world(skc29,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_253])]),
[final] ).
cnf(c_0_289,negated_conjecture,
accessible_world(skc29,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_200,c_0_253])]),
[final] ).
cnf(c_0_290,negated_conjecture,
proposition(skc29,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_253])]),
[final] ).
cnf(c_0_291,negated_conjecture,
proposition(skc29,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_201,c_0_253])]),
[final] ).
cnf(c_0_292,negated_conjecture,
event(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_253])]),
[final] ).
cnf(c_0_293,negated_conjecture,
event(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_253])]),
[final] ).
cnf(c_0_294,negated_conjecture,
event(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_202,c_0_253])]),
[final] ).
cnf(c_0_295,negated_conjecture,
present(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_133,c_0_253])]),
[final] ).
cnf(c_0_296,negated_conjecture,
present(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_253])]),
[final] ).
cnf(c_0_297,negated_conjecture,
present(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_203,c_0_253])]),
[final] ).
cnf(c_0_298,negated_conjecture,
think_believe_consider(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_253])]),
[final] ).
cnf(c_0_299,negated_conjecture,
think_believe_consider(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_122,c_0_253])]),
[final] ).
cnf(c_0_300,negated_conjecture,
forename(skc29,skc42),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_176,c_0_253])]),
[final] ).
cnf(c_0_301,negated_conjecture,
forename(skc29,skc39),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_145,c_0_253])]),
[final] ).
cnf(c_0_302,negated_conjecture,
forename(skc29,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_260,c_0_253])]),
[final] ).
cnf(c_0_303,negated_conjecture,
forename(skc29,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_156,c_0_253])]),
[final] ).
cnf(c_0_304,negated_conjecture,
vincent_forename(skc29,skc42),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_175,c_0_253])]),
[final] ).
cnf(c_0_305,negated_conjecture,
vincent_forename(skc29,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_253])]),
[final] ).
cnf(c_0_306,negated_conjecture,
man(skc29,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_135,c_0_253])]),
[final] ).
cnf(c_0_307,negated_conjecture,
man(skc29,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_253])]),
[final] ).
cnf(c_0_308,negated_conjecture,
man(skc29,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_261,c_0_253])]),
[final] ).
cnf(c_0_309,negated_conjecture,
man(skc29,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_253])]),
[final] ).
cnf(c_0_310,negated_conjecture,
state(skc29,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_253])]),
[final] ).
cnf(c_0_311,negated_conjecture,
jules_forename(skc29,skc39),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_253])]),
[final] ).
cnf(c_0_312,negated_conjecture,
jules_forename(skc29,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_262,c_0_253])]),
[final] ).
cnf(c_0_313,negated_conjecture,
smoke(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_199,c_0_253])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP232-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n026.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:55:51 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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/benchmark/theBenchmark.p
% 0.14/0.50 % Version: 3.5.1
% 0.14/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % new_bool_3 with pid 1121451 completed with status 1
% 0.14/0.50 % Result found by new_bool_3
% 0.14/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.50 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.14/0.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.50 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.50 % SubtermCWHack with pid 1121458 completed with status 1
% 0.14/0.50 % Result found by SubtermCWHack
% 0.14/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.50 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.14/0.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.50 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.50 % Preprocessing time : 0.001 s
% 0.14/0.50
% 0.14/0.50 % No proof found!
% 0.14/0.50 % SZS status Satisfiable
% 0.14/0.50 % SZS output start Saturation
% See solution above
% 0.14/0.50 % Parsed axioms : 85
% 0.14/0.50 % Removed by relevancy pruning/SinE : 0
% 0.14/0.50 % Initial clauses : 85
% 0.14/0.50 % Removed in clause preprocessing : 0
% 0.14/0.50 % Initial clauses in saturation : 85
% 0.14/0.50 % Processed clauses : 375
% 0.14/0.50 % ...of these trivial : 7
% 0.14/0.50 % ...subsumed : 49
% 0.14/0.50 % ...remaining for further processing : 319
% 0.14/0.50 % Other redundant clauses eliminated : 0
% 0.14/0.50 % Clauses deleted for lack of memory : 0
% 0.14/0.50 % Backward-subsumed : 157
% 0.14/0.50 % Backward-rewritten : 108
% 0.14/0.50 % Generated clauses : 428
% 0.14/0.50 % ...of the previous two non-redundant : 371
% 0.14/0.50 % ...aggressively subsumed : 0
% 0.14/0.50 % Contextual simplify-reflections : 484
% 0.14/0.50 % Paramodulations : 428
% 0.14/0.50 % Factorizations : 0
% 0.14/0.50 % NegExts : 0
% 0.14/0.50 % Equation resolutions : 0
% 0.14/0.50 % Disequality decompositions : 0
% 0.14/0.50 % Total rewrite steps : 163
% 0.14/0.50 % ...of those cached : 145
% 0.14/0.50 % Propositional unsat checks : 0
% 0.14/0.50 % Propositional check models : 0
% 0.14/0.50 % Propositional check unsatisfiable : 0
% 0.14/0.50 % Propositional clauses : 0
% 0.14/0.50 % Propositional clauses after purity: 0
% 0.14/0.50 % Propositional unsat core size : 0
% 0.14/0.50 % Propositional preprocessing time : 0.000
% 0.14/0.50 % Propositional encoding time : 0.000
% 0.14/0.50 % Propositional solver time : 0.000
% 0.14/0.50 % Success case prop preproc time : 0.000
% 0.14/0.50 % Success case prop encoding time : 0.000
% 0.14/0.50 % Success case prop solver time : 0.000
% 0.14/0.50 % Current number of processed clauses : 54
% 0.14/0.50 % Positive orientable unit clauses : 39
% 0.14/0.50 % Positive unorientable unit clauses: 0
% 0.14/0.50 % Negative unit clauses : 1
% 0.14/0.50 % Non-unit-clauses : 14
% 0.14/0.50 % Current number of unprocessed clauses: 0
% 0.14/0.50 % ...number of literals in the above : 0
% 0.14/0.50 % Current number of archived formulas : 0
% 0.14/0.50 % Current number of archived clauses : 265
% 0.14/0.50 % Clause-clause subsumption calls (NU) : 33933
% 0.14/0.50 % Rec. Clause-clause subsumption calls : 2079
% 0.14/0.50 % Non-unit clause-clause subsumptions : 686
% 0.14/0.50 % Unit Clause-clause subsumption calls : 0
% 0.14/0.50 % Rewrite failures with RHS unbound : 0
% 0.14/0.50 % BW rewrite match attempts : 6
% 0.14/0.50 % BW rewrite match successes : 1
% 0.14/0.50 % Condensation attempts : 0
% 0.14/0.50 % Condensation successes : 0
% 0.14/0.50 % Termbank termtop insertions : 34107
% 0.14/0.50 % Search garbage collected termcells : 460
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.053 s
% 0.14/0.50 % System time : 0.005 s
% 0.14/0.50 % Total time : 0.058 s
% 0.14/0.50 % Maximum resident set size: 3952 pages
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.056 s
% 0.14/0.50 % System time : 0.010 s
% 0.14/0.50 % Total time : 0.066 s
% 0.14/0.50 % Maximum resident set size: 4864 pages
% 0.14/0.50 % E exiting
%------------------------------------------------------------------------------