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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC116+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 : 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 : Wed Aug 31 18:41:50 EDT 2022

% Result   : Theorem 1.34s 0.52s
% Output   : Refutation 1.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   50 (   8 unt;   0 def)
%            Number of atoms       :  276 (  98 equ)
%            Maximal formula atoms :   30 (   5 avg)
%            Number of connectives :  345 ( 119   ~;  97   |; 107   &)
%                                         (   8 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   40 (  16   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1029,plain,
    $false,
    inference(avatar_sat_refutation,[],[f608,f622,f631,f636,f637,f642,f1028]) ).

fof(f1028,plain,
    ( ~ spl57_1
    | spl57_4
    | spl57_6 ),
    inference(avatar_contradiction_clause,[],[f1027]) ).

fof(f1027,plain,
    ( $false
    | ~ spl57_1
    | spl57_4
    | spl57_6 ),
    inference(subsumption_resolution,[],[f1026,f558]) ).

fof(f558,plain,
    ssList(sK32),
    inference(definition_unfolding,[],[f478,f471]) ).

fof(f471,plain,
    sK30 = sK32,
    inference(cnf_transformation,[],[f298]) ).

fof(f298,plain,
    ( ssList(sK30)
    & ( ~ segmentP(sK30,sK29)
      | ~ neq(sK29,nil) )
    & ( nil = sK31
      | nil != sK32 )
    & ( nil != sK29
      | nil != sK30 )
    & sK31 = sK29
    & ( ( segmentP(sK32,sK31)
        & neq(sK31,nil) )
      | ~ neq(sK32,nil) )
    & sK30 = sK32
    & ssList(sK32)
    & ssList(sK31)
    & ssList(sK29) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK29,sK30,sK31,sK32])],[f191,f297,f296,f295,f294]) ).

fof(f294,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ( ~ segmentP(X1,X0)
                      | ~ neq(X0,nil) )
                    & ( nil = X2
                      | nil != X3 )
                    & ( nil != X0
                      | nil != X1 )
                    & X0 = X2
                    & ( ( segmentP(X3,X2)
                        & neq(X2,nil) )
                      | ~ neq(X3,nil) )
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( ~ segmentP(X1,sK29)
                    | ~ neq(sK29,nil) )
                  & ( nil = X2
                    | nil != X3 )
                  & ( nil != sK29
                    | nil != X1 )
                  & sK29 = X2
                  & ( ( segmentP(X3,X2)
                      & neq(X2,nil) )
                    | ~ neq(X3,nil) )
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) ) )
      & ssList(sK29) ) ),
    introduced(choice_axiom,[]) ).

fof(f295,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ( ~ segmentP(X1,sK29)
                  | ~ neq(sK29,nil) )
                & ( nil = X2
                  | nil != X3 )
                & ( nil != sK29
                  | nil != X1 )
                & sK29 = X2
                & ( ( segmentP(X3,X2)
                    & neq(X2,nil) )
                  | ~ neq(X3,nil) )
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) ) )
   => ( ssList(sK30)
      & ? [X2] :
          ( ? [X3] :
              ( ( ~ segmentP(sK30,sK29)
                | ~ neq(sK29,nil) )
              & ( nil = X2
                | nil != X3 )
              & ( nil != sK29
                | nil != sK30 )
              & sK29 = X2
              & ( ( segmentP(X3,X2)
                  & neq(X2,nil) )
                | ~ neq(X3,nil) )
              & sK30 = X3
              & ssList(X3) )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f296,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ~ segmentP(sK30,sK29)
              | ~ neq(sK29,nil) )
            & ( nil = X2
              | nil != X3 )
            & ( nil != sK29
              | nil != sK30 )
            & sK29 = X2
            & ( ( segmentP(X3,X2)
                & neq(X2,nil) )
              | ~ neq(X3,nil) )
            & sK30 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ~ segmentP(sK30,sK29)
            | ~ neq(sK29,nil) )
          & ( nil = sK31
            | nil != X3 )
          & ( nil != sK29
            | nil != sK30 )
          & sK31 = sK29
          & ( ( segmentP(X3,sK31)
              & neq(sK31,nil) )
            | ~ neq(X3,nil) )
          & sK30 = X3
          & ssList(X3) )
      & ssList(sK31) ) ),
    introduced(choice_axiom,[]) ).

fof(f297,plain,
    ( ? [X3] :
        ( ( ~ segmentP(sK30,sK29)
          | ~ neq(sK29,nil) )
        & ( nil = sK31
          | nil != X3 )
        & ( nil != sK29
          | nil != sK30 )
        & sK31 = sK29
        & ( ( segmentP(X3,sK31)
            & neq(sK31,nil) )
          | ~ neq(X3,nil) )
        & sK30 = X3
        & ssList(X3) )
   => ( ( ~ segmentP(sK30,sK29)
        | ~ neq(sK29,nil) )
      & ( nil = sK31
        | nil != sK32 )
      & ( nil != sK29
        | nil != sK30 )
      & sK31 = sK29
      & ( ( segmentP(sK32,sK31)
          & neq(sK31,nil) )
        | ~ neq(sK32,nil) )
      & sK30 = sK32
      & ssList(sK32) ) ),
    introduced(choice_axiom,[]) ).

fof(f191,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( ~ segmentP(X1,X0)
                    | ~ neq(X0,nil) )
                  & ( nil = X2
                    | nil != X3 )
                  & ( nil != X0
                    | nil != X1 )
                  & X0 = X2
                  & ( ( segmentP(X3,X2)
                      & neq(X2,nil) )
                    | ~ neq(X3,nil) )
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(flattening,[],[f190]) ).

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

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

fof(f478,plain,
    ssList(sK30),
    inference(cnf_transformation,[],[f298]) ).

fof(f1026,plain,
    ( ~ ssList(sK32)
    | ~ spl57_1
    | spl57_4
    | spl57_6 ),
    inference(subsumption_resolution,[],[f1025,f617]) ).

fof(f617,plain,
    ( nil != sK32
    | spl57_4 ),
    inference(avatar_component_clause,[],[f615]) ).

fof(f615,plain,
    ( spl57_4
  <=> nil = sK32 ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_4])]) ).

fof(f1025,plain,
    ( nil = sK32
    | ~ ssList(sK32)
    | ~ spl57_1
    | spl57_6 ),
    inference(subsumption_resolution,[],[f1020,f601]) ).

fof(f601,plain,
    ( ssList(nil)
    | ~ spl57_1 ),
    inference(avatar_component_clause,[],[f600]) ).

fof(f600,plain,
    ( spl57_1
  <=> ssList(nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_1])]) ).

fof(f1020,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK32)
    | nil = sK32
    | spl57_6 ),
    inference(resolution,[],[f353,f626]) ).

fof(f626,plain,
    ( ~ neq(sK32,nil)
    | spl57_6 ),
    inference(avatar_component_clause,[],[f624]) ).

fof(f624,plain,
    ( spl57_6
  <=> neq(sK32,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_6])]) ).

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

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

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

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

fof(f642,plain,
    ( ~ spl57_4
    | spl57_5 ),
    inference(avatar_split_clause,[],[f560,f619,f615]) ).

fof(f619,plain,
    ( spl57_5
  <=> nil = sK29 ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_5])]) ).

fof(f560,plain,
    ( nil = sK29
    | nil != sK32 ),
    inference(definition_unfolding,[],[f476,f474]) ).

fof(f474,plain,
    sK31 = sK29,
    inference(cnf_transformation,[],[f298]) ).

fof(f476,plain,
    ( nil = sK31
    | nil != sK32 ),
    inference(cnf_transformation,[],[f298]) ).

fof(f637,plain,
    ( ~ spl57_8
    | ~ spl57_7 ),
    inference(avatar_split_clause,[],[f559,f628,f633]) ).

fof(f633,plain,
    ( spl57_8
  <=> neq(sK29,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_8])]) ).

fof(f628,plain,
    ( spl57_7
  <=> segmentP(sK32,sK29) ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_7])]) ).

fof(f559,plain,
    ( ~ segmentP(sK32,sK29)
    | ~ neq(sK29,nil) ),
    inference(definition_unfolding,[],[f477,f471]) ).

fof(f477,plain,
    ( ~ segmentP(sK30,sK29)
    | ~ neq(sK29,nil) ),
    inference(cnf_transformation,[],[f298]) ).

fof(f636,plain,
    ( spl57_8
    | ~ spl57_6 ),
    inference(avatar_split_clause,[],[f563,f624,f633]) ).

fof(f563,plain,
    ( ~ neq(sK32,nil)
    | neq(sK29,nil) ),
    inference(definition_unfolding,[],[f472,f474]) ).

fof(f472,plain,
    ( neq(sK31,nil)
    | ~ neq(sK32,nil) ),
    inference(cnf_transformation,[],[f298]) ).

fof(f631,plain,
    ( ~ spl57_6
    | spl57_7 ),
    inference(avatar_split_clause,[],[f562,f628,f624]) ).

fof(f562,plain,
    ( segmentP(sK32,sK29)
    | ~ neq(sK32,nil) ),
    inference(definition_unfolding,[],[f473,f474]) ).

fof(f473,plain,
    ( segmentP(sK32,sK31)
    | ~ neq(sK32,nil) ),
    inference(cnf_transformation,[],[f298]) ).

fof(f622,plain,
    ( ~ spl57_4
    | ~ spl57_5 ),
    inference(avatar_split_clause,[],[f561,f619,f615]) ).

fof(f561,plain,
    ( nil != sK29
    | nil != sK32 ),
    inference(definition_unfolding,[],[f475,f471]) ).

fof(f475,plain,
    ( nil != sK29
    | nil != sK30 ),
    inference(cnf_transformation,[],[f298]) ).

fof(f608,plain,
    spl57_1,
    inference(avatar_split_clause,[],[f451,f600]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SWC116+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/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.14/0.34  % Computer : n019.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   : Tue Aug 30 18:19:50 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.45  % (3881)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.47  % (3895)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.48  % (3903)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.48  % (3887)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.49  % (3887)Instruction limit reached!
% 0.20/0.49  % (3887)------------------------------
% 0.20/0.49  % (3887)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49  % (3879)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.50  % (3880)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.50  % (3887)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (3887)Termination reason: Unknown
% 0.20/0.50  % (3887)Termination phase: Preprocessing 3
% 0.20/0.50  
% 0.20/0.50  % (3887)Memory used [KB]: 1151
% 0.20/0.50  % (3887)Time elapsed: 0.003 s
% 0.20/0.50  % (3887)Instructions burned: 3 (million)
% 0.20/0.50  % (3887)------------------------------
% 0.20/0.50  % (3887)------------------------------
% 0.20/0.50  % (3888)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50  % (3896)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.50  % (3893)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.50  % (3884)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  % (3885)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.51  % (3881)Instruction limit reached!
% 0.20/0.51  % (3881)------------------------------
% 0.20/0.51  % (3881)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (3881)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (3881)Termination reason: Unknown
% 0.20/0.51  % (3881)Termination phase: Saturation
% 0.20/0.51  
% 0.20/0.51  % (3881)Memory used [KB]: 1791
% 0.20/0.51  % (3881)Time elapsed: 0.123 s
% 0.20/0.51  % (3881)Instructions burned: 37 (million)
% 0.20/0.51  % (3881)------------------------------
% 0.20/0.51  % (3881)------------------------------
% 0.20/0.51  % (3905)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.51  % (3897)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.52  % (3894)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.52  % (3903)First to succeed.
% 1.34/0.52  % (3904)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.34/0.52  % (3900)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.34/0.52  % (3898)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)
% 1.34/0.52  % (3899)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.34/0.52  % (3889)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.34/0.52  % (3903)Refutation found. Thanks to Tanya!
% 1.34/0.52  % SZS status Theorem for theBenchmark
% 1.34/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 1.34/0.52  % (3903)------------------------------
% 1.34/0.52  % (3903)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.34/0.52  % (3903)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.34/0.52  % (3903)Termination reason: Refutation
% 1.34/0.52  
% 1.34/0.52  % (3903)Memory used [KB]: 6268
% 1.34/0.52  % (3903)Time elapsed: 0.127 s
% 1.34/0.52  % (3903)Instructions burned: 30 (million)
% 1.34/0.52  % (3903)------------------------------
% 1.34/0.52  % (3903)------------------------------
% 1.34/0.52  % (3874)Success in time 0.176 s
%------------------------------------------------------------------------------