↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : NUM558+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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 01:55:29 PM UTC 2026

% Result   : Theorem 0.35s 0.46s
% Output   : CNFRefutation 0.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   56 (  22 unt;   0 def)
%            Number of atoms       :  294 (  59 equ)
%            Maximal formula atoms :   54 (   5 avg)
%            Number of connectives :  401 ( 163   ~; 169   |;  52   &)
%                                         (   9 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  10 con; 0-3 aty)
%            Number of variables   :   77 (   0 sgn  45   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__2227,hypothesis,
    ( slbdtsldtrb0(xS,xk) != slcrc0
    & aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2227) ).

fof(mDefSub,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aSubsetOf0(X2,X1)
        <=> ( ! [X3] :
                ( aElementOf0(X3,X2)
               => aElementOf0(X3,X1) )
            & aSet0(X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).

fof(mDefSel,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X2,szNzAzT0)
        & aSet0(X1) )
     => ! [X3] :
          ( X3 = slbdtsldtrb0(X1,X2)
        <=> ( ! [X4] :
                ( aElementOf0(X4,X3)
              <=> ( sbrdtbr0(X4) = X2
                  & aSubsetOf0(X4,X1) ) )
            & aSet0(X3) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSel) ).

fof(m__2202_02,hypothesis,
    ( xk != sz00
    & aSet0(xT)
    & aSet0(xS) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).

fof(m__2202,hypothesis,
    aElementOf0(xk,szNzAzT0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202) ).

fof(mDefCons,axiom,
    ! [X1,X2] :
      ( ( aElement0(X2)
        & aSet0(X1) )
     => ! [X3] :
          ( X3 = sdtpldt0(X1,X2)
        <=> ( ! [X4] :
                ( aElementOf0(X4,X3)
              <=> ( ( X4 = X2
                    | aElementOf0(X4,X1) )
                  & aElement0(X4) ) )
            & aSet0(X3) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefCons) ).

fof(mEOfElem,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aElementOf0(X2,X1)
         => aElement0(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).

fof(mDefDiff,axiom,
    ! [X1,X2] :
      ( ( aElement0(X2)
        & aSet0(X1) )
     => ! [X3] :
          ( X3 = sdtmndt0(X1,X2)
        <=> ( ! [X4] :
                ( aElementOf0(X4,X3)
              <=> ( X4 != X2
                  & aElementOf0(X4,X1)
                  & aElement0(X4) ) )
            & aSet0(X3) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).

fof(m__2256,hypothesis,
    aElementOf0(xx,xS),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2256) ).

fof(m__,conjecture,
    aElementOf0(xx,xT),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(m__2378,hypothesis,
    aElementOf0(xP,slbdtsldtrb0(xS,xk)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2378) ).

fof(m__2357,hypothesis,
    xP = sdtpldt0(sdtmndt0(xQ,xy),xx),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2357) ).

fof(m__2304,hypothesis,
    ( aElementOf0(xy,xQ)
    & aElement0(xy) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2304) ).

fof(m__2291,hypothesis,
    ( sbrdtbr0(xQ) = xk
    & isFinite0(xQ)
    & aSet0(xQ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2291) ).

fof(c_0_14,hypothesis,
    ( slbdtsldtrb0(xS,xk) != slcrc0
    & aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
    inference(fof_simplification,[status(thm)],[m__2227]) ).

fof(c_0_15,plain,
    ! [X11,X12,X13,X14] :
      ( ( ~ aSet0(X11)
        | aSubsetOf0(X14,X11)
        | ~ aSet0(X14)
        | ~ aElementOf0(esk2_2(X11,X14),X11) )
      & ( ~ aSet0(X11)
        | aSubsetOf0(X14,X11)
        | ~ aSet0(X14)
        | aElementOf0(esk2_2(X11,X14),X14) )
      & ( ~ aSet0(X11)
        | ~ aSubsetOf0(X12,X11)
        | aElementOf0(X13,X11)
        | ~ aElementOf0(X13,X12) )
      & ( ~ aSet0(X11)
        | ~ aSubsetOf0(X12,X11)
        | aSet0(X12) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).

fof(c_0_16,hypothesis,
    ( slbdtsldtrb0(xS,xk) != slcrc0
    & aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
    inference(fof_nnf,[status(thm)],[c_0_14]) ).

fof(c_0_17,plain,
    ! [X90,X91,X92,X93,X94,X95] :
      ( ( ~ aElementOf0(X91,szNzAzT0)
        | ~ aSet0(X90)
        | X95 = slbdtsldtrb0(X90,X91)
        | ~ aSet0(X95)
        | aElementOf0(esk7_3(X90,X91,X95),X95)
        | sbrdtbr0(esk7_3(X90,X91,X95)) = X91 )
      & ( ~ aElementOf0(X91,szNzAzT0)
        | ~ aSet0(X90)
        | X95 = slbdtsldtrb0(X90,X91)
        | ~ aSet0(X95)
        | aElementOf0(esk7_3(X90,X91,X95),X95)
        | aSubsetOf0(esk7_3(X90,X91,X95),X90) )
      & ( ~ aElementOf0(X91,szNzAzT0)
        | ~ aSet0(X90)
        | X95 = slbdtsldtrb0(X90,X91)
        | ~ aSet0(X95)
        | sbrdtbr0(esk7_3(X90,X91,X95)) != X91
        | ~ aSubsetOf0(esk7_3(X90,X91,X95),X90)
        | ~ aElementOf0(esk7_3(X90,X91,X95),X95) )
      & ( ~ aElementOf0(X91,szNzAzT0)
        | ~ aSet0(X90)
        | X92 != slbdtsldtrb0(X90,X91)
        | aElementOf0(X94,X92)
        | sbrdtbr0(X94) != X91
        | ~ aSubsetOf0(X94,X90) )
      & ( ~ aElementOf0(X91,szNzAzT0)
        | ~ aSet0(X90)
        | X92 != slbdtsldtrb0(X90,X91)
        | ~ aElementOf0(X93,X92)
        | sbrdtbr0(X93) = X91 )
      & ( ~ aElementOf0(X91,szNzAzT0)
        | ~ aSet0(X90)
        | X92 != slbdtsldtrb0(X90,X91)
        | ~ aElementOf0(X93,X92)
        | aSubsetOf0(X93,X90) )
      & ( ~ aElementOf0(X91,szNzAzT0)
        | ~ aSet0(X90)
        | X92 != slbdtsldtrb0(X90,X91)
        | aSet0(X92) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSel])])])])])])]) ).

fof(c_0_18,hypothesis,
    ( xk != sz00
    & aSet0(xT)
    & aSet0(xS) ),
    inference(fof_simplification,[status(thm)],[m__2202_02]) ).

cnf(c_0_19,plain,
    ( ~ aSet0(X3)
    | ~ aSubsetOf0(X2,X3)
    | ~ aElementOf0(X1,X2)
    | aElementOf0(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,hypothesis,
    aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,plain,
    ( ~ aElementOf0(X3,szNzAzT0)
    | ~ aSet0(X2)
    | X1 != slbdtsldtrb0(X2,X3)
    | aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_22,hypothesis,
    ( xk != sz00
    & aSet0(xT)
    & aSet0(xS) ),
    inference(fof_nnf,[status(thm)],[c_0_18]) ).

cnf(c_0_23,plain,
    ( ~ aElementOf0(X4,szNzAzT0)
    | ~ aSet0(X2)
    | X3 != slbdtsldtrb0(X2,X4)
    | ~ aElementOf0(X1,X3)
    | aSubsetOf0(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,hypothesis,
    ( ~ aSet0(slbdtsldtrb0(xT,xk))
    | ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
    | aElementOf0(X1,slbdtsldtrb0(xT,xk)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    ( ~ aSet0(X1)
    | ~ aElementOf0(X2,szNzAzT0)
    | aSet0(slbdtsldtrb0(X1,X2)) ),
    inference(er,[status(thm)],[c_0_21]) ).

cnf(c_0_26,hypothesis,
    aElementOf0(xk,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__2202]) ).

cnf(c_0_27,hypothesis,
    aSet0(xT),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

fof(c_0_28,plain,
    ! [X37,X38,X39,X40,X41,X42] :
      ( ( ~ aElement0(X38)
        | ~ aSet0(X37)
        | X42 = sdtpldt0(X37,X38)
        | ~ aSet0(X42)
        | aElementOf0(esk4_3(X37,X38,X42),X42)
        | esk4_3(X37,X38,X42) = X38
        | aElementOf0(esk4_3(X37,X38,X42),X37) )
      & ( ~ aElement0(X38)
        | ~ aSet0(X37)
        | X42 = sdtpldt0(X37,X38)
        | ~ aSet0(X42)
        | aElementOf0(esk4_3(X37,X38,X42),X42)
        | aElement0(esk4_3(X37,X38,X42)) )
      & ( ~ aElement0(X38)
        | ~ aSet0(X37)
        | X42 = sdtpldt0(X37,X38)
        | ~ aSet0(X42)
        | ~ aElementOf0(esk4_3(X37,X38,X42),X42)
        | ~ aElement0(esk4_3(X37,X38,X42))
        | esk4_3(X37,X38,X42) != X38 )
      & ( ~ aElement0(X38)
        | ~ aSet0(X37)
        | X42 = sdtpldt0(X37,X38)
        | ~ aSet0(X42)
        | ~ aElementOf0(esk4_3(X37,X38,X42),X42)
        | ~ aElement0(esk4_3(X37,X38,X42))
        | ~ aElementOf0(esk4_3(X37,X38,X42),X37) )
      & ( ~ aElement0(X38)
        | ~ aSet0(X37)
        | X39 != sdtpldt0(X37,X38)
        | aElementOf0(X41,X39)
        | ~ aElement0(X41)
        | X41 != X38 )
      & ( ~ aElement0(X38)
        | ~ aSet0(X37)
        | X39 != sdtpldt0(X37,X38)
        | aElementOf0(X41,X39)
        | ~ aElement0(X41)
        | ~ aElementOf0(X41,X37) )
      & ( ~ aElement0(X38)
        | ~ aSet0(X37)
        | X39 != sdtpldt0(X37,X38)
        | ~ aElementOf0(X40,X39)
        | X40 = X38
        | aElementOf0(X40,X37) )
      & ( ~ aElement0(X38)
        | ~ aSet0(X37)
        | X39 != sdtpldt0(X37,X38)
        | ~ aElementOf0(X40,X39)
        | aElement0(X40) )
      & ( ~ aElement0(X38)
        | ~ aSet0(X37)
        | X39 != sdtpldt0(X37,X38)
        | aSet0(X39) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefCons])])])])])])]) ).

fof(c_0_29,plain,
    ! [X5,X6] :
      ( aElement0(X6)
      | ~ aElementOf0(X6,X5)
      | ~ aSet0(X5) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).

fof(c_0_30,plain,
    ! [X1,X2] :
      ( ( aElement0(X2)
        & aSet0(X1) )
     => ! [X3] :
          ( X3 = sdtmndt0(X1,X2)
        <=> ( ! [X4] :
                ( aElementOf0(X4,X3)
              <=> ( X4 != X2
                  & aElementOf0(X4,X1)
                  & aElement0(X4) ) )
            & aSet0(X3) ) ) ),
    inference(fof_simplification,[status(thm)],[mDefDiff]) ).

cnf(c_0_31,plain,
    ( ~ aSet0(X2)
    | ~ aElementOf0(X3,szNzAzT0)
    | ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
    | aSubsetOf0(X1,X2) ),
    inference(er,[status(thm)],[c_0_23]) ).

cnf(c_0_32,hypothesis,
    ( ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
    | aElementOf0(X1,slbdtsldtrb0(xT,xk)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_33,plain,
    ( ~ aElement0(X2)
    | ~ aSet0(X4)
    | X3 != sdtpldt0(X4,X2)
    | ~ aElement0(X1)
    | X1 != X2
    | aElementOf0(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_34,plain,
    ( ~ aElementOf0(X2,X1)
    | ~ aSet0(X1)
    | aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_35,hypothesis,
    aElementOf0(xx,xS),
    inference(split_conjunct,[status(thm)],[m__2256]) ).

cnf(c_0_36,hypothesis,
    aSet0(xS),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

fof(c_0_37,plain,
    ! [X44,X45,X46,X47,X48,X49] :
      ( ( ~ aElement0(X45)
        | ~ aSet0(X44)
        | X49 = sdtmndt0(X44,X45)
        | ~ aSet0(X49)
        | aElementOf0(esk5_3(X44,X45,X49),X49)
        | esk5_3(X44,X45,X49) != X45 )
      & ( ~ aElement0(X45)
        | ~ aSet0(X44)
        | X49 = sdtmndt0(X44,X45)
        | ~ aSet0(X49)
        | aElementOf0(esk5_3(X44,X45,X49),X49)
        | aElementOf0(esk5_3(X44,X45,X49),X44) )
      & ( ~ aElement0(X45)
        | ~ aSet0(X44)
        | X49 = sdtmndt0(X44,X45)
        | ~ aSet0(X49)
        | aElementOf0(esk5_3(X44,X45,X49),X49)
        | aElement0(esk5_3(X44,X45,X49)) )
      & ( ~ aElement0(X45)
        | ~ aSet0(X44)
        | X49 = sdtmndt0(X44,X45)
        | ~ aSet0(X49)
        | esk5_3(X44,X45,X49) = X45
        | ~ aElementOf0(esk5_3(X44,X45,X49),X44)
        | ~ aElement0(esk5_3(X44,X45,X49))
        | ~ aElementOf0(esk5_3(X44,X45,X49),X49) )
      & ( ~ aElement0(X45)
        | ~ aSet0(X44)
        | X46 != sdtmndt0(X44,X45)
        | aElementOf0(X48,X46)
        | X48 = X45
        | ~ aElementOf0(X48,X44)
        | ~ aElement0(X48) )
      & ( ~ aElement0(X45)
        | ~ aSet0(X44)
        | X46 != sdtmndt0(X44,X45)
        | ~ aElementOf0(X47,X46)
        | X47 != X45 )
      & ( ~ aElement0(X45)
        | ~ aSet0(X44)
        | X46 != sdtmndt0(X44,X45)
        | ~ aElementOf0(X47,X46)
        | aElementOf0(X47,X44) )
      & ( ~ aElement0(X45)
        | ~ aSet0(X44)
        | X46 != sdtmndt0(X44,X45)
        | ~ aElementOf0(X47,X46)
        | aElement0(X47) )
      & ( ~ aElement0(X45)
        | ~ aSet0(X44)
        | X46 != sdtmndt0(X44,X45)
        | aSet0(X46) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])])])]) ).

fof(c_0_38,negated_conjecture,
    ~ aElementOf0(xx,xT),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_39,hypothesis,
    ( ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
    | aSubsetOf0(X1,xT) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_27])]) ).

cnf(c_0_40,hypothesis,
    aElementOf0(xP,slbdtsldtrb0(xS,xk)),
    inference(split_conjunct,[status(thm)],[m__2378]) ).

cnf(c_0_41,plain,
    ( ~ aSet0(X2)
    | ~ aElement0(X1)
    | aElementOf0(X1,sdtpldt0(X2,X1)) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])]) ).

cnf(c_0_42,hypothesis,
    xP = sdtpldt0(sdtmndt0(xQ,xy),xx),
    inference(split_conjunct,[status(thm)],[m__2357]) ).

cnf(c_0_43,hypothesis,
    aElement0(xx),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).

cnf(c_0_44,plain,
    ( ~ aElement0(X3)
    | ~ aSet0(X2)
    | X1 != sdtmndt0(X2,X3)
    | aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

fof(c_0_45,negated_conjecture,
    ~ aElementOf0(xx,xT),
    inference(fof_simplification,[status(thm)],[c_0_38]) ).

cnf(c_0_46,hypothesis,
    aSubsetOf0(xP,xT),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_47,hypothesis,
    ( ~ aSet0(sdtmndt0(xQ,xy))
    | aElementOf0(xx,xP) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).

cnf(c_0_48,plain,
    ( ~ aSet0(X1)
    | ~ aElement0(X2)
    | aSet0(sdtmndt0(X1,X2)) ),
    inference(er,[status(thm)],[c_0_44]) ).

cnf(c_0_49,hypothesis,
    aElement0(xy),
    inference(split_conjunct,[status(thm)],[m__2304]) ).

cnf(c_0_50,hypothesis,
    aSet0(xQ),
    inference(split_conjunct,[status(thm)],[m__2291]) ).

fof(c_0_51,negated_conjecture,
    ~ aElementOf0(xx,xT),
    inference(fof_nnf,[status(thm)],[c_0_45]) ).

cnf(c_0_52,hypothesis,
    ( ~ aElementOf0(X1,xP)
    | aElementOf0(X1,xT) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_46]),c_0_27])]) ).

cnf(c_0_53,hypothesis,
    aElementOf0(xx,xP),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]) ).

cnf(c_0_54,negated_conjecture,
    ~ aElementOf0(xx,xT),
    inference(split_conjunct,[status(thm)],[c_0_51]) ).

cnf(c_0_55,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM558+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.37  % Computer : n019.cluster.edu
% 0.13/0.37  % Model    : x86_64 x86_64
% 0.13/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37  % Memory   : 8046.5625MB
% 0.13/0.37  % OS       : Linux 6.8.0-71-generic
% 0.13/0.37  % CPULimit : 300
% 0.13/0.37  % WCLimit  : 300
% 0.13/0.37  % DateTime : Mon Sep 21 02:40:04 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  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.35/0.46  % Version: 3.5.1
% 0.35/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.35/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.35/0.46  % Starting sh5l with 300s (1) cores
% 0.35/0.46  % sh5l with pid 1513700 completed with status 0
% 0.35/0.46  % Result found by sh5l
% 0.35/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.35/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.35/0.46  % Starting sh5l with 300s (1) cores
% 0.35/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.35/0.46  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.35/0.46  % Search class: FGHSF-FSMM31-MFFFFFNN
% 0.35/0.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.46  % Starting SubtermCWHack with 31s (1) cores
% 0.35/0.46  % SubtermCWHack with pid 1513705 completed with status 0
% 0.35/0.46  % Result found by SubtermCWHack
% 0.35/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.35/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.35/0.46  % Starting sh5l with 300s (1) cores
% 0.35/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.35/0.46  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.35/0.46  % Search class: FGHSF-FSMM31-MFFFFFNN
% 0.35/0.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.46  % Starting SubtermCWHack with 31s (1) cores
% 0.35/0.46  % Preprocessing time       : 0.002 s
% 0.35/0.46  
% 0.35/0.46  % Proof found!
% 0.35/0.46  % SZS status Theorem
% 0.35/0.46  % SZS output start CNFRefutation
% See solution above
% 0.35/0.46  % Parsed axioms                        : 72
% 0.35/0.46  % Removed by relevancy pruning/SinE    : 3
% 0.35/0.46  % Initial clauses                      : 122
% 0.35/0.46  % Removed in clause preprocessing      : 5
% 0.35/0.46  % Initial clauses in saturation        : 117
% 0.35/0.46  % Processed clauses                    : 309
% 0.35/0.46  % ...of these trivial                  : 0
% 0.35/0.46  % ...subsumed                          : 71
% 0.35/0.46  % ...remaining for further processing  : 238
% 0.35/0.46  % Other redundant clauses eliminated   : 31
% 0.35/0.46  % Clauses deleted for lack of memory   : 0
% 0.35/0.46  % Backward-subsumed                    : 18
% 0.35/0.46  % Backward-rewritten                   : 12
% 0.35/0.46  % Generated clauses                    : 493
% 0.35/0.46  % ...of the previous two non-redundant : 400
% 0.35/0.46  % ...aggressively subsumed             : 0
% 0.35/0.46  % Contextual simplify-reflections      : 15
% 0.35/0.46  % Paramodulations                      : 464
% 0.35/0.46  % Factorizations                       : 0
% 0.35/0.46  % NegExts                              : 0
% 0.35/0.46  % Equation resolutions                 : 32
% 0.35/0.46  % Disequality decompositions           : 0
% 0.35/0.46  % Total rewrite steps                  : 341
% 0.35/0.46  % ...of those cached                   : 314
% 0.35/0.46  % Propositional unsat checks           : 0
% 0.35/0.46  %    Propositional check models        : 0
% 0.35/0.46  %    Propositional check unsatisfiable : 0
% 0.35/0.46  %    Propositional clauses             : 0
% 0.35/0.46  %    Propositional clauses after purity: 0
% 0.35/0.46  %    Propositional unsat core size     : 0
% 0.35/0.46  %    Propositional preprocessing time  : 0.000
% 0.35/0.46  %    Propositional encoding time       : 0.000
% 0.35/0.46  %    Propositional solver time         : 0.000
% 0.35/0.46  %    Success case prop preproc time    : 0.000
% 0.35/0.46  %    Success case prop encoding time   : 0.000
% 0.35/0.46  %    Success case prop solver time     : 0.000
% 0.35/0.46  % Current number of processed clauses  : 183
% 0.35/0.46  %    Positive orientable unit clauses  : 40
% 0.35/0.46  %    Positive unorientable unit clauses: 0
% 0.35/0.46  %    Negative unit clauses             : 9
% 0.35/0.46  %    Non-unit-clauses                  : 134
% 0.35/0.46  % Current number of unprocessed clauses: 190
% 0.35/0.46  % ...number of literals in the above   : 980
% 0.35/0.46  % Current number of archived formulas  : 0
% 0.35/0.46  % Current number of archived clauses   : 30
% 0.35/0.46  % Clause-clause subsumption calls (NU) : 3530
% 0.35/0.46  % Rec. Clause-clause subsumption calls : 1524
% 0.35/0.46  % Non-unit clause-clause subsumptions  : 80
% 0.35/0.46  % Unit Clause-clause subsumption calls : 713
% 0.35/0.46  % Rewrite failures with RHS unbound    : 0
% 0.35/0.46  % BW rewrite match attempts            : 9
% 0.35/0.46  % BW rewrite match successes           : 9
% 0.35/0.46  % Condensation attempts                : 0
% 0.35/0.46  % Condensation successes               : 0
% 0.35/0.46  % Termbank termtop insertions          : 16698
% 0.35/0.46  % Search garbage collected termcells   : 2186
% 0.35/0.46  
% 0.35/0.46  % -------------------------------------------------
% 0.35/0.46  % User time                : 0.018 s
% 0.35/0.46  % System time              : 0.005 s
% 0.35/0.46  % Total time               : 0.023 s
% 0.35/0.46  % Maximum resident set size: 3964 pages
% 0.35/0.46  
% 0.35/0.46  % -------------------------------------------------
% 0.35/0.46  % User time                : 0.019 s
% 0.35/0.46  % System time              : 0.011 s
% 0.35/0.46  % Total time               : 0.030 s
% 0.35/0.46  % Maximum resident set size: 4864 pages
% 0.35/0.46  % E exiting
%------------------------------------------------------------------------------