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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC037+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 : n022.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.18s 0.57s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   42 (  11 unt;   0 def)
%            Number of atoms       :  248 ( 105 equ)
%            Maximal formula atoms :   28 (   5 avg)
%            Number of connectives :  260 (  54   ~;  54   |; 130   &)
%                                         (   4 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   59 (  24   !;  35   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f695,plain,
    $false,
    inference(subsumption_resolution,[],[f693,f609]) ).

fof(f609,plain,
    ssList(nil),
    inference(backward_demodulation,[],[f406,f408]) ).

fof(f408,plain,
    nil = sK18,
    inference(cnf_transformation,[],[f268]) ).

fof(f268,plain,
    ( ssList(sK17)
    & ssList(sK19)
    & ssList(sK20)
    & ( ( nil = sK20
        & nil = sK19 )
      | ( neq(sK21,nil)
        & ssList(sK21)
        & segmentP(sK20,sK21)
        & segmentP(sK19,sK21) ) )
    & nil != sK17
    & sK18 = sK20
    & nil = sK18
    & sK19 = sK17
    & ssList(sK18) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK17,sK18,sK19,sK20,sK21])],[f155,f267,f266,f265,f264,f263]) ).

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

fof(f264,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( ssList(X3)
                & ( ( nil = X3
                    & nil = X2 )
                  | ? [X4] :
                      ( neq(X4,nil)
                      & ssList(X4)
                      & segmentP(X3,X4)
                      & segmentP(X2,X4) ) )
                & nil != sK17
                & X1 = X3
                & nil = X1
                & sK17 = X2 ) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ssList(X3)
              & ( ( nil = X3
                  & nil = X2 )
                | ? [X4] :
                    ( neq(X4,nil)
                    & ssList(X4)
                    & segmentP(X3,X4)
                    & segmentP(X2,X4) ) )
              & nil != sK17
              & sK18 = X3
              & nil = sK18
              & sK17 = X2 ) )
      & ssList(sK18) ) ),
    introduced(choice_axiom,[]) ).

fof(f265,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( ssList(X3)
            & ( ( nil = X3
                & nil = X2 )
              | ? [X4] :
                  ( neq(X4,nil)
                  & ssList(X4)
                  & segmentP(X3,X4)
                  & segmentP(X2,X4) ) )
            & nil != sK17
            & sK18 = X3
            & nil = sK18
            & sK17 = X2 ) )
   => ( ssList(sK19)
      & ? [X3] :
          ( ssList(X3)
          & ( ( nil = X3
              & nil = sK19 )
            | ? [X4] :
                ( neq(X4,nil)
                & ssList(X4)
                & segmentP(X3,X4)
                & segmentP(sK19,X4) ) )
          & nil != sK17
          & sK18 = X3
          & nil = sK18
          & sK19 = sK17 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f266,plain,
    ( ? [X3] :
        ( ssList(X3)
        & ( ( nil = X3
            & nil = sK19 )
          | ? [X4] :
              ( neq(X4,nil)
              & ssList(X4)
              & segmentP(X3,X4)
              & segmentP(sK19,X4) ) )
        & nil != sK17
        & sK18 = X3
        & nil = sK18
        & sK19 = sK17 )
   => ( ssList(sK20)
      & ( ( nil = sK20
          & nil = sK19 )
        | ? [X4] :
            ( neq(X4,nil)
            & ssList(X4)
            & segmentP(sK20,X4)
            & segmentP(sK19,X4) ) )
      & nil != sK17
      & sK18 = sK20
      & nil = sK18
      & sK19 = sK17 ) ),
    introduced(choice_axiom,[]) ).

fof(f267,plain,
    ( ? [X4] :
        ( neq(X4,nil)
        & ssList(X4)
        & segmentP(sK20,X4)
        & segmentP(sK19,X4) )
   => ( neq(sK21,nil)
      & ssList(sK21)
      & segmentP(sK20,sK21)
      & segmentP(sK19,sK21) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f406,plain,
    ssList(sK18),
    inference(cnf_transformation,[],[f268]) ).

fof(f693,plain,
    ~ ssList(nil),
    inference(resolution,[],[f691,f595]) ).

fof(f595,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f581]) ).

fof(f581,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ ssList(X1)
      | ~ neq(X1,X1) ),
    inference(equality_resolution,[],[f500]) ).

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

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

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

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

fof(f691,plain,
    neq(nil,nil),
    inference(subsumption_resolution,[],[f685,f410]) ).

fof(f410,plain,
    nil != sK17,
    inference(cnf_transformation,[],[f268]) ).

fof(f685,plain,
    ( nil = sK17
    | neq(nil,nil) ),
    inference(backward_demodulation,[],[f601,f684]) ).

fof(f684,plain,
    nil = sK21,
    inference(subsumption_resolution,[],[f683,f410]) ).

fof(f683,plain,
    ( nil = sK17
    | nil = sK21 ),
    inference(resolution,[],[f670,f602]) ).

fof(f602,plain,
    ( ssList(sK21)
    | nil = sK17 ),
    inference(forward_demodulation,[],[f413,f407]) ).

fof(f407,plain,
    sK19 = sK17,
    inference(cnf_transformation,[],[f268]) ).

fof(f413,plain,
    ( nil = sK19
    | ssList(sK21) ),
    inference(cnf_transformation,[],[f268]) ).

fof(f670,plain,
    ( ~ ssList(sK21)
    | nil = sK21 ),
    inference(resolution,[],[f350,f612]) ).

fof(f612,plain,
    segmentP(nil,sK21),
    inference(subsumption_resolution,[],[f611,f410]) ).

fof(f611,plain,
    ( segmentP(nil,sK21)
    | nil = sK17 ),
    inference(backward_demodulation,[],[f607,f408]) ).

fof(f607,plain,
    ( nil = sK17
    | segmentP(sK18,sK21) ),
    inference(backward_demodulation,[],[f598,f409]) ).

fof(f409,plain,
    sK18 = sK20,
    inference(cnf_transformation,[],[f268]) ).

fof(f598,plain,
    ( nil = sK17
    | segmentP(sK20,sK21) ),
    inference(forward_demodulation,[],[f412,f407]) ).

fof(f412,plain,
    ( nil = sK19
    | segmentP(sK20,sK21) ),
    inference(cnf_transformation,[],[f268]) ).

fof(f350,plain,
    ! [X0] :
      ( ~ segmentP(nil,X0)
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f232]) ).

fof(f232,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ( nil = X0
          | ~ segmentP(nil,X0) )
        & ( segmentP(nil,X0)
          | nil != X0 ) ) ),
    inference(nnf_transformation,[],[f202]) ).

fof(f202,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( nil = X0
      <=> segmentP(nil,X0) ) ),
    inference(ennf_transformation,[],[f58]) ).

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

fof(f601,plain,
    ( neq(sK21,nil)
    | nil = sK17 ),
    inference(forward_demodulation,[],[f414,f407]) ).

fof(f414,plain,
    ( neq(sK21,nil)
    | nil = sK19 ),
    inference(cnf_transformation,[],[f268]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SWC037+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % 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.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 18:02:26 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.53  % (8208)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.53  % (8202)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.53  % (8201)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.18/0.53  % (8204)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.18/0.53  % (8202)Instruction limit reached!
% 0.18/0.53  % (8202)------------------------------
% 0.18/0.53  % (8202)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53  % (8202)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53  % (8202)Termination reason: Unknown
% 0.18/0.53  % (8202)Termination phase: shuffling
% 0.18/0.53  
% 0.18/0.53  % (8202)Memory used [KB]: 1279
% 0.18/0.53  % (8202)Time elapsed: 0.005 s
% 0.18/0.53  % (8202)Instructions burned: 9 (million)
% 0.18/0.53  % (8202)------------------------------
% 0.18/0.53  % (8202)------------------------------
% 0.18/0.54  % (8210)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.18/0.54  % (8203)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.18/0.55  % (8195)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.18/0.55  % (8209)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.18/0.55  % (8218)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.18/0.55  % (8217)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.18/0.56  % (8211)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.18/0.56  % (8203)Instruction limit reached!
% 0.18/0.56  % (8203)------------------------------
% 0.18/0.56  % (8203)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.56  % (8222)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.18/0.56  % (8203)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.56  % (8203)Termination reason: Unknown
% 0.18/0.56  % (8203)Termination phase: Preprocessing 3
% 0.18/0.56  
% 0.18/0.56  % (8203)Memory used [KB]: 1023
% 0.18/0.56  % (8203)Time elapsed: 0.004 s
% 0.18/0.56  % (8203)Instructions burned: 3 (million)
% 0.18/0.56  % (8203)------------------------------
% 0.18/0.56  % (8203)------------------------------
% 0.18/0.56  % (8216)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.18/0.56  % (8210)First to succeed.
% 0.18/0.56  TRYING [1]
% 0.18/0.56  TRYING [2]
% 0.18/0.56  % (8220)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.18/0.57  % (8206)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.18/0.57  % (8219)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.18/0.57  % (8210)Refutation found. Thanks to Tanya!
% 0.18/0.57  % SZS status Theorem for theBenchmark
% 0.18/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.57  % (8210)------------------------------
% 0.18/0.57  % (8210)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.57  % (8210)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.57  % (8210)Termination reason: Refutation
% 0.18/0.57  
% 0.18/0.57  % (8210)Memory used [KB]: 1535
% 0.18/0.57  % (8210)Time elapsed: 0.156 s
% 0.18/0.57  % (8210)Instructions burned: 20 (million)
% 0.18/0.57  % (8210)------------------------------
% 0.18/0.57  % (8210)------------------------------
% 0.18/0.57  % (8194)Success in time 0.225 s
%------------------------------------------------------------------------------