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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC040+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 : n009.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:41:21 EDT 2022

% Result   : Theorem 0.19s 0.54s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   27 (   8 unt;   0 def)
%            Number of atoms       :  221 ( 124 equ)
%            Maximal formula atoms :   30 (   8 avg)
%            Number of connectives :  249 (  55   ~;  40   |; 134   &)
%                                         (   2 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   7 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   60 (  12   !;  48   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f660,plain,
    $false,
    inference(avatar_sat_refutation,[],[f604,f633,f657]) ).

fof(f657,plain,
    ~ spl59_1,
    inference(avatar_contradiction_clause,[],[f656]) ).

fof(f656,plain,
    ( $false
    | ~ spl59_1 ),
    inference(trivial_inequality_removal,[],[f654]) ).

fof(f654,plain,
    ( nil != nil
    | ~ spl59_1 ),
    inference(backward_demodulation,[],[f437,f652]) ).

fof(f652,plain,
    ( nil = sK22
    | ~ spl59_1 ),
    inference(forward_demodulation,[],[f599,f436]) ).

fof(f436,plain,
    sK24 = sK22,
    inference(cnf_transformation,[],[f283]) ).

fof(f283,plain,
    ( ssList(sK23)
    & nil != sK22
    & sK24 = sK22
    & sK23 = sK25
    & ( ( ssItem(sK26)
        & ssList(sK27)
        & app(sK27,cons(sK26,nil)) = sK25
        & sK24 = app(cons(sK26,nil),sK27) )
      | ~ neq(sK25,nil) )
    & ssList(sK25)
    & ( nil = sK24
      | nil != sK25 )
    & nil = sK23
    & ssList(sK24)
    & ssList(sK22) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23,sK24,sK25,sK26,sK27])],[f207,f282,f281,f280,f279,f278,f277]) ).

fof(f277,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( nil != X0
                    & X0 = X2
                    & X1 = X3
                    & ( ? [X4] :
                          ( ssItem(X4)
                          & ? [X5] :
                              ( ssList(X5)
                              & app(X5,cons(X4,nil)) = X3
                              & app(cons(X4,nil),X5) = X2 ) )
                      | ~ neq(X3,nil) )
                    & ssList(X3)
                    & ( nil = X2
                      | nil != X3 )
                    & nil = X1 )
                & ssList(X2) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( nil != sK22
                  & sK22 = X2
                  & X1 = X3
                  & ( ? [X4] :
                        ( ssItem(X4)
                        & ? [X5] :
                            ( ssList(X5)
                            & app(X5,cons(X4,nil)) = X3
                            & app(cons(X4,nil),X5) = X2 ) )
                    | ~ neq(X3,nil) )
                  & ssList(X3)
                  & ( nil = X2
                    | nil != X3 )
                  & nil = X1 )
              & ssList(X2) ) )
      & ssList(sK22) ) ),
    introduced(choice_axiom,[]) ).

fof(f278,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( nil != sK22
                & sK22 = X2
                & X1 = X3
                & ( ? [X4] :
                      ( ssItem(X4)
                      & ? [X5] :
                          ( ssList(X5)
                          & app(X5,cons(X4,nil)) = X3
                          & app(cons(X4,nil),X5) = X2 ) )
                  | ~ neq(X3,nil) )
                & ssList(X3)
                & ( nil = X2
                  | nil != X3 )
                & nil = X1 )
            & ssList(X2) ) )
   => ( ssList(sK23)
      & ? [X2] :
          ( ? [X3] :
              ( nil != sK22
              & sK22 = X2
              & sK23 = X3
              & ( ? [X4] :
                    ( ssItem(X4)
                    & ? [X5] :
                        ( ssList(X5)
                        & app(X5,cons(X4,nil)) = X3
                        & app(cons(X4,nil),X5) = X2 ) )
                | ~ neq(X3,nil) )
              & ssList(X3)
              & ( nil = X2
                | nil != X3 )
              & nil = sK23 )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f279,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( nil != sK22
            & sK22 = X2
            & sK23 = X3
            & ( ? [X4] :
                  ( ssItem(X4)
                  & ? [X5] :
                      ( ssList(X5)
                      & app(X5,cons(X4,nil)) = X3
                      & app(cons(X4,nil),X5) = X2 ) )
              | ~ neq(X3,nil) )
            & ssList(X3)
            & ( nil = X2
              | nil != X3 )
            & nil = sK23 )
        & ssList(X2) )
   => ( ? [X3] :
          ( nil != sK22
          & sK24 = sK22
          & sK23 = X3
          & ( ? [X4] :
                ( ssItem(X4)
                & ? [X5] :
                    ( ssList(X5)
                    & app(X5,cons(X4,nil)) = X3
                    & app(cons(X4,nil),X5) = sK24 ) )
            | ~ neq(X3,nil) )
          & ssList(X3)
          & ( nil = sK24
            | nil != X3 )
          & nil = sK23 )
      & ssList(sK24) ) ),
    introduced(choice_axiom,[]) ).

fof(f280,plain,
    ( ? [X3] :
        ( nil != sK22
        & sK24 = sK22
        & sK23 = X3
        & ( ? [X4] :
              ( ssItem(X4)
              & ? [X5] :
                  ( ssList(X5)
                  & app(X5,cons(X4,nil)) = X3
                  & app(cons(X4,nil),X5) = sK24 ) )
          | ~ neq(X3,nil) )
        & ssList(X3)
        & ( nil = sK24
          | nil != X3 )
        & nil = sK23 )
   => ( nil != sK22
      & sK24 = sK22
      & sK23 = sK25
      & ( ? [X4] :
            ( ssItem(X4)
            & ? [X5] :
                ( ssList(X5)
                & app(X5,cons(X4,nil)) = sK25
                & app(cons(X4,nil),X5) = sK24 ) )
        | ~ neq(sK25,nil) )
      & ssList(sK25)
      & ( nil = sK24
        | nil != sK25 )
      & nil = sK23 ) ),
    introduced(choice_axiom,[]) ).

fof(f281,plain,
    ( ? [X4] :
        ( ssItem(X4)
        & ? [X5] :
            ( ssList(X5)
            & app(X5,cons(X4,nil)) = sK25
            & app(cons(X4,nil),X5) = sK24 ) )
   => ( ssItem(sK26)
      & ? [X5] :
          ( ssList(X5)
          & sK25 = app(X5,cons(sK26,nil))
          & app(cons(sK26,nil),X5) = sK24 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f282,plain,
    ( ? [X5] :
        ( ssList(X5)
        & sK25 = app(X5,cons(sK26,nil))
        & app(cons(sK26,nil),X5) = sK24 )
   => ( ssList(sK27)
      & app(sK27,cons(sK26,nil)) = sK25
      & sK24 = app(cons(sK26,nil),sK27) ) ),
    introduced(choice_axiom,[]) ).

fof(f207,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( nil != X0
                  & X0 = X2
                  & X1 = X3
                  & ( ? [X4] :
                        ( ssItem(X4)
                        & ? [X5] :
                            ( ssList(X5)
                            & app(X5,cons(X4,nil)) = X3
                            & app(cons(X4,nil),X5) = X2 ) )
                    | ~ neq(X3,nil) )
                  & ssList(X3)
                  & ( nil = X2
                    | nil != X3 )
                  & nil = X1 )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(flattening,[],[f206]) ).

fof(f206,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( nil = X1
                  & ( nil = X2
                    | nil != X3 )
                  & X1 = X3
                  & ( ~ neq(X3,nil)
                    | ? [X4] :
                        ( ? [X5] :
                            ( app(X5,cons(X4,nil)) = X3
                            & app(cons(X4,nil),X5) = X2
                            & ssList(X5) )
                        & ssItem(X4) ) )
                  & nil != X0
                  & X0 = X2
                  & 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)
                   => ( nil != X1
                      | ( nil = X3
                        & nil != X2 )
                      | X1 != X3
                      | ( neq(X3,nil)
                        & ! [X4] :
                            ( ssItem(X4)
                           => ! [X5] :
                                ( ssList(X5)
                               => ( app(X5,cons(X4,nil)) != X3
                                  | app(cons(X4,nil),X5) != X2 ) ) ) )
                      | nil = X0
                      | X0 != X2 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

fof(f599,plain,
    ( nil = sK24
    | ~ spl59_1 ),
    inference(avatar_component_clause,[],[f597]) ).

fof(f597,plain,
    ( spl59_1
  <=> nil = sK24 ),
    introduced(avatar_definition,[new_symbols(naming,[spl59_1])]) ).

fof(f437,plain,
    nil != sK22,
    inference(cnf_transformation,[],[f283]) ).

fof(f633,plain,
    spl59_2,
    inference(avatar_split_clause,[],[f632,f601]) ).

fof(f601,plain,
    ( spl59_2
  <=> nil = sK25 ),
    introduced(avatar_definition,[new_symbols(naming,[spl59_2])]) ).

fof(f632,plain,
    nil = sK25,
    inference(backward_demodulation,[],[f435,f428]) ).

fof(f428,plain,
    nil = sK23,
    inference(cnf_transformation,[],[f283]) ).

fof(f435,plain,
    sK23 = sK25,
    inference(cnf_transformation,[],[f283]) ).

fof(f604,plain,
    ( spl59_1
    | ~ spl59_2 ),
    inference(avatar_split_clause,[],[f429,f601,f597]) ).

fof(f429,plain,
    ( nil != sK25
    | nil = sK24 ),
    inference(cnf_transformation,[],[f283]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWC040+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n009.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 18:02:50 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.19/0.50  % (27953)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.50  % (27943)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.50  % (27955)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.51  % (27966)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.51  % (27950)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.51  % (27961)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.51  % (27972)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.51  % (27950)Instruction limit reached!
% 0.19/0.51  % (27950)------------------------------
% 0.19/0.51  % (27950)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (27958)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.51  % (27950)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (27950)Termination reason: Unknown
% 0.19/0.51  % (27950)Termination phase: Function definition elimination
% 0.19/0.51  
% 0.19/0.51  % (27950)Memory used [KB]: 1279
% 0.19/0.51  % (27950)Time elapsed: 0.006 s
% 0.19/0.51  % (27950)Instructions burned: 8 (million)
% 0.19/0.51  % (27950)------------------------------
% 0.19/0.51  % (27950)------------------------------
% 0.19/0.52  % (27947)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.52  % (27945)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.52  % (27972)First to succeed.
% 0.19/0.52  % (27944)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  % (27946)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.53  % (27954)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.53  % (27956)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.53  % (27959)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  % (27949)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  % (27960)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.53  % (27970)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.54  % (27957)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.54  % (27971)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  % (27969)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.54  % (27951)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  % (27965)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.54  % (27951)Instruction limit reached!
% 0.19/0.54  % (27951)------------------------------
% 0.19/0.54  % (27951)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (27951)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (27951)Termination reason: Unknown
% 0.19/0.54  % (27951)Termination phase: Naming
% 0.19/0.54  
% 0.19/0.54  % (27951)Memory used [KB]: 1023
% 0.19/0.54  % (27951)Time elapsed: 0.004 s
% 0.19/0.54  % (27951)Instructions burned: 3 (million)
% 0.19/0.54  % (27951)------------------------------
% 0.19/0.54  % (27951)------------------------------
% 0.19/0.54  % (27952)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  % (27963)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)
% 0.19/0.54  % (27968)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.54  % (27948)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.54  % (27962)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  % (27972)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.55  % (27972)------------------------------
% 0.19/0.55  % (27972)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (27972)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (27972)Termination reason: Refutation
% 0.19/0.55  
% 0.19/0.55  % (27972)Memory used [KB]: 6012
% 0.19/0.55  % (27972)Time elapsed: 0.012 s
% 0.19/0.55  % (27972)Instructions burned: 15 (million)
% 0.19/0.55  % (27972)------------------------------
% 0.19/0.55  % (27972)------------------------------
% 0.19/0.55  % (27942)Success in time 0.202 s
%------------------------------------------------------------------------------