↑ Up

E-SAT---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SYN735-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n019.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 03:35:49 PM UTC 2026

% Result   : Satisfiable 0.13s 0.61s
% Output   : Saturation 0.13s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_21ERROR: Could not build tree for root c_0_89ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_24,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssRr(X1,X3)
    | ~ ssPv3(X2)
    | ~ ssRr(X1,X2)
    | ssPv2(X1)
    | ssPv1(X3) ),
    c_0_21,
    [final] ).

cnf(c_0_25,negated_conjecture,
    ssRr(X1,skf1(X1)),
    clause1,
    [final] ).

cnf(c_0_26,negated_conjecture,
    ( ~ ssRr(X1,X3)
    | ~ ssRr(X1,X2)
    | ssPv3(X1)
    | ssPv1(X1)
    | ssPv2(X3)
    | ssPv3(X2) ),
    c_0_22,
    [final] ).

cnf(c_0_28,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssRr(X1,X4)
    | ~ ssRr(X1,X3)
    | ~ ssPv3(X2)
    | ~ ssRr(X1,X2)
    | ssPv2(X4)
    | ssPv4(X3) ),
    c_0_23,
    [final] ).

cnf(c_0_33,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv3(X2)
    | ~ ssPv4(X1)
    | ssPv1(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]),
    [final] ).

cnf(c_0_34,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ssPv1(X1)
    | ssPv3(X2)
    | ssPv3(X1)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_25]),
    [final] ).

cnf(c_0_35,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ssPv4(X1)
    | ssPv3(X1)
    | ssPv1(X1)
    | ssPv1(X2) ),
    c_0_27,
    [final] ).

cnf(c_0_36,negated_conjecture,
    ( ~ ssRr(X1,X3)
    | ~ ssRr(X1,X2)
    | ~ ssPv3(X3)
    | ~ ssPv4(X1)
    | ssPv4(X2)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_25]),
    [final] ).

cnf(c_0_37,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssPv1(X1)
    | ~ ssRr(X1,X3)
    | ~ ssRr(X1,X2)
    | ssPv2(X3)
    | ssPv4(X2) ),
    c_0_29,
    [final] ).

cnf(c_0_39,negated_conjecture,
    ( ~ ssRr(X1,X4)
    | ~ ssRr(X1,X3)
    | ~ ssPv2(X2)
    | ~ ssRr(X1,X2)
    | ssPv2(X1)
    | ssPv3(X4)
    | ssPv4(X3) ),
    c_0_30,
    [final] ).

cnf(c_0_40,negated_conjecture,
    ( ~ ssPv2(X1)
    | ~ ssRr(X1,X4)
    | ~ ssRr(X1,X3)
    | ~ ssPv1(X2)
    | ~ ssRr(X1,X2)
    | ssPv2(X4)
    | ssPv3(X3) ),
    c_0_31,
    [final] ).

cnf(c_0_43,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssRr(X1,X4)
    | ~ ssRr(X1,X3)
    | ~ ssPv4(X2)
    | ~ ssRr(X1,X2)
    | ssPv1(X4)
    | ssPv3(X3) ),
    c_0_32,
    [final] ).

cnf(c_0_51,negated_conjecture,
    ( ~ ssPv3(skf1(X1))
    | ~ ssPv4(X1)
    | ssPv1(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_25]),
    [final] ).

cnf(c_0_52,negated_conjecture,
    ( ssPv1(X1)
    | ssPv3(X1)
    | ssPv3(skf1(X1))
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_34,c_0_25]),
    [final] ).

cnf(c_0_53,negated_conjecture,
    ( ssPv1(X1)
    | ssPv1(skf1(X1))
    | ssPv3(X1)
    | ssPv4(X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_25]),
    [final] ).

cnf(c_0_54,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv3(X2)
    | ~ ssPv4(X1)
    | ssPv4(skf1(X1))
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_36,c_0_25]),
    [final] ).

cnf(c_0_55,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(X1)
    | ~ ssPv4(X1)
    | ssPv4(X2)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_25]),
    [final] ).

cnf(c_0_56,negated_conjecture,
    ( ~ ssRr(X1,X4)
    | ~ ssPv1(X3)
    | ~ ssRr(X1,X3)
    | ~ ssPv3(X2)
    | ~ ssRr(X1,X2)
    | ssPv3(X1)
    | ssPv2(X4) ),
    c_0_38,
    [final] ).

cnf(c_0_57,negated_conjecture,
    ( ~ ssRr(X1,X3)
    | ~ ssRr(X1,X2)
    | ~ ssPv2(X3)
    | ssPv3(skf1(X1))
    | ssPv4(X2)
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_39,c_0_25]),
    [final] ).

cnf(c_0_58,negated_conjecture,
    ( ~ ssRr(X1,X3)
    | ~ ssRr(X1,X2)
    | ~ ssPv1(X3)
    | ~ ssPv2(X1)
    | ssPv3(X2)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_25]),
    [final] ).

cnf(c_0_59,negated_conjecture,
    ( ~ ssRr(X1,X4)
    | ~ ssPv2(X3)
    | ~ ssRr(X1,X3)
    | ~ ssPv3(X2)
    | ~ ssRr(X1,X2)
    | ssPv2(X1)
    | ssPv3(X4) ),
    c_0_41,
    [final] ).

cnf(c_0_60,negated_conjecture,
    ( ~ ssRr(X1,X4)
    | ~ ssPv1(X3)
    | ~ ssRr(X1,X3)
    | ~ ssPv4(X2)
    | ~ ssRr(X1,X2)
    | ssPv1(X1)
    | ssPv2(X4) ),
    c_0_42,
    [final] ).

cnf(c_0_61,negated_conjecture,
    ( ~ ssRr(X2,X3)
    | ~ ssRr(X2,X1)
    | ~ ssPv3(X2)
    | ~ ssPv4(X3)
    | ssPv1(skf1(X2))
    | ssPv3(X1) ),
    inference(spm,[status(thm)],[c_0_43,c_0_25]),
    [final] ).

cnf(c_0_62,negated_conjecture,
    ( ~ ssPv1(X1)
    | ~ ssRr(X1,X3)
    | ~ ssRr(X1,X2)
    | ssPv2(X1)
    | ssPv2(X3)
    | ssPv4(X2) ),
    c_0_44,
    [final] ).

cnf(c_0_63,negated_conjecture,
    ( ~ ssPv1(X1)
    | ~ ssRr(X1,X4)
    | ~ ssPv1(X3)
    | ~ ssRr(X1,X3)
    | ~ ssPv3(X2)
    | ~ ssRr(X1,X2)
    | ssPv2(X4) ),
    c_0_45,
    [final] ).

cnf(c_0_64,negated_conjecture,
    ( ~ ssRr(X1,X3)
    | ~ ssPv4(X2)
    | ~ ssRr(X1,X2)
    | ssPv3(X1)
    | ssPv2(X1)
    | ssPv2(X3) ),
    c_0_46,
    [final] ).

cnf(c_0_65,negated_conjecture,
    ( ~ ssPv2(X1)
    | ~ ssRr(X1,X3)
    | ~ ssRr(X1,X2)
    | ssPv1(X1)
    | ssPv3(X3)
    | ssPv4(X2) ),
    c_0_47,
    [final] ).

cnf(c_0_66,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssPv2(X1)
    | ~ ssPv2(X2)
    | ~ ssRr(X1,X2)
    | ssPv3(X1) ),
    c_0_48,
    [final] ).

cnf(c_0_67,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssPv1(X1)
    | ~ ssRr(X1,X3)
    | ~ ssRr(X1,X2)
    | ssPv3(X3)
    | ssPv4(X2) ),
    c_0_49,
    [final] ).

cnf(c_0_68,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssRr(X1,X3)
    | ~ ssPv1(X2)
    | ~ ssRr(X1,X2)
    | ssPv2(X1)
    | ssPv3(X3) ),
    c_0_50,
    [final] ).

cnf(c_0_71,negated_conjecture,
    ( ssPv1(X1)
    | ssPv1(skf1(X1))
    | ssPv3(X1)
    | ssPv2(X1)
    | ssPv2(skf1(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),
    [final] ).

cnf(c_0_72,negated_conjecture,
    ( ~ ssPv3(skf1(X1))
    | ~ ssPv4(X1)
    | ssPv4(skf1(X1))
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_54,c_0_25]),
    [final] ).

cnf(c_0_73,negated_conjecture,
    ( ~ ssPv1(X1)
    | ~ ssPv4(X1)
    | ssPv4(skf1(X1))
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_55,c_0_25]),
    [final] ).

cnf(c_0_74,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssRr(X1,X3)
    | ~ ssPv1(X3)
    | ~ ssPv3(X2)
    | ssPv3(X1)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_56,c_0_25]),
    [final] ).

cnf(c_0_75,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv2(X2)
    | ssPv3(skf1(X1))
    | ssPv4(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_57,c_0_25]),
    [final] ).

cnf(c_0_76,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(X2)
    | ~ ssPv2(X1)
    | ssPv3(skf1(X1))
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_58,c_0_25]),
    [final] ).

cnf(c_0_77,negated_conjecture,
    ( ~ ssRr(X1,X3)
    | ~ ssRr(X1,X2)
    | ~ ssPv3(X3)
    | ~ ssPv2(X2)
    | ssPv3(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_59,c_0_25]),
    [final] ).

cnf(c_0_78,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssRr(X1,X3)
    | ~ ssPv1(X3)
    | ~ ssPv4(X2)
    | ssPv1(X1)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_60,c_0_25]),
    [final] ).

cnf(c_0_79,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv3(X1)
    | ~ ssPv4(X2)
    | ssPv1(skf1(X1))
    | ssPv3(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_61,c_0_25]),
    [final] ).

cnf(c_0_80,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(X1)
    | ssPv4(X2)
    | ssPv2(X1)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_62,c_0_25]),
    [final] ).

cnf(c_0_81,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssRr(X1,X3)
    | ~ ssPv1(X1)
    | ~ ssPv1(X3)
    | ~ ssPv3(X2)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_63,c_0_25]),
    [final] ).

cnf(c_0_82,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv4(X2)
    | ssPv3(X1)
    | ssPv2(X1)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_64,c_0_25]),
    [final] ).

cnf(c_0_83,negated_conjecture,
    ( ~ ssRr(X2,X1)
    | ~ ssPv2(X2)
    | ssPv1(X2)
    | ssPv3(skf1(X2))
    | ssPv4(X1) ),
    inference(spm,[status(thm)],[c_0_65,c_0_25]),
    [final] ).

cnf(c_0_84,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssPv2(X1)
    | ~ ssPv2(skf1(X1))
    | ssPv3(X1) ),
    inference(spm,[status(thm)],[c_0_66,c_0_25]),
    [final] ).

cnf(c_0_85,negated_conjecture,
    ( ~ ssRr(X2,X1)
    | ~ ssPv1(X2)
    | ~ ssPv4(X2)
    | ssPv3(skf1(X2))
    | ssPv4(X1) ),
    inference(spm,[status(thm)],[c_0_67,c_0_25]),
    [final] ).

cnf(c_0_86,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(X2)
    | ~ ssPv3(X1)
    | ssPv3(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_68,c_0_25]),
    [final] ).

cnf(c_0_87,negated_conjecture,
    ( ~ ssPv1(X3)
    | ~ ssRr(X1,X3)
    | ~ ssPv4(X2)
    | ~ ssRr(X1,X2)
    | ssPv3(X1)
    | ssPv2(X1) ),
    c_0_69,
    [final] ).

cnf(c_0_88,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssPv1(X1)
    | ~ ssRr(X1,X3)
    | ~ ssPv3(X2)
    | ~ ssRr(X1,X2)
    | ssPv3(X3) ),
    c_0_70,
    [final] ).

cnf(c_0_89,negated_conjecture,
    ( ~ ssPv4(X1)
    | ssPv1(skf1(X1))
    | ssPv1(skf1(skf1(X1)))
    | ssPv2(X1)
    | ssPv2(skf1(X1))
    | ssPv2(skf1(skf1(X1))) ),
    inference(spm,[status(thm)],[c_0_51,c_0_71]),
    [final] ).

cnf(c_0_90,negated_conjecture,
    ( ~ ssPv4(X1)
    | ssPv1(skf1(X1))
    | ssPv1(skf1(skf1(X1)))
    | ssPv4(skf1(X1))
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_72,c_0_53]),
    [final] ).

cnf(c_0_91,negated_conjecture,
    ( ~ ssPv4(X1)
    | ssPv3(X1)
    | ssPv4(skf1(X1))
    | ssPv2(skf1(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_52]),c_0_73]),
    [final] ).

cnf(c_0_92,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(skf1(X1))
    | ~ ssPv3(X2)
    | ssPv3(X1)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_74,c_0_25]),
    [final] ).

cnf(c_0_93,negated_conjecture,
    ( ~ ssPv2(skf1(X1))
    | ssPv3(skf1(X1))
    | ssPv4(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_75,c_0_25]),
    [final] ).

cnf(c_0_94,negated_conjecture,
    ( ~ ssPv1(skf1(X1))
    | ~ ssPv2(X1)
    | ssPv3(skf1(X1))
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_76,c_0_25]),
    [final] ).

cnf(c_0_95,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv3(X2)
    | ~ ssPv2(skf1(X1))
    | ssPv3(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_77,c_0_25]),
    [final] ).

cnf(c_0_96,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(skf1(X1))
    | ~ ssPv4(X2)
    | ssPv1(X1)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_78,c_0_25]),
    [final] ).

cnf(c_0_97,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssPv4(skf1(X1))
    | ssPv1(skf1(X1))
    | ssPv3(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_25]),
    [final] ).

cnf(c_0_98,negated_conjecture,
    ( ~ ssPv1(X1)
    | ssPv4(skf1(X1))
    | ssPv2(X1)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_80,c_0_25]),
    [final] ).

cnf(c_0_99,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(X1)
    | ~ ssPv1(skf1(X1))
    | ~ ssPv3(X2)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_81,c_0_25]),
    [final] ).

cnf(c_0_100,negated_conjecture,
    ( ~ ssPv4(skf1(X1))
    | ssPv3(X1)
    | ssPv2(X1)
    | ssPv2(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_82,c_0_25]),
    [final] ).

cnf(c_0_101,negated_conjecture,
    ( ~ ssPv2(X1)
    | ssPv1(X1)
    | ssPv3(skf1(X1))
    | ssPv4(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_83,c_0_25]),
    [final] ).

cnf(c_0_102,negated_conjecture,
    ( ~ ssPv4(X1)
    | ~ ssPv4(skf1(X1))
    | ~ ssPv2(skf1(X1))
    | ~ ssPv2(skf1(skf1(X1)))
    | ssPv1(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_51,c_0_84]),
    [final] ).

cnf(c_0_103,negated_conjecture,
    ( ~ ssPv4(X1)
    | ssPv1(skf1(X1))
    | ssPv1(skf1(skf1(X1)))
    | ssPv4(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_51,c_0_53]),
    [final] ).

cnf(c_0_104,negated_conjecture,
    ( ~ ssPv1(X1)
    | ~ ssPv4(X1)
    | ssPv3(skf1(X1))
    | ssPv4(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_85,c_0_25]),
    [final] ).

cnf(c_0_105,negated_conjecture,
    ( ~ ssPv1(skf1(X1))
    | ~ ssPv3(X1)
    | ssPv3(skf1(X1))
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_86,c_0_25]),
    [final] ).

cnf(c_0_106,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(skf1(X1))
    | ~ ssPv4(X2)
    | ssPv3(X1)
    | ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_87,c_0_25]),
    [final] ).

cnf(c_0_107,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(X1)
    | ~ ssPv3(X2)
    | ~ ssPv4(X1)
    | ssPv3(skf1(X1)) ),
    inference(spm,[status(thm)],[c_0_88,c_0_25]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN735-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.54  % Computer : n019.cluster.edu
% 0.09/0.54  % Model    : x86_64 x86_64
% 0.09/0.54  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.54  % Memory   : 8046.5625MB
% 0.09/0.54  % OS       : Linux 6.8.0-71-generic
% 0.09/0.54  % CPULimit : 300
% 0.09/0.54  % WCLimit  : 300
% 0.09/0.54  % DateTime : Mon Sep 21 11:14:21 UTC 2026
% 0.09/0.55  % CPUTime  : 
% 0.09/0.55  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.59  Running first-order theorem proving
% 0.13/0.59  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.13/0.61  % Version: 3.5.1
% 0.13/0.61  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.61  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.61  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.61  % Starting sh5l with 300s (1) cores
% 0.13/0.61  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2431018 completed with status 1
% 0.13/0.61  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.61  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.61  % No SInE strategy applied
% 0.13/0.61  % Search class: FGUNF-FFMF11-SFFFFFNN
% 0.13/0.61  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.61  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.61  % Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.13/0.61  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.61  % Starting new_bool_3 with 136s (1) cores
% 0.13/0.61  % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2431025 completed with status 1
% 0.13/0.61  % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.61  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.61  % No SInE strategy applied
% 0.13/0.61  % Search class: FGUNF-FFMF11-SFFFFFNN
% 0.13/0.61  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.61  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.61  % Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.13/0.61  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.61  % Preprocessing time       : 0.001 s
% 0.13/0.61  % Presaturation interreduction done
% 0.13/0.61  
% 0.13/0.61  % No proof found!
% 0.13/0.61  % SZS status Satisfiable
% 0.13/0.61  % SZS output start Saturation
% See solution above
% 0.13/0.61  % Parsed axioms                        : 21
% 0.13/0.61  % Removed by relevancy pruning/SinE    : 0
% 0.13/0.61  % Initial clauses                      : 21
% 0.13/0.61  % Removed in clause preprocessing      : 0
% 0.13/0.61  % Initial clauses in saturation        : 21
% 0.13/0.61  % Processed clauses                    : 89
% 0.13/0.61  % ...of these trivial                  : 0
% 0.13/0.61  % ...subsumed                          : 1
% 0.13/0.61  % ...remaining for further processing  : 88
% 0.13/0.61  % Other redundant clauses eliminated   : 0
% 0.13/0.61  % Clauses deleted for lack of memory   : 0
% 0.13/0.61  % Backward-subsumed                    : 0
% 0.13/0.61  % Backward-rewritten                   : 0
% 0.13/0.61  % Generated clauses                    : 49
% 0.13/0.61  % ...of the previous two non-redundant : 47
% 0.13/0.61  % ...aggressively subsumed             : 0
% 0.13/0.61  % Contextual simplify-reflections      : 2
% 0.13/0.61  % Paramodulations                      : 49
% 0.13/0.61  % Factorizations                       : 0
% 0.13/0.61  % NegExts                              : 0
% 0.13/0.61  % Equation resolutions                 : 0
% 0.13/0.61  % Disequality decompositions           : 0
% 0.13/0.61  % Total rewrite steps                  : 0
% 0.13/0.61  % ...of those cached                   : 0
% 0.13/0.61  % Propositional unsat checks           : 0
% 0.13/0.61  %    Propositional check models        : 0
% 0.13/0.61  %    Propositional check unsatisfiable : 0
% 0.13/0.61  %    Propositional clauses             : 0
% 0.13/0.61  %    Propositional clauses after purity: 0
% 0.13/0.61  %    Propositional unsat core size     : 0
% 0.13/0.61  %    Propositional preprocessing time  : 0.000
% 0.13/0.61  %    Propositional encoding time       : 0.000
% 0.13/0.61  %    Propositional solver time         : 0.000
% 0.13/0.61  %    Success case prop preproc time    : 0.000
% 0.13/0.61  %    Success case prop encoding time   : 0.000
% 0.13/0.61  %    Success case prop solver time     : 0.000
% 0.13/0.61  % Current number of processed clauses  : 67
% 0.13/0.61  %    Positive orientable unit clauses  : 1
% 0.13/0.61  %    Positive unorientable unit clauses: 0
% 0.13/0.61  %    Negative unit clauses             : 0
% 0.13/0.61  %    Non-unit-clauses                  : 66
% 0.13/0.61  % Current number of unprocessed clauses: 0
% 0.13/0.61  % ...number of literals in the above   : 0
% 0.13/0.61  % Current number of archived formulas  : 0
% 0.13/0.61  % Current number of archived clauses   : 21
% 0.13/0.61  % Clause-clause subsumption calls (NU) : 47
% 0.13/0.61  % Rec. Clause-clause subsumption calls : 20
% 0.13/0.61  % Non-unit clause-clause subsumptions  : 3
% 0.13/0.61  % Unit Clause-clause subsumption calls : 0
% 0.13/0.61  % Rewrite failures with RHS unbound    : 0
% 0.13/0.61  % BW rewrite match attempts            : 0
% 0.13/0.61  % BW rewrite match successes           : 0
% 0.13/0.61  % Condensation attempts                : 0
% 0.13/0.61  % Condensation successes               : 0
% 0.13/0.61  % Termbank termtop insertions          : 3655
% 0.13/0.61  % Search garbage collected termcells   : 98
% 0.13/0.61  
% 0.13/0.61  % -------------------------------------------------
% 0.13/0.61  % User time                : 0.006 s
% 0.13/0.61  % System time              : 0.001 s
% 0.13/0.61  % Total time               : 0.007 s
% 0.13/0.61  % Maximum resident set size: 3648 pages
% 0.13/0.61  
% 0.13/0.61  % -------------------------------------------------
% 0.13/0.61  % User time                : 0.027 s
% 0.13/0.61  % System time              : 0.010 s
% 0.13/0.61  % Total time               : 0.037 s
% 0.13/0.61  % Maximum resident set size: 4864 pages
% 0.13/0.61  % E exiting
%------------------------------------------------------------------------------