TSTP Solution File: COM018+4 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : COM018+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 15:53:12 EDT 2022

% Result   : Theorem 0.18s 0.53s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   42 (   8 unt;   0 def)
%            Number of atoms       :  396 (  27 equ)
%            Maximal formula atoms :   30 (   9 avg)
%            Number of connectives :  462 ( 108   ~; 141   |; 198   &)
%                                         (   1 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   8 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   2 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :  110 (  64   !;  46   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f695,plain,
    $false,
    inference(avatar_sat_refutation,[],[f442,f694]) ).

fof(f694,plain,
    ~ spl35_19,
    inference(avatar_contradiction_clause,[],[f693]) ).

fof(f693,plain,
    ( $false
    | ~ spl35_19 ),
    inference(subsumption_resolution,[],[f692,f244]) ).

fof(f244,plain,
    isTerminating0(xR),
    inference(cnf_transformation,[],[f131]) ).

fof(f131,plain,
    ( ! [X0,X1,X2] :
        ( ~ aReductOfIn0(X1,X2,xR)
        | ~ aReductOfIn0(X0,X2,xR)
        | ~ aElement0(X0)
        | ~ aElement0(X2)
        | ~ aElement0(X1)
        | ( sdtmndtasgtdt0(X1,xR,sK27(X0,X1))
          & ( ( ( ( aElement0(sK28(X0,X1))
                  & sdtmndtplgtdt0(sK28(X0,X1),xR,sK27(X0,X1))
                  & aReductOfIn0(sK28(X0,X1),X0,xR) )
                | aReductOfIn0(sK27(X0,X1),X0,xR) )
              & sdtmndtplgtdt0(X0,xR,sK27(X0,X1)) )
            | sK27(X0,X1) = X0 )
          & sP5(sK27(X0,X1),X1)
          & sdtmndtasgtdt0(X0,xR,sK27(X0,X1))
          & aElement0(sK27(X0,X1)) ) )
    & isLocallyConfluent0(xR)
    & isTerminating0(xR)
    & ! [X5,X6] :
        ( ~ aElement0(X6)
        | ~ aElement0(X5)
        | ( ~ aReductOfIn0(X6,X5,xR)
          & ~ sdtmndtplgtdt0(X5,xR,X6)
          & ! [X7] :
              ( ~ aReductOfIn0(X7,X5,xR)
              | ~ aElement0(X7)
              | ~ sdtmndtplgtdt0(X7,xR,X6) ) )
        | iLess0(X6,X5) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK27,sK28])],[f128,f130,f129]) ).

fof(f129,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( sdtmndtasgtdt0(X1,xR,X3)
          & ( ( ( ? [X4] :
                    ( aElement0(X4)
                    & sdtmndtplgtdt0(X4,xR,X3)
                    & aReductOfIn0(X4,X0,xR) )
                | aReductOfIn0(X3,X0,xR) )
              & sdtmndtplgtdt0(X0,xR,X3) )
            | X0 = X3 )
          & sP5(X3,X1)
          & sdtmndtasgtdt0(X0,xR,X3)
          & aElement0(X3) )
     => ( sdtmndtasgtdt0(X1,xR,sK27(X0,X1))
        & ( ( ( ? [X4] :
                  ( aElement0(X4)
                  & sdtmndtplgtdt0(X4,xR,sK27(X0,X1))
                  & aReductOfIn0(X4,X0,xR) )
              | aReductOfIn0(sK27(X0,X1),X0,xR) )
            & sdtmndtplgtdt0(X0,xR,sK27(X0,X1)) )
          | sK27(X0,X1) = X0 )
        & sP5(sK27(X0,X1),X1)
        & sdtmndtasgtdt0(X0,xR,sK27(X0,X1))
        & aElement0(sK27(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f130,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( aElement0(X4)
          & sdtmndtplgtdt0(X4,xR,sK27(X0,X1))
          & aReductOfIn0(X4,X0,xR) )
     => ( aElement0(sK28(X0,X1))
        & sdtmndtplgtdt0(sK28(X0,X1),xR,sK27(X0,X1))
        & aReductOfIn0(sK28(X0,X1),X0,xR) ) ),
    introduced(choice_axiom,[]) ).

fof(f128,plain,
    ( ! [X0,X1,X2] :
        ( ~ aReductOfIn0(X1,X2,xR)
        | ~ aReductOfIn0(X0,X2,xR)
        | ~ aElement0(X0)
        | ~ aElement0(X2)
        | ~ aElement0(X1)
        | ? [X3] :
            ( sdtmndtasgtdt0(X1,xR,X3)
            & ( ( ( ? [X4] :
                      ( aElement0(X4)
                      & sdtmndtplgtdt0(X4,xR,X3)
                      & aReductOfIn0(X4,X0,xR) )
                  | aReductOfIn0(X3,X0,xR) )
                & sdtmndtplgtdt0(X0,xR,X3) )
              | X0 = X3 )
            & sP5(X3,X1)
            & sdtmndtasgtdt0(X0,xR,X3)
            & aElement0(X3) ) )
    & isLocallyConfluent0(xR)
    & isTerminating0(xR)
    & ! [X5,X6] :
        ( ~ aElement0(X6)
        | ~ aElement0(X5)
        | ( ~ aReductOfIn0(X6,X5,xR)
          & ~ sdtmndtplgtdt0(X5,xR,X6)
          & ! [X7] :
              ( ~ aReductOfIn0(X7,X5,xR)
              | ~ aElement0(X7)
              | ~ sdtmndtplgtdt0(X7,xR,X6) ) )
        | iLess0(X6,X5) ) ),
    inference(rectify,[],[f75]) ).

fof(f75,plain,
    ( ! [X4,X5,X3] :
        ( ~ aReductOfIn0(X5,X3,xR)
        | ~ aReductOfIn0(X4,X3,xR)
        | ~ aElement0(X4)
        | ~ aElement0(X3)
        | ~ aElement0(X5)
        | ? [X6] :
            ( sdtmndtasgtdt0(X5,xR,X6)
            & ( ( ( ? [X8] :
                      ( aElement0(X8)
                      & sdtmndtplgtdt0(X8,xR,X6)
                      & aReductOfIn0(X8,X4,xR) )
                  | aReductOfIn0(X6,X4,xR) )
                & sdtmndtplgtdt0(X4,xR,X6) )
              | X4 = X6 )
            & sP5(X6,X5)
            & sdtmndtasgtdt0(X4,xR,X6)
            & aElement0(X6) ) )
    & isLocallyConfluent0(xR)
    & isTerminating0(xR)
    & ! [X1,X0] :
        ( ~ aElement0(X0)
        | ~ aElement0(X1)
        | ( ~ aReductOfIn0(X0,X1,xR)
          & ~ sdtmndtplgtdt0(X1,xR,X0)
          & ! [X2] :
              ( ~ aReductOfIn0(X2,X1,xR)
              | ~ aElement0(X2)
              | ~ sdtmndtplgtdt0(X2,xR,X0) ) )
        | iLess0(X0,X1) ) ),
    inference(definition_folding,[],[f43,f74]) ).

fof(f74,plain,
    ! [X6,X5] :
      ( X5 = X6
      | ( sdtmndtplgtdt0(X5,xR,X6)
        & ( ? [X7] :
              ( sdtmndtplgtdt0(X7,xR,X6)
              & aReductOfIn0(X7,X5,xR)
              & aElement0(X7) )
          | aReductOfIn0(X6,X5,xR) ) )
      | ~ sP5(X6,X5) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).

fof(f43,plain,
    ( ! [X4,X5,X3] :
        ( ~ aReductOfIn0(X5,X3,xR)
        | ~ aReductOfIn0(X4,X3,xR)
        | ~ aElement0(X4)
        | ~ aElement0(X3)
        | ~ aElement0(X5)
        | ? [X6] :
            ( sdtmndtasgtdt0(X5,xR,X6)
            & ( ( ( ? [X8] :
                      ( aElement0(X8)
                      & sdtmndtplgtdt0(X8,xR,X6)
                      & aReductOfIn0(X8,X4,xR) )
                  | aReductOfIn0(X6,X4,xR) )
                & sdtmndtplgtdt0(X4,xR,X6) )
              | X4 = X6 )
            & ( X5 = X6
              | ( sdtmndtplgtdt0(X5,xR,X6)
                & ( ? [X7] :
                      ( sdtmndtplgtdt0(X7,xR,X6)
                      & aReductOfIn0(X7,X5,xR)
                      & aElement0(X7) )
                  | aReductOfIn0(X6,X5,xR) ) ) )
            & sdtmndtasgtdt0(X4,xR,X6)
            & aElement0(X6) ) )
    & isLocallyConfluent0(xR)
    & isTerminating0(xR)
    & ! [X1,X0] :
        ( ~ aElement0(X0)
        | ~ aElement0(X1)
        | ( ~ aReductOfIn0(X0,X1,xR)
          & ~ sdtmndtplgtdt0(X1,xR,X0)
          & ! [X2] :
              ( ~ aReductOfIn0(X2,X1,xR)
              | ~ aElement0(X2)
              | ~ sdtmndtplgtdt0(X2,xR,X0) ) )
        | iLess0(X0,X1) ) ),
    inference(flattening,[],[f42]) ).

fof(f42,plain,
    ( ! [X4,X5,X3] :
        ( ? [X6] :
            ( sdtmndtasgtdt0(X5,xR,X6)
            & ( ( ( ? [X8] :
                      ( aElement0(X8)
                      & sdtmndtplgtdt0(X8,xR,X6)
                      & aReductOfIn0(X8,X4,xR) )
                  | aReductOfIn0(X6,X4,xR) )
                & sdtmndtplgtdt0(X4,xR,X6) )
              | X4 = X6 )
            & ( X5 = X6
              | ( sdtmndtplgtdt0(X5,xR,X6)
                & ( ? [X7] :
                      ( sdtmndtplgtdt0(X7,xR,X6)
                      & aReductOfIn0(X7,X5,xR)
                      & aElement0(X7) )
                  | aReductOfIn0(X6,X5,xR) ) ) )
            & sdtmndtasgtdt0(X4,xR,X6)
            & aElement0(X6) )
        | ~ aElement0(X4)
        | ~ aReductOfIn0(X5,X3,xR)
        | ~ aElement0(X5)
        | ~ aElement0(X3)
        | ~ aReductOfIn0(X4,X3,xR) )
    & isLocallyConfluent0(xR)
    & ! [X0,X1] :
        ( iLess0(X0,X1)
        | ( ~ aReductOfIn0(X0,X1,xR)
          & ~ sdtmndtplgtdt0(X1,xR,X0)
          & ! [X2] :
              ( ~ aReductOfIn0(X2,X1,xR)
              | ~ aElement0(X2)
              | ~ sdtmndtplgtdt0(X2,xR,X0) ) )
        | ~ aElement0(X1)
        | ~ aElement0(X0) )
    & isTerminating0(xR) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f29,plain,
    ( ! [X4,X5,X3] :
        ( ( aElement0(X4)
          & aReductOfIn0(X5,X3,xR)
          & aElement0(X5)
          & aElement0(X3)
          & aReductOfIn0(X4,X3,xR) )
       => ? [X6] :
            ( sdtmndtasgtdt0(X5,xR,X6)
            & ( ( ( ? [X8] :
                      ( aElement0(X8)
                      & sdtmndtplgtdt0(X8,xR,X6)
                      & aReductOfIn0(X8,X4,xR) )
                  | aReductOfIn0(X6,X4,xR) )
                & sdtmndtplgtdt0(X4,xR,X6) )
              | X4 = X6 )
            & ( X5 = X6
              | ( sdtmndtplgtdt0(X5,xR,X6)
                & ( ? [X7] :
                      ( sdtmndtplgtdt0(X7,xR,X6)
                      & aReductOfIn0(X7,X5,xR)
                      & aElement0(X7) )
                  | aReductOfIn0(X6,X5,xR) ) ) )
            & sdtmndtasgtdt0(X4,xR,X6)
            & aElement0(X6) ) )
    & isLocallyConfluent0(xR)
    & ! [X0,X1] :
        ( ( aElement0(X1)
          & aElement0(X0) )
       => ( ( aReductOfIn0(X0,X1,xR)
            | sdtmndtplgtdt0(X1,xR,X0)
            | ? [X2] :
                ( aElement0(X2)
                & aReductOfIn0(X2,X1,xR)
                & sdtmndtplgtdt0(X2,xR,X0) ) )
         => iLess0(X0,X1) ) )
    & isTerminating0(xR) ),
    inference(rectify,[],[f16]) ).

fof(f16,axiom,
    ( isTerminating0(xR)
    & ! [X1,X0] :
        ( ( aElement0(X1)
          & aElement0(X0) )
       => ( ( ? [X2] :
                ( aReductOfIn0(X2,X0,xR)
                & aElement0(X2)
                & sdtmndtplgtdt0(X2,xR,X1) )
            | sdtmndtplgtdt0(X0,xR,X1)
            | aReductOfIn0(X1,X0,xR) )
         => iLess0(X1,X0) ) )
    & ! [X0,X2,X1] :
        ( ( aElement0(X1)
          & aReductOfIn0(X1,X0,xR)
          & aElement0(X0)
          & aElement0(X2)
          & aReductOfIn0(X2,X0,xR) )
       => ? [X3] :
            ( sdtmndtasgtdt0(X2,xR,X3)
            & sdtmndtasgtdt0(X1,xR,X3)
            & ( X1 = X3
              | ( sdtmndtplgtdt0(X1,xR,X3)
                & ( aReductOfIn0(X3,X1,xR)
                  | ? [X4] :
                      ( sdtmndtplgtdt0(X4,xR,X3)
                      & aReductOfIn0(X4,X1,xR)
                      & aElement0(X4) ) ) ) )
            & ( X2 = X3
              | ( sdtmndtplgtdt0(X2,xR,X3)
                & ( aReductOfIn0(X3,X2,xR)
                  | ? [X4] :
                      ( aReductOfIn0(X4,X2,xR)
                      & aElement0(X4)
                      & sdtmndtplgtdt0(X4,xR,X3) ) ) ) )
            & aElement0(X3) ) )
    & isLocallyConfluent0(xR) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656_01) ).

fof(f692,plain,
    ( ~ isTerminating0(xR)
    | ~ spl35_19 ),
    inference(subsumption_resolution,[],[f691,f213]) ).

fof(f213,plain,
    aRewritingSystem0(xR),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,axiom,
    aRewritingSystem0(xR),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).

fof(f691,plain,
    ( ~ aRewritingSystem0(xR)
    | ~ isTerminating0(xR)
    | ~ spl35_19 ),
    inference(subsumption_resolution,[],[f689,f362]) ).

fof(f362,plain,
    ( aElement0(xw)
    | ~ spl35_19 ),
    inference(avatar_component_clause,[],[f361]) ).

fof(f361,plain,
    ( spl35_19
  <=> aElement0(xw) ),
    introduced(avatar_definition,[new_symbols(naming,[spl35_19])]) ).

fof(f689,plain,
    ( ~ aElement0(xw)
    | ~ isTerminating0(xR)
    | ~ aRewritingSystem0(xR) ),
    inference(resolution,[],[f195,f183]) ).

fof(f183,plain,
    ! [X0] : ~ aNormalFormOfIn0(X0,xw,xR),
    inference(cnf_transformation,[],[f93]) ).

fof(f93,plain,
    ! [X0] :
      ( ~ aNormalFormOfIn0(X0,xw,xR)
      & ( ~ aElement0(X0)
        | ( xw != X0
          & ~ sdtmndtasgtdt0(xw,xR,X0)
          & ~ sdtmndtplgtdt0(xw,xR,X0)
          & ! [X1] :
              ( ~ sdtmndtplgtdt0(X1,xR,X0)
              | ~ aElement0(X1)
              | ~ aReductOfIn0(X1,xw,xR) )
          & ~ aReductOfIn0(X0,xw,xR) )
        | aReductOfIn0(sK15(X0),X0,xR) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK15])],[f58,f92]) ).

fof(f92,plain,
    ! [X0] :
      ( ? [X2] : aReductOfIn0(X2,X0,xR)
     => aReductOfIn0(sK15(X0),X0,xR) ),
    introduced(choice_axiom,[]) ).

fof(f58,plain,
    ! [X0] :
      ( ~ aNormalFormOfIn0(X0,xw,xR)
      & ( ~ aElement0(X0)
        | ( xw != X0
          & ~ sdtmndtasgtdt0(xw,xR,X0)
          & ~ sdtmndtplgtdt0(xw,xR,X0)
          & ! [X1] :
              ( ~ sdtmndtplgtdt0(X1,xR,X0)
              | ~ aElement0(X1)
              | ~ aReductOfIn0(X1,xw,xR) )
          & ~ aReductOfIn0(X0,xw,xR) )
        | ? [X2] : aReductOfIn0(X2,X0,xR) ) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f34,plain,
    ~ ? [X0] :
        ( ( ( sdtmndtasgtdt0(xw,xR,X0)
            | sdtmndtplgtdt0(xw,xR,X0)
            | ? [X1] :
                ( aReductOfIn0(X1,xw,xR)
                & sdtmndtplgtdt0(X1,xR,X0)
                & aElement0(X1) )
            | xw = X0
            | aReductOfIn0(X0,xw,xR) )
          & aElement0(X0)
          & ~ ? [X2] : aReductOfIn0(X2,X0,xR) )
        | aNormalFormOfIn0(X0,xw,xR) ),
    inference(rectify,[],[f24]) ).

fof(f24,negated_conjecture,
    ~ ? [X0] :
        ( aNormalFormOfIn0(X0,xw,xR)
        | ( ( sdtmndtasgtdt0(xw,xR,X0)
            | sdtmndtplgtdt0(xw,xR,X0)
            | ? [X1] :
                ( aReductOfIn0(X1,xw,xR)
                & sdtmndtplgtdt0(X1,xR,X0)
                & aElement0(X1) )
            | xw = X0
            | aReductOfIn0(X0,xw,xR) )
          & aElement0(X0)
          & ~ ? [X1] : aReductOfIn0(X1,X0,xR) ) ),
    inference(negated_conjecture,[],[f23]) ).

fof(f23,conjecture,
    ? [X0] :
      ( aNormalFormOfIn0(X0,xw,xR)
      | ( ( sdtmndtasgtdt0(xw,xR,X0)
          | sdtmndtplgtdt0(xw,xR,X0)
          | ? [X1] :
              ( aReductOfIn0(X1,xw,xR)
              & sdtmndtplgtdt0(X1,xR,X0)
              & aElement0(X1) )
          | xw = X0
          | aReductOfIn0(X0,xw,xR) )
        & aElement0(X0)
        & ~ ? [X1] : aReductOfIn0(X1,X0,xR) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f195,plain,
    ! [X0,X1] :
      ( aNormalFormOfIn0(sK18(X0,X1),X1,X0)
      | ~ isTerminating0(X0)
      | ~ aRewritingSystem0(X0)
      | ~ aElement0(X1) ),
    inference(cnf_transformation,[],[f99]) ).

fof(f99,plain,
    ! [X0] :
      ( ~ aRewritingSystem0(X0)
      | ! [X1] :
          ( ~ aElement0(X1)
          | aNormalFormOfIn0(sK18(X0,X1),X1,X0) )
      | ~ isTerminating0(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK18])],[f60,f98]) ).

fof(f98,plain,
    ! [X0,X1] :
      ( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
     => aNormalFormOfIn0(sK18(X0,X1),X1,X0) ),
    introduced(choice_axiom,[]) ).

fof(f60,plain,
    ! [X0] :
      ( ~ aRewritingSystem0(X0)
      | ! [X1] :
          ( ~ aElement0(X1)
          | ? [X2] : aNormalFormOfIn0(X2,X1,X0) )
      | ~ isTerminating0(X0) ),
    inference(flattening,[],[f59]) ).

fof(f59,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ aElement0(X1)
          | ? [X2] : aNormalFormOfIn0(X2,X1,X0) )
      | ~ aRewritingSystem0(X0)
      | ~ isTerminating0(X0) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,axiom,
    ! [X0] :
      ( ( aRewritingSystem0(X0)
        & isTerminating0(X0) )
     => ! [X1] :
          ( aElement0(X1)
         => ? [X2] : aNormalFormOfIn0(X2,X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTermNF) ).

fof(f442,plain,
    spl35_19,
    inference(avatar_split_clause,[],[f185,f361]) ).

fof(f185,plain,
    aElement0(xw),
    inference(cnf_transformation,[],[f97]) ).

fof(f97,plain,
    ( ( ( sdtmndtplgtdt0(xv,xR,xw)
        & ( aReductOfIn0(xw,xv,xR)
          | ( sdtmndtplgtdt0(sK16,xR,xw)
            & aElement0(sK16)
            & aReductOfIn0(sK16,xv,xR) ) ) )
      | xv = xw )
    & ( xu = xw
      | ( ( ( aElement0(sK17)
            & sdtmndtplgtdt0(sK17,xR,xw)
            & aReductOfIn0(sK17,xu,xR) )
          | aReductOfIn0(xw,xu,xR) )
        & sdtmndtplgtdt0(xu,xR,xw) ) )
    & sdtmndtasgtdt0(xu,xR,xw)
    & aElement0(xw)
    & sdtmndtasgtdt0(xv,xR,xw) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK16,sK17])],[f94,f96,f95]) ).

fof(f95,plain,
    ( ? [X0] :
        ( sdtmndtplgtdt0(X0,xR,xw)
        & aElement0(X0)
        & aReductOfIn0(X0,xv,xR) )
   => ( sdtmndtplgtdt0(sK16,xR,xw)
      & aElement0(sK16)
      & aReductOfIn0(sK16,xv,xR) ) ),
    introduced(choice_axiom,[]) ).

fof(f96,plain,
    ( ? [X1] :
        ( aElement0(X1)
        & sdtmndtplgtdt0(X1,xR,xw)
        & aReductOfIn0(X1,xu,xR) )
   => ( aElement0(sK17)
      & sdtmndtplgtdt0(sK17,xR,xw)
      & aReductOfIn0(sK17,xu,xR) ) ),
    introduced(choice_axiom,[]) ).

fof(f94,plain,
    ( ( ( sdtmndtplgtdt0(xv,xR,xw)
        & ( aReductOfIn0(xw,xv,xR)
          | ? [X0] :
              ( sdtmndtplgtdt0(X0,xR,xw)
              & aElement0(X0)
              & aReductOfIn0(X0,xv,xR) ) ) )
      | xv = xw )
    & ( xu = xw
      | ( ( ? [X1] :
              ( aElement0(X1)
              & sdtmndtplgtdt0(X1,xR,xw)
              & aReductOfIn0(X1,xu,xR) )
          | aReductOfIn0(xw,xu,xR) )
        & sdtmndtplgtdt0(xu,xR,xw) ) )
    & sdtmndtasgtdt0(xu,xR,xw)
    & aElement0(xw)
    & sdtmndtasgtdt0(xv,xR,xw) ),
    inference(rectify,[],[f37]) ).

fof(f37,plain,
    ( ( ( sdtmndtplgtdt0(xv,xR,xw)
        & ( aReductOfIn0(xw,xv,xR)
          | ? [X1] :
              ( sdtmndtplgtdt0(X1,xR,xw)
              & aElement0(X1)
              & aReductOfIn0(X1,xv,xR) ) ) )
      | xv = xw )
    & ( xu = xw
      | ( ( ? [X0] :
              ( aElement0(X0)
              & sdtmndtplgtdt0(X0,xR,xw)
              & aReductOfIn0(X0,xu,xR) )
          | aReductOfIn0(xw,xu,xR) )
        & sdtmndtplgtdt0(xu,xR,xw) ) )
    & sdtmndtasgtdt0(xu,xR,xw)
    & aElement0(xw)
    & sdtmndtasgtdt0(xv,xR,xw) ),
    inference(rectify,[],[f22]) ).

fof(f22,axiom,
    ( ( xu = xw
      | ( ( ? [X0] :
              ( aElement0(X0)
              & sdtmndtplgtdt0(X0,xR,xw)
              & aReductOfIn0(X0,xu,xR) )
          | aReductOfIn0(xw,xu,xR) )
        & sdtmndtplgtdt0(xu,xR,xw) ) )
    & ( ( sdtmndtplgtdt0(xv,xR,xw)
        & ( aReductOfIn0(xw,xv,xR)
          | ? [X0] :
              ( aReductOfIn0(X0,xv,xR)
              & aElement0(X0)
              & sdtmndtplgtdt0(X0,xR,xw) ) ) )
      | xv = xw )
    & sdtmndtasgtdt0(xv,xR,xw)
    & sdtmndtasgtdt0(xu,xR,xw)
    & aElement0(xw) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__799) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : COM018+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33  % Computer : n007.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Aug 29 16:51:45 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.18/0.49  % (3044)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.18/0.49  % (3056)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.18/0.50  % (3048)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.18/0.50  % (3036)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.18/0.50  % (3054)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.51  % (3036)First to succeed.
% 0.18/0.51  % (3040)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.18/0.51  % (3062)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.52  % (3054)Instruction limit reached!
% 0.18/0.52  % (3054)------------------------------
% 0.18/0.52  % (3054)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52  % (3054)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52  % (3054)Termination reason: Unknown
% 0.18/0.52  % (3054)Termination phase: Preprocessing 3
% 0.18/0.52  
% 0.18/0.52  % (3054)Memory used [KB]: 1535
% 0.18/0.52  % (3054)Time elapsed: 0.005 s
% 0.18/0.52  % (3054)Instructions burned: 3 (million)
% 0.18/0.52  % (3054)------------------------------
% 0.18/0.52  % (3054)------------------------------
% 0.18/0.52  % (3065)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.18/0.53  % (3038)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.53  % (3058)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.18/0.53  % (3059)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.18/0.53  % (3039)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.53  % (3041)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.18/0.53  % (3038)Instruction limit reached!
% 0.18/0.53  % (3038)------------------------------
% 0.18/0.53  % (3038)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53  % (3038)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53  % (3038)Termination reason: Unknown
% 0.18/0.53  % (3038)Termination phase: Property scanning
% 0.18/0.53  
% 0.18/0.53  % (3038)Memory used [KB]: 1535
% 0.18/0.53  % (3038)Time elapsed: 0.003 s
% 0.18/0.53  % (3038)Instructions burned: 4 (million)
% 0.18/0.53  % (3038)------------------------------
% 0.18/0.53  % (3038)------------------------------
% 0.18/0.53  % (3045)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.18/0.53  % (3044)Also succeeded, but the first one will report.
% 0.18/0.53  % (3036)Refutation found. Thanks to Tanya!
% 0.18/0.53  % SZS status Theorem for theBenchmark
% 0.18/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.53  % (3036)------------------------------
% 0.18/0.53  % (3036)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53  % (3036)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53  % (3036)Termination reason: Refutation
% 0.18/0.53  
% 0.18/0.53  % (3036)Memory used [KB]: 6396
% 0.18/0.53  % (3036)Time elapsed: 0.116 s
% 0.18/0.53  % (3036)Instructions burned: 14 (million)
% 0.18/0.53  % (3036)------------------------------
% 0.18/0.53  % (3036)------------------------------
% 0.18/0.53  % (3035)Success in time 0.185 s
%------------------------------------------------------------------------------