↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : ANA097^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 07:46:03 AM UTC 2026

% Result   : Theorem 0.25s 0.33s
% Output   : Refutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :  236 (  57 equ;   0 cnn)
%            Maximal formula atoms :    4 (   7 avg)
%            Number of connectives :  754 (  27   ~;  18   |;  13   &; 686   @)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   64 (  64   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  12 usr;   2 con; 0-5 aty)
%            Number of variables   :   78 (   0   ^;  70   !;   8   ?;  78   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    'type/realax/real': $tType ).

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(type_def_7,type,
    sK0: $tType ).

thf(func_def_0,type,
    'const/sets/UNION': 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).

thf(func_def_1,type,
    'const/sets/INTER': 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).

thf(func_def_2,type,
    'const/sets/FINITE': 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_3,type,
    'const/realax/real_add': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).

thf(func_def_4,type,
    'const/iterate/sum': 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).

thf(func_def_5,type,
    'const/iterate/monoidal': 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).

thf(func_def_6,type,
    'const/iterate/iterate': 
      !>[X0: $tType,X1: $tType] : ( ( X1 > X1 > X1 ) > ( X0 > $o ) > ( X0 > X1 ) > X1 ) ).

thf(func_def_10,type,
    sK1: sK0 > $o ).

thf(func_def_11,type,
    sK2: sK0 > $o ).

thf(func_def_12,type,
    sK3: sK0 > 'type/realax/real' ).

thf(func_def_13,type,
    vNOT: $o > $o ).

thf(f1,axiom,
    ! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
      ( ( 'const/iterate/monoidal' @ X1 @ X2 )
     => ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
          ( ( ( 'const/sets/FINITE' @ X0 @ X4 )
            & ( 'const/sets/FINITE' @ X0 @ X3 ) )
         => ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
            = ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/ITERATE_INCL_EXCL_') ).

thf(f2,axiom,
    'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/MONOIDAL_REAL_ADD_') ).

thf(f3,axiom,
    ! [X0: $tType] :
      ( 'const/iterate/sum'
      @ ( X0
        = ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/sum_') ).

thf(f4,conjecture,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
      ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
        & ( 'const/sets/FINITE' @ X0 @ X1 ) )
     => ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
        = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/SUM_INCL_EXCL_') ).

thf(f5,negated_conjecture,
    ~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
        ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
          & ( 'const/sets/FINITE' @ X0 @ X1 ) )
       => ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
          = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

thf(f6,plain,
    ! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
      ( ( 'const/iterate/monoidal' @ X1 @ X2 )
     => ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
          ( ( ( 'const/sets/FINITE' @ X0 @ X4 )
            & ( 'const/sets/FINITE' @ X0 @ X3 ) )
         => ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
            = ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) ) ) ),
    inference(rectify,[],[f1]) ).

thf(f7,plain,
    ! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
      ( ( ( 'const/iterate/monoidal' @ X1 @ X2 )
        = $true )
     => ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
          ( ( ( ( 'const/sets/FINITE' @ X0 @ X4 )
              = $true )
            & ( ( 'const/sets/FINITE' @ X0 @ X3 )
              = $true ) )
         => ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
            = ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) ) ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
    inference(rectify,[],[f2]) ).

thf(f9,plain,
    ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
    = $true ),
    inference(fool_elimination,[],[f8]) ).

thf(f10,plain,
    ~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
        ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
          & ( 'const/sets/FINITE' @ X0 @ X1 ) )
       => ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
          = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) ),
    inference(rectify,[],[f5]) ).

thf(f11,plain,
    ~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
        ( ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
            = $true )
          & ( ( 'const/sets/FINITE' @ X0 @ X1 )
            = $true ) )
       => ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
          = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) ),
    inference(fool_elimination,[],[f10]) ).

thf(f12,plain,
    ! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
      ( ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
          ( ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
            = ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) )
          | ( ( 'const/sets/FINITE' @ X0 @ X4 )
           != $true )
          | ( ( 'const/sets/FINITE' @ X0 @ X3 )
           != $true ) )
      | ( ( 'const/iterate/monoidal' @ X1 @ X2 )
       != $true ) ),
    inference(ennf_transformation,[],[f7]) ).

thf(f13,plain,
    ! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
      ( ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
          ( ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
            = ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) )
          | ( ( 'const/sets/FINITE' @ X0 @ X4 )
           != $true )
          | ( ( 'const/sets/FINITE' @ X0 @ X3 )
           != $true ) )
      | ( ( 'const/iterate/monoidal' @ X1 @ X2 )
       != $true ) ),
    inference(flattening,[],[f12]) ).

thf(f14,plain,
    ? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
      ( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
       != ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) )
      & ( ( 'const/sets/FINITE' @ X0 @ X2 )
        = $true )
      & ( ( 'const/sets/FINITE' @ X0 @ X1 )
        = $true ) ),
    inference(ennf_transformation,[],[f11]) ).

thf(f15,plain,
    ? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
      ( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
       != ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) )
      & ( ( 'const/sets/FINITE' @ X0 @ X2 )
        = $true )
      & ( ( 'const/sets/FINITE' @ X0 @ X1 )
        = $true ) ),
    inference(flattening,[],[f14]) ).

thf(f16,plain,
    ( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK1 @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK3 ) )
     != ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ) )
    & ( $true
      = ( 'const/sets/FINITE' @ sK0 @ sK2 ) )
    & ( $true
      = ( 'const/sets/FINITE' @ sK0 @ sK1 ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f15]) ).

thf(f17,plain,
    ! [X1: $tType,X0: $tType,X2: X1 > X1 > X1,X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
      ( ( ( 'const/sets/FINITE' @ X0 @ X4 )
       != $true )
      | ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
        = ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) )
      | ( ( 'const/sets/FINITE' @ X0 @ X3 )
       != $true )
      | ( ( 'const/iterate/monoidal' @ X1 @ X2 )
       != $true ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f18,plain,
    ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
    = $true ),
    inference(cnf_transformation,[],[f9]) ).

thf(f19,plain,
    ! [X0: $tType] :
      ( 'const/iterate/sum'
      @ ( X0
        = ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
    inference(cnf_transformation,[],[f3]) ).

thf(f20,plain,
    ( $true
    = ( 'const/sets/FINITE' @ sK0 @ sK1 ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f21,plain,
    ( $true
    = ( 'const/sets/FINITE' @ sK0 @ sK2 ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f22,plain,
    ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK1 @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK3 ) )
   != ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f25,plain,
    ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK1 @ sK3 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK3 ) )
   != ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ sK3 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ) ),
    inference(definition_unfolding,[],[f22,f19,f19,f19,f19]) ).

thf(f34,plain,
    ! [X0: $tType,X2: sK0 > $o,X3: sK0 > X0,X1: X0 > X0 > X0] :
      ( ( $true != $true )
      | ( ( X1 @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ X2 @ X3 ) @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ sK2 @ X3 ) )
        = ( X1 @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ ( 'const/sets/UNION' @ sK0 @ X2 @ sK2 ) @ X3 ) @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ ( 'const/sets/INTER' @ sK0 @ X2 @ sK2 ) @ X3 ) ) )
      | ( $true
       != ( 'const/sets/FINITE' @ sK0 @ X2 ) )
      | ( $true
       != ( 'const/iterate/monoidal' @ X0 @ X1 ) ) ),
    inference(constrained_superposition,[],[f17,f21]) ).

thf(f37,plain,
    ! [X0: $tType,X2: sK0 > $o,X3: sK0 > X0,X1: X0 > X0 > X0] :
      ( ( $true
       != ( 'const/sets/FINITE' @ sK0 @ X2 ) )
      | ( ( X1 @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ X2 @ X3 ) @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ sK2 @ X3 ) )
        = ( X1 @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ ( 'const/sets/UNION' @ sK0 @ X2 @ sK2 ) @ X3 ) @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ ( 'const/sets/INTER' @ sK0 @ X2 @ sK2 ) @ X3 ) ) )
      | ( $true
       != ( 'const/iterate/monoidal' @ X0 @ X1 ) ) ),
    inference(trivial_inequality_removal,[],[f34]) ).

thf(f39,plain,
    ! [X0: $tType,X2: sK0 > X0,X1: X0 > X0 > X0] :
      ( ( $true != $true )
      | ( ( X1 @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ sK1 @ X2 ) @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ sK2 @ X2 ) )
        = ( X1 @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ X2 ) @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ X2 ) ) )
      | ( $true
       != ( 'const/iterate/monoidal' @ X0 @ X1 ) ) ),
    inference(constrained_superposition,[],[f37,f20]) ).

thf(f44,plain,
    ! [X0: $tType,X2: sK0 > X0,X1: X0 > X0 > X0] :
      ( ( $true
       != ( 'const/iterate/monoidal' @ X0 @ X1 ) )
      | ( ( X1 @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ sK1 @ X2 ) @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ sK2 @ X2 ) )
        = ( X1 @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ X2 ) @ ( 'const/iterate/iterate' @ sK0 @ X0 @ X1 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ X2 ) ) ) ),
    inference(trivial_inequality_removal,[],[f39]) ).

thf(f61,plain,
    ! [X0: sK0 > 'type/realax/real'] :
      ( ( $true != $true )
      | ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK1 @ X0 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ X0 ) )
        = ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ X0 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ X0 ) ) ) ),
    inference(constrained_superposition,[],[f44,f18]) ).

thf(f64,plain,
    ! [X0: sK0 > 'type/realax/real'] :
      ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK1 @ X0 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ X0 ) )
      = ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ X0 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ X0 ) ) ),
    inference(trivial_inequality_removal,[],[f61]) ).

thf(f69,plain,
    ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK1 @ sK3 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK3 ) )
   != ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK1 @ sK3 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK3 ) ) ),
    inference(constrained_superposition,[],[f25,f64]) ).

thf(f70,plain,
    $false,
    inference(trivial_inequality_removal,[],[f69]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ANA097^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23  % Computer : n017.cluster.edu
% 0.09/0.23  % Model    : x86_64 x86_64
% 0.09/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.23  % Memory   : 8046.5625MB
% 0.09/0.23  % OS       : Linux 6.8.0-71-generic
% 0.09/0.23  % CPULimit : 300
% 0.09/0.23  % WCLimit  : 300
% 0.09/0.23  % DateTime : Tue Sep 29 17:36:52 UTC 2026
% 0.09/0.23  % CPUTime  : 
% 0.09/0.23  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.28  Running first-order model finding
% 0.25/0.28  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.25/0.33  % (658057)Will run a generic schedule for satisfiability detection.
% 0.25/0.33  % (658062)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1182124072_2999 on theBenchmark for (2999ds/0Mi)
% 0.25/0.33  % Exception at run slice level
% 0.25/0.33  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.25/0.33  % (658067)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1553229216:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.25/0.33  % (658063)% WARNING: option uhcvi not known.
% 0.25/0.33  % (658067) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-658057-658067"...
% 0.25/0.33  % (658065)dis+10_1_sil=32000:sp=arity:random_seed=3380216336:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.25/0.33  % (658064)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4195672950:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.33  % (658066)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1778300353:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.33  % (658063)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3505135435:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.25/0.33  % (658066)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.25/0.33  % (658063)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.25/0.33  % (658068)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=416747408:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.25/0.33  % (658063)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.25/0.33  % (658067)...printing done.
% 0.25/0.33  % (658067)Refutation found. Thanks to Tanya!
% 0.25/0.33  % SZS status Theorem for theBenchmark
% 0.25/0.33  % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.33  % (658067)------------------------------
% 0.25/0.33  % (658067)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.33  % (658067)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.33  % (658067)CaDiCaL version: 2.1.3
% 0.25/0.33  % (658067)Termination reason: Refutation
% 0.25/0.33  % (658067)Time elapsed: 0.012 s
% 0.25/0.33  % (658067)Peak memory usage: 12 MB
% 0.25/0.33  % (658067)Instructions burned: 13 (million)
% 0.25/0.33  % (658057)Success in time 0.039 s
% 0.25/0.33  % Vampire exiting
%------------------------------------------------------------------------------