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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC144+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 : n012.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:00 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :  110 (  27 equ)
%            Maximal formula atoms :   18 (   7 avg)
%            Number of connectives :  127 (  31   ~;   8   |;  76   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   32 (   8   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f593,plain,
    $false,
    inference(subsumption_resolution,[],[f557,f522]) ).

fof(f522,plain,
    neq(sK52,nil),
    inference(cnf_transformation,[],[f332]) ).

fof(f332,plain,
    ( ssList(sK51)
    & ssList(sK52)
    & ssList(sK53)
    & ~ singletonP(sK52)
    & neq(sK52,nil)
    & ~ neq(sK54,nil)
    & sK51 = sK53
    & sK54 = sK52
    & ssList(sK54) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK51,sK52,sK53,sK54])],[f119,f331,f330,f329,f328]) ).

fof(f328,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ~ singletonP(X1)
                    & neq(X1,nil)
                    & ~ neq(X3,nil)
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) ) ) ) )
   => ( ssList(sK51)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ~ singletonP(X1)
                  & neq(X1,nil)
                  & ~ neq(X3,nil)
                  & sK51 = X2
                  & X1 = X3
                  & ssList(X3) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f329,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( ~ singletonP(X1)
                & neq(X1,nil)
                & ~ neq(X3,nil)
                & sK51 = X2
                & X1 = X3
                & ssList(X3) ) ) )
   => ( ssList(sK52)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ~ singletonP(sK52)
              & neq(sK52,nil)
              & ~ neq(X3,nil)
              & sK51 = X2
              & sK52 = X3
              & ssList(X3) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f330,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( ~ singletonP(sK52)
            & neq(sK52,nil)
            & ~ neq(X3,nil)
            & sK51 = X2
            & sK52 = X3
            & ssList(X3) ) )
   => ( ssList(sK53)
      & ? [X3] :
          ( ~ singletonP(sK52)
          & neq(sK52,nil)
          & ~ neq(X3,nil)
          & sK51 = sK53
          & sK52 = X3
          & ssList(X3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f331,plain,
    ( ? [X3] :
        ( ~ singletonP(sK52)
        & neq(sK52,nil)
        & ~ neq(X3,nil)
        & sK51 = sK53
        & sK52 = X3
        & ssList(X3) )
   => ( ~ singletonP(sK52)
      & neq(sK52,nil)
      & ~ neq(sK54,nil)
      & sK51 = sK53
      & sK54 = sK52
      & ssList(sK54) ) ),
    introduced(choice_axiom,[]) ).

fof(f119,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ~ singletonP(X1)
                  & neq(X1,nil)
                  & ~ neq(X3,nil)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) ) ) ) ),
    inference(flattening,[],[f118]) ).

fof(f118,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( neq(X1,nil)
                  & X1 = X3
                  & ~ singletonP(X1)
                  & ~ neq(X3,nil)
                  & 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)
                   => ( ~ neq(X1,nil)
                      | X1 != X3
                      | singletonP(X1)
                      | neq(X3,nil)
                      | X0 != X2 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ~ neq(X1,nil)
                    | X1 != X3
                    | singletonP(X1)
                    | neq(X3,nil)
                    | X0 != X2 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f557,plain,
    ~ neq(sK52,nil),
    inference(definition_unfolding,[],[f521,f519]) ).

fof(f519,plain,
    sK54 = sK52,
    inference(cnf_transformation,[],[f332]) ).

fof(f521,plain,
    ~ neq(sK54,nil),
    inference(cnf_transformation,[],[f332]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWC144+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/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.14/0.34  % Computer : n012.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 30 18:25:50 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.51  % (27199)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.20/0.51  % (27191)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.20/0.51  % (27182)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.20/0.52  % (27184)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52  % (27199)First to succeed.
% 0.20/0.53  % (27178)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.20/0.53  % (27185)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.20/0.53  % (27199)Refutation found. Thanks to Tanya!
% 0.20/0.53  % SZS status Theorem for theBenchmark
% 0.20/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53  % (27199)------------------------------
% 0.20/0.53  % (27199)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (27199)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (27199)Termination reason: Refutation
% 0.20/0.53  
% 0.20/0.53  % (27199)Memory used [KB]: 1279
% 0.20/0.53  % (27199)Time elapsed: 0.073 s
% 0.20/0.53  % (27199)Instructions burned: 10 (million)
% 0.20/0.53  % (27199)------------------------------
% 0.20/0.53  % (27199)------------------------------
% 0.20/0.53  % (27170)Success in time 0.183 s
%------------------------------------------------------------------------------