%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV502^1 : TPTP v9.2.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n022.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 Feb 25 09:41:24 AM UTC 2026
% Result : Theorem 1.63s 1.30s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 184 ( 57 equ; 0 cnn)
% Maximal formula atoms : 6 ( 6 avg)
% Number of connectives : 443 ( 29 ~; 15 |; 17 &; 371 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 3 con; 0-5 aty)
% Number of variables : 66 ( 0 ^; 54 !; 12 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(type_def_7,type,
sK0: $tType ).
thf(func_def_0,type,
'type/nums/num': $tType ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
'const/sets/DELETE':
!>[X0: $tType] : ( ( X0 > $o ) > X0 > X0 > $o ) ).
thf(func_def_4,type,
'const/iterate/nsum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/nums/num' ) > 'type/nums/num' ) ).
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_7,type,
'const/arith/+': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).
thf(func_def_11,type,
sK1: sK0 > 'type/nums/num' ).
thf(func_def_12,type,
sK2: sK0 > $o ).
thf(func_def_13,type,
sK3: sK0 ).
thf(func_def_15,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f36,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f35,f24]) ).
thf(f24,plain,
( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
= $true ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
= $true ),
inference(fool_elimination,[status(thm)],[f11]) ).
thf(f11,plain,
'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+',
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+',
file('/export/starexec/sandbox/tmp/tmp.ybUmz0Udle/DTF2THF_12068.p','thm/iterate/MONOIDAL_ADD_') ).
thf(f35,plain,
( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
!= $true ),
inference(subsumption_resolution,[status(thm)],[f34,f21]) ).
thf(f21,plain,
( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
thf(f18,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
& ( ( 'const/arith/+' @ ( sK1 @ sK3 ) @ ( 'const/iterate/nsum' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK2 @ sK3 ) @ sK1 ) )
!= ( 'const/iterate/nsum' @ sK0 @ sK2 @ sK1 ) )
& ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f16,f17]) ).
thf(f17,plain,
( ? [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true )
& ( ( 'const/iterate/nsum' @ X0 @ X2 @ X1 )
!= ( 'const/arith/+' @ ( X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X3 ) @ X1 ) ) )
& ( $true
= ( 'const/sets/FINITE' @ X0 @ X2 ) ) )
=> ( ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
& ( ( 'const/arith/+' @ ( sK1 @ sK3 ) @ ( 'const/iterate/nsum' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK2 @ sK3 ) @ sK1 ) )
!= ( 'const/iterate/nsum' @ sK0 @ sK2 @ sK1 ) )
& ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f16,plain,
? [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true )
& ( ( 'const/iterate/nsum' @ X0 @ X2 @ X1 )
!= ( 'const/arith/+' @ ( X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X3 ) @ X1 ) ) )
& ( $true
= ( 'const/sets/FINITE' @ X0 @ X2 ) ) ),
inference(flattening,[status(thm)],[f15]) ).
thf(f15,plain,
? [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o,X3: X0] :
( ( ( 'const/iterate/nsum' @ X0 @ X2 @ X1 )
!= ( 'const/arith/+' @ ( X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X3 ) @ X1 ) ) )
& ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true )
& ( $true
= ( 'const/sets/FINITE' @ X0 @ X2 ) ) ),
inference(ennf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
~ ! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o,X3: X0] :
( ( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true )
& ( $true
= ( 'const/sets/FINITE' @ X0 @ X2 ) ) )
=> ( ( 'const/iterate/nsum' @ X0 @ X2 @ X1 )
= ( 'const/arith/+' @ ( X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X3 ) @ X1 ) ) ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
~ ! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
=> ( ( 'const/iterate/nsum' @ X0 @ X2 @ X1 )
= ( 'const/arith/+' @ ( X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X3 ) @ X1 ) ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X0: $tType,X1: X0 > 'type/nums/num',X3: X0 > $o,X4: X0] :
( ( ( 'const/sets/FINITE' @ X0 @ X3 )
& ( 'const/sets/IN' @ X0 @ X4 @ X3 ) )
=> ( ( 'const/arith/+' @ ( X1 @ X4 ) @ ( 'const/iterate/nsum' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X3 @ X4 ) @ X1 ) )
= ( 'const/iterate/nsum' @ X0 @ X3 @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
! [X0: $tType,X1: X0 > 'type/nums/num',X3: X0 > $o,X4: X0] :
( ( ( 'const/sets/FINITE' @ X0 @ X3 )
& ( 'const/sets/IN' @ X0 @ X4 @ X3 ) )
=> ( ( 'const/arith/+' @ ( X1 @ X4 ) @ ( 'const/iterate/nsum' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X3 @ X4 ) @ X1 ) )
= ( 'const/iterate/nsum' @ X0 @ X3 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ybUmz0Udle/DTF2THF_12068.p','thm/iterate/NSUM_DELETE_') ).
thf(f34,plain,
( ( $true
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
!= $true ) ),
inference(subsumption_resolution,[status(thm)],[f33,f19]) ).
thf(f19,plain,
( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true ),
inference(cnf_transformation,[status(thm)],[f18]) ).
thf(f33,plain,
( ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true )
| ( $true
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f32]) ).
thf(f32,plain,
( ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true )
| ( $true
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ( ( 'const/iterate/iterate' @ sK0 @ 'type/nums/num' @ 'const/arith/+' @ sK2 @ sK1 )
!= ( 'const/iterate/iterate' @ sK0 @ 'type/nums/num' @ 'const/arith/+' @ sK2 @ sK1 ) )
| ( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
!= $true ) ),
inference(superposition,[status(thm)],[f25,f22]) ).
thf(f22,plain,
! [X1: $tType,X0: $tType,X2: X1 > X1 > X1,X3: X0 > X1,X4: X0 > $o,X5: X0] :
( ( ( X2 @ ( X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X4 @ X5 ) @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) )
| ( ( 'const/sets/IN' @ X0 @ X5 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true )
| ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true )
| ! [X3: X0 > X1,X4: X0 > $o,X5: X0] :
( ( ( X2 @ ( X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X4 @ X5 ) @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) )
| ( ( 'const/sets/IN' @ X0 @ X5 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true ) ) ),
inference(flattening,[status(thm)],[f13]) ).
thf(f13,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ! [X3: X0 > X1,X4: X0 > $o,X5: X0] :
( ( ( X2 @ ( X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X4 @ X5 ) @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) )
| ( ( 'const/sets/IN' @ X0 @ X5 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true ) )
| ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( ( 'const/iterate/monoidal' @ X1 @ X2 )
= $true )
=> ! [X3: X0 > X1,X4: X0 > $o,X5: X0] :
( ( ( ( 'const/sets/IN' @ X0 @ X5 @ X4 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X4 )
= $true ) )
=> ( ( X2 @ ( X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X4 @ X5 ) @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) ) ) ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( 'const/iterate/monoidal' @ X1 @ X2 )
=> ! [X3: X0 > X1,X4: X0 > $o,X5: X0] :
( ( ( 'const/sets/FINITE' @ X0 @ X4 )
& ( 'const/sets/IN' @ X0 @ X5 @ X4 ) )
=> ( ( X2 @ ( X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X4 @ X5 ) @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X2: $tType,X1: X2 > X2 > X2] :
( ( 'const/iterate/monoidal' @ X2 @ X1 )
=> ! [X3: X0 > X2,X4: X0 > $o,X5: X0] :
( ( ( 'const/sets/FINITE' @ X0 @ X4 )
& ( 'const/sets/IN' @ X0 @ X5 @ X4 ) )
=> ( ( X1 @ ( X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X2 @ X1 @ ( 'const/sets/DELETE' @ X0 @ X4 @ X5 ) @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X2 @ X1 @ X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ybUmz0Udle/DTF2THF_12068.p','thm/iterate/ITERATE_DELETE_') ).
thf(f25,plain,
( ( 'const/arith/+' @ ( sK1 @ sK3 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/nums/num' @ 'const/arith/+' @ ( 'const/sets/DELETE' @ sK0 @ sK2 @ sK3 ) @ sK1 ) )
!= ( 'const/iterate/iterate' @ sK0 @ 'type/nums/num' @ 'const/arith/+' @ sK2 @ sK1 ) ),
inference(definition_unfolding,[status(thm)],[f20,f23,f23]) ).
thf(f23,plain,
! [X0: $tType] :
( 'const/iterate/nsum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/nums/num' @ 'const/arith/+' ) ) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
thf(f1,axiom,
! [X0: $tType] :
( 'const/iterate/nsum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/nums/num' @ 'const/arith/+' ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ybUmz0Udle/DTF2THF_12068.p','thm/iterate/nsum_') ).
thf(f20,plain,
( ( 'const/arith/+' @ ( sK1 @ sK3 ) @ ( 'const/iterate/nsum' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK2 @ sK3 ) @ sK1 ) )
!= ( 'const/iterate/nsum' @ sK0 @ sK2 @ sK1 ) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV502^1 : TPTP v9.2.1. Released v7.0.0.
% 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/0.33 % Computer : n022.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Feb 24 12:47:51 EST 2026
% 0.14/0.34 % CPUTime :
% 0.14/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.18/0.44 ---- Original DTF file ---
% 0.18/0.44 thf(spec,logic,$$dhol).
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 % File : SEV502^1 : TPTP v9.2.1. Released v7.0.0.
% 0.18/0.44 % Domain : Analysis
% 0.18/0.44 % Problem : NSUM_DELETE
% 0.18/0.44 % Version : Especial.
% 0.18/0.44 % English :
% 0.18/0.44
% 0.18/0.44 % Refs : [Kal16] Kalisyk (2016), Email to Geoff Sutcliffe
% 0.18/0.44 % Source : [Kal16]
% 0.18/0.44 % Names : NSUM_DELETE_.p [Kal16]
% 0.18/0.44
% 0.18/0.44 % Status : Theorem
% 0.18/0.44 % Rating : 0.00 v9.1.0, 0.33 v8.1.0, 0.25 v7.5.0, 0.33 v7.2.0, 0.25 v7.1.0
% 0.18/0.44 % Syntax : Number of formulae : 12 ( 2 unt; 8 typ; 1 def)
% 0.18/0.44 % Number of atoms : 11 ( 3 equ; 0 cnn)
% 0.18/0.44 % Maximal formula atoms : 4 ( 2 avg)
% 0.18/0.44 % Number of connectives : 51 ( 0 ~; 0 |; 2 &; 46 @)
% 0.18/0.44 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.18/0.44 % Maximal formula depth : 13 ( 7 avg)
% 0.18/0.44 % Number of types : 2 ( 1 usr)
% 0.18/0.44 % Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% 0.18/0.44 % Number of symbols : 8 ( 7 usr; 0 con; 2-5 aty)
% 0.18/0.44 % Number of variables : 18 ( 0 ^; 11 !; 0 ?; 18 :)
% 0.18/0.44 % ( 7 !>; 0 ?*; 0 @-; 0 @+)
% 0.18/0.44 % SPC : TH1_THM_EQU_NAR
% 0.18/0.44
% 0.18/0.44 % Comments : Exported from core HOL Light.
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 thf('thf_type_type/nums/num',type,
% 0.18/0.44 'type/nums/num': $tType ).
% 0.18/0.44
% 0.18/0.44 thf('thf_const_const/sets/IN',type,
% 0.18/0.44 'const/sets/IN':
% 0.18/0.44 !>[A: $tType] : ( A > ( A > $o ) > $o ) ).
% 0.18/0.44
% 0.18/0.44 thf('thf_const_const/sets/FINITE',type,
% 0.18/0.44 'const/sets/FINITE':
% 0.18/0.44 !>[A: $tType] : ( ( A > $o ) > $o ) ).
% 0.18/0.44
% 0.18/0.44 thf('thf_const_const/sets/DELETE',type,
% 0.18/0.44 'const/sets/DELETE':
% 0.18/0.44 !>[A: $tType] : ( ( A > $o ) > A > A > $o ) ).
% 0.18/0.44
% 0.18/0.44 thf('thf_const_const/iterate/nsum',type,
% 0.18/0.44 'const/iterate/nsum':
% 0.18/0.44 !>[A: $tType] : ( ( A > $o ) > ( A > 'type/nums/num' ) > 'type/nums/num' ) ).
% 0.18/0.44
% 0.18/0.44 thf('thf_const_const/iterate/monoidal',type,
% 0.18/0.44 'const/iterate/monoidal':
% 0.18/0.44 !>[A: $tType] : ( ( A > A > A ) > $o ) ).
% 0.18/0.44
% 0.18/0.44 thf('thf_const_const/iterate/iterate',type,
% 0.18/0.44 'const/iterate/iterate':
% 0.18/0.44 !>[A: $tType,A0: $tType] : ( ( A0 > A0 > A0 ) > ( A > $o ) > ( A > A0 ) > A0 ) ).
% 0.18/0.44
% 0.18/0.44 thf('thf_const_const/arith/+',type,
% 0.18/0.44 'const/arith/+': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).
% 0.18/0.44
% 0.18/0.44 thf('thm/iterate/nsum_',definition,
% 0.18/0.44 ! [A: $tType] :
% 0.18/0.44 ( ( 'const/iterate/nsum' @ A )
% 0.18/0.44 = ( 'const/iterate/iterate' @ A @ 'type/nums/num' @ 'const/arith/+' ) ) ).
% 0.18/0.44
% 0.18/0.44 thf('thm/iterate/ITERATE_DELETE_',axiom,
% 0.18/0.44 ! [A: $tType,B: $tType,A0: B > B > B] :
% 0.18/0.44 ( ( 'const/iterate/monoidal' @ B @ A0 )
% 0.18/0.44 => ! [A1: A > B,A2: A > $o,A3: A] :
% 0.18/0.44 ( ( ( 'const/sets/FINITE' @ A @ A2 )
% 0.18/0.44 & ( 'const/sets/IN' @ A @ A3 @ A2 ) )
% 0.18/0.44 => ( ( A0 @ ( A1 @ A3 ) @ ( 'const/iterate/iterate' @ A @ B @ A0 @ ( 'const/sets/DELETE' @ A @ A2 @ A3 ) @ A1 ) )
% 0.18/0.44 = ( 'const/iterate/iterate' @ A @ B @ A0 @ A2 @ A1 ) ) ) ) ).
% 0.18/0.44
% 0.18/0.44 thf('thm/iterate/MONOIDAL_ADD_',axiom,
% 0.18/0.44 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' ).
% 0.18/0.44
% 0.18/0.44 thf('thm/iterate/NSUM_DELETE_',conjecture,
% 0.18/0.44 ! [A: $tType,A0: A > 'type/nums/num',A1: A > $o,A2: A] :
% 0.18/0.44 ( ( ( 'const/sets/FINITE' @ A @ A1 )
% 0.18/0.44 & ( 'const/sets/IN' @ A @ A2 @ A1 ) )
% 0.18/0.44 => ( ( 'const/arith/+' @ ( A0 @ A2 ) @ ( 'const/iterate/nsum' @ A @ ( 'const/sets/DELETE' @ A @ A1 @ A2 ) @ A0 ) )
% 0.18/0.44 = ( 'const/iterate/nsum' @ A @ A1 @ A0 ) ) ) ).
% 0.18/0.44
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 ------------------------
% 1.50/1.26 ---- Embedded in THF ---
% 1.50/1.26 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.50/1.26 %%% Generated on Tue Feb 24 12:47:52 EST 2026
% 1.50/1.26 %%% using '$$dhol' embedding, version 1.3.0.
% 1.50/1.26 %%% Logic specification used:
% 1.50/1.26 %%% thf(spec, logic, $$dhol).
% 1.50/1.26
% 1.50/1.26 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.ybUmz0Udle/DTF2DTF12068.p
% See solution above
% 1.50/1.26 ------------------------
% 1.50/1.27 ---- Cleaned THF ---
% 1.50/1.27 thf('thf_type_type/nums/num',type,
% 1.50/1.27 'type/nums/num': $tType ).
% 1.50/1.27
% 1.50/1.27 thf('thf_const_const/sets/IN',type,
% 1.50/1.27 'const/sets/IN':
% 1.50/1.27 !>[A: $tType] : ( A > ( A > $o ) > $o ) ).
% 1.50/1.27
% 1.50/1.27 thf('thf_const_const/sets/FINITE',type,
% 1.50/1.27 'const/sets/FINITE':
% 1.50/1.27 !>[A: $tType] : ( ( A > $o ) > $o ) ).
% 1.50/1.27
% 1.50/1.27 thf('thf_const_const/sets/DELETE',type,
% 1.50/1.27 'const/sets/DELETE':
% 1.50/1.27 !>[A: $tType] : ( ( A > $o ) > A > A > $o ) ).
% 1.50/1.27
% 1.50/1.27 thf('thf_const_const/iterate/nsum',type,
% 1.50/1.27 'const/iterate/nsum':
% 1.50/1.27 !>[A: $tType] : ( ( A > $o ) > ( A > 'type/nums/num' ) > 'type/nums/num' ) ).
% 1.50/1.27
% 1.50/1.27 thf('thf_const_const/iterate/monoidal',type,
% 1.50/1.27 'const/iterate/monoidal':
% 1.50/1.27 !>[A: $tType] : ( ( A > A > A ) > $o ) ).
% 1.50/1.27
% 1.50/1.27 thf('thf_const_const/iterate/iterate',type,
% 1.50/1.27 'const/iterate/iterate':
% 1.50/1.27 !>[A: $tType,A0: $tType] : ( ( A0 > A0 > A0 ) > ( A > $o ) > ( A > A0 ) > A0 ) ).
% 1.50/1.27
% 1.50/1.27 thf('thf_const_const/arith/+',type,
% 1.50/1.27 'const/arith/+': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).
% 1.50/1.27
% 1.50/1.27 thf('thm/iterate/nsum_',definition,
% 1.50/1.27 ! [A: $tType] :
% 1.50/1.27 ( ( 'const/iterate/nsum' @ A )
% 1.50/1.27 = ( 'const/iterate/iterate' @ A @ 'type/nums/num' @ 'const/arith/+' ) ) ).
% 1.50/1.27
% 1.50/1.27 thf('thm/iterate/ITERATE_DELETE_',axiom,
% 1.50/1.27 ! [A: $tType,B: $tType,A0: B > B > B] :
% 1.50/1.27 ( ( 'const/iterate/monoidal' @ B @ A0 )
% 1.50/1.27 => ! [A1: A > B,A2: A > $o,A3: A] :
% 1.50/1.27 ( ( ( 'const/sets/FINITE' @ A @ A2 )
% 1.50/1.27 & ( 'const/sets/IN' @ A @ A3 @ A2 ) )
% 1.50/1.27 => ( ( A0 @ ( A1 @ A3 ) @ ( 'const/iterate/iterate' @ A @ B @ A0 @ ( 'const/sets/DELETE' @ A @ A2 @ A3 ) @ A1 ) )
% 1.50/1.27 = ( 'const/iterate/iterate' @ A @ B @ A0 @ A2 @ A1 ) ) ) ) ).
% 1.50/1.27
% 1.50/1.27 thf('thm/iterate/MONOIDAL_ADD_',axiom,
% 1.50/1.27 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' ).
% 1.50/1.27
% 1.50/1.27 thf('thm/iterate/NSUM_DELETE_',conjecture,
% 1.50/1.27 ! [A: $tType,A0: A > 'type/nums/num',A1: A > $o,A2: A] :
% 1.50/1.27 ( ( ( 'const/sets/FINITE' @ A @ A1 )
% 1.50/1.27 & ( 'const/sets/IN' @ A @ A2 @ A1 ) )
% 1.50/1.27 => ( ( 'const/arith/+' @ ( A0 @ A2 ) @ ( 'const/iterate/nsum' @ A @ ( 'const/sets/DELETE' @ A @ A1 @ A2 ) @ A0 ) )
% 1.50/1.27 = ( 'const/iterate/nsum' @ A @ A1 @ A0 ) ) ) ).
% 1.50/1.27 ------------------------
% 1.50/1.28 % (12349)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_12068 for (2999ds/2Mi)
% 1.50/1.28 % (12346)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on DTF2THF_12068 for (2999ds/4Mi)
% 1.50/1.29 % (12349)Instruction limit reached!
% 1.50/1.29 % (12349)------------------------------
% 1.50/1.29 % (12349)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.29 % (12349)Termination reason: Unknown
% 1.50/1.29 % (12349)Termination phase: shuffling
% 1.50/1.29
% 1.50/1.29 % (12349)Memory used [KB]: 895
% 1.50/1.29 % (12349)Time elapsed: 0.002 s
% 1.50/1.29 % (12349)Instructions burned: 2 (million)
% 1.50/1.29 % (12349)------------------------------
% 1.50/1.29 % (12349)------------------------------
% 1.50/1.29 % (12346)Instruction limit reached!
% 1.50/1.29 % (12346)------------------------------
% 1.50/1.29 % (12346)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.29 % (12346)Termination reason: Unknown
% 1.50/1.29 % (12346)Termination phase: Saturation
% 1.50/1.29
% 1.50/1.29 % (12346)Memory used [KB]: 5500
% 1.50/1.29 % (12346)Time elapsed: 0.003 s
% 1.50/1.29 % (12346)Instructions burned: 5 (million)
% 1.50/1.29 % (12346)------------------------------
% 1.50/1.29 % (12346)------------------------------
% 1.50/1.29 % (12345)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_12068 for (2999ds/183Mi)
% 1.50/1.29 % (12347)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on DTF2THF_12068 for (2999ds/27Mi)
% 1.50/1.29 % (12348)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_12068 for (2999ds/2Mi)
% 1.50/1.29 % (12350)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_12068 for (2999ds/275Mi)
% 1.50/1.29 % (12351)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_12068 for (2999ds/18Mi)
% 1.50/1.29 % (12348)Instruction limit reached!
% 1.50/1.29 % (12348)------------------------------
% 1.50/1.29 % (12348)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.29 % (12348)Termination reason: Unknown
% 1.50/1.29 % (12348)Termination phase: Unused predicate definition removal
% 1.50/1.29
% 1.50/1.29 % (12348)Memory used [KB]: 895
% 1.50/1.29 % (12348)Time elapsed: 0.003 s
% 1.50/1.29 % (12348)Instructions burned: 2 (million)
% 1.50/1.29 % (12348)------------------------------
% 1.50/1.29 % (12348)------------------------------
% 1.50/1.29 % (12352)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_12068 for (2999ds/3Mi)
% 1.50/1.30 % (12352)Instruction limit reached!
% 1.50/1.30 % (12352)------------------------------
% 1.50/1.30 % (12352)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.30 % (12352)Termination reason: Unknown
% 1.50/1.30 % (12352)Termination phase: Saturation
% 1.50/1.30
% 1.50/1.30 % (12352)Memory used [KB]: 5500
% 1.50/1.30 % (12352)Time elapsed: 0.002 s
% 1.50/1.30 % (12352)Instructions burned: 3 (million)
% 1.50/1.30 % (12352)------------------------------
% 1.50/1.30 % (12352)------------------------------
% 1.63/1.30 % (12353)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on DTF2THF_12068 for (2999ds/37Mi)
% 1.63/1.30 % (12350)First to succeed.
% 1.63/1.30 % Exception at run slice level
% 1.63/1.30 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.63/1.30 % (12347)Also succeeded, but the first one will report.
% 1.63/1.30 % (12350)Refutation found. Thanks to Tanya!
% 1.63/1.30 % SZS status Theorem for DTF2THF_12068
% 1.63/1.30 % SZS output start Proof for DTF2THF_12068
% 1.63/1.30 thf(type_def_6, type, 'type/nums/num': $tType).
% 1.63/1.30 thf(type_def_7, type, sK0: $tType).
% 1.63/1.30 thf(func_def_0, type, 'type/nums/num': $tType).
% 1.63/1.30 thf(func_def_1, type, 'const/sets/IN': !>[X0: $tType]:(X0 > (X0 > $o) > $o)).
% 1.63/1.30 thf(func_def_2, type, 'const/sets/FINITE': !>[X0: $tType]:((X0 > $o) > $o)).
% 1.63/1.30 thf(func_def_3, type, 'const/sets/DELETE': !>[X0: $tType]:((X0 > $o) > X0 > X0 > $o)).
% 1.63/1.30 thf(func_def_4, type, 'const/iterate/nsum': !>[X0: $tType]:((X0 > $o) > (X0 > 'type/nums/num') > 'type/nums/num')).
% 1.63/1.30 thf(func_def_5, type, 'const/iterate/monoidal': !>[X0: $tType]:((X0 > X0 > X0) > $o)).
% 1.63/1.30 thf(func_def_6, type, 'const/iterate/iterate': !>[X0: $tType, X1: $tType]:((X1 > X1 > X1) > (X0 > $o) > (X0 > X1) > X1)).
% 1.63/1.30 thf(func_def_7, type, 'const/arith/+': 'type/nums/num' > 'type/nums/num' > 'type/nums/num').
% 1.63/1.30 thf(func_def_11, type, sK1: sK0 > 'type/nums/num').
% 1.63/1.30 thf(func_def_12, type, sK2: sK0 > $o).
% 1.63/1.30 thf(func_def_13, type, sK3: sK0).
% 1.63/1.30 thf(func_def_15, type, ph5: !>[X0: $tType]:(X0)).
% 1.63/1.30 thf(f36,plain,(
% 1.63/1.30 $false),
% 1.63/1.30 inference(subsumption_resolution,[status(thm)],[f35,f24])).
% 1.63/1.30 thf(f24,plain,(
% 1.63/1.30 (('const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+') = $true)),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f12])).
% 1.63/1.30 thf(f12,plain,(
% 1.63/1.30 (('const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+') = $true)),
% 1.63/1.30 inference(fool_elimination,[status(thm)],[f11])).
% 1.63/1.30 thf(f11,plain,(
% 1.63/1.30 ('const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+')),
% 1.63/1.30 inference(rectify,[status(thm)],[f3])).
% 1.63/1.30 thf(f3,axiom,(
% 1.63/1.30 ('const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+')),
% 1.63/1.30 file('/export/starexec/sandbox/tmp/tmp.ybUmz0Udle/DTF2THF_12068.p','thm/iterate/MONOIDAL_ADD_')).
% 1.63/1.30 thf(f35,plain,(
% 1.63/1.30 (('const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+') != $true)),
% 1.63/1.30 inference(subsumption_resolution,[status(thm)],[f34,f21])).
% 1.63/1.30 thf(f21,plain,(
% 1.63/1.30 ($true = ('const/sets/IN' @ sK0 @ sK3 @ sK2))),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f18])).
% 1.63/1.30 thf(f18,plain,(
% 1.63/1.30 ($true = ('const/sets/IN' @ sK0 @ sK3 @ sK2)) & (('const/arith/+' @ (sK1 @ sK3) @ ('const/iterate/nsum' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1)) != ('const/iterate/nsum' @ sK0 @ sK2 @ sK1)) & (('const/sets/FINITE' @ sK0 @ sK2) = $true)),
% 1.63/1.30 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f16,f17])).
% 1.63/1.30 thf(f17,plain,(
% 1.63/1.30 ? [X0 : $tType,X1 : X0 > 'type/nums/num',X2 : X0 > $o,X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ X2) = $true) & (('const/iterate/nsum' @ X0 @ X2 @ X1) != ('const/arith/+' @ (X1 @ X3) @ ('const/iterate/nsum' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X3) @ X1))) & ($true = ('const/sets/FINITE' @ X0 @ X2))) => (($true = ('const/sets/IN' @ sK0 @ sK3 @ sK2)) & (('const/arith/+' @ (sK1 @ sK3) @ ('const/iterate/nsum' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1)) != ('const/iterate/nsum' @ sK0 @ sK2 @ sK1)) & (('const/sets/FINITE' @ sK0 @ sK2) = $true))),
% 1.63/1.30 introduced(definition,[],[choice_axiom])).
% 1.63/1.30 thf(f16,plain,(
% 1.63/1.30 ? [X0 : $tType,X1 : X0 > 'type/nums/num',X2 : X0 > $o,X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ X2) = $true) & (('const/iterate/nsum' @ X0 @ X2 @ X1) != ('const/arith/+' @ (X1 @ X3) @ ('const/iterate/nsum' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X3) @ X1))) & ($true = ('const/sets/FINITE' @ X0 @ X2)))),
% 1.63/1.30 inference(flattening,[status(thm)],[f15])).
% 1.63/1.30 thf(f15,plain,(
% 1.63/1.30 ? [X0 : $tType,X1 : X0 > 'type/nums/num',X2 : X0 > $o,X3 : X0] : ((('const/iterate/nsum' @ X0 @ X2 @ X1) != ('const/arith/+' @ (X1 @ X3) @ ('const/iterate/nsum' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X3) @ X1))) & ((('const/sets/IN' @ X0 @ X3 @ X2) = $true) & ($true = ('const/sets/FINITE' @ X0 @ X2))))),
% 1.63/1.30 inference(ennf_transformation,[status(thm)],[f8])).
% 1.63/1.30 thf(f8,plain,(
% 1.63/1.30 ~! [X0 : $tType,X1 : X0 > 'type/nums/num',X2 : X0 > $o,X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X2) = $true) & ($true = ('const/sets/FINITE' @ X0 @ X2))) => (('const/iterate/nsum' @ X0 @ X2 @ X1) = ('const/arith/+' @ (X1 @ X3) @ ('const/iterate/nsum' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X3) @ X1))))),
% 1.63/1.30 inference(fool_elimination,[status(thm)],[f7])).
% 1.63/1.30 thf(f7,plain,(
% 1.63/1.30 ~! [X0 : $tType,X1 : X0 > 'type/nums/num',X2 : X0 > $o,X3 : X0] : ((('const/sets/FINITE' @ X0 @ X2) & ('const/sets/IN' @ X0 @ X3 @ X2)) => (('const/iterate/nsum' @ X0 @ X2 @ X1) = ('const/arith/+' @ (X1 @ X3) @ ('const/iterate/nsum' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X3) @ X1))))),
% 1.63/1.30 inference(rectify,[status(thm)],[f5])).
% 1.63/1.30 thf(f5,negated_conjecture,(
% 1.63/1.30 ~! [X0 : $tType,X1 : X0 > 'type/nums/num',X3 : X0 > $o,X4 : X0] : ((('const/sets/FINITE' @ X0 @ X3) & ('const/sets/IN' @ X0 @ X4 @ X3)) => (('const/arith/+' @ (X1 @ X4) @ ('const/iterate/nsum' @ X0 @ ('const/sets/DELETE' @ X0 @ X3 @ X4) @ X1)) = ('const/iterate/nsum' @ X0 @ X3 @ X1)))),
% 1.63/1.30 inference(negated_conjecture,[status(cth)],[f4])).
% 1.63/1.30 thf(f4,conjecture,(
% 1.63/1.30 ! [X0 : $tType,X1 : X0 > 'type/nums/num',X3 : X0 > $o,X4 : X0] : ((('const/sets/FINITE' @ X0 @ X3) & ('const/sets/IN' @ X0 @ X4 @ X3)) => (('const/arith/+' @ (X1 @ X4) @ ('const/iterate/nsum' @ X0 @ ('const/sets/DELETE' @ X0 @ X3 @ X4) @ X1)) = ('const/iterate/nsum' @ X0 @ X3 @ X1)))),
% 1.63/1.30 file('/export/starexec/sandbox/tmp/tmp.ybUmz0Udle/DTF2THF_12068.p','thm/iterate/NSUM_DELETE_')).
% 1.63/1.30 thf(f34,plain,(
% 1.63/1.30 ($true != ('const/sets/IN' @ sK0 @ sK3 @ sK2)) | (('const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+') != $true)),
% 1.63/1.30 inference(subsumption_resolution,[status(thm)],[f33,f19])).
% 1.63/1.30 thf(f19,plain,(
% 1.63/1.30 (('const/sets/FINITE' @ sK0 @ sK2) = $true)),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f18])).
% 1.63/1.30 thf(f33,plain,(
% 1.63/1.30 (('const/sets/FINITE' @ sK0 @ sK2) != $true) | ($true != ('const/sets/IN' @ sK0 @ sK3 @ sK2)) | (('const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+') != $true)),
% 1.63/1.30 inference(trivial_inequality_removal,[status(thm)],[f32])).
% 1.63/1.30 thf(f32,plain,(
% 1.63/1.30 (('const/sets/FINITE' @ sK0 @ sK2) != $true) | ($true != ('const/sets/IN' @ sK0 @ sK3 @ sK2)) | (('const/iterate/iterate' @ sK0 @ 'type/nums/num' @ 'const/arith/+' @ sK2 @ sK1) != ('const/iterate/iterate' @ sK0 @ 'type/nums/num' @ 'const/arith/+' @ sK2 @ sK1)) | (('const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+') != $true)),
% 1.63/1.30 inference(superposition,[status(thm)],[f25,f22])).
% 1.63/1.30 thf(f22,plain,(
% 1.63/1.30 ( ! [X1 : $tType,X0 : $tType,X2 : X1 > X1 > X1,X3 : X0 > X1,X4 : X0 > $o,X5 : X0] : (((X2 @ (X3 @ X5) @ ('const/iterate/iterate' @ X0 @ X1 @ X2 @ ('const/sets/DELETE' @ X0 @ X4 @ X5) @ X3)) = ('const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3)) | (('const/sets/IN' @ X0 @ X5 @ X4) != $true) | (('const/sets/FINITE' @ X0 @ X4) != $true) | (('const/iterate/monoidal' @ X1 @ X2) != $true)) )),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f14])).
% 1.63/1.30 thf(f14,plain,(
% 1.63/1.30 ! [X0 : $tType,X1 : $tType,X2 : X1 > X1 > X1] : ((('const/iterate/monoidal' @ X1 @ X2) != $true) | ! [X3 : X0 > X1,X4 : X0 > $o,X5 : X0] : (((X2 @ (X3 @ X5) @ ('const/iterate/iterate' @ X0 @ X1 @ X2 @ ('const/sets/DELETE' @ X0 @ X4 @ X5) @ X3)) = ('const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3)) | (('const/sets/IN' @ X0 @ X5 @ X4) != $true) | (('const/sets/FINITE' @ X0 @ X4) != $true)))),
% 1.63/1.30 inference(flattening,[status(thm)],[f13])).
% 1.63/1.30 thf(f13,plain,(
% 1.63/1.30 ! [X0 : $tType,X1 : $tType,X2 : X1 > X1 > X1] : (! [X3 : X0 > X1,X4 : X0 > $o,X5 : X0] : (((X2 @ (X3 @ X5) @ ('const/iterate/iterate' @ X0 @ X1 @ X2 @ ('const/sets/DELETE' @ X0 @ X4 @ X5) @ X3)) = ('const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3)) | ((('const/sets/IN' @ X0 @ X5 @ X4) != $true) | (('const/sets/FINITE' @ X0 @ X4) != $true))) | (('const/iterate/monoidal' @ X1 @ X2) != $true))),
% 1.63/1.30 inference(ennf_transformation,[status(thm)],[f10])).
% 1.63/1.30 thf(f10,plain,(
% 1.63/1.30 ! [X0 : $tType,X1 : $tType,X2 : X1 > X1 > X1] : ((('const/iterate/monoidal' @ X1 @ X2) = $true) => ! [X3 : X0 > X1,X4 : X0 > $o,X5 : X0] : (((('const/sets/IN' @ X0 @ X5 @ X4) = $true) & (('const/sets/FINITE' @ X0 @ X4) = $true)) => ((X2 @ (X3 @ X5) @ ('const/iterate/iterate' @ X0 @ X1 @ X2 @ ('const/sets/DELETE' @ X0 @ X4 @ X5) @ X3)) = ('const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3))))),
% 1.63/1.30 inference(fool_elimination,[status(thm)],[f9])).
% 1.63/1.30 thf(f9,plain,(
% 1.63/1.30 ! [X0 : $tType,X1 : $tType,X2 : X1 > X1 > X1] : (('const/iterate/monoidal' @ X1 @ X2) => ! [X3 : X0 > X1,X4 : X0 > $o,X5 : X0] : ((('const/sets/FINITE' @ X0 @ X4) & ('const/sets/IN' @ X0 @ X5 @ X4)) => ((X2 @ (X3 @ X5) @ ('const/iterate/iterate' @ X0 @ X1 @ X2 @ ('const/sets/DELETE' @ X0 @ X4 @ X5) @ X3)) = ('const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3))))),
% 1.63/1.30 inference(rectify,[status(thm)],[f2])).
% 1.63/1.30 thf(f2,axiom,(
% 1.63/1.30 ! [X0 : $tType,X2 : $tType,X1 : X2 > X2 > X2] : (('const/iterate/monoidal' @ X2 @ X1) => ! [X3 : X0 > X2,X4 : X0 > $o,X5 : X0] : ((('const/sets/FINITE' @ X0 @ X4) & ('const/sets/IN' @ X0 @ X5 @ X4)) => ((X1 @ (X3 @ X5) @ ('const/iterate/iterate' @ X0 @ X2 @ X1 @ ('const/sets/DELETE' @ X0 @ X4 @ X5) @ X3)) = ('const/iterate/iterate' @ X0 @ X2 @ X1 @ X4 @ X3))))),
% 1.63/1.30 file('/export/starexec/sandbox/tmp/tmp.ybUmz0Udle/DTF2THF_12068.p','thm/iterate/ITERATE_DELETE_')).
% 1.63/1.30 thf(f25,plain,(
% 1.63/1.30 (('const/arith/+' @ (sK1 @ sK3) @ ('const/iterate/iterate' @ sK0 @ 'type/nums/num' @ 'const/arith/+' @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1)) != ('const/iterate/iterate' @ sK0 @ 'type/nums/num' @ 'const/arith/+' @ sK2 @ sK1))),
% 1.63/1.30 inference(definition_unfolding,[status(thm)],[f20,f23,f23])).
% 1.63/1.30 thf(f23,plain,(
% 1.63/1.30 ( ! [X0 : $tType] : (('const/iterate/nsum' @ X0 = ('const/iterate/iterate' @ X0 @ 'type/nums/num' @ 'const/arith/+'))) )),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f1])).
% 1.63/1.30 thf(f1,axiom,(
% 1.63/1.30 ! [X0 : $tType] : ('const/iterate/nsum' @ X0 = ('const/iterate/iterate' @ X0 @ 'type/nums/num' @ 'const/arith/+'))),
% 1.63/1.30 file('/export/starexec/sandbox/tmp/tmp.ybUmz0Udle/DTF2THF_12068.p','thm/iterate/nsum_')).
% 1.63/1.30 thf(f20,plain,(
% 1.63/1.30 (('const/arith/+' @ (sK1 @ sK3) @ ('const/iterate/nsum' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1)) != ('const/iterate/nsum' @ sK0 @ sK2 @ sK1))),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f18])).
% 1.63/1.30 % SZS output end Proof for DTF2THF_12068
% 1.63/1.30 % (12350)------------------------------
% 1.63/1.30 % (12350)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.63/1.30 % (12350)Termination reason: Refutation
% 1.63/1.30
% 1.63/1.30 % (12350)Memory used [KB]: 5500
% 1.63/1.30 % (12350)Time elapsed: 0.008 s
% 1.63/1.30 % (12350)Instructions burned: 5 (million)
% 1.63/1.30 % (12350)------------------------------
% 1.63/1.30 % (12350)------------------------------
% 1.63/1.30 % (12344)Success in time 0.023 s
%------------------------------------------------------------------------------