TSTP Solution File: SWC391+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC391+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n008.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 : Wed Aug 31 18:43:33 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (   9 unt;   0 def)
%            Number of atoms       :  133 (  43 equ)
%            Maximal formula atoms :   20 (   7 avg)
%            Number of connectives :  137 (  23   ~;   8   |;  91   &)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   7 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   :   45 (  10   !;  35   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f598,plain,
    $false,
    inference(subsumption_resolution,[],[f596,f356]) ).

fof(f356,plain,
    ~ memberP(sK7,sK10),
    inference(cnf_transformation,[],[f237]) ).

fof(f237,plain,
    ( ssList(sK7)
    & memberP(sK6,sK10)
    & ~ memberP(sK7,sK10)
    & ssItem(sK10)
    & sK9 = sK7
    & ssList(sK9)
    & sK9 = sK8
    & sK6 = sK8
    & ssList(sK8)
    & ssList(sK6) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10])],[f103,f236,f235,f234,f233,f232]) ).

fof(f232,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ? [X4] :
                        ( memberP(X0,X4)
                        & ~ memberP(X1,X4)
                        & ssItem(X4) )
                    & X1 = X3
                    & ssList(X3)
                    & X2 = X3
                    & X0 = X2 )
                & ssList(X2) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ? [X4] :
                      ( memberP(sK6,X4)
                      & ~ memberP(X1,X4)
                      & ssItem(X4) )
                  & X1 = X3
                  & ssList(X3)
                  & X2 = X3
                  & sK6 = X2 )
              & ssList(X2) ) )
      & ssList(sK6) ) ),
    introduced(choice_axiom,[]) ).

fof(f233,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ? [X4] :
                    ( memberP(sK6,X4)
                    & ~ memberP(X1,X4)
                    & ssItem(X4) )
                & X1 = X3
                & ssList(X3)
                & X2 = X3
                & sK6 = X2 )
            & ssList(X2) ) )
   => ( ssList(sK7)
      & ? [X2] :
          ( ? [X3] :
              ( ? [X4] :
                  ( memberP(sK6,X4)
                  & ~ memberP(sK7,X4)
                  & ssItem(X4) )
              & sK7 = X3
              & ssList(X3)
              & X2 = X3
              & sK6 = X2 )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f234,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ? [X4] :
                ( memberP(sK6,X4)
                & ~ memberP(sK7,X4)
                & ssItem(X4) )
            & sK7 = X3
            & ssList(X3)
            & X2 = X3
            & sK6 = X2 )
        & ssList(X2) )
   => ( ? [X3] :
          ( ? [X4] :
              ( memberP(sK6,X4)
              & ~ memberP(sK7,X4)
              & ssItem(X4) )
          & sK7 = X3
          & ssList(X3)
          & sK8 = X3
          & sK6 = sK8 )
      & ssList(sK8) ) ),
    introduced(choice_axiom,[]) ).

fof(f235,plain,
    ( ? [X3] :
        ( ? [X4] :
            ( memberP(sK6,X4)
            & ~ memberP(sK7,X4)
            & ssItem(X4) )
        & sK7 = X3
        & ssList(X3)
        & sK8 = X3
        & sK6 = sK8 )
   => ( ? [X4] :
          ( memberP(sK6,X4)
          & ~ memberP(sK7,X4)
          & ssItem(X4) )
      & sK9 = sK7
      & ssList(sK9)
      & sK9 = sK8
      & sK6 = sK8 ) ),
    introduced(choice_axiom,[]) ).

fof(f236,plain,
    ( ? [X4] :
        ( memberP(sK6,X4)
        & ~ memberP(sK7,X4)
        & ssItem(X4) )
   => ( memberP(sK6,sK10)
      & ~ memberP(sK7,sK10)
      & ssItem(sK10) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f596,plain,
    memberP(sK7,sK10),
    inference(backward_demodulation,[],[f558,f560]) ).

fof(f560,plain,
    sK8 = sK7,
    inference(definition_unfolding,[],[f352,f354]) ).

fof(f354,plain,
    sK9 = sK7,
    inference(cnf_transformation,[],[f237]) ).

fof(f352,plain,
    sK9 = sK8,
    inference(cnf_transformation,[],[f237]) ).

fof(f558,plain,
    memberP(sK8,sK10),
    inference(definition_unfolding,[],[f357,f351]) ).

fof(f351,plain,
    sK6 = sK8,
    inference(cnf_transformation,[],[f237]) ).

fof(f357,plain,
    memberP(sK6,sK10),
    inference(cnf_transformation,[],[f237]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC391+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.33  % Computer : n008.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 18:56:40 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  % (14194)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.49  % (14206)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.49  % (14210)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.49  % (14198)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.50  % (14190)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50  % (14202)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.50  % (14186)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.50  % (14185)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51  % (14206)First to succeed.
% 0.19/0.51  % (14206)Refutation found. Thanks to Tanya!
% 0.19/0.51  % SZS status Theorem for theBenchmark
% 0.19/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51  % (14206)------------------------------
% 0.19/0.51  % (14206)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (14206)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (14206)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (14206)Memory used [KB]: 1407
% 0.19/0.51  % (14206)Time elapsed: 0.068 s
% 0.19/0.51  % (14206)Instructions burned: 12 (million)
% 0.19/0.51  % (14206)------------------------------
% 0.19/0.51  % (14206)------------------------------
% 0.19/0.51  % (14183)Success in time 0.168 s
%------------------------------------------------------------------------------