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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC097+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 : n004.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:47 EDT 2022

% Result   : Theorem 0.20s 0.60s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (   5 unt;   0 def)
%            Number of atoms       :  120 (  31 equ)
%            Maximal formula atoms :   13 (   4 avg)
%            Number of connectives :  146 (  56   ~;  45   |;  26   &)
%                                         (   4 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   34 (  21   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f425,plain,
    $false,
    inference(avatar_sat_refutation,[],[f184,f185,f196,f197,f424]) ).

fof(f424,plain,
    ( ~ spl9_2
    | ~ spl9_3
    | ~ spl9_4 ),
    inference(avatar_contradiction_clause,[],[f423]) ).

fof(f423,plain,
    ( $false
    | ~ spl9_2
    | ~ spl9_3
    | ~ spl9_4 ),
    inference(subsumption_resolution,[],[f417,f194]) ).

fof(f194,plain,
    ( ssItem(sK6)
    | ~ spl9_4 ),
    inference(avatar_component_clause,[],[f192]) ).

fof(f192,plain,
    ( spl9_4
  <=> ssItem(sK6) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).

fof(f417,plain,
    ( ~ ssItem(sK6)
    | ~ spl9_2
    | ~ spl9_3 ),
    inference(trivial_inequality_removal,[],[f416]) ).

fof(f416,plain,
    ( sK3 != sK3
    | ~ ssItem(sK6)
    | ~ spl9_2
    | ~ spl9_3 ),
    inference(superposition,[],[f188,f183]) ).

fof(f183,plain,
    ( app(sK2,cons(sK6,nil)) = sK3
    | ~ spl9_2 ),
    inference(avatar_component_clause,[],[f181]) ).

fof(f181,plain,
    ( spl9_2
  <=> app(sK2,cons(sK6,nil)) = sK3 ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).

fof(f188,plain,
    ( ! [X5] :
        ( sK3 != app(sK2,cons(X5,nil))
        | ~ ssItem(X5) )
    | ~ spl9_3 ),
    inference(avatar_component_clause,[],[f187]) ).

fof(f187,plain,
    ( spl9_3
  <=> ! [X5] :
        ( ~ ssItem(X5)
        | sK3 != app(sK2,cons(X5,nil)) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).

fof(f197,plain,
    ( ~ spl9_1
    | spl9_3 ),
    inference(avatar_split_clause,[],[f168,f187,f177]) ).

fof(f177,plain,
    ( spl9_1
  <=> neq(sK3,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).

fof(f168,plain,
    ! [X5] :
      ( sK3 != app(sK2,cons(X5,nil))
      | ~ ssItem(X5)
      | ~ neq(sK3,nil) ),
    inference(definition_unfolding,[],[f131,f138]) ).

fof(f138,plain,
    sK5 = sK3,
    inference(cnf_transformation,[],[f101]) ).

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

fof(f100,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( neq(X1,nil)
                      & ~ neq(X3,nil) )
                    | ( ! [X5] :
                          ( app(X0,cons(X5,nil)) != X1
                          | ~ ssItem(X5) )
                      & ? [X4] :
                          ( ssItem(X4)
                          & app(X2,cons(X4,nil)) = X3 )
                      & neq(X1,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)
                             => app(X2,cons(X4,nil)) != X3 )
                          | ~ neq(X1,nil)
                          | ? [X5] :
                              ( ssItem(X5)
                              & app(X0,cons(X5,nil)) = X1 ) )
                        & ( ~ 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)
                   => ( ( ( ! [X5] :
                              ( ssItem(X5)
                             => app(X2,cons(X5,nil)) != X3 )
                          | ~ neq(X1,nil)
                          | ? [X4] :
                              ( ssItem(X4)
                              & app(X0,cons(X4,nil)) = X1 ) )
                        & ( ~ 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)
                 => ( ( ( ! [X5] :
                            ( ssItem(X5)
                           => app(X2,cons(X5,nil)) != X3 )
                        | ~ neq(X1,nil)
                        | ? [X4] :
                            ( ssItem(X4)
                            & app(X0,cons(X4,nil)) = X1 ) )
                      & ( ~ neq(X1,nil)
                        | neq(X3,nil) ) )
                    | X1 != X3
                    | X0 != X2 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f131,plain,
    ! [X5] :
      ( ~ ssItem(X5)
      | sK3 != app(sK2,cons(X5,nil))
      | ~ neq(sK5,nil) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f196,plain,
    ( ~ spl9_1
    | spl9_4 ),
    inference(avatar_split_clause,[],[f165,f192,f177]) ).

fof(f165,plain,
    ( ssItem(sK6)
    | ~ neq(sK3,nil) ),
    inference(definition_unfolding,[],[f135,f138]) ).

fof(f135,plain,
    ( ssItem(sK6)
    | ~ neq(sK5,nil) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f185,plain,
    spl9_1,
    inference(avatar_split_clause,[],[f137,f177]) ).

fof(f137,plain,
    neq(sK3,nil),
    inference(cnf_transformation,[],[f101]) ).

fof(f184,plain,
    ( ~ spl9_1
    | spl9_2 ),
    inference(avatar_split_clause,[],[f166,f181,f177]) ).

fof(f166,plain,
    ( app(sK2,cons(sK6,nil)) = sK3
    | ~ neq(sK3,nil) ),
    inference(definition_unfolding,[],[f134,f140,f138,f138]) ).

fof(f140,plain,
    sK4 = sK2,
    inference(cnf_transformation,[],[f101]) ).

fof(f134,plain,
    ( app(sK4,cons(sK6,nil)) = sK5
    | ~ neq(sK5,nil) ),
    inference(cnf_transformation,[],[f101]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SWC097+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 18:10:49 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.57  % (3128)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.20/0.58  % (3126)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.20/0.58  % (3129)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.20/0.59  % (3128)First to succeed.
% 0.20/0.59  % (3120)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.20/0.60  % (3135)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.20/0.60  % (3121)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.20/0.60  % (3143)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.20/0.60  % (3125)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.20/0.60  % (3124)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.20/0.60  % (3126)Also succeeded, but the first one will report.
% 0.20/0.60  % (3138)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.20/0.60  % (3122)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.20/0.60  % (3138)Instruction limit reached!
% 0.20/0.60  % (3138)------------------------------
% 0.20/0.60  % (3138)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.60  % (3138)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.60  % (3138)Termination reason: Unknown
% 0.20/0.60  % (3138)Termination phase: Preprocessing 1
% 0.20/0.60  
% 0.20/0.60  % (3138)Memory used [KB]: 1407
% 0.20/0.60  % (3138)Time elapsed: 0.004 s
% 0.20/0.60  % (3138)Instructions burned: 2 (million)
% 0.20/0.60  % (3138)------------------------------
% 0.20/0.60  % (3138)------------------------------
% 0.20/0.60  % (3128)Refutation found. Thanks to Tanya!
% 0.20/0.60  % SZS status Theorem for theBenchmark
% 0.20/0.60  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.60  % (3128)------------------------------
% 0.20/0.60  % (3128)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.60  % (3128)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.60  % (3128)Termination reason: Refutation
% 0.20/0.60  
% 0.20/0.60  % (3128)Memory used [KB]: 6268
% 0.20/0.60  % (3128)Time elapsed: 0.145 s
% 0.20/0.60  % (3128)Instructions burned: 11 (million)
% 0.20/0.60  % (3128)------------------------------
% 0.20/0.60  % (3128)------------------------------
% 0.20/0.60  % (3119)Success in time 0.244 s
%------------------------------------------------------------------------------