↑ Up

Leo-III---1.8.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : ANA095^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39

% Computer : n010.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:45:46 AM UTC 2026

% Result   : Theorem 126.24s 102.46s
% Output   : Refutation 126.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   34 (  15 unt;   0 typ;   3 def)
%            Number of atoms       :  180 (  35 equ;   0 cnn)
%            Maximal formula atoms :    8 (   5 avg)
%            Number of connectives :  672 (  43   ~;  34   |;  19   &; 566   @)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   62 (  62   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  10 usr;   2 con; 0-5 aty)
%            Number of variables   :   80 (   0   ^;  77   !;   0   ?;  80   :)
%                                         (   0  !>;   0  ?*;   0  @-;   3  @+)

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

thf(skt1_type,type,
    skt1: $tType ).

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

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

thf('const/sets/DISJOINT_decl',type,
    'const/sets/DISJOINT': 
      !>[TA: $tType] : ( ( TA > $o ) > ( TA > $o ) > $o ) ).

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

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

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

thf('const/iterate/iterate_decl',type,
    'const/iterate/iterate': 
      !>[TA: $tType,TB: $tType] : ( ( TA > TA > TA ) > ( TB > $o ) > ( TB > TA ) > TA ) ).

thf(sk1_decl,type,
    sk1: skt1 > 'type/realax/real' ).

thf(sk2_decl,type,
    sk2: skt1 > $o ).

thf(sk3_decl,type,
    sk3: skt1 > $o ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: skt1 > 'type/realax/real'] :
          ~ ! [B: skt1 > $o,C: skt1 > $o] :
              ( ( ( 'const/sets/FINITE' @ skt1 @ B )
                & ( 'const/sets/FINITE' @ skt1 @ C )
                & ( 'const/sets/DISJOINT' @ skt1 @ B @ C ) )
             => ( ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ B @ C ) @ A )
                = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ skt1 @ B @ A ) @ ( 'const/iterate/sum' @ skt1 @ C @ A ) ) ) ) ) ) ).

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: skt1 > $o] :
          ~ ! [B: skt1 > $o] :
              ( ( ( 'const/sets/FINITE' @ skt1 @ A )
                & ( 'const/sets/FINITE' @ skt1 @ B )
                & ( 'const/sets/DISJOINT' @ skt1 @ A @ B ) )
             => ( ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ A @ B ) @ sk1 )
                = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ skt1 @ A @ sk1 ) @ ( 'const/iterate/sum' @ skt1 @ B @ sk1 ) ) ) ) ) ) ).

thf(sk3_def,definition,
    ( sk3
    = ( @+[A: skt1 > $o] :
          ~ ( ( ( 'const/sets/FINITE' @ skt1 @ sk2 )
              & ( 'const/sets/FINITE' @ skt1 @ A )
              & ( 'const/sets/DISJOINT' @ skt1 @ sk2 @ A ) )
           => ( ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ sk2 @ A ) @ sk1 )
              = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ skt1 @ sk2 @ sk1 ) @ ( 'const/iterate/sum' @ skt1 @ A @ sk1 ) ) ) ) ) ) ).

thf(1,conjecture,
    ! [TA: $tType,A: TA > 'type/realax/real',B: TA > $o,C: TA > $o] :
      ( ( ( 'const/sets/FINITE' @ TA @ B )
        & ( 'const/sets/FINITE' @ TA @ C )
        & ( 'const/sets/DISJOINT' @ TA @ B @ C ) )
     => ( ( 'const/iterate/sum' @ TA @ ( 'const/sets/UNION' @ TA @ B @ C ) @ A )
        = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ TA @ B @ A ) @ ( 'const/iterate/sum' @ TA @ C @ A ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/SUM_UNION_') ).

thf(2,negated_conjecture,
    ~ ! [TA: $tType,A: TA > 'type/realax/real',B: TA > $o,C: TA > $o] :
        ( ( ( 'const/sets/FINITE' @ TA @ B )
          & ( 'const/sets/FINITE' @ TA @ C )
          & ( 'const/sets/DISJOINT' @ TA @ B @ C ) )
       => ( ( 'const/iterate/sum' @ TA @ ( 'const/sets/UNION' @ TA @ B @ C ) @ A )
          = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ TA @ B @ A ) @ ( 'const/iterate/sum' @ TA @ C @ A ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(6,plain,
    ~ ! [TA: $tType,A: TA > 'type/realax/real',B: TA > $o,C: TA > $o] :
        ( ( ( 'const/sets/FINITE' @ TA @ B )
          & ( 'const/sets/FINITE' @ TA @ C )
          & ( 'const/sets/DISJOINT' @ TA @ B @ C ) )
       => ( ( 'const/iterate/sum' @ TA @ ( 'const/sets/UNION' @ TA @ B @ C ) @ A )
          = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ TA @ B @ A ) @ ( 'const/iterate/sum' @ TA @ C @ A ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7,plain,
    ( ( 'const/sets/FINITE' @ skt1 @ sk2 )
    & ( 'const/sets/FINITE' @ skt1 @ sk3 )
    & ( 'const/sets/DISJOINT' @ skt1 @ sk2 @ sk3 )
    & ( ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ sk2 @ sk3 ) @ sk1 )
     != ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ skt1 @ sk2 @ sk1 ) @ ( 'const/iterate/sum' @ skt1 @ sk3 @ sk1 ) ) ) ),
    inference(cnf,[status(esa)],[6]) ).

thf(11,plain,
    ( ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ sk2 @ sk3 ) @ sk1 )
   != ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ skt1 @ sk2 @ sk1 ) @ ( 'const/iterate/sum' @ skt1 @ sk3 @ sk1 ) ) ),
    inference(cnfConj,[status(thm)],[7]) ).

thf(12,plain,
    ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ skt1 @ sk2 @ sk1 ) @ ( 'const/iterate/sum' @ skt1 @ sk3 @ sk1 ) )
   != ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ sk2 @ sk3 ) @ sk1 ) ),
    inference(lifteq,[status(thm)],[11]) ).

thf(10,plain,
    'const/sets/DISJOINT' @ skt1 @ sk2 @ sk3,
    inference(cnfConj,[status(thm)],[7]) ).

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

thf(19,plain,
    'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(4,axiom,
    ! [TA: $tType,TB: $tType,A: TA > TA > TA] :
      ( ( 'const/iterate/monoidal' @ TA @ A )
     => ! [B: TB > TA,C: TB > $o,D: TB > $o] :
          ( ( ( 'const/sets/FINITE' @ TB @ C )
            & ( 'const/sets/FINITE' @ TB @ D )
            & ( 'const/sets/DISJOINT' @ TB @ C @ D ) )
         => ( ( 'const/iterate/iterate' @ TB @ TA @ A @ ( 'const/sets/UNION' @ TB @ C @ D ) @ B )
            = ( A @ ( 'const/iterate/iterate' @ TB @ TA @ A @ C @ B ) @ ( 'const/iterate/iterate' @ TB @ TA @ A @ D @ B ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/ITERATE_UNION_') ).

thf(16,plain,
    ! [TA: $tType,TB: $tType,A: TA > TA > TA] :
      ( ( 'const/iterate/monoidal' @ TA @ A )
     => ! [B: TB > TA,C: TB > $o,D: TB > $o] :
          ( ( ( 'const/sets/FINITE' @ TB @ C )
            & ( 'const/sets/FINITE' @ TB @ D )
            & ( 'const/sets/DISJOINT' @ TB @ C @ D ) )
         => ( ( 'const/iterate/iterate' @ TB @ TA @ A @ ( 'const/sets/UNION' @ TB @ C @ D ) @ B )
            = ( A @ ( 'const/iterate/iterate' @ TB @ TA @ A @ C @ B ) @ ( 'const/iterate/iterate' @ TB @ TA @ A @ D @ B ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(17,plain,
    ! [TA: $tType,TB: $tType,D: TA > $o,C: TA > $o,B: TA > TB,A: TB > TB > TB] :
      ( ~ ( 'const/iterate/monoidal' @ TB @ A )
      | ~ ( 'const/sets/FINITE' @ TA @ C )
      | ~ ( 'const/sets/FINITE' @ TA @ D )
      | ~ ( 'const/sets/DISJOINT' @ TA @ C @ D )
      | ( ( 'const/iterate/iterate' @ TA @ TB @ A @ ( 'const/sets/UNION' @ TA @ C @ D ) @ B )
        = ( A @ ( 'const/iterate/iterate' @ TA @ TB @ A @ C @ B ) @ ( 'const/iterate/iterate' @ TA @ TB @ A @ D @ B ) ) ) ),
    inference(cnf,[status(esa)],[16]) ).

thf(18,plain,
    ! [TA: $tType,TB: $tType,D: TA > $o,C: TA > $o,B: TA > TB,A: TB > TB > TB] :
      ( ( ( 'const/iterate/iterate' @ TA @ TB @ A @ ( 'const/sets/UNION' @ TA @ C @ D ) @ B )
        = ( A @ ( 'const/iterate/iterate' @ TA @ TB @ A @ C @ B ) @ ( 'const/iterate/iterate' @ TA @ TB @ A @ D @ B ) ) )
      | ~ ( 'const/iterate/monoidal' @ TB @ A )
      | ~ ( 'const/sets/FINITE' @ TA @ C )
      | ~ ( 'const/sets/FINITE' @ TA @ D )
      | ~ ( 'const/sets/DISJOINT' @ TA @ C @ D ) ),
    inference(lifteq,[status(thm)],[17]) ).

thf(66,plain,
    ! [TA: $tType,TB: $tType,D: TA > $o,C: TA > $o,B: TA > TB,A: TB > TB > TB] :
      ( ( ( 'const/iterate/iterate' @ TA @ TB @ A @ ( 'const/sets/UNION' @ TA @ C @ D ) @ B )
        = ( A @ ( 'const/iterate/iterate' @ TA @ TB @ A @ C @ B ) @ ( 'const/iterate/iterate' @ TA @ TB @ A @ D @ B ) ) )
      | ~ $true
      | ~ ( 'const/sets/FINITE' @ TA @ C )
      | ~ ( 'const/sets/FINITE' @ TA @ D )
      | ~ ( 'const/sets/DISJOINT' @ TA @ C @ D )
      | ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
       != ( 'const/iterate/monoidal' @ TB @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[19,18]) ).

thf(67,plain,
    ! [TA: $tType,TB: $tType,D: TA > $o,C: TA > $o,B: TA > TB,A: TB > TB > TB] :
      ( ( ( 'const/iterate/iterate' @ TA @ TB @ A @ ( 'const/sets/UNION' @ TA @ C @ D ) @ B )
        = ( A @ ( 'const/iterate/iterate' @ TA @ TB @ A @ C @ B ) @ ( 'const/iterate/iterate' @ TA @ TB @ A @ D @ B ) ) )
      | ~ ( 'const/sets/FINITE' @ TA @ C )
      | ~ ( 'const/sets/FINITE' @ TA @ D )
      | ~ ( 'const/sets/DISJOINT' @ TA @ C @ D )
      | ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
       != ( 'const/iterate/monoidal' @ TB @ A ) ) ),
    inference(simp,[status(thm)],[66]) ).

thf(68,plain,
    ! [TA: $tType,C: TA > $o,B: TA > $o,A: TA > 'type/realax/real'] :
      ( ( ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ TA @ B @ C ) @ A )
        = ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ B @ A ) @ ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ C @ A ) ) )
      | ~ ( 'const/sets/FINITE' @ TA @ B )
      | ~ ( 'const/sets/FINITE' @ TA @ C )
      | ~ ( 'const/sets/DISJOINT' @ TA @ B @ C ) ),
    inference(pattern_uni,[status(thm)],[67:[bind(A,$thf( 'const/realax/real_add' )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( D )),bind_type(TA,$thf( TA )),bind_type(TB,$thf( 'type/realax/real' ))]]) ).

thf(100,plain,
    ! [TA: $tType,C: TA > $o,B: TA > $o,A: TA > 'type/realax/real'] :
      ( ( ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ TA @ B @ C ) @ A )
        = ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ B @ A ) @ ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ C @ A ) ) )
      | ~ ( 'const/sets/FINITE' @ TA @ B )
      | ~ ( 'const/sets/FINITE' @ TA @ C )
      | ~ ( 'const/sets/DISJOINT' @ TA @ B @ C ) ),
    inference(simp,[status(thm)],[68]) ).

thf(286,plain,
    ! [TA: $tType,C: TA > $o,B: TA > $o,A: TA > 'type/realax/real'] :
      ( ( ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ TA @ B @ C ) @ A )
        = ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ B @ A ) @ ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ C @ A ) ) )
      | ~ ( 'const/sets/FINITE' @ TA @ B )
      | ~ ( 'const/sets/FINITE' @ TA @ C )
      | ~ $true
      | ( ( 'const/sets/DISJOINT' @ skt1 @ sk2 @ sk3 )
       != ( 'const/sets/DISJOINT' @ TA @ B @ C ) ) ),
    inference(paramod_ordered,[status(thm)],[10,100]) ).

thf(287,plain,
    ! [TA: $tType,C: TA > $o,B: TA > $o,A: TA > 'type/realax/real'] :
      ( ( ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ TA @ B @ C ) @ A )
        = ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ B @ A ) @ ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ C @ A ) ) )
      | ~ ( 'const/sets/FINITE' @ TA @ B )
      | ~ ( 'const/sets/FINITE' @ TA @ C )
      | ( ( 'const/sets/DISJOINT' @ skt1 @ sk2 @ sk3 )
       != ( 'const/sets/DISJOINT' @ TA @ B @ C ) ) ),
    inference(simp,[status(thm)],[286]) ).

thf(288,plain,
    ! [A: skt1 > 'type/realax/real'] :
      ( ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ skt1 @ 'type/realax/real' @ 'const/realax/real_add' @ sk2 @ A ) @ ( 'const/iterate/iterate' @ skt1 @ 'type/realax/real' @ 'const/realax/real_add' @ sk3 @ A ) )
        = ( 'const/iterate/iterate' @ skt1 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ skt1 @ sk2 @ sk3 ) @ A ) )
      | ~ ( 'const/sets/FINITE' @ skt1 @ sk2 )
      | ~ ( 'const/sets/FINITE' @ skt1 @ sk3 ) ),
    inference(pattern_uni,[status(thm)],[287:[bind(A,$thf( A )),bind(B,$thf( sk2 )),bind(C,$thf( sk3 )),bind_type(TA,$thf( skt1 ))]]) ).

thf(8,plain,
    'const/sets/FINITE' @ skt1 @ sk2,
    inference(cnfConj,[status(thm)],[7]) ).

thf(9,plain,
    'const/sets/FINITE' @ skt1 @ sk3,
    inference(cnfConj,[status(thm)],[7]) ).

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

thf(13,plain,
    ! [TA: $tType] :
      ( ( 'const/iterate/sum' @ TA )
      = ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(14,plain,
    ! [TA: $tType] :
      ( ( 'const/iterate/sum' @ TA )
      = ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' ) ),
    inference(cnf,[status(esa)],[13]) ).

thf(15,plain,
    ! [TA: $tType] :
      ( ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' )
      = ( 'const/iterate/sum' @ TA ) ),
    inference(lifteq,[status(thm)],[14]) ).

thf(139,plain,
    ! [TA: $tType,B: TA > 'type/realax/real',A: TA > $o] :
      ( ( 'const/iterate/iterate' @ TA @ 'type/realax/real' @ 'const/realax/real_add' @ A @ B )
      = ( 'const/iterate/sum' @ TA @ A @ B ) ),
    inference(func_ext,[status(esa)],[15]) ).

thf(424,plain,
    ! [A: skt1 > 'type/realax/real'] :
      ( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ skt1 @ sk2 @ A ) @ ( 'const/iterate/sum' @ skt1 @ sk3 @ A ) )
        = ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ sk2 @ sk3 ) @ A ) )
      | ~ $true
      | ~ $true ),
    inference(rewrite,[status(thm)],[288,8,9,139]) ).

thf(425,plain,
    ! [A: skt1 > 'type/realax/real'] :
      ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ skt1 @ sk2 @ A ) @ ( 'const/iterate/sum' @ skt1 @ sk3 @ A ) )
      = ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ sk2 @ sk3 ) @ A ) ),
    inference(simp,[status(thm)],[424]) ).

thf(426,plain,
    ( ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ sk2 @ sk3 ) @ sk1 )
   != ( 'const/iterate/sum' @ skt1 @ ( 'const/sets/UNION' @ skt1 @ sk2 @ sk3 ) @ sk1 ) ),
    inference(rewrite,[status(thm)],[12,425]) ).

thf(427,plain,
    $false,
    inference(simp,[status(thm)],[426]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : ANA095^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.10  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.09/0.25  % Computer : n010.cluster.edu
% 0.09/0.25  % Model    : x86_64 x86_64
% 0.09/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.25  % Memory   : 8046.5625MB
% 0.09/0.25  % OS       : Linux 6.8.0-71-generic
% 0.09/0.25  % CPULimit : 300
% 0.09/0.25  % WCLimit  : 300
% 0.09/0.25  % DateTime : Tue Sep 29 17:41:33 UTC 2026
% 0.09/0.25  % CPUTime  : 
% 0.09/0.25  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 1.16/0.99  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.62/1.17  % [INFO] 	 Parsing done (177ms). 
% 1.62/1.18  % [INFO] 	 Running in sequential loop mode. 
% 2.37/1.51  % [INFO] 	 eprover registered as external prover. 
% 2.37/1.52  % [INFO] 	 Scanning for conjecture ... 
% 2.37/1.57  % [INFO] 	 No direction of definition thm/iterate/sum_ detected. Treating as axiom ... 
% 2.63/1.61  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 2.63/1.64  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 2.63/1.64  % [INFO] 	 No direction of definition thm/iterate/sum_ detected. Treating as axiom ... 
% 2.63/1.65  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.63/1.66  % [INFO] 	 Type checking passed. 
% 2.63/1.66  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 126.24/102.45  % [INFO] 	 Killing All external provers ... 
% 126.24/102.46  % Time passed: 102010ms (effective reasoning time: 101271ms)
% 126.24/102.46  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 126.24/102.46  % Axioms used in derivation (3): thm/iterate/MONOIDAL_REAL_ADD_, thm/iterate/ITERATE_UNION_, thm/iterate/sum_
% 126.24/102.46  % No. of inferences in proof: 31
% 126.24/102.46  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 102010 ms resp. 101271 ms w/o parsing
% 126.48/102.53  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 126.48/102.53  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------