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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC038+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 : n009.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:20 EDT 2022

% Result   : Theorem 0.20s 0.56s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  11 unt;   0 def)
%            Number of atoms       :  181 (  97 equ)
%            Maximal formula atoms :   24 (   6 avg)
%            Number of connectives :  191 (  39   ~;  36   |; 101   &)
%                                         (   2 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   6 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   :   37 (  13   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f757,plain,
    $false,
    inference(trivial_inequality_removal,[],[f756]) ).

fof(f756,plain,
    sK55 != sK55,
    inference(superposition,[],[f614,f679]) ).

fof(f679,plain,
    sK56 = sK55,
    inference(resolution,[],[f677,f613]) ).

fof(f613,plain,
    ssList(sK55),
    inference(definition_unfolding,[],[f547,f543]) ).

fof(f543,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f345]) ).

fof(f345,plain,
    ( ssList(sK53)
    & ssList(sK55)
    & ssList(sK56)
    & sK54 = sK56
    & sK53 = sK55
    & nil != sK53
    & ( ( nil = sK55
        & nil = sK56 )
      | ( frontsegP(sK56,sK55)
        & neq(sK55,nil) ) )
    & nil = sK54
    & ssList(sK54) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f113,f344,f343,f342,f341]) ).

fof(f341,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & X1 = X3
                    & X0 = X2
                    & nil != X0
                    & ( ( nil = X2
                        & nil = X3 )
                      | ( frontsegP(X3,X2)
                        & neq(X2,nil) ) )
                    & nil = X1 ) )
            & ssList(X1) ) )
   => ( ssList(sK53)
      & ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & sK53 = X2
                  & nil != sK53
                  & ( ( nil = X2
                      & nil = X3 )
                    | ( frontsegP(X3,X2)
                      & neq(X2,nil) ) )
                  & nil = X1 ) )
          & ssList(X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f342,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( ssList(X3)
                & X1 = X3
                & sK53 = X2
                & nil != sK53
                & ( ( nil = X2
                    & nil = X3 )
                  | ( frontsegP(X3,X2)
                    & neq(X2,nil) ) )
                & nil = X1 ) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ssList(X3)
              & sK54 = X3
              & sK53 = X2
              & nil != sK53
              & ( ( nil = X2
                  & nil = X3 )
                | ( frontsegP(X3,X2)
                  & neq(X2,nil) ) )
              & nil = sK54 ) )
      & ssList(sK54) ) ),
    introduced(choice_axiom,[]) ).

fof(f343,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( ssList(X3)
            & sK54 = X3
            & sK53 = X2
            & nil != sK53
            & ( ( nil = X2
                & nil = X3 )
              | ( frontsegP(X3,X2)
                & neq(X2,nil) ) )
            & nil = sK54 ) )
   => ( ssList(sK55)
      & ? [X3] :
          ( ssList(X3)
          & sK54 = X3
          & sK53 = sK55
          & nil != sK53
          & ( ( nil = sK55
              & nil = X3 )
            | ( frontsegP(X3,sK55)
              & neq(sK55,nil) ) )
          & nil = sK54 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f344,plain,
    ( ? [X3] :
        ( ssList(X3)
        & sK54 = X3
        & sK53 = sK55
        & nil != sK53
        & ( ( nil = sK55
            & nil = X3 )
          | ( frontsegP(X3,sK55)
            & neq(sK55,nil) ) )
        & nil = sK54 )
   => ( ssList(sK56)
      & sK54 = sK56
      & sK53 = sK55
      & nil != sK53
      & ( ( nil = sK55
          & nil = sK56 )
        | ( frontsegP(sK56,sK55)
          & neq(sK55,nil) ) )
      & nil = sK54 ) ),
    introduced(choice_axiom,[]) ).

fof(f113,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & nil != X0
                  & ( ( nil = X2
                      & nil = X3 )
                    | ( frontsegP(X3,X2)
                      & neq(X2,nil) ) )
                  & nil = X1 ) )
          & ssList(X1) ) ),
    inference(flattening,[],[f112]) ).

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

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

fof(f547,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f345]) ).

fof(f677,plain,
    ( ~ ssList(sK55)
    | sK56 = sK55 ),
    inference(duplicate_literal_removal,[],[f675]) ).

fof(f675,plain,
    ( sK56 = sK55
    | sK56 = sK55
    | ~ ssList(sK55) ),
    inference(resolution,[],[f621,f615]) ).

fof(f615,plain,
    ( frontsegP(sK56,sK55)
    | sK56 = sK55 ),
    inference(definition_unfolding,[],[f541,f559]) ).

fof(f559,plain,
    nil = sK56,
    inference(definition_unfolding,[],[f537,f544]) ).

fof(f544,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f345]) ).

fof(f537,plain,
    nil = sK54,
    inference(cnf_transformation,[],[f345]) ).

fof(f541,plain,
    ( nil = sK55
    | frontsegP(sK56,sK55) ),
    inference(cnf_transformation,[],[f345]) ).

fof(f621,plain,
    ! [X0] :
      ( ~ frontsegP(sK56,X0)
      | ~ ssList(X0)
      | sK56 = X0 ),
    inference(definition_unfolding,[],[f550,f559,f559]) ).

fof(f550,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | nil = X0
      | ~ frontsegP(nil,X0) ),
    inference(cnf_transformation,[],[f346]) ).

fof(f346,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ( nil = X0
          | ~ frontsegP(nil,X0) )
        & ( frontsegP(nil,X0)
          | nil != X0 ) ) ),
    inference(nnf_transformation,[],[f189]) ).

fof(f189,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( nil = X0
      <=> frontsegP(nil,X0) ) ),
    inference(ennf_transformation,[],[f46]) ).

fof(f46,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil = X0
      <=> frontsegP(nil,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).

fof(f614,plain,
    sK56 != sK55,
    inference(definition_unfolding,[],[f542,f559,f543]) ).

fof(f542,plain,
    nil != sK53,
    inference(cnf_transformation,[],[f345]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SWC038+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/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.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 18:02:35 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.51  % (27336)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.51  % (27344)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.53  % (27352)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.53  % (27335)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.53  % (27327)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.54  % (27328)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.54  % (27331)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.54  % (27337)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.54  % (27330)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.54  % (27349)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.54  TRYING [1]
% 0.20/0.54  % (27329)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.54  % (27341)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.54  % (27334)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.54  % (27345)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.54  % (27339)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.55  % (27354)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.55  % (27342)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.55  % (27333)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.55  % (27343)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.55  % (27346)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.55  % (27350)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.55  % (27336)First to succeed.
% 0.20/0.56  % (27338)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.56  % (27336)Refutation found. Thanks to Tanya!
% 0.20/0.56  % SZS status Theorem for theBenchmark
% 0.20/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56  % (27336)------------------------------
% 0.20/0.56  % (27336)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (27336)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (27336)Termination reason: Refutation
% 0.20/0.56  
% 0.20/0.56  % (27336)Memory used [KB]: 1535
% 0.20/0.56  % (27336)Time elapsed: 0.158 s
% 0.20/0.56  % (27336)Instructions burned: 19 (million)
% 0.20/0.56  % (27336)------------------------------
% 0.20/0.56  % (27336)------------------------------
% 0.20/0.56  % (27326)Success in time 0.212 s
%------------------------------------------------------------------------------