TSTP Solution File: SWC208+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWC208+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 : n001.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 : Sat Sep  2 12:45:35 EDT 2023

% Result   : Theorem 0.21s 0.43s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (  11 unt;   0 def)
%            Number of atoms       :  159 (  58 equ)
%            Maximal formula atoms :   24 (   7 avg)
%            Number of connectives :  166 (  29   ~;  25   |; 100   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   6 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(f616,plain,
    $false,
    inference(resolution,[],[f615,f611]) ).

fof(f611,plain,
    neq(nil,nil),
    inference(backward_demodulation,[],[f604,f607]) ).

fof(f607,plain,
    nil = sK21,
    inference(resolution,[],[f382,f603]) ).

fof(f603,plain,
    ~ neq(sK20,nil),
    inference(backward_demodulation,[],[f381,f379]) ).

fof(f379,plain,
    sK18 = sK20,
    inference(cnf_transformation,[],[f254]) ).

fof(f254,plain,
    ( ( ( frontsegP(sK21,sK20)
        & neq(sK20,nil) )
      | ( nil = sK20
        & nil = sK21 ) )
    & ~ neq(sK18,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] :
                    ( ( ( frontsegP(X3,X2)
                        & neq(X2,nil) )
                      | ( nil = X2
                        & nil = X3 ) )
                    & ~ neq(X0,nil)
                    & neq(X1,nil)
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( frontsegP(X3,X2)
                      & neq(X2,nil) )
                    | ( nil = X2
                      & nil = X3 ) )
                  & ~ neq(sK18,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] :
                ( ( ( frontsegP(X3,X2)
                    & neq(X2,nil) )
                  | ( nil = X2
                    & nil = X3 ) )
                & ~ neq(sK18,nil)
                & neq(X1,nil)
                & sK18 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ( frontsegP(X3,X2)
                  & neq(X2,nil) )
                | ( nil = X2
                  & nil = X3 ) )
              & ~ neq(sK18,nil)
              & neq(sK19,nil)
              & sK18 = X2
              & sK19 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK19) ) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( frontsegP(X3,X2)
                      & neq(X2,nil) )
                    | ( nil = X2
                      & nil = X3 ) )
                  & ~ neq(X0,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] :
                  ( ( ( frontsegP(X3,X2)
                      & neq(X2,nil) )
                    | ( nil = X2
                      & nil = X3 ) )
                  & ~ neq(X0,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)
                   => ( ( ( ~ frontsegP(X3,X2)
                          | ~ neq(X2,nil) )
                        & ( nil != X2
                          | nil != X3 ) )
                      | neq(X0,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)
                 => ( ( ( ~ frontsegP(X3,X2)
                        | ~ neq(X2,nil) )
                      & ( nil != X2
                        | nil != X3 ) )
                    | neq(X0,nil)
                    | ~ neq(X1,nil)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.P2lxK1oC7O/Vampire---4.8_22424',co1) ).

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

fof(f382,plain,
    ( neq(sK20,nil)
    | nil = sK21 ),
    inference(cnf_transformation,[],[f254]) ).

fof(f604,plain,
    neq(sK21,nil),
    inference(backward_demodulation,[],[f380,f378]) ).

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

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

fof(f615,plain,
    ~ neq(nil,nil),
    inference(backward_demodulation,[],[f603,f612]) ).

fof(f612,plain,
    nil = sK20,
    inference(resolution,[],[f383,f603]) ).

fof(f383,plain,
    ( neq(sK20,nil)
    | nil = sK20 ),
    inference(cnf_transformation,[],[f254]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SWC208+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14  % Command    : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.35  % Computer : n001.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Wed Aug 30 17:49:54 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.41  % (22587)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42  % (22589)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on Vampire---4 for (793ds/0Mi)
% 0.21/0.42  % (22588)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on Vampire---4 for (846ds/0Mi)
% 0.21/0.42  % (22591)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on Vampire---4 for (533ds/0Mi)
% 0.21/0.42  % (22590)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on Vampire---4 for (569ds/0Mi)
% 0.21/0.42  % (22592)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on Vampire---4 for (531ds/0Mi)
% 0.21/0.42  % (22593)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on Vampire---4 for (522ds/0Mi)
% 0.21/0.42  % (22594)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on Vampire---4 for (497ds/0Mi)
% 0.21/0.43  TRYING [1]
% 0.21/0.43  TRYING [2]
% 0.21/0.43  % (22593)First to succeed.
% 0.21/0.43  TRYING [1]
% 0.21/0.43  TRYING [1]
% 0.21/0.43  % (22594)Also succeeded, but the first one will report.
% 0.21/0.43  TRYING [2]
% 0.21/0.43  TRYING [2]
% 0.21/0.43  % (22593)Refutation found. Thanks to Tanya!
% 0.21/0.43  % SZS status Theorem for Vampire---4
% 0.21/0.43  % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.43  % (22593)------------------------------
% 0.21/0.43  % (22593)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.21/0.43  % (22593)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.21/0.43  % (22593)Termination reason: Refutation
% 0.21/0.43  
% 0.21/0.43  % (22593)Memory used [KB]: 1535
% 0.21/0.43  % (22593)Time elapsed: 0.011 s
% 0.21/0.43  % (22593)------------------------------
% 0.21/0.43  % (22593)------------------------------
% 0.21/0.43  % (22587)Success in time 0.072 s
% 0.21/0.43  % Vampire---4.8 exiting
%------------------------------------------------------------------------------