TSTP Solution File: SWC219+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC219+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_sat --cores 0 -t %d %s

% Computer : n008.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:42:28 EDT 2022

% Result   : Theorem 1.74s 0.58s
% Output   : Refutation 1.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   51 (  14 unt;   0 def)
%            Number of atoms       :  446 ( 150 equ)
%            Maximal formula atoms :   50 (   8 avg)
%            Number of connectives :  583 ( 188   ~; 164   |; 210   &)
%                                         (   0 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-3 aty)
%            Number of variables   :  153 (  93   !;  60   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f728,plain,
    $false,
    inference(subsumption_resolution,[],[f727,f439]) ).

fof(f439,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).

fof(f727,plain,
    ~ ssList(nil),
    inference(trivial_inequality_removal,[],[f725]) ).

fof(f725,plain,
    ( ~ ssList(nil)
    | sK10 != sK10 ),
    inference(superposition,[],[f685,f693]) ).

fof(f693,plain,
    sK10 = app(sK10,nil),
    inference(resolution,[],[f568,f389]) ).

fof(f389,plain,
    ssList(sK10),
    inference(cnf_transformation,[],[f252]) ).

fof(f252,plain,
    ( ssList(sK10)
    & sK12 = sK10
    & ssList(sK13)
    & ( ( memberP(sK13,sK14)
        & ! [X5] :
            ( ~ ssItem(X5)
            | ~ memberP(sK13,X5)
            | sK14 = X5
            | ~ leq(X5,sK14) )
        & ssItem(sK14)
        & sK12 = cons(sK14,nil) )
      | ( nil = sK13
        & nil = sK12 ) )
    & ! [X6] :
        ( ~ ssItem(X6)
        | ! [X7] :
            ( ~ ssList(X7)
            | ! [X8] :
                ( ( memberP(X7,sK15(X6,X7,X8))
                  & leq(X6,sK15(X6,X7,X8))
                  & memberP(X8,sK15(X6,X7,X8))
                  & ssItem(sK15(X6,X7,X8))
                  & ~ leq(sK15(X6,X7,X8),X6) )
                | ~ ssList(X8)
                | sK10 != app(app(X7,cons(X6,nil)),X8) ) ) )
    & nil != sK10
    & sK13 = sK11
    & ssList(sK12)
    & ssList(sK11) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13,sK14,sK15])],[f245,f251,f250,f249,f248,f247,f246]) ).

fof(f246,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( X0 = X2
                    & ssList(X3)
                    & ( ? [X4] :
                          ( memberP(X3,X4)
                          & ! [X5] :
                              ( ~ ssItem(X5)
                              | ~ memberP(X3,X5)
                              | X4 = X5
                              | ~ leq(X5,X4) )
                          & ssItem(X4)
                          & cons(X4,nil) = X2 )
                      | ( nil = X3
                        & nil = X2 ) )
                    & ! [X6] :
                        ( ~ ssItem(X6)
                        | ! [X7] :
                            ( ~ ssList(X7)
                            | ! [X8] :
                                ( ? [X9] :
                                    ( memberP(X7,X9)
                                    & leq(X6,X9)
                                    & memberP(X8,X9)
                                    & ssItem(X9)
                                    & ~ leq(X9,X6) )
                                | ~ ssList(X8)
                                | app(app(X7,cons(X6,nil)),X8) != X0 ) ) )
                    & nil != X0
                    & X1 = X3 )
                & ssList(X2) )
            & ssList(X1) ) )
   => ( ssList(sK10)
      & ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( sK10 = X2
                  & ssList(X3)
                  & ( ? [X4] :
                        ( memberP(X3,X4)
                        & ! [X5] :
                            ( ~ ssItem(X5)
                            | ~ memberP(X3,X5)
                            | X4 = X5
                            | ~ leq(X5,X4) )
                        & ssItem(X4)
                        & cons(X4,nil) = X2 )
                    | ( nil = X3
                      & nil = X2 ) )
                  & ! [X6] :
                      ( ~ ssItem(X6)
                      | ! [X7] :
                          ( ~ ssList(X7)
                          | ! [X8] :
                              ( ? [X9] :
                                  ( memberP(X7,X9)
                                  & leq(X6,X9)
                                  & memberP(X8,X9)
                                  & ssItem(X9)
                                  & ~ leq(X9,X6) )
                              | ~ ssList(X8)
                              | sK10 != app(app(X7,cons(X6,nil)),X8) ) ) )
                  & nil != sK10
                  & X1 = X3 )
              & ssList(X2) )
          & ssList(X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f247,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( sK10 = X2
                & ssList(X3)
                & ( ? [X4] :
                      ( memberP(X3,X4)
                      & ! [X5] :
                          ( ~ ssItem(X5)
                          | ~ memberP(X3,X5)
                          | X4 = X5
                          | ~ leq(X5,X4) )
                      & ssItem(X4)
                      & cons(X4,nil) = X2 )
                  | ( nil = X3
                    & nil = X2 ) )
                & ! [X6] :
                    ( ~ ssItem(X6)
                    | ! [X7] :
                        ( ~ ssList(X7)
                        | ! [X8] :
                            ( ? [X9] :
                                ( memberP(X7,X9)
                                & leq(X6,X9)
                                & memberP(X8,X9)
                                & ssItem(X9)
                                & ~ leq(X9,X6) )
                            | ~ ssList(X8)
                            | sK10 != app(app(X7,cons(X6,nil)),X8) ) ) )
                & nil != sK10
                & X1 = X3 )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( sK10 = X2
              & ssList(X3)
              & ( ? [X4] :
                    ( memberP(X3,X4)
                    & ! [X5] :
                        ( ~ ssItem(X5)
                        | ~ memberP(X3,X5)
                        | X4 = X5
                        | ~ leq(X5,X4) )
                    & ssItem(X4)
                    & cons(X4,nil) = X2 )
                | ( nil = X3
                  & nil = X2 ) )
              & ! [X6] :
                  ( ~ ssItem(X6)
                  | ! [X7] :
                      ( ~ ssList(X7)
                      | ! [X8] :
                          ( ? [X9] :
                              ( memberP(X7,X9)
                              & leq(X6,X9)
                              & memberP(X8,X9)
                              & ssItem(X9)
                              & ~ leq(X9,X6) )
                          | ~ ssList(X8)
                          | sK10 != app(app(X7,cons(X6,nil)),X8) ) ) )
              & nil != sK10
              & sK11 = X3 )
          & ssList(X2) )
      & ssList(sK11) ) ),
    introduced(choice_axiom,[]) ).

fof(f248,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( sK10 = X2
            & ssList(X3)
            & ( ? [X4] :
                  ( memberP(X3,X4)
                  & ! [X5] :
                      ( ~ ssItem(X5)
                      | ~ memberP(X3,X5)
                      | X4 = X5
                      | ~ leq(X5,X4) )
                  & ssItem(X4)
                  & cons(X4,nil) = X2 )
              | ( nil = X3
                & nil = X2 ) )
            & ! [X6] :
                ( ~ ssItem(X6)
                | ! [X7] :
                    ( ~ ssList(X7)
                    | ! [X8] :
                        ( ? [X9] :
                            ( memberP(X7,X9)
                            & leq(X6,X9)
                            & memberP(X8,X9)
                            & ssItem(X9)
                            & ~ leq(X9,X6) )
                        | ~ ssList(X8)
                        | sK10 != app(app(X7,cons(X6,nil)),X8) ) ) )
            & nil != sK10
            & sK11 = X3 )
        & ssList(X2) )
   => ( ? [X3] :
          ( sK12 = sK10
          & ssList(X3)
          & ( ? [X4] :
                ( memberP(X3,X4)
                & ! [X5] :
                    ( ~ ssItem(X5)
                    | ~ memberP(X3,X5)
                    | X4 = X5
                    | ~ leq(X5,X4) )
                & ssItem(X4)
                & cons(X4,nil) = sK12 )
            | ( nil = X3
              & nil = sK12 ) )
          & ! [X6] :
              ( ~ ssItem(X6)
              | ! [X7] :
                  ( ~ ssList(X7)
                  | ! [X8] :
                      ( ? [X9] :
                          ( memberP(X7,X9)
                          & leq(X6,X9)
                          & memberP(X8,X9)
                          & ssItem(X9)
                          & ~ leq(X9,X6) )
                      | ~ ssList(X8)
                      | sK10 != app(app(X7,cons(X6,nil)),X8) ) ) )
          & nil != sK10
          & sK11 = X3 )
      & ssList(sK12) ) ),
    introduced(choice_axiom,[]) ).

fof(f249,plain,
    ( ? [X3] :
        ( sK12 = sK10
        & ssList(X3)
        & ( ? [X4] :
              ( memberP(X3,X4)
              & ! [X5] :
                  ( ~ ssItem(X5)
                  | ~ memberP(X3,X5)
                  | X4 = X5
                  | ~ leq(X5,X4) )
              & ssItem(X4)
              & cons(X4,nil) = sK12 )
          | ( nil = X3
            & nil = sK12 ) )
        & ! [X6] :
            ( ~ ssItem(X6)
            | ! [X7] :
                ( ~ ssList(X7)
                | ! [X8] :
                    ( ? [X9] :
                        ( memberP(X7,X9)
                        & leq(X6,X9)
                        & memberP(X8,X9)
                        & ssItem(X9)
                        & ~ leq(X9,X6) )
                    | ~ ssList(X8)
                    | sK10 != app(app(X7,cons(X6,nil)),X8) ) ) )
        & nil != sK10
        & sK11 = X3 )
   => ( sK12 = sK10
      & ssList(sK13)
      & ( ? [X4] :
            ( memberP(sK13,X4)
            & ! [X5] :
                ( ~ ssItem(X5)
                | ~ memberP(sK13,X5)
                | X4 = X5
                | ~ leq(X5,X4) )
            & ssItem(X4)
            & cons(X4,nil) = sK12 )
        | ( nil = sK13
          & nil = sK12 ) )
      & ! [X6] :
          ( ~ ssItem(X6)
          | ! [X7] :
              ( ~ ssList(X7)
              | ! [X8] :
                  ( ? [X9] :
                      ( memberP(X7,X9)
                      & leq(X6,X9)
                      & memberP(X8,X9)
                      & ssItem(X9)
                      & ~ leq(X9,X6) )
                  | ~ ssList(X8)
                  | sK10 != app(app(X7,cons(X6,nil)),X8) ) ) )
      & nil != sK10
      & sK13 = sK11 ) ),
    introduced(choice_axiom,[]) ).

fof(f250,plain,
    ( ? [X4] :
        ( memberP(sK13,X4)
        & ! [X5] :
            ( ~ ssItem(X5)
            | ~ memberP(sK13,X5)
            | X4 = X5
            | ~ leq(X5,X4) )
        & ssItem(X4)
        & cons(X4,nil) = sK12 )
   => ( memberP(sK13,sK14)
      & ! [X5] :
          ( ~ ssItem(X5)
          | ~ memberP(sK13,X5)
          | sK14 = X5
          | ~ leq(X5,sK14) )
      & ssItem(sK14)
      & sK12 = cons(sK14,nil) ) ),
    introduced(choice_axiom,[]) ).

fof(f251,plain,
    ! [X6,X7,X8] :
      ( ? [X9] :
          ( memberP(X7,X9)
          & leq(X6,X9)
          & memberP(X8,X9)
          & ssItem(X9)
          & ~ leq(X9,X6) )
     => ( memberP(X7,sK15(X6,X7,X8))
        & leq(X6,sK15(X6,X7,X8))
        & memberP(X8,sK15(X6,X7,X8))
        & ssItem(sK15(X6,X7,X8))
        & ~ leq(sK15(X6,X7,X8),X6) ) ),
    introduced(choice_axiom,[]) ).

fof(f245,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X0 = X2
                  & ssList(X3)
                  & ( ? [X4] :
                        ( memberP(X3,X4)
                        & ! [X5] :
                            ( ~ ssItem(X5)
                            | ~ memberP(X3,X5)
                            | X4 = X5
                            | ~ leq(X5,X4) )
                        & ssItem(X4)
                        & cons(X4,nil) = X2 )
                    | ( nil = X3
                      & nil = X2 ) )
                  & ! [X6] :
                      ( ~ ssItem(X6)
                      | ! [X7] :
                          ( ~ ssList(X7)
                          | ! [X8] :
                              ( ? [X9] :
                                  ( memberP(X7,X9)
                                  & leq(X6,X9)
                                  & memberP(X8,X9)
                                  & ssItem(X9)
                                  & ~ leq(X9,X6) )
                              | ~ ssList(X8)
                              | app(app(X7,cons(X6,nil)),X8) != X0 ) ) )
                  & nil != X0
                  & X1 = X3 )
              & ssList(X2) )
          & ssList(X1) ) ),
    inference(rectify,[],[f160]) ).

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

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

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

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

fof(f568,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(X0,nil) = X0 ),
    inference(cnf_transformation,[],[f143]) ).

fof(f143,plain,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f84]) ).

fof(f84,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(X0,nil) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).

fof(f685,plain,
    ! [X0] :
      ( app(sK10,X0) != sK10
      | ~ ssList(X0) ),
    inference(backward_demodulation,[],[f642,f668]) ).

fof(f668,plain,
    app(nil,sK10) = sK10,
    inference(resolution,[],[f464,f389]) ).

fof(f464,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(nil,X0) = X0 ),
    inference(cnf_transformation,[],[f148]) ).

fof(f148,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(nil,X0) = X0 ),
    inference(ennf_transformation,[],[f28]) ).

fof(f28,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(nil,X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).

fof(f642,plain,
    ! [X0] :
      ( app(app(nil,sK10),X0) != sK10
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f641,f627]) ).

fof(f627,plain,
    ssItem(sK14),
    inference(subsumption_resolution,[],[f626,f373]) ).

fof(f373,plain,
    nil != sK10,
    inference(cnf_transformation,[],[f252]) ).

fof(f626,plain,
    ( ssItem(sK14)
    | nil = sK10 ),
    inference(forward_demodulation,[],[f381,f388]) ).

fof(f388,plain,
    sK12 = sK10,
    inference(cnf_transformation,[],[f252]) ).

fof(f381,plain,
    ( ssItem(sK14)
    | nil = sK12 ),
    inference(cnf_transformation,[],[f252]) ).

fof(f641,plain,
    ! [X0] :
      ( ~ ssItem(sK14)
      | app(app(nil,sK10),X0) != sK10
      | ~ ssList(X0) ),
    inference(superposition,[],[f640,f620]) ).

fof(f620,plain,
    sK10 = cons(sK14,nil),
    inference(backward_demodulation,[],[f597,f619]) ).

fof(f619,plain,
    sK10 = sF59,
    inference(forward_demodulation,[],[f618,f388]) ).

fof(f618,plain,
    sK12 = sF59,
    inference(subsumption_resolution,[],[f616,f373]) ).

fof(f616,plain,
    ( nil = sK10
    | sK12 = sF59 ),
    inference(backward_demodulation,[],[f599,f388]) ).

fof(f599,plain,
    ( sK12 = sF59
    | nil = sK12 ),
    inference(definition_folding,[],[f379,f597]) ).

fof(f379,plain,
    ( sK12 = cons(sK14,nil)
    | nil = sK12 ),
    inference(cnf_transformation,[],[f252]) ).

fof(f597,plain,
    sF59 = cons(sK14,nil),
    introduced(function_definition,[]) ).

fof(f640,plain,
    ! [X0,X1] :
      ( sK10 != app(app(nil,cons(X0,nil)),X1)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(subsumption_resolution,[],[f639,f439]) ).

fof(f639,plain,
    ! [X0,X1] :
      ( ~ ssList(nil)
      | ~ ssList(X1)
      | ~ ssItem(X0)
      | sK10 != app(app(nil,cons(X0,nil)),X1) ),
    inference(duplicate_literal_removal,[],[f638]) ).

fof(f638,plain,
    ! [X0,X1] :
      ( ~ ssList(nil)
      | ~ ssList(X1)
      | sK10 != app(app(nil,cons(X0,nil)),X1)
      | sK10 != app(app(nil,cons(X0,nil)),X1)
      | ~ ssItem(X0)
      | ~ ssItem(X0)
      | ~ ssList(X1) ),
    inference(resolution,[],[f632,f375]) ).

fof(f375,plain,
    ! [X8,X6,X7] :
      ( ssItem(sK15(X6,X7,X8))
      | ~ ssList(X8)
      | ~ ssList(X7)
      | ~ ssItem(X6)
      | sK10 != app(app(X7,cons(X6,nil)),X8) ),
    inference(cnf_transformation,[],[f252]) ).

fof(f632,plain,
    ! [X2,X3] :
      ( ~ ssItem(sK15(X2,nil,X3))
      | ~ ssItem(X2)
      | ~ ssList(X3)
      | app(app(nil,cons(X2,nil)),X3) != sK10 ),
    inference(subsumption_resolution,[],[f630,f439]) ).

fof(f630,plain,
    ! [X2,X3] :
      ( ~ ssItem(X2)
      | ~ ssList(nil)
      | ~ ssList(X3)
      | app(app(nil,cons(X2,nil)),X3) != sK10
      | ~ ssItem(sK15(X2,nil,X3)) ),
    inference(resolution,[],[f355,f378]) ).

fof(f378,plain,
    ! [X8,X6,X7] :
      ( memberP(X7,sK15(X6,X7,X8))
      | ~ ssItem(X6)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | sK10 != app(app(X7,cons(X6,nil)),X8) ),
    inference(cnf_transformation,[],[f252]) ).

fof(f355,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f174]) ).

fof(f174,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | ~ memberP(nil,X0) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f38,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC219+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_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 18:38:55 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.52  % (18004)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52  % (18025)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.52  % (18006)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52  % (18017)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.52  % (18019)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53  % (18009)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53  % (18003)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.53  % (18008)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.53  % (18029)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.53  % (18007)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53  % (18020)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.53  % (18005)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.53  % (18021)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.53  % (18018)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.54  % (18015)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.54  % (18032)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.19/0.54  % (18022)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.54  % (18011)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.54  % (18011)Instruction limit reached!
% 0.19/0.54  % (18011)------------------------------
% 0.19/0.54  % (18011)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (18011)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (18011)Termination reason: Unknown
% 0.19/0.54  % (18011)Termination phase: Preprocessing 3
% 0.19/0.54  
% 0.19/0.54  % (18011)Memory used [KB]: 1151
% 0.19/0.54  % (18011)Time elapsed: 0.003 s
% 0.19/0.54  % (18011)Instructions burned: 4 (million)
% 0.19/0.54  % (18011)------------------------------
% 0.19/0.54  % (18011)------------------------------
% 0.19/0.54  % (18013)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.54  % (18010)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.54  % (18016)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.54  % (18014)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.54  % (18031)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.54  % (18012)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54  % (18026)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.55  % (18027)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.55  % (18024)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.55  % (18030)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.19/0.55  % (18028)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.58/0.56  % (18023)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.58/0.56  TRYING [1]
% 1.58/0.57  % (18010)Instruction limit reached!
% 1.58/0.57  % (18010)------------------------------
% 1.58/0.57  % (18010)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.58/0.57  % (18010)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.58/0.57  % (18010)Termination reason: Unknown
% 1.58/0.57  % (18010)Termination phase: Function definition elimination
% 1.58/0.57  
% 1.58/0.57  % (18010)Memory used [KB]: 1279
% 1.58/0.57  % (18010)Time elapsed: 0.005 s
% 1.58/0.57  % (18010)Instructions burned: 8 (million)
% 1.58/0.57  % (18010)------------------------------
% 1.58/0.57  % (18010)------------------------------
% 1.74/0.57  TRYING [1]
% 1.74/0.57  % (18018)First to succeed.
% 1.74/0.58  TRYING [2]
% 1.74/0.58  TRYING [2]
% 1.74/0.58  % (18030)Also succeeded, but the first one will report.
% 1.74/0.58  % (18018)Refutation found. Thanks to Tanya!
% 1.74/0.58  % SZS status Theorem for theBenchmark
% 1.74/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 1.74/0.58  % (18018)------------------------------
% 1.74/0.58  % (18018)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.74/0.58  % (18018)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.74/0.58  % (18018)Termination reason: Refutation
% 1.74/0.58  
% 1.74/0.58  % (18018)Memory used [KB]: 1535
% 1.74/0.58  % (18018)Time elapsed: 0.171 s
% 1.74/0.58  % (18018)Instructions burned: 24 (million)
% 1.74/0.58  % (18018)------------------------------
% 1.74/0.58  % (18018)------------------------------
% 1.74/0.58  % (18002)Success in time 0.234 s
%------------------------------------------------------------------------------