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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC026+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 : n011.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:41:16 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   6 unt;   0 def)
%            Number of atoms       :  190 ( 149 equ)
%            Maximal formula atoms :   28 (   8 avg)
%            Number of connectives :  233 (  65   ~;  52   |; 104   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 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(f607,plain,
    $false,
    inference(subsumption_resolution,[],[f606,f604]) ).

fof(f604,plain,
    nil = sK42,
    inference(trivial_inequality_removal,[],[f602]) ).

fof(f602,plain,
    ( nil != nil
    | nil = sK42 ),
    inference(backward_demodulation,[],[f497,f601]) ).

fof(f601,plain,
    nil = sK41,
    inference(subsumption_resolution,[],[f560,f495]) ).

fof(f495,plain,
    ( nil != sK42
    | nil = sK41 ),
    inference(cnf_transformation,[],[f314]) ).

fof(f314,plain,
    ( ( ( nil = sK39
        & nil != sK40 )
      | ( nil != sK39
        & nil = sK40 ) )
    & ( nil = sK42
      | nil != sK41 )
    & sK39 = sK41
    & ( nil = sK41
      | nil != sK42 )
    & sK40 = sK42
    & ssList(sK42)
    & ssList(sK41)
    & ssList(sK40)
    & ssList(sK39) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK39,sK40,sK41,sK42])],[f100,f313,f312,f311,f310]) ).

fof(f310,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( ( nil = X0
                        & nil != X1 )
                      | ( nil != X0
                        & nil = X1 ) )
                    & ( nil = X3
                      | nil != X2 )
                    & X0 = X2
                    & ( nil = X2
                      | nil != X3 )
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( nil = sK39
                      & nil != X1 )
                    | ( nil != sK39
                      & nil = X1 ) )
                  & ( nil = X3
                    | nil != X2 )
                  & sK39 = X2
                  & ( nil = X2
                    | nil != X3 )
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK39) ) ),
    introduced(choice_axiom,[]) ).

fof(f311,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ( nil = sK39
                    & nil != X1 )
                  | ( nil != sK39
                    & nil = X1 ) )
                & ( nil = X3
                  | nil != X2 )
                & sK39 = X2
                & ( nil = X2
                  | nil != X3 )
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ( nil = sK39
                  & nil != sK40 )
                | ( nil != sK39
                  & nil = sK40 ) )
              & ( nil = X3
                | nil != X2 )
              & sK39 = X2
              & ( nil = X2
                | nil != X3 )
              & sK40 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK40) ) ),
    introduced(choice_axiom,[]) ).

fof(f312,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ( nil = sK39
                & nil != sK40 )
              | ( nil != sK39
                & nil = sK40 ) )
            & ( nil = X3
              | nil != X2 )
            & sK39 = X2
            & ( nil = X2
              | nil != X3 )
            & sK40 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ( nil = sK39
              & nil != sK40 )
            | ( nil != sK39
              & nil = sK40 ) )
          & ( nil = X3
            | nil != sK41 )
          & sK39 = sK41
          & ( nil = sK41
            | nil != X3 )
          & sK40 = X3
          & ssList(X3) )
      & ssList(sK41) ) ),
    introduced(choice_axiom,[]) ).

fof(f313,plain,
    ( ? [X3] :
        ( ( ( nil = sK39
            & nil != sK40 )
          | ( nil != sK39
            & nil = sK40 ) )
        & ( nil = X3
          | nil != sK41 )
        & sK39 = sK41
        & ( nil = sK41
          | nil != X3 )
        & sK40 = X3
        & ssList(X3) )
   => ( ( ( nil = sK39
          & nil != sK40 )
        | ( nil != sK39
          & nil = sK40 ) )
      & ( nil = sK42
        | nil != sK41 )
      & sK39 = sK41
      & ( nil = sK41
        | nil != sK42 )
      & sK40 = sK42
      & ssList(sK42) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f560,plain,
    ( nil = sK42
    | nil = sK41 ),
    inference(definition_unfolding,[],[f500,f496,f494]) ).

fof(f494,plain,
    sK40 = sK42,
    inference(cnf_transformation,[],[f314]) ).

fof(f496,plain,
    sK39 = sK41,
    inference(cnf_transformation,[],[f314]) ).

fof(f500,plain,
    ( nil = sK39
    | nil = sK40 ),
    inference(cnf_transformation,[],[f314]) ).

fof(f497,plain,
    ( nil = sK42
    | nil != sK41 ),
    inference(cnf_transformation,[],[f314]) ).

fof(f606,plain,
    nil != sK42,
    inference(subsumption_resolution,[],[f561,f601]) ).

fof(f561,plain,
    ( nil != sK41
    | nil != sK42 ),
    inference(definition_unfolding,[],[f499,f494,f496]) ).

fof(f499,plain,
    ( nil != sK40
    | nil != sK39 ),
    inference(cnf_transformation,[],[f314]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC026+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.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 17:56:25 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.20/0.50  % (7043)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50  % (7055)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.20/0.51  % (7035)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.20/0.51  % (7036)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51  % (7038)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.51  % (7058)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.51  % (7050)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.51  % (7037)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51  % (7062)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.51  % (7052)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.52  % (7055)First to succeed.
% 0.20/0.52  % (7047)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.20/0.52  % (7056)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.52  % (7041)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52  % (7041)Instruction limit reached!
% 0.20/0.52  % (7041)------------------------------
% 0.20/0.52  % (7041)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (7041)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (7041)Termination reason: Unknown
% 0.20/0.52  % (7041)Termination phase: Preprocessing 2
% 0.20/0.52  
% 0.20/0.52  % (7041)Memory used [KB]: 1023
% 0.20/0.52  % (7041)Time elapsed: 0.002 s
% 0.20/0.52  % (7041)Instructions burned: 2 (million)
% 0.20/0.52  % (7041)------------------------------
% 0.20/0.52  % (7041)------------------------------
% 0.20/0.52  % (7033)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.52  % (7039)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.20/0.52  % (7034)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.20/0.52  % (7055)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (7055)------------------------------
% 0.20/0.52  % (7055)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (7055)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (7055)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (7055)Memory used [KB]: 1407
% 0.20/0.52  % (7055)Time elapsed: 0.091 s
% 0.20/0.52  % (7055)Instructions burned: 12 (million)
% 0.20/0.52  % (7055)------------------------------
% 0.20/0.52  % (7055)------------------------------
% 0.20/0.52  % (7032)Success in time 0.176 s
%------------------------------------------------------------------------------