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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC020+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 : n014.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:15 EDT 2022

% Result   : Theorem 0.20s 0.55s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   45 (   4 unt;   0 def)
%            Number of atoms       :  275 (  94 equ)
%            Maximal formula atoms :   32 (   6 avg)
%            Number of connectives :  345 ( 115   ~; 105   |; 108   &)
%                                         (   4 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   50 (  24   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f814,plain,
    $false,
    inference(avatar_sat_refutation,[],[f617,f638,f648,f649,f654,f813]) ).

fof(f813,plain,
    ( ~ spl57_8
    | ~ spl57_10 ),
    inference(avatar_contradiction_clause,[],[f812]) ).

fof(f812,plain,
    ( $false
    | ~ spl57_8
    | ~ spl57_10 ),
    inference(subsumption_resolution,[],[f811,f390]) ).

fof(f390,plain,
    ssList(sK15),
    inference(cnf_transformation,[],[f257]) ).

fof(f257,plain,
    ( ssList(sK17)
    & ssList(sK18)
    & ( nil != sK15
      | nil != sK16 )
    & sK16 = sK18
    & ( ( nil = sK17
        & nil = sK18 )
      | ( neq(sK17,nil)
        & frontsegP(sK18,sK17) ) )
    & sK17 = sK15
    & ! [X4] :
        ( ~ frontsegP(sK16,X4)
        | ~ ssList(X4)
        | ~ neq(X4,nil)
        | ~ frontsegP(sK15,X4) )
    & ssList(sK16)
    & ssList(sK15) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16,sK17,sK18])],[f112,f256,f255,f254,f253]) ).

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

fof(f254,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( ssList(X3)
                & ( nil != sK15
                  | nil != X1 )
                & X1 = X3
                & ( ( nil = X2
                    & nil = X3 )
                  | ( neq(X2,nil)
                    & frontsegP(X3,X2) ) )
                & sK15 = X2
                & ! [X4] :
                    ( ~ frontsegP(X1,X4)
                    | ~ ssList(X4)
                    | ~ neq(X4,nil)
                    | ~ frontsegP(sK15,X4) ) ) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ssList(X3)
              & ( nil != sK15
                | nil != sK16 )
              & sK16 = X3
              & ( ( nil = X2
                  & nil = X3 )
                | ( neq(X2,nil)
                  & frontsegP(X3,X2) ) )
              & sK15 = X2
              & ! [X4] :
                  ( ~ frontsegP(sK16,X4)
                  | ~ ssList(X4)
                  | ~ neq(X4,nil)
                  | ~ frontsegP(sK15,X4) ) ) )
      & ssList(sK16) ) ),
    introduced(choice_axiom,[]) ).

fof(f255,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( ssList(X3)
            & ( nil != sK15
              | nil != sK16 )
            & sK16 = X3
            & ( ( nil = X2
                & nil = X3 )
              | ( neq(X2,nil)
                & frontsegP(X3,X2) ) )
            & sK15 = X2
            & ! [X4] :
                ( ~ frontsegP(sK16,X4)
                | ~ ssList(X4)
                | ~ neq(X4,nil)
                | ~ frontsegP(sK15,X4) ) ) )
   => ( ssList(sK17)
      & ? [X3] :
          ( ssList(X3)
          & ( nil != sK15
            | nil != sK16 )
          & sK16 = X3
          & ( ( nil = sK17
              & nil = X3 )
            | ( neq(sK17,nil)
              & frontsegP(X3,sK17) ) )
          & sK17 = sK15
          & ! [X4] :
              ( ~ frontsegP(sK16,X4)
              | ~ ssList(X4)
              | ~ neq(X4,nil)
              | ~ frontsegP(sK15,X4) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f256,plain,
    ( ? [X3] :
        ( ssList(X3)
        & ( nil != sK15
          | nil != sK16 )
        & sK16 = X3
        & ( ( nil = sK17
            & nil = X3 )
          | ( neq(sK17,nil)
            & frontsegP(X3,sK17) ) )
        & sK17 = sK15
        & ! [X4] :
            ( ~ frontsegP(sK16,X4)
            | ~ ssList(X4)
            | ~ neq(X4,nil)
            | ~ frontsegP(sK15,X4) ) )
   => ( ssList(sK18)
      & ( nil != sK15
        | nil != sK16 )
      & sK16 = sK18
      & ( ( nil = sK17
          & nil = sK18 )
        | ( neq(sK17,nil)
          & frontsegP(sK18,sK17) ) )
      & sK17 = sK15
      & ! [X4] :
          ( ~ frontsegP(sK16,X4)
          | ~ ssList(X4)
          | ~ neq(X4,nil)
          | ~ frontsegP(sK15,X4) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f811,plain,
    ( ~ ssList(sK15)
    | ~ spl57_8
    | ~ spl57_10 ),
    inference(resolution,[],[f796,f475]) ).

fof(f475,plain,
    ! [X0] :
      ( frontsegP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f132]) ).

fof(f132,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | frontsegP(X0,X0) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f42,axiom,
    ! [X0] :
      ( ssList(X0)
     => frontsegP(X0,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).

fof(f796,plain,
    ( ~ frontsegP(sK15,sK15)
    | ~ spl57_8
    | ~ spl57_10 ),
    inference(subsumption_resolution,[],[f795,f390]) ).

fof(f795,plain,
    ( ~ ssList(sK15)
    | ~ frontsegP(sK15,sK15)
    | ~ spl57_8
    | ~ spl57_10 ),
    inference(subsumption_resolution,[],[f781,f637]) ).

fof(f637,plain,
    ( neq(sK15,nil)
    | ~ spl57_8 ),
    inference(avatar_component_clause,[],[f635]) ).

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

fof(f781,plain,
    ( ~ neq(sK15,nil)
    | ~ frontsegP(sK15,sK15)
    | ~ ssList(sK15)
    | ~ spl57_10 ),
    inference(resolution,[],[f565,f647]) ).

fof(f647,plain,
    ( frontsegP(sK18,sK15)
    | ~ spl57_10 ),
    inference(avatar_component_clause,[],[f645]) ).

fof(f645,plain,
    ( spl57_10
  <=> frontsegP(sK18,sK15) ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_10])]) ).

fof(f565,plain,
    ! [X4] :
      ( ~ frontsegP(sK18,X4)
      | ~ ssList(X4)
      | ~ neq(X4,nil)
      | ~ frontsegP(sK15,X4) ),
    inference(definition_unfolding,[],[f392,f398]) ).

fof(f398,plain,
    sK16 = sK18,
    inference(cnf_transformation,[],[f257]) ).

fof(f392,plain,
    ! [X4] :
      ( ~ frontsegP(sK16,X4)
      | ~ ssList(X4)
      | ~ neq(X4,nil)
      | ~ frontsegP(sK15,X4) ),
    inference(cnf_transformation,[],[f257]) ).

fof(f654,plain,
    ( spl57_4
    | spl57_10 ),
    inference(avatar_split_clause,[],[f562,f645,f614]) ).

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

fof(f562,plain,
    ( frontsegP(sK18,sK15)
    | nil = sK15 ),
    inference(definition_unfolding,[],[f396,f393,f393]) ).

fof(f393,plain,
    sK17 = sK15,
    inference(cnf_transformation,[],[f257]) ).

fof(f396,plain,
    ( nil = sK17
    | frontsegP(sK18,sK17) ),
    inference(cnf_transformation,[],[f257]) ).

fof(f649,plain,
    ( spl57_8
    | spl57_3 ),
    inference(avatar_split_clause,[],[f563,f610,f635]) ).

fof(f610,plain,
    ( spl57_3
  <=> nil = sK18 ),
    introduced(avatar_definition,[new_symbols(naming,[spl57_3])]) ).

fof(f563,plain,
    ( nil = sK18
    | neq(sK15,nil) ),
    inference(definition_unfolding,[],[f395,f393]) ).

fof(f395,plain,
    ( nil = sK18
    | neq(sK17,nil) ),
    inference(cnf_transformation,[],[f257]) ).

fof(f648,plain,
    ( spl57_3
    | spl57_10 ),
    inference(avatar_split_clause,[],[f564,f645,f610]) ).

fof(f564,plain,
    ( frontsegP(sK18,sK15)
    | nil = sK18 ),
    inference(definition_unfolding,[],[f394,f393]) ).

fof(f394,plain,
    ( nil = sK18
    | frontsegP(sK18,sK17) ),
    inference(cnf_transformation,[],[f257]) ).

fof(f638,plain,
    ( spl57_4
    | spl57_8 ),
    inference(avatar_split_clause,[],[f561,f635,f614]) ).

fof(f561,plain,
    ( neq(sK15,nil)
    | nil = sK15 ),
    inference(definition_unfolding,[],[f397,f393,f393]) ).

fof(f397,plain,
    ( nil = sK17
    | neq(sK17,nil) ),
    inference(cnf_transformation,[],[f257]) ).

fof(f617,plain,
    ( ~ spl57_3
    | ~ spl57_4 ),
    inference(avatar_split_clause,[],[f560,f614,f610]) ).

fof(f560,plain,
    ( nil != sK15
    | nil != sK18 ),
    inference(definition_unfolding,[],[f399,f398]) ).

fof(f399,plain,
    ( nil != sK15
    | nil != sK16 ),
    inference(cnf_transformation,[],[f257]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SWC020+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.14  % 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.35  % Computer : n014.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 17:58:33 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.52  % (23686)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.20/0.52  % (23701)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.20/0.53  % (23699)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (23686)First to succeed.
% 0.20/0.54  % (23701)Instruction limit reached!
% 0.20/0.54  % (23701)------------------------------
% 0.20/0.54  % (23701)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (23708)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.20/0.54  % (23715)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.54  % (23700)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.20/0.54  % (23693)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.20/0.54  % (23701)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (23701)Termination reason: Unknown
% 0.20/0.54  % (23701)Termination phase: Equality resolution with deletion
% 0.20/0.54  
% 0.20/0.54  % (23701)Memory used [KB]: 1791
% 0.20/0.54  % (23701)Time elapsed: 0.006 s
% 0.20/0.54  % (23701)Instructions burned: 8 (million)
% 0.20/0.54  % (23701)------------------------------
% 0.20/0.54  % (23701)------------------------------
% 0.20/0.54  % (23691)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)
% 0.20/0.54  % (23713)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.54  % (23709)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.20/0.54  % (23690)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)
% 0.20/0.54  % (23689)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.54  % (23687)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.20/0.54  % (23688)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.20/0.54  % (23690)Also succeeded, but the first one will report.
% 0.20/0.55  % (23686)Refutation found. Thanks to Tanya!
% 0.20/0.55  % SZS status Theorem for theBenchmark
% 0.20/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55  % (23686)------------------------------
% 0.20/0.55  % (23686)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (23686)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (23686)Termination reason: Refutation
% 0.20/0.55  
% 0.20/0.55  % (23686)Memory used [KB]: 6524
% 0.20/0.55  % (23686)Time elapsed: 0.113 s
% 0.20/0.55  % (23686)Instructions burned: 19 (million)
% 0.20/0.55  % (23686)------------------------------
% 0.20/0.55  % (23686)------------------------------
% 0.20/0.55  % (23685)Success in time 0.186 s
%------------------------------------------------------------------------------