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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC138+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 : n023.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:58 EDT 2022

% Result   : Theorem 0.11s 0.38s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :   97 (  27 equ)
%            Maximal formula atoms :   16 (   6 avg)
%            Number of connectives :  103 (  20   ~;   6   |;  65   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 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(f592,plain,
    $false,
    inference(subsumption_resolution,[],[f368,f556]) ).

fof(f556,plain,
    ~ neq(sK9,nil),
    inference(definition_unfolding,[],[f365,f369]) ).

fof(f369,plain,
    sK11 = sK9,
    inference(cnf_transformation,[],[f244]) ).

fof(f244,plain,
    ( sK11 = sK9
    & neq(sK9,nil)
    & ssList(sK11)
    & sK10 = sK8
    & ~ neq(sK11,nil)
    & ssList(sK10)
    & ssList(sK9)
    & ssList(sK8) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11])],[f141,f243,f242,f241,f240]) ).

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

fof(f241,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( X1 = X3
                & neq(X1,nil)
                & ssList(X3)
                & sK8 = X2
                & ~ neq(X3,nil) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( sK9 = X3
              & neq(sK9,nil)
              & ssList(X3)
              & sK8 = X2
              & ~ neq(X3,nil) )
          & ssList(X2) )
      & ssList(sK9) ) ),
    introduced(choice_axiom,[]) ).

fof(f242,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( sK9 = X3
            & neq(sK9,nil)
            & ssList(X3)
            & sK8 = X2
            & ~ neq(X3,nil) )
        & ssList(X2) )
   => ( ? [X3] :
          ( sK9 = X3
          & neq(sK9,nil)
          & ssList(X3)
          & sK10 = sK8
          & ~ neq(X3,nil) )
      & ssList(sK10) ) ),
    introduced(choice_axiom,[]) ).

fof(f243,plain,
    ( ? [X3] :
        ( sK9 = X3
        & neq(sK9,nil)
        & ssList(X3)
        & sK10 = sK8
        & ~ neq(X3,nil) )
   => ( sK11 = sK9
      & neq(sK9,nil)
      & ssList(sK11)
      & sK10 = sK8
      & ~ neq(sK11,nil) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f365,plain,
    ~ neq(sK11,nil),
    inference(cnf_transformation,[],[f244]) ).

fof(f368,plain,
    neq(sK9,nil),
    inference(cnf_transformation,[],[f244]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem    : SWC138+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.07  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.07/0.26  % Computer : n023.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit   : 300
% 0.07/0.26  % WCLimit    : 300
% 0.07/0.26  % DateTime   : Tue Aug 30 18:45:19 EDT 2022
% 0.07/0.26  % CPUTime    : 
% 0.11/0.36  % (21374)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.11/0.36  % (21377)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.11/0.36  % (21381)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.11/0.36  % (21395)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.11/0.36  % (21382)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.11/0.37  % (21371)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.11/0.37  % (21383)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.11/0.37  % (21380)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.11/0.37  % (21387)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.11/0.37  % (21380)Instruction limit reached!
% 0.11/0.37  % (21380)------------------------------
% 0.11/0.37  % (21380)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.37  % (21380)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.37  % (21380)Termination reason: Unknown
% 0.11/0.37  % (21380)Termination phase: Preprocessing 3
% 0.11/0.37  
% 0.11/0.37  % (21380)Memory used [KB]: 1023
% 0.11/0.37  % (21380)Time elapsed: 0.002 s
% 0.11/0.37  % (21380)Instructions burned: 3 (million)
% 0.11/0.37  % (21380)------------------------------
% 0.11/0.37  % (21380)------------------------------
% 0.11/0.37  % (21379)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.11/0.37  % (21374)First to succeed.
% 0.11/0.38  % (21376)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.11/0.38  % (21383)Also succeeded, but the first one will report.
% 0.11/0.38  % (21374)Refutation found. Thanks to Tanya!
% 0.11/0.38  % SZS status Theorem for theBenchmark
% 0.11/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.38  % (21374)------------------------------
% 0.11/0.38  % (21374)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.38  % (21374)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.38  % (21374)Termination reason: Refutation
% 0.11/0.38  
% 0.11/0.38  % (21374)Memory used [KB]: 1407
% 0.11/0.38  % (21374)Time elapsed: 0.009 s
% 0.11/0.38  % (21374)Instructions burned: 13 (million)
% 0.11/0.38  % (21374)------------------------------
% 0.11/0.38  % (21374)------------------------------
% 0.11/0.38  % (21368)Success in time 0.11 s
%------------------------------------------------------------------------------