TSTP Solution File: SWC208+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC208+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_uns --cores 0 -t %d %s

% Computer : n006.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:39:36 EDT 2022

% Result   : Theorem 1.59s 0.60s
% Output   : Refutation 1.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (  11 unt;   0 def)
%            Number of atoms       :  169 (  61 equ)
%            Maximal formula atoms :   24 (   6 avg)
%            Number of connectives :  175 (  33   ~;  29   |; 100   &)
%                                         (   1 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   32 (   8   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f254,plain,
    $false,
    inference(avatar_sat_refutation,[],[f242,f252]) ).

fof(f252,plain,
    ~ spl9_4,
    inference(avatar_contradiction_clause,[],[f251]) ).

fof(f251,plain,
    ( $false
    | ~ spl9_4 ),
    inference(subsumption_resolution,[],[f250,f244]) ).

fof(f244,plain,
    neq(nil,nil),
    inference(backward_demodulation,[],[f174,f243]) ).

fof(f243,plain,
    nil = sK4,
    inference(subsumption_resolution,[],[f206,f209]) ).

fof(f209,plain,
    ~ neq(sK5,nil),
    inference(definition_unfolding,[],[f175,f173]) ).

fof(f173,plain,
    sK3 = sK5,
    inference(cnf_transformation,[],[f145]) ).

fof(f145,plain,
    ( ssList(sK3)
    & ssList(sK5)
    & sK6 = sK4
    & ( ( neq(sK5,nil)
        & frontsegP(sK6,sK5) )
      | ( nil = sK6
        & nil = sK5 ) )
    & ~ neq(sK3,nil)
    & neq(sK4,nil)
    & sK3 = sK5
    & ssList(sK6)
    & ssList(sK4) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f108,f144,f143,f142,f141]) ).

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

fof(f142,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( X1 = X3
                & ( ( neq(X2,nil)
                    & frontsegP(X3,X2) )
                  | ( nil = X3
                    & nil = X2 ) )
                & ~ neq(sK3,nil)
                & neq(X1,nil)
                & sK3 = X2
                & ssList(X3) ) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( sK4 = X3
              & ( ( neq(X2,nil)
                  & frontsegP(X3,X2) )
                | ( nil = X3
                  & nil = X2 ) )
              & ~ neq(sK3,nil)
              & neq(sK4,nil)
              & sK3 = X2
              & ssList(X3) ) )
      & ssList(sK4) ) ),
    introduced(choice_axiom,[]) ).

fof(f143,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( sK4 = X3
            & ( ( neq(X2,nil)
                & frontsegP(X3,X2) )
              | ( nil = X3
                & nil = X2 ) )
            & ~ neq(sK3,nil)
            & neq(sK4,nil)
            & sK3 = X2
            & ssList(X3) ) )
   => ( ssList(sK5)
      & ? [X3] :
          ( sK4 = X3
          & ( ( neq(sK5,nil)
              & frontsegP(X3,sK5) )
            | ( nil = X3
              & nil = sK5 ) )
          & ~ neq(sK3,nil)
          & neq(sK4,nil)
          & sK3 = sK5
          & ssList(X3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f144,plain,
    ( ? [X3] :
        ( sK4 = X3
        & ( ( neq(sK5,nil)
            & frontsegP(X3,sK5) )
          | ( nil = X3
            & nil = sK5 ) )
        & ~ neq(sK3,nil)
        & neq(sK4,nil)
        & sK3 = sK5
        & ssList(X3) )
   => ( sK6 = sK4
      & ( ( neq(sK5,nil)
          & frontsegP(sK6,sK5) )
        | ( nil = sK6
          & nil = sK5 ) )
      & ~ neq(sK3,nil)
      & neq(sK4,nil)
      & sK3 = sK5
      & ssList(sK6) ) ),
    introduced(choice_axiom,[]) ).

fof(f108,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( X1 = X3
                  & ( ( neq(X2,nil)
                      & frontsegP(X3,X2) )
                    | ( nil = X3
                      & nil = X2 ) )
                  & ~ neq(X0,nil)
                  & neq(X1,nil)
                  & X0 = X2
                  & ssList(X3) ) )
          & ssList(X1) ) ),
    inference(flattening,[],[f107]) ).

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

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

fof(f175,plain,
    ~ neq(sK3,nil),
    inference(cnf_transformation,[],[f145]) ).

fof(f206,plain,
    ( neq(sK5,nil)
    | nil = sK4 ),
    inference(definition_unfolding,[],[f179,f180]) ).

fof(f180,plain,
    sK6 = sK4,
    inference(cnf_transformation,[],[f145]) ).

fof(f179,plain,
    ( neq(sK5,nil)
    | nil = sK6 ),
    inference(cnf_transformation,[],[f145]) ).

fof(f174,plain,
    neq(sK4,nil),
    inference(cnf_transformation,[],[f145]) ).

fof(f250,plain,
    ( ~ neq(nil,nil)
    | ~ spl9_4 ),
    inference(backward_demodulation,[],[f209,f239]) ).

fof(f239,plain,
    ( nil = sK5
    | ~ spl9_4 ),
    inference(avatar_component_clause,[],[f237]) ).

fof(f237,plain,
    ( spl9_4
  <=> nil = sK5 ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).

fof(f242,plain,
    spl9_4,
    inference(avatar_split_clause,[],[f241,f237]) ).

fof(f241,plain,
    nil = sK5,
    inference(subsumption_resolution,[],[f178,f209]) ).

fof(f178,plain,
    ( neq(sK5,nil)
    | nil = sK5 ),
    inference(cnf_transformation,[],[f145]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC208+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n006.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:33:25 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.52  % (13572)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.19/0.53  % (13556)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.54  % (13572)Instruction limit reached!
% 0.19/0.54  % (13572)------------------------------
% 0.19/0.54  % (13572)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (13556)Instruction limit reached!
% 0.19/0.54  % (13556)------------------------------
% 0.19/0.54  % (13556)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (13572)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (13572)Termination reason: Unknown
% 0.19/0.54  % (13572)Termination phase: Function definition elimination
% 0.19/0.55  
% 0.19/0.55  % (13572)Memory used [KB]: 1791
% 0.19/0.55  % (13572)Time elapsed: 0.010 s
% 0.19/0.55  % (13572)Instructions burned: 8 (million)
% 0.19/0.55  % (13572)------------------------------
% 0.19/0.55  % (13572)------------------------------
% 1.31/0.55  % (13556)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.31/0.55  % (13556)Termination reason: Unknown
% 1.31/0.55  % (13556)Termination phase: Saturation
% 1.31/0.55  
% 1.31/0.55  % (13556)Memory used [KB]: 2046
% 1.31/0.55  % (13556)Time elapsed: 0.123 s
% 1.31/0.55  % (13556)Instructions burned: 16 (million)
% 1.31/0.55  % (13556)------------------------------
% 1.31/0.55  % (13556)------------------------------
% 1.31/0.56  % (13554)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.59/0.58  % (13546)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.59/0.58  % (13546)Instruction limit reached!
% 1.59/0.58  % (13546)------------------------------
% 1.59/0.58  % (13546)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.58  % (13546)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.58  % (13546)Termination reason: Unknown
% 1.59/0.58  % (13546)Termination phase: shuffling
% 1.59/0.58  
% 1.59/0.58  % (13546)Memory used [KB]: 1535
% 1.59/0.58  % (13546)Time elapsed: 0.003 s
% 1.59/0.58  % (13546)Instructions burned: 3 (million)
% 1.59/0.58  % (13546)------------------------------
% 1.59/0.58  % (13546)------------------------------
% 1.59/0.58  % (13554)Refutation not found, incomplete strategy% (13554)------------------------------
% 1.59/0.58  % (13554)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.58  % (13554)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.58  % (13554)Termination reason: Refutation not found, incomplete strategy
% 1.59/0.58  
% 1.59/0.58  % (13554)Memory used [KB]: 6140
% 1.59/0.58  % (13554)Time elapsed: 0.154 s
% 1.59/0.58  % (13554)Instructions burned: 5 (million)
% 1.59/0.58  % (13554)------------------------------
% 1.59/0.58  % (13554)------------------------------
% 1.59/0.58  % (13570)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.59/0.58  % (13567)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 1.59/0.59  % (13555)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.59/0.59  % (13555)First to succeed.
% 1.59/0.59  % (13550)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.59/0.59  % (13549)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.59/0.59  % (13548)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.59/0.60  % (13544)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.59/0.60  % (13550)Also succeeded, but the first one will report.
% 1.59/0.60  % (13555)Refutation found. Thanks to Tanya!
% 1.59/0.60  % SZS status Theorem for theBenchmark
% 1.59/0.60  % SZS output start Proof for theBenchmark
% See solution above
% 1.59/0.60  % (13555)------------------------------
% 1.59/0.60  % (13555)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.60  % (13555)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.60  % (13555)Termination reason: Refutation
% 1.59/0.60  
% 1.59/0.60  % (13555)Memory used [KB]: 6140
% 1.59/0.60  % (13555)Time elapsed: 0.006 s
% 1.59/0.60  % (13555)Instructions burned: 4 (million)
% 1.59/0.60  % (13555)------------------------------
% 1.59/0.60  % (13555)------------------------------
% 1.59/0.60  % (13543)Success in time 0.242 s
%------------------------------------------------------------------------------