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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC026+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 : n023.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:17 EDT 2022

% Result   : Theorem 1.70s 0.58s
% Output   : Refutation 1.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   3 unt;   0 def)
%            Number of atoms       :  119 ( 100 equ)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  147 (  52   ~;  45   |;  39   &)
%                                         (   2 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   24 (  12   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f129,plain,
    $false,
    inference(avatar_sat_refutation,[],[f125,f126,f127,f128]) ).

fof(f128,plain,
    ( spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f115,f122,f118]) ).

fof(f118,plain,
    ( spl4_1
  <=> nil = sK0 ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

fof(f122,plain,
    ( spl4_2
  <=> nil = sK2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

fof(f115,plain,
    ( nil != sK2
    | nil = sK0 ),
    inference(definition_unfolding,[],[f106,f107]) ).

fof(f107,plain,
    sK1 = sK2,
    inference(cnf_transformation,[],[f103]) ).

fof(f103,plain,
    ( ( ( nil != sK2
        & nil = sK3 )
      | ( nil = sK2
        & nil != sK3 ) )
    & sK1 = sK2
    & ( nil != sK1
      | nil = sK0 )
    & sK3 = sK0
    & ( nil != sK0
      | nil = sK1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f101,f102]) ).

fof(f102,plain,
    ( ? [X0,X1,X2,X3] :
        ( ( ( nil != X2
            & nil = X3 )
          | ( nil = X2
            & nil != X3 ) )
        & X1 = X2
        & ( nil != X1
          | nil = X0 )
        & X0 = X3
        & ( nil != X0
          | nil = X1 ) )
   => ( ( ( nil != sK2
          & nil = sK3 )
        | ( nil = sK2
          & nil != sK3 ) )
      & sK1 = sK2
      & ( nil != sK1
        | nil = sK0 )
      & sK3 = sK0
      & ( nil != sK0
        | nil = sK1 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f101,plain,
    ? [X0,X1,X2,X3] :
      ( ( ( nil != X2
          & nil = X3 )
        | ( nil = X2
          & nil != X3 ) )
      & X1 = X2
      & ( nil != X1
        | nil = X0 )
      & X0 = X3
      & ( nil != X0
        | nil = X1 ) ),
    inference(rectify,[],[f100]) ).

fof(f100,plain,
    ? [X2,X3,X1,X0] :
      ( ( ( nil != X1
          & nil = X0 )
        | ( nil = X1
          & nil != X0 ) )
      & X1 = X3
      & ( nil != X3
        | nil = X2 )
      & X0 = X2
      & ( nil != X2
        | nil = X3 ) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f98,plain,
    ~ ! [X0,X1,X2,X3] :
        ( ( ( nil != X0
            | nil = X1 )
          & ( nil != X1
            | nil = X0 ) )
        | X1 != X3
        | ( nil != X2
          & nil = X3 )
        | X0 != X2
        | ( nil != X3
          & nil = X2 ) ),
    inference(pure_predicate_removal,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( ( nil != X0
                          | nil = X1 )
                        & ( nil != X1
                          | nil = X0 ) )
                      | X1 != X3
                      | ( nil != X2
                        & nil = X3 )
                      | X0 != X2
                      | ( 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
                        | nil = X1 )
                      & ( nil != X1
                        | nil = X0 ) )
                    | X1 != X3
                    | ( nil != X2
                      & nil = X3 )
                    | X0 != X2
                    | ( nil != X3
                      & nil = X2 ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f106,plain,
    ( nil != sK1
    | nil = sK0 ),
    inference(cnf_transformation,[],[f103]) ).

fof(f127,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f112,f122,f118]) ).

fof(f112,plain,
    ( nil != sK2
    | nil != sK0 ),
    inference(definition_unfolding,[],[f110,f105]) ).

fof(f105,plain,
    sK3 = sK0,
    inference(cnf_transformation,[],[f103]) ).

fof(f110,plain,
    ( nil != sK2
    | nil != sK3 ),
    inference(cnf_transformation,[],[f103]) ).

fof(f126,plain,
    ( spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f113,f122,f118]) ).

fof(f113,plain,
    ( nil = sK2
    | nil = sK0 ),
    inference(definition_unfolding,[],[f109,f105]) ).

fof(f109,plain,
    ( nil = sK3
    | nil = sK2 ),
    inference(cnf_transformation,[],[f103]) ).

fof(f125,plain,
    ( ~ spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f116,f122,f118]) ).

fof(f116,plain,
    ( nil = sK2
    | nil != sK0 ),
    inference(definition_unfolding,[],[f104,f107]) ).

fof(f104,plain,
    ( nil != sK0
    | nil = sK1 ),
    inference(cnf_transformation,[],[f103]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC026+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 : n023.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:20:05 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 1.39/0.56  % (23436)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)
% 1.39/0.57  % (23436)First to succeed.
% 1.39/0.57  % (23458)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.70/0.58  % (23436)Refutation found. Thanks to Tanya!
% 1.70/0.58  % SZS status Theorem for theBenchmark
% 1.70/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 1.70/0.58  % (23436)------------------------------
% 1.70/0.58  % (23436)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.70/0.58  % (23436)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.70/0.58  % (23436)Termination reason: Refutation
% 1.70/0.58  
% 1.70/0.58  % (23436)Memory used [KB]: 6012
% 1.70/0.58  % (23436)Time elapsed: 0.005 s
% 1.70/0.58  % (23436)Instructions burned: 2 (million)
% 1.70/0.58  % (23436)------------------------------
% 1.70/0.58  % (23436)------------------------------
% 1.70/0.58  % (23434)Success in time 0.223 s
%------------------------------------------------------------------------------