↑ Up

E---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NLP044-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 : n004.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:34:28 PM UTC 2026

% Result   : Satisfiable 0.24s 5.62s
% Output   : Saturation 0.24s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_58ERROR: Could not build tree for root c_0_77ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_51,negated_conjecture,
    ( ~ ssSkP0(X4,X3,X1)
    | ~ member(X1,X2,X3)
    | cost(X1,skf6(X1,X5,X6)) ),
    c_0_46,
    [final] ).

cnf(c_0_52,negated_conjecture,
    ( member(X3,skf8(X1,X3,X2),X2)
    | ssSkP0(X1,X2,X3) ),
    clause35,
    [final] ).

cnf(c_0_53,negated_conjecture,
    ( ~ ssSkP0(X4,X3,X1)
    | ~ member(X1,X2,X3)
    | event(X1,skf6(X1,X5,X6)) ),
    c_0_47,
    [final] ).

cnf(c_0_54,negated_conjecture,
    ( ~ ssSkP0(X4,X3,X1)
    | ~ member(X1,X2,X3)
    | nonreflexive(X1,skf6(X1,X5,X6)) ),
    c_0_48,
    [final] ).

cnf(c_0_55,negated_conjecture,
    ( ~ ssSkP0(X4,X3,X1)
    | ~ member(X1,X2,X3)
    | present(X1,skf6(X1,X5,X6)) ),
    c_0_49,
    [final] ).

cnf(c_0_63,negated_conjecture,
    ( ~ actual_world(X1)
    | ~ shake_beverage(X1,X6)
    | ~ patient(X1,X4,X6)
    | ~ ssSkP0(X4,X2,X1)
    | ~ order(X1,X4)
    | ~ nonreflexive(X1,X4)
    | ~ past(X1,X4)
    | ~ event(X1,X4)
    | ~ nonhuman(X1,X4)
    | ~ of(X1,X3,X5)
    | ~ woman(X1,X5)
    | ~ agent(X1,X4,X5)
    | ~ forename(X1,X3)
    | ~ mia_forename(X1,X3)
    | ~ five(X1,X2)
    | ~ group(X1,X2)
    | member(X1,skf10(X1,X2),X2)
    | ssSkC0 ),
    c_0_50,
    [final] ).

cnf(c_0_64,negated_conjecture,
    ( of(skc33,skc37,skc38)
    | ssSkC0 ),
    clause27,
    [final] ).

cnf(c_0_65,negated_conjecture,
    actual_world(skc33),
    clause1,
    [final] ).

cnf(c_0_66,negated_conjecture,
    ( mia_forename(skc33,skc37)
    | ssSkC0 ),
    clause6,
    [final] ).

cnf(c_0_67,negated_conjecture,
    ( forename(skc33,skc37)
    | ssSkC0 ),
    clause7,
    [final] ).

cnf(c_0_68,negated_conjecture,
    ( woman(skc33,skc38)
    | ssSkC0 ),
    clause8,
    [final] ).

cnf(c_0_70,negated_conjecture,
    ( ~ ssSkP0(X6,X5,X1)
    | ssSkP0(X4,X5,X1)
    | cost(X1,skf6(X1,X2,X3)) ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]),
    [final] ).

cnf(c_0_71,negated_conjecture,
    ( ssSkP0(skc37,skc34,skc33)
    | ssSkC0 ),
    clause25,
    [final] ).

cnf(c_0_72,negated_conjecture,
    ( ~ ssSkP0(X6,X2,X3)
    | event(X3,skf6(X3,X4,X5))
    | ssSkP0(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_53,c_0_52]),
    [final] ).

cnf(c_0_73,negated_conjecture,
    ( ~ ssSkP0(X6,X2,X3)
    | nonreflexive(X3,skf6(X3,X4,X5))
    | ssSkP0(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_54,c_0_52]),
    [final] ).

cnf(c_0_74,negated_conjecture,
    ( ~ ssSkP0(X6,X5,X1)
    | ssSkP0(X4,X5,X1)
    | present(X1,skf6(X1,X2,X3)) ),
    inference(spm,[status(thm)],[c_0_55,c_0_52]),
    [final] ).

cnf(c_0_75,negated_conjecture,
    ( ~ ssSkP0(X4,X3,X1)
    | ~ member(X1,X2,X3)
    | patient(X1,skf6(X1,X2,X5),X2) ),
    c_0_56,
    [final] ).

cnf(c_0_76,negated_conjecture,
    ( ~ ssSkC0
    | ssSkP0(skc14,skc13,skc12) ),
    c_0_57,
    [final] ).

cnf(c_0_77,negated_conjecture,
    ( ~ ssSkC0
    | ~ actual_world(X1)
    | ~ shake_beverage(X1,X6)
    | ~ patient(X1,X4,X6)
    | ~ order(X1,X4)
    | ~ nonreflexive(X1,X4)
    | ~ past(X1,X4)
    | ~ event(X1,X4)
    | ~ of(X1,X3,X5)
    | ~ woman(X1,X5)
    | ~ agent(X1,X4,X5)
    | ~ ssSkP0(X3,X2,X1)
    | ~ forename(X1,X3)
    | ~ mia_forename(X1,X3)
    | ~ nonhuman(X1,X3)
    | ~ five(X1,X2)
    | ~ group(X1,X2)
    | member(X1,skf5(X1,X2),X2) ),
    c_0_58,
    [final] ).

cnf(c_0_78,negated_conjecture,
    ( ~ ssSkC0
    | of(skc12,skc16,skc17) ),
    c_0_59,
    [final] ).

cnf(c_0_79,negated_conjecture,
    actual_world(skc12),
    clause2,
    [final] ).

cnf(c_0_80,negated_conjecture,
    ( ~ ssSkC0
    | mia_forename(skc12,skc16) ),
    c_0_60,
    [final] ).

cnf(c_0_81,negated_conjecture,
    ( ~ ssSkC0
    | forename(skc12,skc16) ),
    c_0_61,
    [final] ).

cnf(c_0_82,negated_conjecture,
    ( ~ ssSkC0
    | woman(skc12,skc17) ),
    c_0_62,
    [final] ).

cnf(c_0_85,negated_conjecture,
    ( ~ group(skc33,X1)
    | ~ five(skc33,X1)
    | ~ nonhuman(skc33,X2)
    | ~ event(skc33,X2)
    | ~ past(skc33,X2)
    | ~ nonreflexive(skc33,X2)
    | ~ order(skc33,X2)
    | ~ shake_beverage(skc33,X3)
    | ~ ssSkP0(X2,X1,skc33)
    | ~ agent(skc33,X2,skc38)
    | ~ patient(skc33,X2,X3)
    | ssSkC0
    | member(skc33,skf10(skc33,X1),X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]),c_0_66]),c_0_67]),c_0_68]),
    [final] ).

cnf(c_0_86,negated_conjecture,
    ( shake_beverage(skc33,skc36)
    | ssSkC0 ),
    clause13,
    [final] ).

cnf(c_0_87,negated_conjecture,
    ( ~ event(X1,X2)
    | ~ agent(X1,X2,X3)
    | ~ patient(X1,X2,skf8(X3,X1,X4))
    | ~ present(X1,X2)
    | ~ nonreflexive(X1,X2)
    | ~ cost(X1,X2)
    | ssSkP0(X3,X5,X1) ),
    c_0_69,
    [final] ).

cnf(c_0_88,negated_conjecture,
    ( ssSkC0
    | ssSkP0(X3,skc34,skc33)
    | cost(skc33,skf6(skc33,X1,X2)) ),
    inference(spm,[status(thm)],[c_0_70,c_0_71]),
    [final] ).

cnf(c_0_89,negated_conjecture,
    ( ssSkC0
    | event(skc33,skf6(skc33,X2,X3))
    | ssSkP0(X1,skc34,skc33) ),
    inference(spm,[status(thm)],[c_0_72,c_0_71]),
    [final] ).

cnf(c_0_90,negated_conjecture,
    ( ssSkC0
    | nonreflexive(skc33,skf6(skc33,X2,X3))
    | ssSkP0(X1,skc34,skc33) ),
    inference(spm,[status(thm)],[c_0_73,c_0_71]),
    [final] ).

cnf(c_0_91,negated_conjecture,
    ( ssSkC0
    | ssSkP0(X3,skc34,skc33)
    | present(skc33,skf6(skc33,X1,X2)) ),
    inference(spm,[status(thm)],[c_0_74,c_0_71]),
    [final] ).

cnf(c_0_92,negated_conjecture,
    ( ~ ssSkP0(X5,X3,X1)
    | ssSkP0(X2,X3,X1)
    | patient(X1,skf6(X1,skf8(X2,X1,X3),X4),skf8(X2,X1,X3)) ),
    inference(spm,[status(thm)],[c_0_75,c_0_52]),
    [final] ).

cnf(c_0_93,negated_conjecture,
    ( ~ ssSkC0
    | ssSkP0(X3,skc13,skc12)
    | cost(skc12,skf6(skc12,X1,X2)) ),
    inference(spm,[status(thm)],[c_0_70,c_0_76]),
    [final] ).

cnf(c_0_94,negated_conjecture,
    ( ~ ssSkC0
    | event(skc12,skf6(skc12,X2,X3))
    | ssSkP0(X1,skc13,skc12) ),
    inference(spm,[status(thm)],[c_0_72,c_0_76]),
    [final] ).

cnf(c_0_95,negated_conjecture,
    ( ~ ssSkC0
    | nonreflexive(skc12,skf6(skc12,X2,X3))
    | ssSkP0(X1,skc13,skc12) ),
    inference(spm,[status(thm)],[c_0_73,c_0_76]),
    [final] ).

cnf(c_0_96,negated_conjecture,
    ( ~ ssSkC0
    | ssSkP0(X3,skc13,skc12)
    | present(skc12,skf6(skc12,X1,X2)) ),
    inference(spm,[status(thm)],[c_0_74,c_0_76]),
    [final] ).

cnf(c_0_98,negated_conjecture,
    ( ~ ssSkC0
    | shake_beverage(skc12,skc15) ),
    c_0_83,
    [final] ).

cnf(c_0_105,negated_conjecture,
    ( ~ ssSkP0(X4,X3,X1)
    | ~ member(X1,X2,X3)
    | agent(X1,skf6(X1,X2,X4),X4) ),
    c_0_84,
    [final] ).

cnf(c_0_108,negated_conjecture,
    ( ~ group(skc33,X1)
    | ~ five(skc33,X1)
    | ~ nonhuman(skc33,X2)
    | ~ event(skc33,X2)
    | ~ past(skc33,X2)
    | ~ nonreflexive(skc33,X2)
    | ~ order(skc33,X2)
    | ~ ssSkP0(X2,X1,skc33)
    | ~ agent(skc33,X2,skc38)
    | ~ patient(skc33,X2,skc36)
    | ssSkC0
    | member(skc33,skf10(skc33,X1),X1) ),
    inference(spm,[status(thm)],[c_0_85,c_0_86]),
    [final] ).

cnf(c_0_109,negated_conjecture,
    ( order(skc33,skc35)
    | ssSkC0 ),
    clause12,
    [final] ).

cnf(c_0_110,negated_conjecture,
    ( event(skc33,skc35)
    | ssSkC0 ),
    clause9,
    [final] ).

cnf(c_0_111,negated_conjecture,
    ( past(skc33,skc35)
    | ssSkC0 ),
    clause10,
    [final] ).

cnf(c_0_112,negated_conjecture,
    ( nonreflexive(skc33,skc35)
    | ssSkC0 ),
    clause11,
    [final] ).

cnf(c_0_113,negated_conjecture,
    ( agent(skc33,skc35,skc38)
    | ssSkC0 ),
    clause26,
    [final] ).

cnf(c_0_114,negated_conjecture,
    ( patient(skc33,skc35,skc36)
    | ssSkC0 ),
    clause28,
    [final] ).

cnf(c_0_115,negated_conjecture,
    ( ~ agent(skc33,skf6(skc33,X4,X5),X2)
    | ~ patient(skc33,skf6(skc33,X4,X5),skf8(X2,skc33,X6))
    | ssSkC0
    | ssSkP0(X2,X3,skc33)
    | ssSkP0(X1,skc34,skc33) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_90]),c_0_91]),
    [final] ).

cnf(c_0_116,negated_conjecture,
    ( ssSkC0
    | ssSkP0(X1,skc34,skc33)
    | patient(skc33,skf6(skc33,skf8(X1,skc33,skc34),X2),skf8(X1,skc33,skc34)) ),
    inference(spm,[status(thm)],[c_0_92,c_0_71]),
    [final] ).

cnf(c_0_117,negated_conjecture,
    ( ~ ssSkC0
    | ~ agent(skc12,skf6(skc12,X4,X5),X2)
    | ~ patient(skc12,skf6(skc12,X4,X5),skf8(X2,skc12,X6))
    | ssSkP0(X2,X3,skc12)
    | ssSkP0(X1,skc13,skc12) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_93]),c_0_94]),c_0_95]),c_0_96]),
    [final] ).

cnf(c_0_118,negated_conjecture,
    ( ~ ssSkC0
    | ssSkP0(X1,skc13,skc12)
    | patient(skc12,skf6(skc12,skf8(X1,skc12,skc13),X2),skf8(X1,skc12,skc13)) ),
    inference(spm,[status(thm)],[c_0_92,c_0_76]),
    [final] ).

cnf(c_0_120,negated_conjecture,
    ( ~ ssSkC0
    | order(skc12,skc14) ),
    c_0_99,
    [final] ).

cnf(c_0_121,negated_conjecture,
    ( ~ ssSkC0
    | event(skc12,skc14) ),
    c_0_100,
    [final] ).

cnf(c_0_122,negated_conjecture,
    ( ~ ssSkC0
    | past(skc12,skc14) ),
    c_0_101,
    [final] ).

cnf(c_0_123,negated_conjecture,
    ( ~ ssSkC0
    | nonreflexive(skc12,skc14) ),
    c_0_102,
    [final] ).

cnf(c_0_124,negated_conjecture,
    ( ~ ssSkC0
    | agent(skc12,skc14,skc17) ),
    c_0_103,
    [final] ).

cnf(c_0_125,negated_conjecture,
    ( ~ ssSkC0
    | patient(skc12,skc14,skc15) ),
    c_0_104,
    [final] ).

cnf(c_0_126,negated_conjecture,
    ( ~ ssSkP0(X4,X3,X1)
    | ssSkP0(X2,X3,X1)
    | agent(X1,skf6(X1,skf8(X2,X1,X3),X4),X4) ),
    inference(spm,[status(thm)],[c_0_105,c_0_52]),
    [final] ).

cnf(c_0_129,negated_conjecture,
    ( ~ member(skc33,X1,skc34)
    | dollar(skc33,X1)
    | ssSkC0 ),
    c_0_106,
    [final] ).

cnf(c_0_130,negated_conjecture,
    ( ~ ssSkC0
    | ~ member(skc12,X1,skc13)
    | dollar(skc12,X1) ),
    c_0_107,
    [final] ).

cnf(c_0_134,negated_conjecture,
    ( ~ group(skc33,X1)
    | ~ five(skc33,X1)
    | ~ nonhuman(skc33,skc35)
    | ~ ssSkP0(skc35,X1,skc33)
    | ssSkC0
    | member(skc33,skf10(skc33,X1),X1) ),
    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_108,c_0_109]),c_0_110]),c_0_111]),c_0_112]),c_0_113]),c_0_114]),
    [final] ).

cnf(c_0_135,negated_conjecture,
    ( ~ agent(skc33,skf6(skc33,skf8(X1,skc33,skc34),X4),X1)
    | ssSkC0
    | ssSkP0(X1,X3,skc33)
    | ssSkP0(X2,skc34,skc33)
    | ssSkP0(X1,skc34,skc33) ),
    inference(spm,[status(thm)],[c_0_115,c_0_116]),
    [final] ).

cnf(c_0_136,negated_conjecture,
    ( ~ ssSkC0
    | ~ agent(skc12,skf6(skc12,skf8(X1,skc12,skc13),X4),X1)
    | ssSkP0(X1,X3,skc12)
    | ssSkP0(X2,skc13,skc12)
    | ssSkP0(X1,skc13,skc12) ),
    inference(spm,[status(thm)],[c_0_117,c_0_118]),
    [final] ).

cnf(c_0_137,negated_conjecture,
    ( ~ ssSkC0
    | ~ group(skc12,X1)
    | ~ five(skc12,X1)
    | ~ nonhuman(skc12,skc16)
    | ~ ssSkP0(skc16,X1,skc12)
    | member(skc12,skf5(skc12,X1),X1) ),
    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_119,c_0_120]),c_0_121]),c_0_122]),c_0_123]),c_0_124]),c_0_125]),
    [final] ).

cnf(c_0_138,negated_conjecture,
    ( ssSkC0
    | ssSkP0(X1,skc34,skc33)
    | agent(skc33,skf6(skc33,skf8(X1,skc33,skc34),skc37),skc37) ),
    inference(spm,[status(thm)],[c_0_126,c_0_71]),
    [final] ).

cnf(c_0_139,negated_conjecture,
    ( ~ ssSkC0
    | ssSkP0(X1,skc13,skc12)
    | agent(skc12,skf6(skc12,skf8(X1,skc12,skc13),skc14),skc14) ),
    inference(spm,[status(thm)],[c_0_126,c_0_76]),
    [final] ).

cnf(c_0_140,negated_conjecture,
    ( ~ actual_world(X1)
    | ~ shake_beverage(X1,X7)
    | ~ patient(X1,X5,X7)
    | ~ ssSkP0(X5,X3,X1)
    | ~ order(X1,X5)
    | ~ nonreflexive(X1,X5)
    | ~ past(X1,X5)
    | ~ event(X1,X5)
    | ~ nonhuman(X1,X5)
    | ~ of(X1,X4,X6)
    | ~ woman(X1,X6)
    | ~ agent(X1,X5,X6)
    | ~ forename(X1,X4)
    | ~ mia_forename(X1,X4)
    | ~ five(X1,X3)
    | ~ group(X1,X3)
    | ~ dollar(X1,skf10(X1,X2))
    | ssSkC0 ),
    c_0_127,
    [final] ).

cnf(c_0_141,negated_conjecture,
    ( ~ ssSkC0
    | ~ actual_world(X1)
    | ~ shake_beverage(X1,X7)
    | ~ patient(X1,X5,X7)
    | ~ order(X1,X5)
    | ~ nonreflexive(X1,X5)
    | ~ past(X1,X5)
    | ~ event(X1,X5)
    | ~ of(X1,X4,X6)
    | ~ woman(X1,X6)
    | ~ agent(X1,X5,X6)
    | ~ ssSkP0(X4,X3,X1)
    | ~ forename(X1,X4)
    | ~ mia_forename(X1,X4)
    | ~ nonhuman(X1,X4)
    | ~ five(X1,X3)
    | ~ group(X1,X3)
    | ~ dollar(X1,skf5(X1,X2)) ),
    c_0_128,
    [final] ).

cnf(c_0_142,negated_conjecture,
    ( ssSkC0
    | ssSkP0(X1,skc34,skc33)
    | dollar(skc33,skf8(X1,skc33,skc34)) ),
    inference(spm,[status(thm)],[c_0_129,c_0_52]),
    [final] ).

cnf(c_0_143,negated_conjecture,
    ( ~ ssSkC0
    | ssSkP0(X1,skc13,skc12)
    | dollar(skc12,skf8(X1,skc12,skc13)) ),
    inference(spm,[status(thm)],[c_0_130,c_0_52]),
    [final] ).

cnf(c_0_144,negated_conjecture,
    ( nonhuman(skc33,skc37)
    | ssSkC0 ),
    clause5,
    [final] ).

cnf(c_0_145,negated_conjecture,
    ( five(skc33,skc34)
    | ssSkC0 ),
    clause4,
    [final] ).

cnf(c_0_146,negated_conjecture,
    ( group(skc33,skc34)
    | ssSkC0 ),
    clause3,
    [final] ).

cnf(c_0_147,negated_conjecture,
    ( ~ ssSkC0
    | nonhuman(skc12,skc14) ),
    c_0_131,
    [final] ).

cnf(c_0_148,negated_conjecture,
    ( ~ ssSkC0
    | five(skc12,skc13) ),
    c_0_132,
    [final] ).

cnf(c_0_149,negated_conjecture,
    ( ~ ssSkC0
    | group(skc12,skc13) ),
    c_0_133,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NLP044-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/5.46  % Computer : n004.cluster.edu
% 0.19/5.46  % Model    : x86_64 x86_64
% 0.19/5.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.46  % Memory   : 8046.5625MB
% 0.19/5.46  % OS       : Linux 6.8.0-71-generic
% 0.19/5.46  % CPULimit : 300
% 0.19/5.46  % WCLimit  : 300
% 0.19/5.46  % DateTime : Mon Sep 21 01:35:40 UTC 2026
% 0.19/5.46  % CPUTime  : 
% 0.19/5.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/5.54  Running first-order theorem proving
% 0.24/5.54  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.24/5.62  % Version: 3.5.1
% 0.24/5.62  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.62  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.62  % Starting new_bool_3 with 300s (1) cores
% 0.24/5.62  % Starting new_bool_1 with 300s (1) cores
% 0.24/5.62  % Starting sh5l with 300s (1) cores
% 0.24/5.62  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1984528 completed with status 1
% 0.24/5.62  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/5.62  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.62  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.62  % No SInE strategy applied
% 0.24/5.62  % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.24/5.62  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.62  % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.62  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/5.62  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.24/5.62  % Starting new_bool_3 with 136s (1) cores
% 0.24/5.62  % Starting new_bool_1 with 136s (1) cores
% 0.24/5.62  % new_bool_3 with pid 1984535 completed with status 1
% 0.24/5.62  % Result found by new_bool_3
% 0.24/5.62  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.62  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.62  % No SInE strategy applied
% 0.24/5.62  % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.24/5.62  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.62  % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.62  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/5.62  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.24/5.62  % Starting new_bool_3 with 136s (1) cores
% 0.24/5.62  % Preprocessing time       : 0.003 s
% 0.24/5.62  % Presaturation interreduction done
% 0.24/5.62  
% 0.24/5.62  % No proof found!
% 0.24/5.62  % SZS status Satisfiable
% 0.24/5.62  % SZS output start Saturation
% See solution above
% 0.24/5.62  % Parsed axioms                        : 46
% 0.24/5.62  % Removed by relevancy pruning/SinE    : 0
% 0.24/5.62  % Initial clauses                      : 46
% 0.24/5.62  % Removed in clause preprocessing      : 0
% 0.24/5.62  % Initial clauses in saturation        : 46
% 0.24/5.62  % Processed clauses                    : 174
% 0.24/5.62  % ...of these trivial                  : 2
% 0.24/5.62  % ...subsumed                          : 50
% 0.24/5.62  % ...remaining for further processing  : 122
% 0.24/5.62  % Other redundant clauses eliminated   : 0
% 0.24/5.62  % Clauses deleted for lack of memory   : 0
% 0.24/5.62  % Backward-subsumed                    : 2
% 0.24/5.62  % Backward-rewritten                   : 0
% 0.24/5.62  % Generated clauses                    : 82
% 0.24/5.62  % ...of the previous two non-redundant : 82
% 0.24/5.62  % ...aggressively subsumed             : 0
% 0.24/5.62  % Contextual simplify-reflections      : 22
% 0.24/5.62  % Paramodulations                      : 82
% 0.24/5.62  % Factorizations                       : 0
% 0.24/5.62  % NegExts                              : 0
% 0.24/5.62  % Equation resolutions                 : 0
% 0.24/5.62  % Disequality decompositions           : 0
% 0.24/5.62  % Total rewrite steps                  : 4
% 0.24/5.62  % ...of those cached                   : 2
% 0.24/5.62  % Propositional unsat checks           : 0
% 0.24/5.62  %    Propositional check models        : 0
% 0.24/5.62  %    Propositional check unsatisfiable : 0
% 0.24/5.62  %    Propositional clauses             : 0
% 0.24/5.62  %    Propositional clauses after purity: 0
% 0.24/5.62  %    Propositional unsat core size     : 0
% 0.24/5.62  %    Propositional preprocessing time  : 0.000
% 0.24/5.62  %    Propositional encoding time       : 0.000
% 0.24/5.62  %    Propositional solver time         : 0.000
% 0.24/5.62  %    Success case prop preproc time    : 0.000
% 0.24/5.62  %    Success case prop encoding time   : 0.000
% 0.24/5.62  %    Success case prop solver time     : 0.000
% 0.24/5.62  % Current number of processed clauses  : 74
% 0.24/5.62  %    Positive orientable unit clauses  : 2
% 0.24/5.62  %    Positive unorientable unit clauses: 0
% 0.24/5.62  %    Negative unit clauses             : 0
% 0.24/5.62  %    Non-unit-clauses                  : 72
% 0.24/5.62  % Current number of unprocessed clauses: 0
% 0.24/5.62  % ...number of literals in the above   : 0
% 0.24/5.62  % Current number of archived formulas  : 0
% 0.24/5.62  % Current number of archived clauses   : 48
% 0.24/5.62  % Clause-clause subsumption calls (NU) : 4405
% 0.24/5.62  % Rec. Clause-clause subsumption calls : 746
% 0.24/5.62  % Non-unit clause-clause subsumptions  : 74
% 0.24/5.62  % Unit Clause-clause subsumption calls : 0
% 0.24/5.62  % Rewrite failures with RHS unbound    : 0
% 0.24/5.62  % BW rewrite match attempts            : 0
% 0.24/5.62  % BW rewrite match successes           : 0
% 0.24/5.62  % Condensation attempts                : 0
% 0.24/5.62  % Condensation successes               : 0
% 0.24/5.62  % Termbank termtop insertions          : 4719
% 0.24/5.62  % Search garbage collected termcells   : 194
% 0.24/5.62  
% 0.24/5.62  % -------------------------------------------------
% 0.24/5.62  % User time                : 0.019 s
% 0.24/5.62  % System time              : 0.010 s
% 0.24/5.62  % Total time               : 0.030 s
% 0.24/5.62  % Maximum resident set size: 3428 pages
% 0.24/5.62  
% 0.24/5.62  % -------------------------------------------------
% 0.24/5.62  % User time                : 0.103 s
% 0.24/5.62  % System time              : 0.021 s
% 0.24/5.62  % Total time               : 0.124 s
% 0.24/5.62  % Maximum resident set size: 4608 pages
% 0.24/5.62  % E exiting
%------------------------------------------------------------------------------