%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NLP130-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 : n020.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:37:41 PM UTC 2026
% Result : Satisfiable 0.23s 0.62s
% Output : Saturation 0.23s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_60ERROR: Could not build tree for root c_0_68ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_68,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP0(X6,X1)
| ~ two(X1,X6)
| ~ group(X1,X6)
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| member(X1,skf21(X1,X6),X6)
| ssSkC0 ),
c_0_60,
[final] ).
cnf(c_0_69,negated_conjecture,
( of(skc42,skc46,skc45)
| ssSkC0 ),
clause36,
[final] ).
cnf(c_0_70,negated_conjecture,
actual_world(skc42),
clause1,
[final] ).
cnf(c_0_71,negated_conjecture,
( lonely(skc42,skc45)
| ssSkC0 ),
clause10,
[final] ).
cnf(c_0_72,negated_conjecture,
( street(skc42,skc45)
| ssSkC0 ),
clause11,
[final] ).
cnf(c_0_73,negated_conjecture,
( city(skc42,skc45)
| ssSkC0 ),
clause12,
[final] ).
cnf(c_0_74,negated_conjecture,
( hollywood_placename(skc42,skc46)
| ssSkC0 ),
clause13,
[final] ).
cnf(c_0_75,negated_conjecture,
( placename(skc42,skc46)
| ssSkC0 ),
clause14,
[final] ).
cnf(c_0_76,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ ssSkP1(X6,X1)
| ~ two(X1,X6)
| ~ group(X1,X6)
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| member(X1,skf9(X1,X6),X6) ),
c_0_61,
[final] ).
cnf(c_0_77,negated_conjecture,
( ~ ssSkC0
| of(skc12,skc16,skc15) ),
c_0_62,
[final] ).
cnf(c_0_78,negated_conjecture,
actual_world(skc12),
clause2,
[final] ).
cnf(c_0_79,negated_conjecture,
( ~ ssSkC0
| lonely(skc12,skc15) ),
c_0_63,
[final] ).
cnf(c_0_80,negated_conjecture,
( ~ ssSkC0
| street(skc12,skc15) ),
c_0_64,
[final] ).
cnf(c_0_81,negated_conjecture,
( ~ ssSkC0
| city(skc12,skc15) ),
c_0_65,
[final] ).
cnf(c_0_82,negated_conjecture,
( ~ ssSkC0
| hollywood_placename(skc12,skc16) ),
c_0_66,
[final] ).
cnf(c_0_83,negated_conjecture,
( ~ ssSkC0
| placename(skc12,skc16) ),
c_0_67,
[final] ).
cnf(c_0_93,negated_conjecture,
( down(skc42,skc44,skc45)
| ssSkC0 ),
clause35,
[final] ).
cnf(c_0_94,negated_conjecture,
( event(skc42,skc44)
| ssSkC0 ),
clause3,
[final] ).
cnf(c_0_95,negated_conjecture,
( present(skc42,skc44)
| ssSkC0 ),
clause4,
[final] ).
cnf(c_0_96,negated_conjecture,
( barrel(skc42,skc44)
| ssSkC0 ),
clause5,
[final] ).
cnf(c_0_97,negated_conjecture,
( in(skc42,skc44,skc45)
| ssSkC0 ),
clause34,
[final] ).
cnf(c_0_99,negated_conjecture,
( ~ ssSkC0
| down(skc12,skc14,skc15) ),
c_0_84,
[final] ).
cnf(c_0_100,negated_conjecture,
( ~ ssSkC0
| event(skc12,skc14) ),
c_0_85,
[final] ).
cnf(c_0_101,negated_conjecture,
( ~ ssSkC0
| present(skc12,skc14) ),
c_0_86,
[final] ).
cnf(c_0_102,negated_conjecture,
( ~ ssSkC0
| barrel(skc12,skc14) ),
c_0_87,
[final] ).
cnf(c_0_103,negated_conjecture,
( ~ ssSkC0
| in(skc12,skc14,skc15) ),
c_0_88,
[final] ).
cnf(c_0_109,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ~ member(X1,X2,X3)
| frontseat(X1,skf15(X1,X4)) ),
c_0_89,
[final] ).
cnf(c_0_110,negated_conjecture,
( ssSkP1(skc43,skc42)
| ssSkC0 ),
clause17,
[final] ).
cnf(c_0_113,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ~ member(X1,X2,X3)
| be(X1,skf16(X1,X2),X2,skf15(X1,X2)) ),
c_0_90,
[final] ).
cnf(c_0_114,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ~ member(X1,X2,X3)
| state(X1,skf16(X1,X4)) ),
c_0_91,
[final] ).
cnf(c_0_118,negated_conjecture,
( agent(skc42,skc44,skc47)
| ssSkC0 ),
clause33,
[final] ).
cnf(c_0_119,negated_conjecture,
( old(skc42,skc47)
| ssSkC0 ),
clause6,
[final] ).
cnf(c_0_120,negated_conjecture,
( dirty(skc42,skc47)
| ssSkC0 ),
clause7,
[final] ).
cnf(c_0_121,negated_conjecture,
( white(skc42,skc47)
| ssSkC0 ),
clause8,
[final] ).
cnf(c_0_122,negated_conjecture,
( chevy(skc42,skc47)
| ssSkC0 ),
clause9,
[final] ).
cnf(c_0_124,negated_conjecture,
( ~ ssSkC0
| agent(skc12,skc14,skc17) ),
c_0_104,
[final] ).
cnf(c_0_125,negated_conjecture,
( ~ ssSkC0
| old(skc12,skc17) ),
c_0_105,
[final] ).
cnf(c_0_126,negated_conjecture,
( ~ ssSkC0
| dirty(skc12,skc17) ),
c_0_106,
[final] ).
cnf(c_0_127,negated_conjecture,
( ~ ssSkC0
| white(skc12,skc17) ),
c_0_107,
[final] ).
cnf(c_0_128,negated_conjecture,
( ~ ssSkC0
| chevy(skc12,skc17) ),
c_0_108,
[final] ).
cnf(c_0_131,negated_conjecture,
( ~ member(skc42,X2,skc43)
| ssSkC0
| frontseat(skc42,skf15(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]),
[final] ).
cnf(c_0_132,negated_conjecture,
( member(X2,skf14(X2,X1),X1)
| ssSkP0(X1,X2) ),
clause42,
[final] ).
cnf(c_0_133,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| be(X1,skf11(X1,X2),X2,skf10(X2,X1)) ),
c_0_111,
[final] ).
cnf(c_0_134,negated_conjecture,
( frontseat(X2,skf14(X2,X3))
| ssSkP0(X1,X2) ),
clause41,
[final] ).
cnf(c_0_136,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| in(X1,skf10(X2,X1),X2) ),
c_0_112,
[final] ).
cnf(c_0_138,negated_conjecture,
( ~ member(skc42,X1,skc43)
| ssSkC0
| be(skc42,skf16(skc42,X1),X1,skf15(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_113,c_0_110]),
[final] ).
cnf(c_0_139,negated_conjecture,
( ~ member(skc42,X2,skc43)
| ssSkC0
| state(skc42,skf16(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_114,c_0_110]),
[final] ).
cnf(c_0_140,negated_conjecture,
( ~ ssSkP1(X3,X1)
| ~ member(X1,X2,X3)
| in(X1,skf15(X1,X4),skf15(X1,X4)) ),
c_0_115,
[final] ).
cnf(c_0_141,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| state(X1,skf11(X1,X4)) ),
c_0_116,
[final] ).
cnf(c_0_146,negated_conjecture,
( ~ group(skc42,X1)
| ~ two(skc42,X1)
| ~ ssSkP0(X1,skc42)
| ssSkC0
| member(skc42,skf21(skc42,X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_120]),c_0_121]),c_0_122]),
[final] ).
cnf(c_0_147,negated_conjecture,
( two(skc42,skc43)
| ssSkC0 ),
clause16,
[final] ).
cnf(c_0_148,negated_conjecture,
( group(skc42,skc43)
| ssSkC0 ),
clause15,
[final] ).
cnf(c_0_149,negated_conjecture,
( ~ ssSkC0
| ~ group(skc12,X1)
| ~ two(skc12,X1)
| ~ ssSkP1(X1,skc12)
| member(skc12,skf9(skc12,X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]),c_0_126]),c_0_127]),c_0_128]),
[final] ).
cnf(c_0_150,negated_conjecture,
( ~ ssSkC0
| two(skc12,skc13) ),
c_0_129,
[final] ).
cnf(c_0_151,negated_conjecture,
( ~ ssSkC0
| group(skc12,skc13) ),
c_0_130,
[final] ).
cnf(c_0_152,negated_conjecture,
( ssSkC0
| ssSkP0(skc43,skc42)
| frontseat(skc42,skf15(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_131,c_0_132]),
[final] ).
cnf(c_0_153,negated_conjecture,
( ~ ssSkP0(X4,X1)
| ~ member(X1,skf14(X1,X2),X4)
| ssSkP0(X3,X1)
| be(X1,skf11(X1,skf14(X1,X2)),skf14(X1,X2),skf10(skf14(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_133,c_0_134]),
[final] ).
cnf(c_0_154,negated_conjecture,
( ~ ssSkC0
| ssSkP0(skc13,skc12) ),
c_0_135,
[final] ).
cnf(c_0_155,negated_conjecture,
( ~ ssSkP0(X4,X1)
| ~ member(X1,skf14(X1,X2),X4)
| ssSkP0(X3,X1)
| in(X1,skf10(skf14(X1,X2),X1),skf14(X1,X2)) ),
inference(spm,[status(thm)],[c_0_136,c_0_134]),
[final] ).
cnf(c_0_156,negated_conjecture,
( ~ state(X1,X4)
| ~ be(X1,X4,skf14(X1,X3),X2)
| ~ in(X1,X2,skf14(X1,X3))
| ssSkP0(X5,X1) ),
c_0_137,
[final] ).
cnf(c_0_157,negated_conjecture,
( ssSkC0
| ssSkP0(skc43,skc42)
| be(skc42,skf16(skc42,skf14(skc42,skc43)),skf14(skc42,skc43),skf15(skc42,skf14(skc42,skc43))) ),
inference(spm,[status(thm)],[c_0_138,c_0_132]),
[final] ).
cnf(c_0_158,negated_conjecture,
( ssSkC0
| ssSkP0(skc43,skc42)
| state(skc42,skf16(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_139,c_0_132]),
[final] ).
cnf(c_0_159,negated_conjecture,
( ~ member(skc42,X2,skc43)
| ssSkC0
| in(skc42,skf15(skc42,X1),skf15(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_140,c_0_110]),
[final] ).
cnf(c_0_160,negated_conjecture,
( ~ ssSkP0(X5,X1)
| ~ member(X1,skf14(X1,X4),X5)
| ssSkP0(X3,X1)
| state(X1,skf11(X1,X2)) ),
inference(spm,[status(thm)],[c_0_141,c_0_134]),
[final] ).
cnf(c_0_163,negated_conjecture,
( ~ member(skc42,X1,skc43)
| young(skc42,X1)
| ssSkC0 ),
c_0_142,
[final] ).
cnf(c_0_164,negated_conjecture,
( ~ member(skc42,X1,skc43)
| fellow(skc42,X1)
| ssSkC0 ),
c_0_143,
[final] ).
cnf(c_0_166,negated_conjecture,
( ~ ssSkC0
| ~ member(skc12,X1,skc13)
| young(skc12,X1) ),
c_0_144,
[final] ).
cnf(c_0_167,negated_conjecture,
( member(X2,skf19(X2,X1),X1)
| ssSkP1(X1,X2) ),
clause43,
[final] ).
cnf(c_0_168,negated_conjecture,
( ~ ssSkC0
| ~ member(skc12,X1,skc13)
| fellow(skc12,X1) ),
c_0_145,
[final] ).
cnf(c_0_169,negated_conjecture,
( ~ ssSkP0(skc43,skc42)
| ssSkC0
| member(skc42,skf21(skc42,skc43),skc43) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148]),
[final] ).
cnf(c_0_170,negated_conjecture,
( ~ ssSkC0
| ~ ssSkP1(skc13,skc12)
| member(skc12,skf9(skc12,skc13),skc13) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_151]),
[final] ).
cnf(c_0_171,negated_conjecture,
( ~ ssSkP0(X2,skc42)
| ~ member(skc42,skf15(skc42,X1),X2)
| ssSkC0
| ssSkP0(skc43,skc42)
| be(skc42,skf11(skc42,skf15(skc42,X1)),skf15(skc42,X1),skf10(skf15(skc42,X1),skc42)) ),
inference(spm,[status(thm)],[c_0_133,c_0_152]),
[final] ).
cnf(c_0_172,negated_conjecture,
( ~ ssSkC0
| ~ member(skc12,skf14(skc12,X1),skc13)
| ssSkP0(X2,skc12)
| be(skc12,skf11(skc12,skf14(skc12,X1)),skf14(skc12,X1),skf10(skf14(skc12,X1),skc12)) ),
inference(spm,[status(thm)],[c_0_153,c_0_154]),
[final] ).
cnf(c_0_173,negated_conjecture,
( ~ ssSkP0(X2,skc42)
| ~ member(skc42,skf15(skc42,X1),X2)
| ssSkC0
| ssSkP0(skc43,skc42)
| in(skc42,skf10(skf15(skc42,X1),skc42),skf15(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_136,c_0_152]),
[final] ).
cnf(c_0_174,negated_conjecture,
( ~ ssSkC0
| ~ member(skc12,skf14(skc12,X1),skc13)
| ssSkP0(X2,skc12)
| in(skc12,skf10(skf14(skc12,X1),skc12),skf14(skc12,X1)) ),
inference(spm,[status(thm)],[c_0_155,c_0_154]),
[final] ).
cnf(c_0_175,negated_conjecture,
( ~ in(skc42,skf15(skc42,skf14(skc42,skc43)),skf14(skc42,skc43))
| ssSkC0
| ssSkP0(X1,skc42)
| ssSkP0(skc43,skc42) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_158]),
[final] ).
cnf(c_0_176,negated_conjecture,
( ssSkC0
| ssSkP0(skc43,skc42)
| in(skc42,skf15(skc42,X1),skf15(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_159,c_0_132]),
[final] ).
cnf(c_0_177,negated_conjecture,
( ~ ssSkP0(X3,skc42)
| ~ member(skc42,skf15(skc42,X2),X3)
| ssSkC0
| ssSkP0(skc43,skc42)
| state(skc42,skf11(skc42,X1)) ),
inference(spm,[status(thm)],[c_0_141,c_0_152]),
[final] ).
cnf(c_0_178,negated_conjecture,
( ~ ssSkC0
| ~ member(skc12,skf14(skc12,X3),skc13)
| ssSkP0(X2,skc12)
| state(skc12,skf11(skc12,X1)) ),
inference(spm,[status(thm)],[c_0_160,c_0_154]),
[final] ).
cnf(c_0_179,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP0(X7,X1)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ fellow(X1,skf21(X1,X6))
| ~ young(X1,skf21(X1,X6))
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ssSkC0 ),
c_0_161,
[final] ).
cnf(c_0_180,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ ssSkP1(X7,X1)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ fellow(X1,skf9(X1,X6))
| ~ young(X1,skf9(X1,X6))
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2) ),
c_0_162,
[final] ).
cnf(c_0_181,negated_conjecture,
( ssSkC0
| ssSkP0(skc43,skc42)
| young(skc42,skf14(skc42,skc43)) ),
inference(spm,[status(thm)],[c_0_163,c_0_132]),
[final] ).
cnf(c_0_182,negated_conjecture,
( ssSkC0
| ssSkP0(skc43,skc42)
| fellow(skc42,skf14(skc42,skc43)) ),
inference(spm,[status(thm)],[c_0_164,c_0_132]),
[final] ).
cnf(c_0_183,negated_conjecture,
( ~ state(X1,X3)
| ~ be(X1,X3,skf19(X1,X4),X2)
| ~ in(X1,X2,X2)
| ~ frontseat(X1,X2)
| ssSkP1(X5,X1) ),
c_0_165,
[final] ).
cnf(c_0_184,negated_conjecture,
( ~ ssSkC0
| ssSkP1(skc13,skc12)
| young(skc12,skf19(skc12,skc13)) ),
inference(spm,[status(thm)],[c_0_166,c_0_167]),
[final] ).
cnf(c_0_185,negated_conjecture,
( ~ ssSkC0
| ssSkP1(skc13,skc12)
| fellow(skc12,skf19(skc12,skc13)) ),
inference(spm,[status(thm)],[c_0_168,c_0_167]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NLP130-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.48 % Computer : n020.cluster.edu
% 0.17/0.48 % Model : x86_64 x86_64
% 0.17/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.48 % Memory : 8046.5625MB
% 0.17/0.48 % OS : Linux 6.8.0-71-generic
% 0.17/0.48 % CPULimit : 300
% 0.17/0.48 % WCLimit : 300
% 0.17/0.48 % DateTime : Mon Sep 21 01:43:47 UTC 2026
% 0.17/0.48 % CPUTime :
% 0.17/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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.23/0.62 % Version: 3.5.1
% 0.23/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.62 % Starting sh5l with 300s (1) cores
% 0.23/0.62 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1729392 completed with status 1
% 0.23/0.62 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.62 % No SInE strategy applied
% 0.23/0.62 % Search class: FGHNF-FFMM22-SFFFFFNN
% 0.23/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/0.62 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.62 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.62 % new_bool_3 with pid 1729399 completed with status 1
% 0.23/0.62 % Result found by new_bool_3
% 0.23/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.62 % No SInE strategy applied
% 0.23/0.62 % Search class: FGHNF-FFMM22-SFFFFFNN
% 0.23/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/0.62 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.62 % Preprocessing time : 0.002 s
% 0.23/0.62 % Presaturation interreduction done
% 0.23/0.62
% 0.23/0.62 % No proof found!
% 0.23/0.62 % SZS status Satisfiable
% 0.23/0.62 % SZS output start Saturation
% See solution above
% 0.23/0.63 % Parsed axioms : 60
% 0.23/0.63 % Removed by relevancy pruning/SinE : 0
% 0.23/0.63 % Initial clauses : 60
% 0.23/0.63 % Removed in clause preprocessing : 0
% 0.23/0.63 % Initial clauses in saturation : 60
% 0.23/0.63 % Processed clauses : 169
% 0.23/0.63 % ...of these trivial : 2
% 0.23/0.63 % ...subsumed : 17
% 0.23/0.63 % ...remaining for further processing : 150
% 0.23/0.63 % Other redundant clauses eliminated : 0
% 0.23/0.63 % Clauses deleted for lack of memory : 0
% 0.23/0.63 % Backward-subsumed : 4
% 0.23/0.63 % Backward-rewritten : 0
% 0.23/0.63 % Generated clauses : 49
% 0.23/0.63 % ...of the previous two non-redundant : 49
% 0.23/0.63 % ...aggressively subsumed : 0
% 0.23/0.63 % Contextual simplify-reflections : 29
% 0.23/0.63 % Paramodulations : 49
% 0.23/0.63 % Factorizations : 0
% 0.23/0.63 % NegExts : 0
% 0.23/0.63 % Equation resolutions : 0
% 0.23/0.63 % Disequality decompositions : 0
% 0.23/0.63 % Total rewrite steps : 4
% 0.23/0.63 % ...of those cached : 2
% 0.23/0.63 % Propositional unsat checks : 0
% 0.23/0.63 % Propositional check models : 0
% 0.23/0.63 % Propositional check unsatisfiable : 0
% 0.23/0.63 % Propositional clauses : 0
% 0.23/0.63 % Propositional clauses after purity: 0
% 0.23/0.63 % Propositional unsat core size : 0
% 0.23/0.63 % Propositional preprocessing time : 0.000
% 0.23/0.63 % Propositional encoding time : 0.000
% 0.23/0.63 % Propositional solver time : 0.000
% 0.23/0.63 % Success case prop preproc time : 0.000
% 0.23/0.63 % Success case prop encoding time : 0.000
% 0.23/0.63 % Success case prop solver time : 0.000
% 0.23/0.63 % Current number of processed clauses : 86
% 0.23/0.63 % Positive orientable unit clauses : 2
% 0.23/0.63 % Positive unorientable unit clauses: 0
% 0.23/0.63 % Negative unit clauses : 0
% 0.23/0.63 % Non-unit-clauses : 84
% 0.23/0.63 % Current number of unprocessed clauses: 0
% 0.23/0.63 % ...number of literals in the above : 0
% 0.23/0.63 % Current number of archived formulas : 0
% 0.23/0.63 % Current number of archived clauses : 64
% 0.23/0.63 % Clause-clause subsumption calls (NU) : 5478
% 0.23/0.63 % Rec. Clause-clause subsumption calls : 1373
% 0.23/0.63 % Non-unit clause-clause subsumptions : 50
% 0.23/0.63 % Unit Clause-clause subsumption calls : 0
% 0.23/0.63 % Rewrite failures with RHS unbound : 0
% 0.23/0.63 % BW rewrite match attempts : 0
% 0.23/0.63 % BW rewrite match successes : 0
% 0.23/0.63 % Condensation attempts : 0
% 0.23/0.63 % Condensation successes : 0
% 0.23/0.63 % Termbank termtop insertions : 5129
% 0.23/0.63 % Search garbage collected termcells : 217
% 0.23/0.63
% 0.23/0.63 % -------------------------------------------------
% 0.23/0.63 % User time : 0.016 s
% 0.23/0.63 % System time : 0.006 s
% 0.23/0.63 % Total time : 0.022 s
% 0.23/0.63 % Maximum resident set size: 3440 pages
% 0.23/0.63
% 0.23/0.63 % -------------------------------------------------
% 0.23/0.63 % User time : 0.053 s
% 0.23/0.63 % System time : 0.025 s
% 0.23/0.63 % Total time : 0.078 s
% 0.23/0.63 % Maximum resident set size: 4864 pages
% 0.23/0.63 % E exiting
%------------------------------------------------------------------------------