TSTP Solution File: SWC146+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC146+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s

% Computer : n005.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 : Thu Aug 31 20:56:56 EDT 2023

% Result   : Theorem 0.22s 0.44s
% Output   : Refutation 0.22s
% 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(f638,plain,
    $false,
    inference(subsumption_resolution,[],[f601,f381]) ).

fof(f381,plain,
    ~ neq(sK21,nil),
    inference(cnf_transformation,[],[f254]) ).

fof(f254,plain,
    ( ~ singletonP(sK19)
    & ~ neq(sK21,nil)
    & neq(sK19,nil)
    & sK18 = sK20
    & sK19 = sK21
    & ssList(sK21)
    & ssList(sK20)
    & ssList(sK19)
    & ssList(sK18) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f99,f253,f252,f251,f250]) ).

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

fof(f251,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ~ singletonP(X1)
                & ~ neq(X3,nil)
                & neq(X1,nil)
                & sK18 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ~ singletonP(sK19)
              & ~ neq(X3,nil)
              & neq(sK19,nil)
              & sK18 = X2
              & sK19 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK19) ) ),
    introduced(choice_axiom,[]) ).

fof(f252,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ~ singletonP(sK19)
            & ~ neq(X3,nil)
            & neq(sK19,nil)
            & sK18 = X2
            & sK19 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ~ singletonP(sK19)
          & ~ neq(X3,nil)
          & neq(sK19,nil)
          & sK18 = sK20
          & sK19 = X3
          & ssList(X3) )
      & ssList(sK20) ) ),
    introduced(choice_axiom,[]) ).

fof(f253,plain,
    ( ? [X3] :
        ( ~ singletonP(sK19)
        & ~ neq(X3,nil)
        & neq(sK19,nil)
        & sK18 = sK20
        & sK19 = X3
        & ssList(X3) )
   => ( ~ singletonP(sK19)
      & ~ neq(sK21,nil)
      & neq(sK19,nil)
      & sK18 = sK20
      & sK19 = sK21
      & ssList(sK21) ) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( singletonP(X1)
                    | neq(X3,nil)
                    | ~ neq(X1,nil)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.bJWJKAYcRw/Vampire---4.8_20560',co1) ).

fof(f601,plain,
    neq(sK21,nil),
    inference(definition_unfolding,[],[f380,f378]) ).

fof(f378,plain,
    sK19 = sK21,
    inference(cnf_transformation,[],[f254]) ).

fof(f380,plain,
    neq(sK19,nil),
    inference(cnf_transformation,[],[f254]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SWC146+1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/0.15  % Command    : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.36  % Computer : n005.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Aug 28 16:18:23 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/tmp/tmp.bJWJKAYcRw/Vampire---4.8_20560
% 0.22/0.37  % (20668)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.43  % (20670)lrs-1004_3_av=off:ep=RSTC:fsd=off:fsr=off:urr=ec_only:stl=62_525 on Vampire---4 for (525ds/0Mi)
% 0.22/0.43  % (20672)ott+1011_4_er=known:fsd=off:nm=4:tgt=ground_499 on Vampire---4 for (499ds/0Mi)
% 0.22/0.43  % (20671)lrs+10_4:5_amm=off:bsr=on:bce=on:flr=on:fsd=off:fde=unused:gs=on:gsem=on:lcm=predicate:sos=all:tgt=ground:stl=62_514 on Vampire---4 for (514ds/0Mi)
% 0.22/0.43  % (20673)ott+11_8:1_aac=none:amm=sco:anc=none:er=known:flr=on:fde=unused:irw=on:nm=0:nwc=1.2:nicw=on:sims=off:sos=all:sac=on_470 on Vampire---4 for (470ds/0Mi)
% 0.22/0.43  % (20674)lrs+10_1024_av=off:bsr=on:br=off:ep=RSTC:fsd=off:irw=on:nm=4:nwc=1.1:sims=off:urr=on:stl=125_440 on Vampire---4 for (440ds/0Mi)
% 0.22/0.43  % (20669)lrs+1011_1_bd=preordered:flr=on:fsd=off:fsr=off:irw=on:lcm=reverse:msp=off:nm=2:nwc=10.0:sos=on:sp=reverse_weighted_frequency:tgt=full:stl=62_562 on Vampire---4 for (562ds/0Mi)
% 0.22/0.43  % (20675)ott+1010_2:5_bd=off:fsd=off:fde=none:nm=16:sos=on_419 on Vampire---4 for (419ds/0Mi)
% 0.22/0.44  % (20672)First to succeed.
% 0.22/0.44  % (20672)Refutation found. Thanks to Tanya!
% 0.22/0.44  % SZS status Theorem for Vampire---4
% 0.22/0.44  % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.44  % (20672)------------------------------
% 0.22/0.44  % (20672)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.22/0.44  % (20672)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.22/0.44  % (20672)Termination reason: Refutation
% 0.22/0.44  
% 0.22/0.44  % (20672)Memory used [KB]: 5884
% 0.22/0.44  % (20672)Time elapsed: 0.007 s
% 0.22/0.44  % (20672)------------------------------
% 0.22/0.44  % (20672)------------------------------
% 0.22/0.44  % (20668)Success in time 0.07 s
% 0.22/0.44  % Vampire---4.8 exiting
%------------------------------------------------------------------------------