TSTP Solution File: SWC010+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC010+1 : TPTP v8.1.0. Released v2.4.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 : n022.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 18:38:11 EDT 2022

% Result   : Theorem 0.19s 0.54s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   46 (  12 unt;   0 def)
%            Number of atoms       :  361 ( 102 equ)
%            Maximal formula atoms :   23 (   7 avg)
%            Number of connectives :  454 ( 139   ~; 125   |; 162   &)
%                                         (   0 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (  10 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :  189 ( 125   !;  64   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f689,plain,
    $false,
    inference(unit_resulting_resolution,[],[f288,f687]) ).

fof(f687,plain,
    ! [X0,X1] : ~ sP0(sK4,sK5,X0,X1),
    inference(forward_demodulation,[],[f686,f292]) ).

fof(f292,plain,
    app(sK2(sK4,sK5),sK3(sK4,sK5)) = sK4,
    inference(resolution,[],[f288,f194]) ).

fof(f194,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | app(sK2(X2,X3),sK3(X2,X3)) = X2 ),
    inference(cnf_transformation,[],[f157]) ).

fof(f157,plain,
    ! [X0,X1,X2,X3] :
      ( ( ! [X4] :
            ( ! [X5] :
                ( ! [X6] :
                    ( app(X5,X6) != X0
                    | app(app(X5,cons(X4,nil)),X6) != X1
                    | ~ ssList(X6) )
                | ~ ssList(X5) )
            | ~ ssItem(X4) )
        & neq(X1,nil)
        & ssItem(sK1(X2,X3))
        & ssList(sK2(X2,X3))
        & app(sK2(X2,X3),sK3(X2,X3)) = X2
        & app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),sK3(X2,X3)) = X3
        & ssList(sK3(X2,X3))
        & ! [X10] :
            ( sK1(X2,X3) = X10
            | ~ memberP(X3,X10)
            | ~ geq(X10,sK1(X2,X3))
            | ~ ssItem(X10) ) )
      | ~ sP0(X0,X1,X2,X3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f153,f156,f155,f154]) ).

fof(f154,plain,
    ! [X2,X3] :
      ( ? [X7] :
          ( ssItem(X7)
          & ? [X8] :
              ( ssList(X8)
              & ? [X9] :
                  ( app(X8,X9) = X2
                  & app(app(X8,cons(X7,nil)),X9) = X3
                  & ssList(X9)
                  & ! [X10] :
                      ( X7 = X10
                      | ~ memberP(X3,X10)
                      | ~ geq(X10,X7)
                      | ~ ssItem(X10) ) ) ) )
     => ( ssItem(sK1(X2,X3))
        & ? [X8] :
            ( ssList(X8)
            & ? [X9] :
                ( app(X8,X9) = X2
                & app(app(X8,cons(sK1(X2,X3),nil)),X9) = X3
                & ssList(X9)
                & ! [X10] :
                    ( sK1(X2,X3) = X10
                    | ~ memberP(X3,X10)
                    | ~ geq(X10,sK1(X2,X3))
                    | ~ ssItem(X10) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f155,plain,
    ! [X2,X3] :
      ( ? [X8] :
          ( ssList(X8)
          & ? [X9] :
              ( app(X8,X9) = X2
              & app(app(X8,cons(sK1(X2,X3),nil)),X9) = X3
              & ssList(X9)
              & ! [X10] :
                  ( sK1(X2,X3) = X10
                  | ~ memberP(X3,X10)
                  | ~ geq(X10,sK1(X2,X3))
                  | ~ ssItem(X10) ) ) )
     => ( ssList(sK2(X2,X3))
        & ? [X9] :
            ( app(sK2(X2,X3),X9) = X2
            & app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),X9) = X3
            & ssList(X9)
            & ! [X10] :
                ( sK1(X2,X3) = X10
                | ~ memberP(X3,X10)
                | ~ geq(X10,sK1(X2,X3))
                | ~ ssItem(X10) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f156,plain,
    ! [X2,X3] :
      ( ? [X9] :
          ( app(sK2(X2,X3),X9) = X2
          & app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),X9) = X3
          & ssList(X9)
          & ! [X10] :
              ( sK1(X2,X3) = X10
              | ~ memberP(X3,X10)
              | ~ geq(X10,sK1(X2,X3))
              | ~ ssItem(X10) ) )
     => ( app(sK2(X2,X3),sK3(X2,X3)) = X2
        & app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),sK3(X2,X3)) = X3
        & ssList(sK3(X2,X3))
        & ! [X10] :
            ( sK1(X2,X3) = X10
            | ~ memberP(X3,X10)
            | ~ geq(X10,sK1(X2,X3))
            | ~ ssItem(X10) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f153,plain,
    ! [X0,X1,X2,X3] :
      ( ( ! [X4] :
            ( ! [X5] :
                ( ! [X6] :
                    ( app(X5,X6) != X0
                    | app(app(X5,cons(X4,nil)),X6) != X1
                    | ~ ssList(X6) )
                | ~ ssList(X5) )
            | ~ ssItem(X4) )
        & neq(X1,nil)
        & ? [X7] :
            ( ssItem(X7)
            & ? [X8] :
                ( ssList(X8)
                & ? [X9] :
                    ( app(X8,X9) = X2
                    & app(app(X8,cons(X7,nil)),X9) = X3
                    & ssList(X9)
                    & ! [X10] :
                        ( X7 = X10
                        | ~ memberP(X3,X10)
                        | ~ geq(X10,X7)
                        | ~ ssItem(X10) ) ) ) ) )
      | ~ sP0(X0,X1,X2,X3) ),
    inference(rectify,[],[f152]) ).

fof(f152,plain,
    ! [X0,X1,X2,X3] :
      ( ( ! [X8] :
            ( ! [X9] :
                ( ! [X10] :
                    ( app(X9,X10) != X0
                    | app(app(X9,cons(X8,nil)),X10) != X1
                    | ~ ssList(X10) )
                | ~ ssList(X9) )
            | ~ ssItem(X8) )
        & neq(X1,nil)
        & ? [X4] :
            ( ssItem(X4)
            & ? [X5] :
                ( ssList(X5)
                & ? [X6] :
                    ( app(X5,X6) = X2
                    & app(app(X5,cons(X4,nil)),X6) = X3
                    & ssList(X6)
                    & ! [X7] :
                        ( X4 = X7
                        | ~ memberP(X3,X7)
                        | ~ geq(X7,X4)
                        | ~ ssItem(X7) ) ) ) ) )
      | ~ sP0(X0,X1,X2,X3) ),
    inference(nnf_transformation,[],[f146]) ).

fof(f146,plain,
    ! [X0,X1,X2,X3] :
      ( ( ! [X8] :
            ( ! [X9] :
                ( ! [X10] :
                    ( app(X9,X10) != X0
                    | app(app(X9,cons(X8,nil)),X10) != X1
                    | ~ ssList(X10) )
                | ~ ssList(X9) )
            | ~ ssItem(X8) )
        & neq(X1,nil)
        & ? [X4] :
            ( ssItem(X4)
            & ? [X5] :
                ( ssList(X5)
                & ? [X6] :
                    ( app(X5,X6) = X2
                    & app(app(X5,cons(X4,nil)),X6) = X3
                    & ssList(X6)
                    & ! [X7] :
                        ( X4 = X7
                        | ~ memberP(X3,X7)
                        | ~ geq(X7,X4)
                        | ~ ssItem(X7) ) ) ) ) )
      | ~ sP0(X0,X1,X2,X3) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f686,plain,
    ! [X0,X1] : ~ sP0(app(sK2(sK4,sK5),sK3(sK4,sK5)),sK5,X0,X1),
    inference(subsumption_resolution,[],[f685,f294]) ).

fof(f294,plain,
    ssItem(sK1(sK4,sK5)),
    inference(resolution,[],[f288,f196]) ).

fof(f196,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | ssItem(sK1(X2,X3)) ),
    inference(cnf_transformation,[],[f157]) ).

fof(f685,plain,
    ! [X0,X1] :
      ( ~ sP0(app(sK2(sK4,sK5),sK3(sK4,sK5)),sK5,X0,X1)
      | ~ ssItem(sK1(sK4,sK5)) ),
    inference(subsumption_resolution,[],[f684,f293]) ).

fof(f293,plain,
    ssList(sK2(sK4,sK5)),
    inference(resolution,[],[f288,f195]) ).

fof(f195,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | ssList(sK2(X2,X3)) ),
    inference(cnf_transformation,[],[f157]) ).

fof(f684,plain,
    ! [X0,X1] :
      ( ~ sP0(app(sK2(sK4,sK5),sK3(sK4,sK5)),sK5,X0,X1)
      | ~ ssList(sK2(sK4,sK5))
      | ~ ssItem(sK1(sK4,sK5)) ),
    inference(subsumption_resolution,[],[f667,f290]) ).

fof(f290,plain,
    ssList(sK3(sK4,sK5)),
    inference(resolution,[],[f288,f192]) ).

fof(f192,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | ssList(sK3(X2,X3)) ),
    inference(cnf_transformation,[],[f157]) ).

fof(f667,plain,
    ! [X0,X1] :
      ( ~ ssList(sK3(sK4,sK5))
      | ~ ssList(sK2(sK4,sK5))
      | ~ ssItem(sK1(sK4,sK5))
      | ~ sP0(app(sK2(sK4,sK5),sK3(sK4,sK5)),sK5,X0,X1) ),
    inference(superposition,[],[f258,f291]) ).

fof(f291,plain,
    app(app(sK2(sK4,sK5),cons(sK1(sK4,sK5),nil)),sK3(sK4,sK5)) = sK5,
    inference(resolution,[],[f288,f193]) ).

fof(f193,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),sK3(X2,X3)) = X3 ),
    inference(cnf_transformation,[],[f157]) ).

fof(f258,plain,
    ! [X2,X3,X6,X4,X5] :
      ( ~ sP0(app(X5,X6),app(app(X5,cons(X4,nil)),X6),X2,X3)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssItem(X4) ),
    inference(equality_resolution,[],[f257]) ).

fof(f257,plain,
    ! [X2,X3,X1,X6,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != X1
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | ~ sP0(app(X5,X6),X1,X2,X3) ),
    inference(equality_resolution,[],[f198]) ).

fof(f198,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( app(X5,X6) != X0
      | app(app(X5,cons(X4,nil)),X6) != X1
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | ~ sP0(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f157]) ).

fof(f288,plain,
    sP0(sK4,sK5,sK4,sK5),
    inference(subsumption_resolution,[],[f253,f269]) ).

fof(f269,plain,
    neq(sK5,nil),
    inference(subsumption_resolution,[],[f252,f197]) ).

fof(f197,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | neq(X1,nil) ),
    inference(cnf_transformation,[],[f157]) ).

fof(f252,plain,
    ( neq(sK5,nil)
    | sP0(sK4,sK5,sK4,sK5) ),
    inference(definition_unfolding,[],[f202,f203,f200]) ).

fof(f200,plain,
    sK7 = sK5,
    inference(cnf_transformation,[],[f162]) ).

fof(f162,plain,
    ( ssList(sK4)
    & ssList(sK5)
    & ssList(sK7)
    & sK6 = sK4
    & ( ( neq(sK5,nil)
        & ~ neq(sK7,nil) )
      | sP0(sK4,sK5,sK6,sK7) )
    & sK7 = sK5
    & ssList(sK6) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f147,f161,f160,f159,f158]) ).

fof(f158,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ssList(X3)
                    & X0 = X2
                    & ( ( neq(X1,nil)
                        & ~ neq(X3,nil) )
                      | sP0(X0,X1,X2,X3) )
                    & X1 = X3 )
                & ssList(X2) ) ) )
   => ( ssList(sK4)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & sK4 = X2
                  & ( ( neq(X1,nil)
                      & ~ neq(X3,nil) )
                    | sP0(sK4,X1,X2,X3) )
                  & X1 = X3 )
              & ssList(X2) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f159,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ssList(X3)
                & sK4 = X2
                & ( ( neq(X1,nil)
                    & ~ neq(X3,nil) )
                  | sP0(sK4,X1,X2,X3) )
                & X1 = X3 )
            & ssList(X2) ) )
   => ( ssList(sK5)
      & ? [X2] :
          ( ? [X3] :
              ( ssList(X3)
              & sK4 = X2
              & ( ( neq(sK5,nil)
                  & ~ neq(X3,nil) )
                | sP0(sK4,sK5,X2,X3) )
              & sK5 = X3 )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f160,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ssList(X3)
            & sK4 = X2
            & ( ( neq(sK5,nil)
                & ~ neq(X3,nil) )
              | sP0(sK4,sK5,X2,X3) )
            & sK5 = X3 )
        & ssList(X2) )
   => ( ? [X3] :
          ( ssList(X3)
          & sK6 = sK4
          & ( ( neq(sK5,nil)
              & ~ neq(X3,nil) )
            | sP0(sK4,sK5,sK6,X3) )
          & sK5 = X3 )
      & ssList(sK6) ) ),
    introduced(choice_axiom,[]) ).

fof(f161,plain,
    ( ? [X3] :
        ( ssList(X3)
        & sK6 = sK4
        & ( ( neq(sK5,nil)
            & ~ neq(X3,nil) )
          | sP0(sK4,sK5,sK6,X3) )
        & sK5 = X3 )
   => ( ssList(sK7)
      & sK6 = sK4
      & ( ( neq(sK5,nil)
          & ~ neq(sK7,nil) )
        | sP0(sK4,sK5,sK6,sK7) )
      & sK7 = sK5 ) ),
    introduced(choice_axiom,[]) ).

fof(f147,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X0 = X2
                  & ( ( neq(X1,nil)
                      & ~ neq(X3,nil) )
                    | sP0(X0,X1,X2,X3) )
                  & X1 = X3 )
              & ssList(X2) ) ) ),
    inference(definition_folding,[],[f118,f146]) ).

fof(f118,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X0 = X2
                  & ( ( neq(X1,nil)
                      & ~ neq(X3,nil) )
                    | ( ! [X8] :
                          ( ! [X9] :
                              ( ! [X10] :
                                  ( app(X9,X10) != X0
                                  | app(app(X9,cons(X8,nil)),X10) != X1
                                  | ~ ssList(X10) )
                              | ~ ssList(X9) )
                          | ~ ssItem(X8) )
                      & neq(X1,nil)
                      & ? [X4] :
                          ( ssItem(X4)
                          & ? [X5] :
                              ( ssList(X5)
                              & ? [X6] :
                                  ( app(X5,X6) = X2
                                  & app(app(X5,cons(X4,nil)),X6) = X3
                                  & ssList(X6)
                                  & ! [X7] :
                                      ( X4 = X7
                                      | ~ memberP(X3,X7)
                                      | ~ geq(X7,X4)
                                      | ~ ssItem(X7) ) ) ) ) ) )
                  & X1 = X3 )
              & ssList(X2) ) ) ),
    inference(flattening,[],[f117]) ).

fof(f117,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ? [X4] :
                          ( ? [X5] :
                              ( ? [X6] :
                                  ( app(app(X5,cons(X4,nil)),X6) = X3
                                  & ! [X7] :
                                      ( X4 = X7
                                      | ~ memberP(X3,X7)
                                      | ~ geq(X7,X4)
                                      | ~ ssItem(X7) )
                                  & app(X5,X6) = X2
                                  & ssList(X6) )
                              & ssList(X5) )
                          & ssItem(X4) )
                      & neq(X1,nil)
                      & ! [X8] :
                          ( ! [X9] :
                              ( ! [X10] :
                                  ( app(X9,X10) != X0
                                  | app(app(X9,cons(X8,nil)),X10) != X1
                                  | ~ ssList(X10) )
                              | ~ ssList(X9) )
                          | ~ ssItem(X8) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f98,plain,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( ( ! [X4] :
                              ( ssItem(X4)
                             => ! [X5] :
                                  ( ssList(X5)
                                 => ! [X6] :
                                      ( ssList(X6)
                                     => ( app(app(X5,cons(X4,nil)),X6) != X3
                                        | ? [X7] :
                                            ( memberP(X3,X7)
                                            & geq(X7,X4)
                                            & X4 != X7
                                            & ssItem(X7) )
                                        | app(X5,X6) != X2 ) ) ) )
                          | ~ neq(X1,nil)
                          | ? [X8] :
                              ( ? [X9] :
                                  ( ? [X10] :
                                      ( app(X9,X10) = X0
                                      & app(app(X9,cons(X8,nil)),X10) = X1
                                      & ssList(X10) )
                                  & ssList(X9) )
                              & ssItem(X8) ) )
                        & ( ~ neq(X1,nil)
                          | neq(X3,nil) ) )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(rectify,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( ( ~ neq(X1,nil)
                          | ! [X7] :
                              ( ssItem(X7)
                             => ! [X8] :
                                  ( ssList(X8)
                                 => ! [X9] :
                                      ( ssList(X9)
                                     => ( app(app(X8,cons(X7,nil)),X9) != X3
                                        | app(X8,X9) != X2
                                        | ? [X10] :
                                            ( X7 != X10
                                            & memberP(X3,X10)
                                            & ssItem(X10)
                                            & geq(X10,X7) ) ) ) ) )
                          | ? [X4] :
                              ( ssItem(X4)
                              & ? [X5] :
                                  ( ssList(X5)
                                  & ? [X6] :
                                      ( app(app(X5,cons(X4,nil)),X6) = X1
                                      & app(X5,X6) = X0
                                      & ssList(X6) ) ) ) )
                        & ( ~ neq(X1,nil)
                          | neq(X3,nil) ) )
                      | X1 != X3
                      | X0 != X2 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( ( ~ neq(X1,nil)
                        | ! [X7] :
                            ( ssItem(X7)
                           => ! [X8] :
                                ( ssList(X8)
                               => ! [X9] :
                                    ( ssList(X9)
                                   => ( app(app(X8,cons(X7,nil)),X9) != X3
                                      | app(X8,X9) != X2
                                      | ? [X10] :
                                          ( X7 != X10
                                          & memberP(X3,X10)
                                          & ssItem(X10)
                                          & geq(X10,X7) ) ) ) ) )
                        | ? [X4] :
                            ( ssItem(X4)
                            & ? [X5] :
                                ( ssList(X5)
                                & ? [X6] :
                                    ( app(app(X5,cons(X4,nil)),X6) = X1
                                    & app(X5,X6) = X0
                                    & ssList(X6) ) ) ) )
                      & ( ~ neq(X1,nil)
                        | neq(X3,nil) ) )
                    | X1 != X3
                    | X0 != X2 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f203,plain,
    sK6 = sK4,
    inference(cnf_transformation,[],[f162]) ).

fof(f202,plain,
    ( neq(sK5,nil)
    | sP0(sK4,sK5,sK6,sK7) ),
    inference(cnf_transformation,[],[f162]) ).

fof(f253,plain,
    ( sP0(sK4,sK5,sK4,sK5)
    | ~ neq(sK5,nil) ),
    inference(definition_unfolding,[],[f201,f200,f203,f200]) ).

fof(f201,plain,
    ( ~ neq(sK7,nil)
    | sP0(sK4,sK5,sK6,sK7) ),
    inference(cnf_transformation,[],[f162]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC010+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 : n022.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.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 17:57:10 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.19/0.50  % (24747)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.19/0.50  % (24739)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50  % (24725)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.19/0.50  % (24729)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.51  % (24739)Instruction limit reached!
% 0.19/0.51  % (24739)------------------------------
% 0.19/0.51  % (24739)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (24739)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (24739)Termination reason: Unknown
% 0.19/0.51  % (24739)Termination phase: Saturation
% 0.19/0.51  
% 0.19/0.51  % (24739)Memory used [KB]: 1791
% 0.19/0.51  % (24739)Time elapsed: 0.008 s
% 0.19/0.51  % (24739)Instructions burned: 9 (million)
% 0.19/0.51  % (24739)------------------------------
% 0.19/0.51  % (24739)------------------------------
% 0.19/0.51  % (24727)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.19/0.51  % (24734)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.51  % (24746)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.19/0.52  % (24721)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.19/0.52  % (24722)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52  % (24745)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.52  % (24738)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.52  % (24738)Instruction limit reached!
% 0.19/0.52  % (24738)------------------------------
% 0.19/0.52  % (24738)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (24738)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (24738)Termination reason: Unknown
% 0.19/0.52  % (24738)Termination phase: Preprocessing 3
% 0.19/0.52  
% 0.19/0.52  % (24738)Memory used [KB]: 1663
% 0.19/0.52  % (24738)Time elapsed: 0.003 s
% 0.19/0.52  % (24738)Instructions burned: 4 (million)
% 0.19/0.52  % (24738)------------------------------
% 0.19/0.52  % (24738)------------------------------
% 0.19/0.52  % (24726)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.19/0.52  % (24731)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.19/0.52  % (24748)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52  % (24735)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.52  % (24749)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.53  % (24740)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.53  % (24723)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.19/0.53  % (24737)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53  % (24735)Instruction limit reached!
% 0.19/0.53  % (24735)------------------------------
% 0.19/0.53  % (24735)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (24735)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (24735)Termination reason: Unknown
% 0.19/0.53  % (24735)Termination phase: Saturation
% 0.19/0.53  
% 0.19/0.53  % (24735)Memory used [KB]: 6140
% 0.19/0.53  % (24735)Time elapsed: 0.132 s
% 0.19/0.53  % (24735)Instructions burned: 8 (million)
% 0.19/0.53  % (24735)------------------------------
% 0.19/0.53  % (24735)------------------------------
% 0.19/0.53  % (24732)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.19/0.53  % (24742)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.19/0.53  % (24728)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.53  % (24754)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.19/0.53  % (24747)First to succeed.
% 0.19/0.53  % (24752)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.19/0.54  % (24736)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.19/0.54  % (24734)Instruction limit reached!
% 0.19/0.54  % (24734)------------------------------
% 0.19/0.54  % (24734)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (24734)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (24734)Termination reason: Unknown
% 0.19/0.54  % (24734)Termination phase: Saturation
% 0.19/0.54  
% 0.19/0.54  % (24734)Memory used [KB]: 6268
% 0.19/0.54  % (24734)Time elapsed: 0.145 s
% 0.19/0.54  % (24734)Instructions burned: 13 (million)
% 0.19/0.54  % (24734)------------------------------
% 0.19/0.54  % (24734)------------------------------
% 0.19/0.54  % (24747)Refutation found. Thanks to Tanya!
% 0.19/0.54  % SZS status Theorem for theBenchmark
% 0.19/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.54  % (24747)------------------------------
% 0.19/0.54  % (24747)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (24747)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (24747)Termination reason: Refutation
% 0.19/0.54  
% 0.19/0.54  % (24747)Memory used [KB]: 2046
% 0.19/0.54  % (24747)Time elapsed: 0.088 s
% 0.19/0.54  % (24747)Instructions burned: 28 (million)
% 0.19/0.54  % (24747)------------------------------
% 0.19/0.54  % (24747)------------------------------
% 0.19/0.54  % (24715)Success in time 0.195 s
%------------------------------------------------------------------------------