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

View Problem - Process Solution

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

% Computer : n001.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:38:21 EDT 2022

% Result   : Theorem 0.15s 0.48s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   34 (   9 unt;   0 def)
%            Number of atoms       :  194 (  96 equ)
%            Maximal formula atoms :   24 (   5 avg)
%            Number of connectives :  204 (  44   ~;  42   |; 101   &)
%                                         (   4 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   37 (  13   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f277,plain,
    $false,
    inference(avatar_sat_refutation,[],[f262,f269,f276]) ).

fof(f276,plain,
    ( spl9_4
    | ~ spl9_5 ),
    inference(avatar_contradiction_clause,[],[f275]) ).

fof(f275,plain,
    ( $false
    | spl9_4
    | ~ spl9_5 ),
    inference(subsumption_resolution,[],[f274,f256]) ).

fof(f256,plain,
    ( sK3 != sK2
    | spl9_4 ),
    inference(avatar_component_clause,[],[f255]) ).

fof(f255,plain,
    ( spl9_4
  <=> sK3 = sK2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).

fof(f274,plain,
    ( sK3 = sK2
    | ~ spl9_5 ),
    inference(subsumption_resolution,[],[f271,f154]) ).

fof(f154,plain,
    ssList(sK2),
    inference(cnf_transformation,[],[f135]) ).

fof(f135,plain,
    ( ssList(sK1)
    & ssList(sK3)
    & nil = sK1
    & sK0 = sK2
    & nil != sK0
    & ( ( frontsegP(sK3,sK2)
        & neq(sK2,nil) )
      | ( nil = sK2
        & nil = sK3 ) )
    & sK1 = sK3
    & ssList(sK2)
    & ssList(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f126,f134,f133,f132,f131]) ).

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

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

fof(f133,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ssList(X3)
            & nil = sK1
            & sK0 = X2
            & nil != sK0
            & ( ( frontsegP(X3,X2)
                & neq(X2,nil) )
              | ( nil = X2
                & nil = X3 ) )
            & sK1 = X3 )
        & ssList(X2) )
   => ( ? [X3] :
          ( ssList(X3)
          & nil = sK1
          & sK0 = sK2
          & nil != sK0
          & ( ( frontsegP(X3,sK2)
              & neq(sK2,nil) )
            | ( nil = sK2
              & nil = X3 ) )
          & sK1 = X3 )
      & ssList(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f134,plain,
    ( ? [X3] :
        ( ssList(X3)
        & nil = sK1
        & sK0 = sK2
        & nil != sK0
        & ( ( frontsegP(X3,sK2)
            & neq(sK2,nil) )
          | ( nil = sK2
            & nil = X3 ) )
        & sK1 = X3 )
   => ( ssList(sK3)
      & nil = sK1
      & sK0 = sK2
      & nil != sK0
      & ( ( frontsegP(sK3,sK2)
          & neq(sK2,nil) )
        | ( nil = sK2
          & nil = sK3 ) )
      & sK1 = sK3 ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f271,plain,
    ( ~ ssList(sK2)
    | sK3 = sK2
    | ~ spl9_5 ),
    inference(resolution,[],[f214,f261]) ).

fof(f261,plain,
    ( frontsegP(sK3,sK2)
    | ~ spl9_5 ),
    inference(avatar_component_clause,[],[f259]) ).

fof(f259,plain,
    ( spl9_5
  <=> frontsegP(sK3,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).

fof(f214,plain,
    ! [X0] :
      ( ~ frontsegP(sK3,X0)
      | ~ ssList(X0)
      | sK3 = X0 ),
    inference(definition_unfolding,[],[f173,f205,f205]) ).

fof(f205,plain,
    nil = sK3,
    inference(definition_unfolding,[],[f162,f155]) ).

fof(f155,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f135]) ).

fof(f162,plain,
    nil = sK1,
    inference(cnf_transformation,[],[f135]) ).

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

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

fof(f107,plain,
    ! [X0] :
      ( ( nil = X0
      <=> frontsegP(nil,X0) )
      | ~ ssList(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(f269,plain,
    ~ spl9_4,
    inference(avatar_split_clause,[],[f207,f255]) ).

fof(f207,plain,
    sK3 != sK2,
    inference(definition_unfolding,[],[f160,f205,f161]) ).

fof(f161,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f135]) ).

fof(f160,plain,
    nil != sK0,
    inference(cnf_transformation,[],[f135]) ).

fof(f262,plain,
    ( spl9_4
    | spl9_5 ),
    inference(avatar_split_clause,[],[f208,f259,f255]) ).

fof(f208,plain,
    ( frontsegP(sK3,sK2)
    | sK3 = sK2 ),
    inference(definition_unfolding,[],[f159,f205]) ).

fof(f159,plain,
    ( frontsegP(sK3,sK2)
    | nil = sK2 ),
    inference(cnf_transformation,[],[f135]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SWC038+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.10  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.10/0.30  % Computer : n001.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Tue Aug 30 18:26:32 EDT 2022
% 0.10/0.30  % CPUTime    : 
% 0.15/0.44  % (8011)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)
% 0.15/0.45  % (8010)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.15/0.46  % (8003)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)
% 0.15/0.46  % (8007)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)
% 0.15/0.46  % (8007)First to succeed.
% 0.15/0.46  % (8024)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)
% 0.15/0.47  % (8016)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.15/0.47  % (8015)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.47  % (8001)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.15/0.47  % (8019)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.47  % (8002)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.15/0.47  % (8003)Instruction limit reached!
% 0.15/0.47  % (8003)------------------------------
% 0.15/0.47  % (8003)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47  % (8003)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47  % (8003)Termination reason: Unknown
% 0.15/0.47  % (8003)Termination phase: Preprocessing 3
% 0.15/0.47  
% 0.15/0.47  % (8003)Memory used [KB]: 1535
% 0.15/0.47  % (8003)Time elapsed: 0.004 s
% 0.15/0.47  % (8003)Instructions burned: 3 (million)
% 0.15/0.47  % (8003)------------------------------
% 0.15/0.47  % (8003)------------------------------
% 0.15/0.47  % (8019)Instruction limit reached!
% 0.15/0.47  % (8019)------------------------------
% 0.15/0.47  % (8019)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47  % (8019)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47  % (8019)Termination reason: Unknown
% 0.15/0.47  % (8019)Termination phase: Naming
% 0.15/0.47  
% 0.15/0.47  % (8019)Memory used [KB]: 1535
% 0.15/0.47  % (8019)Time elapsed: 0.003 s
% 0.15/0.47  % (8019)Instructions burned: 2 (million)
% 0.15/0.47  % (8019)------------------------------
% 0.15/0.47  % (8019)------------------------------
% 0.15/0.47  % (8023)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.15/0.47  % (8008)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.15/0.48  % (8028)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)
% 0.15/0.48  % (8007)Refutation found. Thanks to Tanya!
% 0.15/0.48  % SZS status Theorem for theBenchmark
% 0.15/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48  % (8007)------------------------------
% 0.15/0.48  % (8007)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.48  % (8007)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.48  % (8007)Termination reason: Refutation
% 0.15/0.48  
% 0.15/0.48  % (8007)Memory used [KB]: 6012
% 0.15/0.48  % (8007)Time elapsed: 0.093 s
% 0.15/0.48  % (8007)Instructions burned: 4 (million)
% 0.15/0.48  % (8007)------------------------------
% 0.15/0.48  % (8007)------------------------------
% 0.15/0.48  % (8000)Success in time 0.167 s
%------------------------------------------------------------------------------