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

View Problem - Process Solution

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

% Computer : n029.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 May 21 05:13:40 EDT 2024

% Result   : Theorem 0.14s 0.38s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   30 (  13 unt;   0 def)
%            Number of atoms       :  181 (  43 equ)
%            Maximal formula atoms :   24 (   6 avg)
%            Number of connectives :  194 (  43   ~;  38   |;  95   &)
%                                         (   3 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   4 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   45 (  10   !;  35   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f660,plain,
    $false,
    inference(avatar_sat_refutation,[],[f648,f653,f658,f659]) ).

fof(f659,plain,
    ~ spl70_3,
    inference(avatar_split_clause,[],[f643,f655]) ).

fof(f655,plain,
    ( spl70_3
  <=> memberP(sK21,sK22) ),
    introduced(avatar_definition,[new_symbols(naming,[spl70_3])]) ).

fof(f643,plain,
    ~ memberP(sK21,sK22),
    inference(duplicate_literal_removal,[],[f603]) ).

fof(f603,plain,
    ( ~ memberP(sK21,sK22)
    | ~ memberP(sK21,sK22) ),
    inference(definition_unfolding,[],[f384,f602,f379]) ).

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

fof(f255,plain,
    ( ( ~ memberP(sK18,sK22)
      | ~ memberP(sK19,sK22) )
    & ( memberP(sK18,sK22)
      | memberP(sK19,sK22) )
    & ssItem(sK22)
    & sK20 = sK21
    & 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] :
                    ( ? [X4] :
                        ( ( ~ memberP(X0,X4)
                          | ~ memberP(X1,X4) )
                        & ( memberP(X0,X4)
                          | memberP(X1,X4) )
                        & ssItem(X4) )
                    & X2 = X3
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ? [X4] :
                      ( ( ~ memberP(sK18,X4)
                        | ~ memberP(X1,X4) )
                      & ( memberP(sK18,X4)
                        | memberP(X1,X4) )
                      & ssItem(X4) )
                  & X2 = X3
                  & sK18 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK18) ) ),
    introduced(choice_axiom,[]) ).

fof(f251,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ? [X4] :
                    ( ( ~ memberP(sK18,X4)
                      | ~ memberP(X1,X4) )
                    & ( memberP(sK18,X4)
                      | memberP(X1,X4) )
                    & ssItem(X4) )
                & X2 = X3
                & sK18 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ? [X4] :
                  ( ( ~ memberP(sK18,X4)
                    | ~ memberP(sK19,X4) )
                  & ( memberP(sK18,X4)
                    | memberP(sK19,X4) )
                  & ssItem(X4) )
              & X2 = X3
              & sK18 = X2
              & sK19 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK19) ) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f254,plain,
    ( ? [X4] :
        ( ( ~ memberP(sK18,X4)
          | ~ memberP(sK19,X4) )
        & ( memberP(sK18,X4)
          | memberP(sK19,X4) )
        & ssItem(X4) )
   => ( ( ~ memberP(sK18,sK22)
        | ~ memberP(sK19,sK22) )
      & ( memberP(sK18,sK22)
        | memberP(sK19,sK22) )
      & ssItem(sK22) ) ),
    introduced(choice_axiom,[]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ? [X4] :
                      ( ( ~ memberP(X0,X4)
                        | ~ memberP(X1,X4) )
                      & ( memberP(X0,X4)
                        | memberP(X1,X4) )
                      & ssItem(X4) )
                  & X2 = X3
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

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

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

fof(f602,plain,
    sK18 = sK21,
    inference(definition_unfolding,[],[f380,f381]) ).

fof(f381,plain,
    sK20 = sK21,
    inference(cnf_transformation,[],[f255]) ).

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

fof(f384,plain,
    ( ~ memberP(sK18,sK22)
    | ~ memberP(sK19,sK22) ),
    inference(cnf_transformation,[],[f255]) ).

fof(f658,plain,
    spl70_3,
    inference(avatar_split_clause,[],[f642,f655]) ).

fof(f642,plain,
    memberP(sK21,sK22),
    inference(duplicate_literal_removal,[],[f604]) ).

fof(f604,plain,
    ( memberP(sK21,sK22)
    | memberP(sK21,sK22) ),
    inference(definition_unfolding,[],[f383,f602,f379]) ).

fof(f383,plain,
    ( memberP(sK18,sK22)
    | memberP(sK19,sK22) ),
    inference(cnf_transformation,[],[f255]) ).

fof(f653,plain,
    spl70_2,
    inference(avatar_split_clause,[],[f382,f650]) ).

fof(f650,plain,
    ( spl70_2
  <=> ssItem(sK22) ),
    introduced(avatar_definition,[new_symbols(naming,[spl70_2])]) ).

fof(f382,plain,
    ssItem(sK22),
    inference(cnf_transformation,[],[f255]) ).

fof(f648,plain,
    spl70_1,
    inference(avatar_split_clause,[],[f378,f645]) ).

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

fof(f378,plain,
    ssList(sK21),
    inference(cnf_transformation,[],[f255]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC375+1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.34  % Computer : n029.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sun May 19 02:49:23 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.14/0.35  % (25095)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (25098)WARNING: value z3 for option sas not known
% 0.14/0.37  % (25096)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37  % (25100)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.14/0.37  % (25102)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.14/0.37  % (25099)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37  % (25098)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.14/0.37  % (25101)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.14/0.37  % (25097)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38  % (25100)First to succeed.
% 0.14/0.38  % (25100)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25095"
% 0.14/0.38  % (25100)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38  % (25100)------------------------------
% 0.14/0.38  % (25100)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38  % (25100)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (25100)Memory used [KB]: 1234
% 0.14/0.38  % (25100)Time elapsed: 0.011 s
% 0.14/0.38  % (25100)Instructions burned: 17 (million)
% 0.14/0.38  % (25095)Success in time 0.016 s
%------------------------------------------------------------------------------