TSTP Solution File: SET789+4 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET789+4 : TPTP v8.1.0. Released v3.2.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 : n025.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:22:16 EDT 2022

% Result   : Theorem 0.15s 0.47s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   39 (   8 unt;   0 def)
%            Number of atoms       :  189 (  24 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  226 (  76   ~;  63   |;  55   &)
%                                         (   4 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :  116 (  98   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f60,plain,
    $false,
    inference(subsumption_resolution,[],[f59,f44]) ).

fof(f44,plain,
    member(sK3,sK2),
    inference(resolution,[],[f33,f29]) ).

fof(f29,plain,
    ! [X2,X0,X1] :
      ( ~ greatest(X0,X1,X2)
      | member(X0,X2) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( ~ greatest(X0,X1,X2)
      | ( ! [X3] :
            ( ~ member(X3,X2)
            | apply(X1,X3,X0) )
        & member(X0,X2) ) ),
    inference(rectify,[],[f22]) ).

fof(f22,plain,
    ! [X2,X1,X0] :
      ( ~ greatest(X2,X1,X0)
      | ( ! [X3] :
            ( ~ member(X3,X0)
            | apply(X1,X3,X2) )
        & member(X2,X0) ) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,plain,
    ! [X1,X0,X2] :
      ( greatest(X2,X1,X0)
     => ( member(X2,X0)
        & ! [X3] :
            ( member(X3,X0)
           => apply(X1,X3,X2) ) ) ),
    inference(unused_predicate_definition_removal,[],[f15]) ).

fof(f15,plain,
    ! [X1,X0,X2] :
      ( ( member(X2,X0)
        & ! [X3] :
            ( member(X3,X0)
           => apply(X1,X3,X2) ) )
    <=> greatest(X2,X1,X0) ),
    inference(rectify,[],[f5]) ).

fof(f5,axiom,
    ! [X1,X0,X5] :
      ( ( member(X5,X1)
        & ! [X2] :
            ( member(X2,X1)
           => apply(X0,X2,X5) ) )
    <=> greatest(X5,X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greatest) ).

fof(f33,plain,
    greatest(sK3,sK0,sK2),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ( order(sK0,sK2)
    & greatest(sK3,sK0,sK2)
    & sK1 != sK3
    & greatest(sK1,sK0,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f24,f26,f25]) ).

fof(f25,plain,
    ( ? [X0,X1,X2] :
        ( order(X0,X2)
        & ? [X3] :
            ( greatest(X3,X0,X2)
            & X1 != X3 )
        & greatest(X1,X0,X2) )
   => ( order(sK0,sK2)
      & ? [X3] :
          ( greatest(X3,sK0,sK2)
          & sK1 != X3 )
      & greatest(sK1,sK0,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f26,plain,
    ( ? [X3] :
        ( greatest(X3,sK0,sK2)
        & sK1 != X3 )
   => ( greatest(sK3,sK0,sK2)
      & sK1 != sK3 ) ),
    introduced(choice_axiom,[]) ).

fof(f24,plain,
    ? [X0,X1,X2] :
      ( order(X0,X2)
      & ? [X3] :
          ( greatest(X3,X0,X2)
          & X1 != X3 )
      & greatest(X1,X0,X2) ),
    inference(rectify,[],[f21]) ).

fof(f21,plain,
    ? [X2,X0,X1] :
      ( order(X2,X1)
      & ? [X3] :
          ( greatest(X3,X2,X1)
          & X0 != X3 )
      & greatest(X0,X2,X1) ),
    inference(flattening,[],[f20]) ).

fof(f20,plain,
    ? [X1,X2,X0] :
      ( ? [X3] :
          ( greatest(X3,X2,X1)
          & X0 != X3 )
      & order(X2,X1)
      & greatest(X0,X2,X1) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f13,plain,
    ~ ! [X1,X2,X0] :
        ( ( order(X2,X1)
          & greatest(X0,X2,X1) )
       => ! [X3] :
            ( greatest(X3,X2,X1)
           => X0 = X3 ) ),
    inference(rectify,[],[f12]) ).

fof(f12,negated_conjecture,
    ~ ! [X5,X1,X0] :
        ( ( order(X0,X1)
          & greatest(X5,X0,X1) )
       => ! [X2] :
            ( greatest(X2,X0,X1)
           => X2 = X5 ) ),
    inference(negated_conjecture,[],[f11]) ).

fof(f11,conjecture,
    ! [X5,X1,X0] :
      ( ( order(X0,X1)
        & greatest(X5,X0,X1) )
     => ! [X2] :
          ( greatest(X2,X0,X1)
         => X2 = X5 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV1) ).

fof(f59,plain,
    ~ member(sK3,sK2),
    inference(subsumption_resolution,[],[f58,f42]) ).

fof(f42,plain,
    member(sK1,sK2),
    inference(resolution,[],[f31,f29]) ).

fof(f31,plain,
    greatest(sK1,sK0,sK2),
    inference(cnf_transformation,[],[f27]) ).

fof(f58,plain,
    ( ~ member(sK1,sK2)
    | ~ member(sK3,sK2) ),
    inference(subsumption_resolution,[],[f54,f32]) ).

fof(f32,plain,
    sK1 != sK3,
    inference(cnf_transformation,[],[f27]) ).

fof(f54,plain,
    ( sK1 = sK3
    | ~ member(sK1,sK2)
    | ~ member(sK3,sK2) ),
    inference(resolution,[],[f51,f41]) ).

fof(f41,plain,
    ! [X0] :
      ( apply(sK0,X0,sK1)
      | ~ member(X0,sK2) ),
    inference(resolution,[],[f31,f30]) ).

fof(f30,plain,
    ! [X2,X3,X0,X1] :
      ( ~ greatest(X0,X1,X2)
      | ~ member(X3,X2)
      | apply(X1,X3,X0) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f51,plain,
    ! [X2] :
      ( ~ apply(sK0,sK3,X2)
      | ~ member(X2,sK2)
      | sK3 = X2 ),
    inference(subsumption_resolution,[],[f49,f44]) ).

fof(f49,plain,
    ! [X2] :
      ( ~ member(X2,sK2)
      | sK3 = X2
      | ~ apply(sK0,sK3,X2)
      | ~ member(sK3,sK2) ),
    inference(duplicate_literal_removal,[],[f47]) ).

fof(f47,plain,
    ! [X2] :
      ( sK3 = X2
      | ~ member(sK3,sK2)
      | ~ member(X2,sK2)
      | ~ member(X2,sK2)
      | ~ apply(sK0,sK3,X2) ),
    inference(resolution,[],[f38,f43]) ).

fof(f43,plain,
    ! [X0] :
      ( apply(sK0,X0,sK3)
      | ~ member(X0,sK2) ),
    inference(resolution,[],[f33,f30]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ~ apply(sK0,X0,X1)
      | X0 = X1
      | ~ apply(sK0,X1,X0)
      | ~ member(X0,sK2)
      | ~ member(X1,sK2) ),
    inference(resolution,[],[f34,f37]) ).

fof(f37,plain,
    ! [X2,X3,X0,X1] :
      ( ~ order(X1,X0)
      | ~ apply(X1,X3,X2)
      | ~ apply(X1,X2,X3)
      | X2 = X3
      | ~ member(X2,X0)
      | ~ member(X3,X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ~ order(X1,X0)
      | ( ! [X2,X3] :
            ( ~ apply(X1,X2,X3)
            | ~ member(X2,X0)
            | ~ apply(X1,X3,X2)
            | X2 = X3
            | ~ member(X3,X0) )
        & ! [X4] :
            ( ~ member(X4,X0)
            | apply(X1,X4,X4) )
        & ! [X5,X6,X7] :
            ( apply(X1,X5,X7)
            | ~ member(X5,X0)
            | ~ member(X6,X0)
            | ~ member(X7,X0)
            | ~ apply(X1,X5,X6)
            | ~ apply(X1,X6,X7) ) ) ),
    inference(rectify,[],[f19]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ order(X1,X0)
      | ( ! [X4,X3] :
            ( ~ apply(X1,X4,X3)
            | ~ member(X4,X0)
            | ~ apply(X1,X3,X4)
            | X3 = X4
            | ~ member(X3,X0) )
        & ! [X2] :
            ( ~ member(X2,X0)
            | apply(X1,X2,X2) )
        & ! [X6,X5,X7] :
            ( apply(X1,X6,X7)
            | ~ member(X6,X0)
            | ~ member(X5,X0)
            | ~ member(X7,X0)
            | ~ apply(X1,X6,X5)
            | ~ apply(X1,X5,X7) ) ) ),
    inference(flattening,[],[f18]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ( ! [X5,X6,X7] :
            ( apply(X1,X6,X7)
            | ~ apply(X1,X6,X5)
            | ~ apply(X1,X5,X7)
            | ~ member(X7,X0)
            | ~ member(X6,X0)
            | ~ member(X5,X0) )
        & ! [X2] :
            ( ~ member(X2,X0)
            | apply(X1,X2,X2) )
        & ! [X3,X4] :
            ( X3 = X4
            | ~ apply(X1,X4,X3)
            | ~ apply(X1,X3,X4)
            | ~ member(X4,X0)
            | ~ member(X3,X0) ) )
      | ~ order(X1,X0) ),
    inference(ennf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( order(X1,X0)
     => ( ! [X5,X6,X7] :
            ( ( member(X7,X0)
              & member(X6,X0)
              & member(X5,X0) )
           => ( ( apply(X1,X6,X5)
                & apply(X1,X5,X7) )
             => apply(X1,X6,X7) ) )
        & ! [X2] :
            ( member(X2,X0)
           => apply(X1,X2,X2) )
        & ! [X3,X4] :
            ( ( member(X4,X0)
              & member(X3,X0) )
           => ( ( apply(X1,X4,X3)
                & apply(X1,X3,X4) )
             => X3 = X4 ) ) ) ),
    inference(unused_predicate_definition_removal,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ( ! [X5,X6,X7] :
            ( ( member(X7,X0)
              & member(X6,X0)
              & member(X5,X0) )
           => ( ( apply(X1,X6,X5)
                & apply(X1,X5,X7) )
             => apply(X1,X6,X7) ) )
        & ! [X2] :
            ( member(X2,X0)
           => apply(X1,X2,X2) )
        & ! [X3,X4] :
            ( ( member(X4,X0)
              & member(X3,X0) )
           => ( ( apply(X1,X4,X3)
                & apply(X1,X3,X4) )
             => X3 = X4 ) ) )
    <=> order(X1,X0) ),
    inference(rectify,[],[f1]) ).

fof(f1,axiom,
    ! [X1,X0] :
      ( order(X0,X1)
    <=> ( ! [X2] :
            ( member(X2,X1)
           => apply(X0,X2,X2) )
        & ! [X2,X3] :
            ( ( member(X2,X1)
              & member(X3,X1) )
           => ( ( apply(X0,X3,X2)
                & apply(X0,X2,X3) )
             => X2 = X3 ) )
        & ! [X3,X2,X4] :
            ( ( member(X4,X1)
              & member(X2,X1)
              & member(X3,X1) )
           => ( ( apply(X0,X2,X3)
                & apply(X0,X3,X4) )
             => apply(X0,X2,X4) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).

fof(f34,plain,
    order(sK0,sK2),
    inference(cnf_transformation,[],[f27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : SET789+4 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.09/0.31  % Computer : n025.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit   : 300
% 0.09/0.31  % WCLimit    : 300
% 0.09/0.31  % DateTime   : Tue Aug 30 14:29:15 EDT 2022
% 0.09/0.31  % CPUTime    : 
% 0.15/0.46  % (19353)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.46  % (19344)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.15/0.46  % (19353)Instruction limit reached!
% 0.15/0.46  % (19353)------------------------------
% 0.15/0.46  % (19353)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.46  % (19344)First to succeed.
% 0.15/0.47  % (19345)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.47  % (19353)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47  % (19353)Termination reason: Unknown
% 0.15/0.47  % (19353)Termination phase: Saturation
% 0.15/0.47  
% 0.15/0.47  % (19353)Memory used [KB]: 5884
% 0.15/0.47  % (19353)Time elapsed: 0.087 s
% 0.15/0.47  % (19353)Instructions burned: 3 (million)
% 0.15/0.47  % (19353)------------------------------
% 0.15/0.47  % (19353)------------------------------
% 0.15/0.47  % (19344)Refutation found. Thanks to Tanya!
% 0.15/0.47  % SZS status Theorem for theBenchmark
% 0.15/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47  % (19344)------------------------------
% 0.15/0.47  % (19344)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47  % (19344)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47  % (19344)Termination reason: Refutation
% 0.15/0.47  
% 0.15/0.47  % (19344)Memory used [KB]: 1407
% 0.15/0.47  % (19344)Time elapsed: 0.081 s
% 0.15/0.47  % (19344)Instructions burned: 2 (million)
% 0.15/0.47  % (19344)------------------------------
% 0.15/0.47  % (19344)------------------------------
% 0.15/0.47  % (19338)Success in time 0.15 s
%------------------------------------------------------------------------------