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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC102+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:49 EDT 2022

% Result   : Theorem 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   32 (  12 unt;   0 def)
%            Number of atoms       :  152 (  43 equ)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  162 (  42   ~;  27   |;  78   &)
%                                         (   2 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 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   :   35 (  11   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f390,plain,
    $false,
    inference(avatar_sat_refutation,[],[f228,f231,f377]) ).

fof(f377,plain,
    spl9_1,
    inference(avatar_contradiction_clause,[],[f376]) ).

fof(f376,plain,
    ( $false
    | spl9_1 ),
    inference(subsumption_resolution,[],[f234,f223]) ).

fof(f223,plain,
    ( ~ frontsegP(sK1,sK1)
    | spl9_1 ),
    inference(avatar_component_clause,[],[f221]) ).

fof(f221,plain,
    ( spl9_1
  <=> frontsegP(sK1,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).

fof(f234,plain,
    frontsegP(sK1,sK1),
    inference(unit_resulting_resolution,[],[f179,f158]) ).

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

fof(f117,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(f179,plain,
    ssList(sK1),
    inference(cnf_transformation,[],[f143]) ).

fof(f143,plain,
    ( ssList(sK1)
    & ssList(sK2)
    & ssList(sK3)
    & neq(sK2,nil)
    & sK3 = sK1
    & sK2 = sK4
    & ssList(sK4)
    & ( ~ frontsegP(sK2,sK1)
      | ~ neq(sK1,nil) )
    & sK3 = sK4 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f104,f142,f141,f140,f139]) ).

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

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

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

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

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

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

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

fof(f231,plain,
    spl9_2,
    inference(avatar_split_clause,[],[f230,f225]) ).

fof(f225,plain,
    ( spl9_2
  <=> neq(sK1,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).

fof(f230,plain,
    neq(sK1,nil),
    inference(forward_demodulation,[],[f204,f206]) ).

fof(f206,plain,
    sK4 = sK1,
    inference(definition_unfolding,[],[f171,f175]) ).

fof(f175,plain,
    sK3 = sK1,
    inference(cnf_transformation,[],[f143]) ).

fof(f171,plain,
    sK3 = sK4,
    inference(cnf_transformation,[],[f143]) ).

fof(f204,plain,
    neq(sK4,nil),
    inference(definition_unfolding,[],[f176,f174]) ).

fof(f174,plain,
    sK2 = sK4,
    inference(cnf_transformation,[],[f143]) ).

fof(f176,plain,
    neq(sK2,nil),
    inference(cnf_transformation,[],[f143]) ).

fof(f228,plain,
    ( ~ spl9_1
    | ~ spl9_2 ),
    inference(avatar_split_clause,[],[f219,f225,f221]) ).

fof(f219,plain,
    ( ~ neq(sK1,nil)
    | ~ frontsegP(sK1,sK1) ),
    inference(forward_demodulation,[],[f205,f206]) ).

fof(f205,plain,
    ( ~ frontsegP(sK4,sK1)
    | ~ neq(sK1,nil) ),
    inference(definition_unfolding,[],[f172,f174]) ).

fof(f172,plain,
    ( ~ frontsegP(sK2,sK1)
    | ~ neq(sK1,nil) ),
    inference(cnf_transformation,[],[f143]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWC102+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.14/0.35  % Computer : n001.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 18:40:02 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.48  % (647)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.21/0.49  % (637)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.21/0.49  % (627)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.21/0.50  % (627)First to succeed.
% 0.21/0.50  % (637)Instruction limit reached!
% 0.21/0.50  % (637)------------------------------
% 0.21/0.50  % (637)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50  % (637)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50  % (637)Termination reason: Unknown
% 0.21/0.50  % (637)Termination phase: Naming
% 0.21/0.50  
% 0.21/0.50  % (637)Memory used [KB]: 1535
% 0.21/0.50  % (637)Time elapsed: 0.005 s
% 0.21/0.50  % (637)Instructions burned: 3 (million)
% 0.21/0.50  % (637)------------------------------
% 0.21/0.50  % (637)------------------------------
% 0.21/0.51  % (627)Refutation found. Thanks to Tanya!
% 0.21/0.51  % SZS status Theorem for theBenchmark
% 0.21/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51  % (627)------------------------------
% 0.21/0.51  % (627)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (627)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (627)Termination reason: Refutation
% 0.21/0.51  
% 0.21/0.51  % (627)Memory used [KB]: 6268
% 0.21/0.51  % (627)Time elapsed: 0.093 s
% 0.21/0.51  % (627)Instructions burned: 11 (million)
% 0.21/0.51  % (627)------------------------------
% 0.21/0.51  % (627)------------------------------
% 0.21/0.51  % (619)Success in time 0.145 s
%------------------------------------------------------------------------------