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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWC217+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n018.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 : Tue Apr 30 16:11:29 EDT 2024

% Result   : Theorem 0.19s 0.39s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   38 (  14 unt;   0 def)
%            Number of atoms       :  234 (  84 equ)
%            Maximal formula atoms :   28 (   6 avg)
%            Number of connectives :  275 (  79   ~;  57   |; 118   &)
%                                         (   2 <=>;  19  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   59 (  24   !;  35   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f981,plain,
    $false,
    inference(resolution,[],[f980,f395]) ).

fof(f395,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).

fof(f980,plain,
    ~ ssList(nil),
    inference(resolution,[],[f973,f642]) ).

fof(f642,plain,
    ssItem(sK22),
    inference(resolution,[],[f384,f639]) ).

fof(f639,plain,
    neq(sK21,nil),
    inference(forward_demodulation,[],[f381,f379]) ).

fof(f379,plain,
    sK19 = sK21,
    inference(cnf_transformation,[],[f255]) ).

fof(f255,plain,
    ( ( ~ neq(sK21,nil)
      | ( memberP(sK21,sK22)
        & sK20 = cons(sK22,nil)
        & ssItem(sK22) ) )
    & ( nil != sK21
      | nil = sK20 )
    & ~ 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,sK22])],[f99,f254,f253,f252,f251,f250]) ).

fof(f250,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( ~ neq(X3,nil)
                      | ? [X4] :
                          ( memberP(X3,X4)
                          & cons(X4,nil) = X2
                          & ssItem(X4) ) )
                    & ( nil != X3
                      | nil = X2 )
                    & ~ neq(X0,nil)
                    & neq(X1,nil)
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ~ neq(X3,nil)
                    | ? [X4] :
                        ( memberP(X3,X4)
                        & cons(X4,nil) = X2
                        & ssItem(X4) ) )
                  & ( nil != X3
                    | nil = X2 )
                  & ~ 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] :
                ( ( ~ neq(X3,nil)
                  | ? [X4] :
                      ( memberP(X3,X4)
                      & cons(X4,nil) = X2
                      & ssItem(X4) ) )
                & ( nil != X3
                  | nil = X2 )
                & ~ neq(sK18,nil)
                & neq(X1,nil)
                & sK18 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ~ neq(X3,nil)
                | ? [X4] :
                    ( memberP(X3,X4)
                    & cons(X4,nil) = X2
                    & ssItem(X4) ) )
              & ( nil != X3
                | nil = X2 )
              & ~ neq(sK18,nil)
              & neq(sK19,nil)
              & sK18 = X2
              & sK19 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK19) ) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f254,plain,
    ( ? [X4] :
        ( memberP(sK21,X4)
        & cons(X4,nil) = sK20
        & ssItem(X4) )
   => ( memberP(sK21,sK22)
      & sK20 = cons(sK22,nil)
      & ssItem(sK22) ) ),
    introduced(choice_axiom,[]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ~ neq(X3,nil)
                    | ? [X4] :
                        ( memberP(X3,X4)
                        & cons(X4,nil) = X2
                        & ssItem(X4) ) )
                  & ( nil != X3
                    | nil = X2 )
                  & ~ 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] :
                  ( ( ~ neq(X3,nil)
                    | ? [X4] :
                        ( memberP(X3,X4)
                        & cons(X4,nil) = X2
                        & ssItem(X4) ) )
                  & ( nil != X3
                    | nil = X2 )
                  & ~ 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)
                   => ( ( neq(X3,nil)
                        & ! [X4] :
                            ( ssItem(X4)
                           => ( ~ memberP(X3,X4)
                              | cons(X4,nil) != X2 ) ) )
                      | ( nil = X3
                        & nil != X2 )
                      | 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)
                 => ( ( neq(X3,nil)
                      & ! [X4] :
                          ( ssItem(X4)
                         => ( ~ memberP(X3,X4)
                            | cons(X4,nil) != X2 ) ) )
                    | ( nil = X3
                      & nil != X2 )
                    | neq(X0,nil)
                    | ~ neq(X1,nil)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f381,plain,
    neq(sK19,nil),
    inference(cnf_transformation,[],[f255]) ).

fof(f384,plain,
    ( ~ neq(sK21,nil)
    | ssItem(sK22) ),
    inference(cnf_transformation,[],[f255]) ).

fof(f973,plain,
    ( ~ ssItem(sK22)
    | ~ ssList(nil) ),
    inference(trivial_inequality_removal,[],[f963]) ).

fof(f963,plain,
    ( nil != nil
    | ~ ssItem(sK22)
    | ~ ssList(nil) ),
    inference(backward_demodulation,[],[f728,f949]) ).

fof(f949,plain,
    nil = sK20,
    inference(resolution,[],[f948,f395]) ).

fof(f948,plain,
    ( ~ ssList(nil)
    | nil = sK20 ),
    inference(resolution,[],[f943,f377]) ).

fof(f377,plain,
    ssList(sK20),
    inference(cnf_transformation,[],[f255]) ).

fof(f943,plain,
    ( ~ ssList(sK20)
    | ~ ssList(nil)
    | nil = sK20 ),
    inference(resolution,[],[f575,f638]) ).

fof(f638,plain,
    ~ neq(sK20,nil),
    inference(forward_demodulation,[],[f382,f380]) ).

fof(f380,plain,
    sK18 = sK20,
    inference(cnf_transformation,[],[f255]) ).

fof(f382,plain,
    ~ neq(sK18,nil),
    inference(cnf_transformation,[],[f255]) ).

fof(f575,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | X0 = X1
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f356]) ).

fof(f356,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f198]) ).

fof(f198,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).

fof(f728,plain,
    ( nil != sK20
    | ~ ssItem(sK22)
    | ~ ssList(nil) ),
    inference(superposition,[],[f558,f643]) ).

fof(f643,plain,
    sK20 = cons(sK22,nil),
    inference(resolution,[],[f385,f639]) ).

fof(f385,plain,
    ( ~ neq(sK21,nil)
    | sK20 = cons(sK22,nil) ),
    inference(cnf_transformation,[],[f255]) ).

fof(f558,plain,
    ! [X0,X1] :
      ( nil != cons(X1,X0)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f179]) ).

fof(f179,plain,
    ! [X0] :
      ( ! [X1] :
          ( nil != cons(X1,X0)
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f21,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => nil != cons(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC217+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Apr 30 04:21:58 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (14563)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (14566)WARNING: value z3 for option sas not known
% 0.13/0.37  % (14566)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 theBenchmark for (569ds/0Mi)
% 0.13/0.37  % (14567)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37  % (14570)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 theBenchmark for (497ds/0Mi)
% 0.13/0.37  % (14568)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 theBenchmark for (531ds/0Mi)
% 0.13/0.37  % (14565)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37  % (14569)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 theBenchmark for (522ds/0Mi)
% 0.13/0.37  % (14564)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.38  TRYING [1]
% 0.13/0.38  TRYING [2]
% 0.13/0.39  TRYING [1]
% 0.13/0.39  TRYING [2]
% 0.13/0.39  % (14569)First to succeed.
% 0.19/0.39  TRYING [3]
% 0.19/0.39  % (14566)Also succeeded, but the first one will report.
% 0.19/0.39  % (14569)Refutation found. Thanks to Tanya!
% 0.19/0.39  % SZS status Theorem for theBenchmark
% 0.19/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.39  % (14569)------------------------------
% 0.19/0.39  % (14569)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.19/0.39  % (14569)Termination reason: Refutation
% 0.19/0.39  
% 0.19/0.39  % (14569)Memory used [KB]: 1522
% 0.19/0.39  % (14569)Time elapsed: 0.022 s
% 0.19/0.39  % (14569)Instructions burned: 41 (million)
% 0.19/0.39  % (14569)------------------------------
% 0.19/0.39  % (14569)------------------------------
% 0.19/0.39  % (14563)Success in time 0.041 s
%------------------------------------------------------------------------------