TSTP Solution File: NUM394+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM394+1 : 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_sat --cores 0 -t %d %s

% Computer : n028.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:04:58 EDT 2022

% Result   : Theorem 0.18s 0.50s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   59 (  17 unt;   3 typ;   0 def)
%            Number of atoms       :  171 (  12 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  190 (  75   ~;  62   |;  34   &)
%                                         (   6 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    4 (   0 usr;   3 ari)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   65 (  54   !;  11   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_15,type,
    sQ16_eqProxy: ( $int * $int ) > $o ).

tff(pred_def_16,type,
    sQ17_eqProxy: ( $rat * $rat ) > $o ).

tff(pred_def_17,type,
    sQ18_eqProxy: ( $real * $real ) > $o ).

fof(f414,plain,
    $false,
    inference(subsumption_resolution,[],[f397,f186]) ).

fof(f186,plain,
    ! [X0] : subset(X0,X0),
    inference(literal_reordering,[],[f137]) ).

fof(f137,plain,
    ! [X0] : subset(X0,X0),
    inference(cnf_transformation,[],[f88]) ).

fof(f88,plain,
    ! [X0] : subset(X0,X0),
    inference(rectify,[],[f45]) ).

fof(f45,plain,
    ! [X1] : subset(X1,X1),
    inference(rectify,[],[f26]) ).

fof(f26,axiom,
    ! [X1,X0] : subset(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

fof(f397,plain,
    ~ subset(sK3,sK3),
    inference(backward_demodulation,[],[f297,f393]) ).

fof(f393,plain,
    sK3 = sK4,
    inference(subsumption_resolution,[],[f392,f233]) ).

fof(f233,plain,
    ordinal(sK4),
    inference(literal_reordering,[],[f138]) ).

fof(f138,plain,
    ordinal(sK4),
    inference(cnf_transformation,[],[f91]) ).

fof(f91,plain,
    ( ordinal(sK3)
    & ~ in(sK4,sK3)
    & ~ ordinal_subset(sK3,sK4)
    & ordinal(sK4) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f61,f90,f89]) ).

fof(f89,plain,
    ( ? [X0] :
        ( ordinal(X0)
        & ? [X1] :
            ( ~ in(X1,X0)
            & ~ ordinal_subset(X0,X1)
            & ordinal(X1) ) )
   => ( ordinal(sK3)
      & ? [X1] :
          ( ~ in(X1,sK3)
          & ~ ordinal_subset(sK3,X1)
          & ordinal(X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f90,plain,
    ( ? [X1] :
        ( ~ in(X1,sK3)
        & ~ ordinal_subset(sK3,X1)
        & ordinal(X1) )
   => ( ~ in(sK4,sK3)
      & ~ ordinal_subset(sK3,sK4)
      & ordinal(sK4) ) ),
    introduced(choice_axiom,[]) ).

fof(f61,plain,
    ? [X0] :
      ( ordinal(X0)
      & ? [X1] :
          ( ~ in(X1,X0)
          & ~ ordinal_subset(X0,X1)
          & ordinal(X1) ) ),
    inference(flattening,[],[f60]) ).

fof(f60,plain,
    ? [X0] :
      ( ? [X1] :
          ( ~ in(X1,X0)
          & ~ ordinal_subset(X0,X1)
          & ordinal(X1) )
      & ordinal(X0) ),
    inference(ennf_transformation,[],[f30]) ).

fof(f30,negated_conjecture,
    ~ ! [X0] :
        ( ordinal(X0)
       => ! [X1] :
            ( ordinal(X1)
           => ( in(X1,X0)
              | ordinal_subset(X0,X1) ) ) ),
    inference(negated_conjecture,[],[f29]) ).

fof(f29,conjecture,
    ! [X0] :
      ( ordinal(X0)
     => ! [X1] :
          ( ordinal(X1)
         => ( in(X1,X0)
            | ordinal_subset(X0,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_ordinal1) ).

fof(f392,plain,
    ( ~ ordinal(sK4)
    | sK3 = sK4 ),
    inference(resolution,[],[f374,f198]) ).

fof(f198,plain,
    ! [X0] :
      ( epsilon_transitive(X0)
      | ~ ordinal(X0) ),
    inference(literal_reordering,[],[f152]) ).

fof(f152,plain,
    ! [X0] :
      ( epsilon_transitive(X0)
      | ~ ordinal(X0) ),
    inference(cnf_transformation,[],[f79]) ).

fof(f79,plain,
    ! [X0] :
      ( ~ ordinal(X0)
      | ( epsilon_connected(X0)
        & epsilon_transitive(X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0] :
      ( ordinal(X0)
     => ( epsilon_connected(X0)
        & epsilon_transitive(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).

fof(f374,plain,
    ( ~ epsilon_transitive(sK4)
    | sK3 = sK4 ),
    inference(subsumption_resolution,[],[f371,f297]) ).

fof(f371,plain,
    ( sK3 = sK4
    | subset(sK3,sK4)
    | ~ epsilon_transitive(sK4) ),
    inference(resolution,[],[f338,f210]) ).

fof(f210,plain,
    ! [X0,X1] :
      ( ~ in(X1,X0)
      | subset(X1,X0)
      | ~ epsilon_transitive(X0) ),
    inference(literal_reordering,[],[f171]) ).

fof(f171,plain,
    ! [X0,X1] :
      ( ~ in(X1,X0)
      | subset(X1,X0)
      | ~ epsilon_transitive(X0) ),
    inference(cnf_transformation,[],[f115]) ).

fof(f115,plain,
    ! [X0] :
      ( ( ! [X1] :
            ( subset(X1,X0)
            | ~ in(X1,X0) )
        | ~ epsilon_transitive(X0) )
      & ( epsilon_transitive(X0)
        | ( ~ subset(sK12(X0),X0)
          & in(sK12(X0),X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f113,f114]) ).

fof(f114,plain,
    ! [X0] :
      ( ? [X2] :
          ( ~ subset(X2,X0)
          & in(X2,X0) )
     => ( ~ subset(sK12(X0),X0)
        & in(sK12(X0),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f113,plain,
    ! [X0] :
      ( ( ! [X1] :
            ( subset(X1,X0)
            | ~ in(X1,X0) )
        | ~ epsilon_transitive(X0) )
      & ( epsilon_transitive(X0)
        | ? [X2] :
            ( ~ subset(X2,X0)
            & in(X2,X0) ) ) ),
    inference(rectify,[],[f112]) ).

fof(f112,plain,
    ! [X0] :
      ( ( ! [X1] :
            ( subset(X1,X0)
            | ~ in(X1,X0) )
        | ~ epsilon_transitive(X0) )
      & ( epsilon_transitive(X0)
        | ? [X1] :
            ( ~ subset(X1,X0)
            & in(X1,X0) ) ) ),
    inference(nnf_transformation,[],[f63]) ).

fof(f63,plain,
    ! [X0] :
      ( ! [X1] :
          ( subset(X1,X0)
          | ~ in(X1,X0) )
    <=> epsilon_transitive(X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0] :
      ( epsilon_transitive(X0)
    <=> ! [X1] :
          ( in(X1,X0)
         => subset(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).

fof(f338,plain,
    ( in(sK3,sK4)
    | sK3 = sK4 ),
    inference(subsumption_resolution,[],[f335,f193]) ).

fof(f193,plain,
    ~ in(sK4,sK3),
    inference(literal_reordering,[],[f140]) ).

fof(f140,plain,
    ~ in(sK4,sK3),
    inference(cnf_transformation,[],[f91]) ).

fof(f335,plain,
    ( sK3 = sK4
    | in(sK4,sK3)
    | in(sK3,sK4) ),
    inference(resolution,[],[f306,f233]) ).

fof(f306,plain,
    ! [X0] :
      ( ~ ordinal(X0)
      | in(sK3,X0)
      | in(X0,sK3)
      | sK3 = X0 ),
    inference(resolution,[],[f216,f226]) ).

fof(f226,plain,
    ordinal(sK3),
    inference(literal_reordering,[],[f141]) ).

fof(f141,plain,
    ordinal(sK3),
    inference(cnf_transformation,[],[f91]) ).

fof(f216,plain,
    ! [X0,X1] :
      ( ~ ordinal(X1)
      | in(X1,X0)
      | ~ ordinal(X0)
      | X0 = X1
      | in(X0,X1) ),
    inference(literal_reordering,[],[f134]) ).

fof(f134,plain,
    ! [X0,X1] :
      ( ~ ordinal(X1)
      | in(X1,X0)
      | X0 = X1
      | in(X0,X1)
      | ~ ordinal(X0) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f59,plain,
    ! [X0] :
      ( ! [X1] :
          ( in(X1,X0)
          | in(X0,X1)
          | ~ ordinal(X1)
          | X0 = X1 )
      | ~ ordinal(X0) ),
    inference(flattening,[],[f58]) ).

fof(f58,plain,
    ! [X0] :
      ( ! [X1] :
          ( in(X1,X0)
          | X0 = X1
          | in(X0,X1)
          | ~ ordinal(X1) )
      | ~ ordinal(X0) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f28,axiom,
    ! [X0] :
      ( ordinal(X0)
     => ! [X1] :
          ( ordinal(X1)
         => ~ ( ~ in(X1,X0)
              & X0 != X1
              & ~ in(X0,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_ordinal1) ).

fof(f297,plain,
    ~ subset(sK3,sK4),
    inference(subsumption_resolution,[],[f296,f226]) ).

fof(f296,plain,
    ( ~ ordinal(sK3)
    | ~ subset(sK3,sK4) ),
    inference(subsumption_resolution,[],[f295,f233]) ).

fof(f295,plain,
    ( ~ ordinal(sK4)
    | ~ subset(sK3,sK4)
    | ~ ordinal(sK3) ),
    inference(resolution,[],[f201,f204]) ).

fof(f204,plain,
    ~ ordinal_subset(sK3,sK4),
    inference(literal_reordering,[],[f139]) ).

fof(f139,plain,
    ~ ordinal_subset(sK3,sK4),
    inference(cnf_transformation,[],[f91]) ).

fof(f201,plain,
    ! [X0,X1] :
      ( ordinal_subset(X1,X0)
      | ~ ordinal(X0)
      | ~ subset(X1,X0)
      | ~ ordinal(X1) ),
    inference(literal_reordering,[],[f157]) ).

fof(f157,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | ~ ordinal(X1)
      | ordinal_subset(X1,X0)
      | ~ ordinal(X0) ),
    inference(cnf_transformation,[],[f103]) ).

fof(f103,plain,
    ! [X0,X1] :
      ( ( ( subset(X1,X0)
          | ~ ordinal_subset(X1,X0) )
        & ( ordinal_subset(X1,X0)
          | ~ subset(X1,X0) ) )
      | ~ ordinal(X1)
      | ~ ordinal(X0) ),
    inference(nnf_transformation,[],[f65]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
      <=> ordinal_subset(X1,X0) )
      | ~ ordinal(X1)
      | ~ ordinal(X0) ),
    inference(flattening,[],[f64]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
      <=> ordinal_subset(X1,X0) )
      | ~ ordinal(X1)
      | ~ ordinal(X0) ),
    inference(ennf_transformation,[],[f46]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ( ordinal(X1)
        & ordinal(X0) )
     => ( subset(X1,X0)
      <=> ordinal_subset(X1,X0) ) ),
    inference(rectify,[],[f24]) ).

fof(f24,axiom,
    ! [X1,X0] :
      ( ( ordinal(X1)
        & ordinal(X0) )
     => ( subset(X0,X1)
      <=> ordinal_subset(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 06:37:18 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.46  % (1084)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.18/0.46  % (1110)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.18/0.49  % (1110)First to succeed.
% 0.18/0.49  % (1101)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.49  % (1092)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.50  % (1094)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.18/0.50  % (1086)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.50  % (1110)Refutation found. Thanks to Tanya!
% 0.18/0.50  % SZS status Theorem for theBenchmark
% 0.18/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50  % (1110)------------------------------
% 0.18/0.50  % (1110)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50  % (1110)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50  % (1110)Termination reason: Refutation
% 0.18/0.50  
% 0.18/0.50  % (1110)Memory used [KB]: 5884
% 0.18/0.50  % (1110)Time elapsed: 0.010 s
% 0.18/0.50  % (1110)Instructions burned: 10 (million)
% 0.18/0.50  % (1110)------------------------------
% 0.18/0.50  % (1110)------------------------------
% 0.18/0.50  % (1078)Success in time 0.165 s
%------------------------------------------------------------------------------