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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---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_uns --cores 0 -t %d %s

% Computer : n013.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:39:05 EDT 2022

% Result   : Theorem 0.15s 0.47s
% Output   : Refutation 0.15s
% 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 :  126 (  30   ~;   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(f709,plain,
    $false,
    inference(subsumption_resolution,[],[f558,f508]) ).

fof(f508,plain,
    ~ neq(sK49,nil),
    inference(cnf_transformation,[],[f327]) ).

fof(f327,plain,
    ( ssList(sK46)
    & ssList(sK47)
    & neq(sK47,nil)
    & ~ neq(sK49,nil)
    & ~ singletonP(sK47)
    & ssList(sK49)
    & sK47 = sK49
    & sK46 = sK48
    & ssList(sK48) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK46,sK47,sK48,sK49])],[f174,f326,f325,f324,f323]) ).

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

fof(f324,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( neq(X1,nil)
                & ~ neq(X3,nil)
                & ~ singletonP(X1)
                & ssList(X3)
                & X1 = X3
                & sK46 = X2 )
            & ssList(X2) ) )
   => ( ssList(sK47)
      & ? [X2] :
          ( ? [X3] :
              ( neq(sK47,nil)
              & ~ neq(X3,nil)
              & ~ singletonP(sK47)
              & ssList(X3)
              & sK47 = X3
              & sK46 = X2 )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f325,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( neq(sK47,nil)
            & ~ neq(X3,nil)
            & ~ singletonP(sK47)
            & ssList(X3)
            & sK47 = X3
            & sK46 = X2 )
        & ssList(X2) )
   => ( ? [X3] :
          ( neq(sK47,nil)
          & ~ neq(X3,nil)
          & ~ singletonP(sK47)
          & ssList(X3)
          & sK47 = X3
          & sK46 = sK48 )
      & ssList(sK48) ) ),
    introduced(choice_axiom,[]) ).

fof(f326,plain,
    ( ? [X3] :
        ( neq(sK47,nil)
        & ~ neq(X3,nil)
        & ~ singletonP(sK47)
        & ssList(X3)
        & sK47 = X3
        & sK46 = sK48 )
   => ( neq(sK47,nil)
      & ~ neq(sK49,nil)
      & ~ singletonP(sK47)
      & ssList(sK49)
      & sK47 = sK49
      & sK46 = sK48 ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f558,plain,
    neq(sK49,nil),
    inference(definition_unfolding,[],[f509,f505]) ).

fof(f505,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f327]) ).

fof(f509,plain,
    neq(sK47,nil),
    inference(cnf_transformation,[],[f327]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SWC144+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.09/0.31  % Computer : n013.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit   : 300
% 0.09/0.31  % WCLimit    : 300
% 0.09/0.31  % DateTime   : Tue Aug 30 18:23:02 EDT 2022
% 0.09/0.31  % CPUTime    : 
% 0.15/0.44  % (23228)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.15/0.44  % (23208)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.15/0.45  % (23220)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.15/0.45  % (23216)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.15/0.45  % (23226)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.15/0.45  % (23233)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.15/0.45  % (23218)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.45  % (23212)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.15/0.46  % (23218)Instruction limit reached!
% 0.15/0.46  % (23218)------------------------------
% 0.15/0.46  % (23218)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.46  % (23218)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.46  % (23218)Termination reason: Unknown
% 0.15/0.46  % (23218)Termination phase: shuffling
% 0.15/0.46  
% 0.15/0.46  % (23218)Memory used [KB]: 1535
% 0.15/0.46  % (23218)Time elapsed: 0.006 s
% 0.15/0.46  % (23218)Instructions burned: 3 (million)
% 0.15/0.46  % (23218)------------------------------
% 0.15/0.46  % (23218)------------------------------
% 0.15/0.46  % (23228)First to succeed.
% 0.15/0.46  % (23217)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.15/0.46  % (23225)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.15/0.46  % (23209)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.15/0.46  % (23211)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.15/0.47  % (23228)Refutation found. Thanks to Tanya!
% 0.15/0.47  % SZS status Theorem for theBenchmark
% 0.15/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47  % (23228)------------------------------
% 0.15/0.47  % (23228)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47  % (23228)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47  % (23228)Termination reason: Refutation
% 0.15/0.47  
% 0.15/0.47  % (23228)Memory used [KB]: 6396
% 0.15/0.47  % (23228)Time elapsed: 0.094 s
% 0.15/0.47  % (23228)Instructions burned: 12 (million)
% 0.15/0.47  % (23228)------------------------------
% 0.15/0.47  % (23228)------------------------------
% 0.15/0.47  % (23203)Success in time 0.152 s
%------------------------------------------------------------------------------