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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWC026+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 : n019.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 15:47:22 EDT 2024

% Result   : Theorem 0.22s 0.40s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   43 (   7 unt;   0 def)
%            Number of atoms       :  235 ( 161 equ)
%            Maximal formula atoms :   28 (   5 avg)
%            Number of connectives :  277 (  85   ~;  71   |; 104   &)
%                                         (   5 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   6 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   32 (   8   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f678,plain,
    $false,
    inference(avatar_sat_refutation,[],[f651,f656,f665,f671,f672,f673,f676,f677]) ).

fof(f677,plain,
    ( spl69_4
    | ~ spl69_3
    | ~ spl69_5 ),
    inference(avatar_split_clause,[],[f674,f668,f658,f662]) ).

fof(f662,plain,
    ( spl69_4
  <=> nil = sK20 ),
    introduced(avatar_definition,[new_symbols(naming,[spl69_4])]) ).

fof(f658,plain,
    ( spl69_3
  <=> nil = sK21 ),
    introduced(avatar_definition,[new_symbols(naming,[spl69_3])]) ).

fof(f668,plain,
    ( spl69_5
  <=> sK20 = sK21 ),
    introduced(avatar_definition,[new_symbols(naming,[spl69_5])]) ).

fof(f674,plain,
    ( nil = sK20
    | ~ spl69_3
    | ~ spl69_5 ),
    inference(forward_demodulation,[],[f660,f669]) ).

fof(f669,plain,
    ( sK20 = sK21
    | ~ spl69_5 ),
    inference(avatar_component_clause,[],[f668]) ).

fof(f660,plain,
    ( nil = sK21
    | ~ spl69_3 ),
    inference(avatar_component_clause,[],[f658]) ).

fof(f676,plain,
    ( ~ spl69_5
    | ~ spl69_4 ),
    inference(avatar_split_clause,[],[f644,f662,f668]) ).

fof(f644,plain,
    ( nil != sK20
    | sK20 != sK21 ),
    inference(inner_rewriting,[],[f643]) ).

fof(f643,plain,
    ( nil != sK21
    | sK20 != sK21 ),
    inference(inner_rewriting,[],[f603]) ).

fof(f603,plain,
    ( nil != sK21
    | nil != sK20 ),
    inference(definition_unfolding,[],[f385,f378,f379]) ).

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

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

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

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

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

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

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

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

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

fof(f385,plain,
    ( nil != sK19
    | nil != sK18 ),
    inference(cnf_transformation,[],[f254]) ).

fof(f673,plain,
    ( spl69_5
    | ~ spl69_4 ),
    inference(avatar_split_clause,[],[f646,f662,f668]) ).

fof(f646,plain,
    ( nil != sK20
    | sK20 = sK21 ),
    inference(inner_rewriting,[],[f380]) ).

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

fof(f672,plain,
    ( spl69_5
    | ~ spl69_3 ),
    inference(avatar_split_clause,[],[f645,f658,f668]) ).

fof(f645,plain,
    ( nil != sK21
    | sK20 = sK21 ),
    inference(inner_rewriting,[],[f381]) ).

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

fof(f671,plain,
    ( ~ spl69_5
    | spl69_3
    | ~ spl69_4 ),
    inference(avatar_split_clause,[],[f666,f662,f658,f668]) ).

fof(f666,plain,
    ( sK20 != sK21
    | spl69_3
    | ~ spl69_4 ),
    inference(forward_demodulation,[],[f659,f664]) ).

fof(f664,plain,
    ( nil = sK20
    | ~ spl69_4 ),
    inference(avatar_component_clause,[],[f662]) ).

fof(f659,plain,
    ( nil != sK21
    | spl69_3 ),
    inference(avatar_component_clause,[],[f658]) ).

fof(f665,plain,
    ( spl69_3
    | spl69_4 ),
    inference(avatar_split_clause,[],[f606,f662,f658]) ).

fof(f606,plain,
    ( nil = sK20
    | nil = sK21 ),
    inference(definition_unfolding,[],[f382,f379,f378]) ).

fof(f382,plain,
    ( nil = sK18
    | nil = sK19 ),
    inference(cnf_transformation,[],[f254]) ).

fof(f656,plain,
    spl69_2,
    inference(avatar_split_clause,[],[f377,f653]) ).

fof(f653,plain,
    ( spl69_2
  <=> ssList(sK21) ),
    introduced(avatar_definition,[new_symbols(naming,[spl69_2])]) ).

fof(f377,plain,
    ssList(sK21),
    inference(cnf_transformation,[],[f254]) ).

fof(f651,plain,
    spl69_1,
    inference(avatar_split_clause,[],[f376,f648]) ).

fof(f648,plain,
    ( spl69_1
  <=> ssList(sK20) ),
    introduced(avatar_definition,[new_symbols(naming,[spl69_1])]) ).

fof(f376,plain,
    ssList(sK20),
    inference(cnf_transformation,[],[f254]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWC026+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36  % Computer : n019.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Tue Apr 30 04:08:44 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.37  % (7627)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.39  % (7630)WARNING: value z3 for option sas not known
% 0.22/0.39  % (7631)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.39  % (7628)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.39  % (7629)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.39  % (7632)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.22/0.39  % (7630)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.22/0.39  % (7634)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.22/0.39  % (7633)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.22/0.40  % (7632)First to succeed.
% 0.22/0.40  % (7633)Also succeeded, but the first one will report.
% 0.22/0.40  % (7632)Refutation found. Thanks to Tanya!
% 0.22/0.40  % SZS status Theorem for theBenchmark
% 0.22/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.40  % (7632)------------------------------
% 0.22/0.40  % (7632)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.40  % (7632)Termination reason: Refutation
% 0.22/0.40  
% 0.22/0.40  % (7632)Memory used [KB]: 1241
% 0.22/0.40  % (7632)Time elapsed: 0.012 s
% 0.22/0.40  % (7632)Instructions burned: 18 (million)
% 0.22/0.40  % (7632)------------------------------
% 0.22/0.40  % (7632)------------------------------
% 0.22/0.40  % (7627)Success in time 0.031 s
%------------------------------------------------------------------------------