%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO530^1 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n004.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:54:28 AM UTC 2026
% Result : Theorem 1.65s 1.32s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 40 ( 16 unt; 0 typ; 3 def)
% Number of atoms : 179 ( 44 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 287 ( 19 ~; 14 |; 4 &; 218 @)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 12 usr; 9 con; 0-2 aty)
% ( 0 !!; 23 ??; 0 @@+; 0 @@-)
% Number of variables : 87 ( 46 ^; 21 !; 20 ?; 87 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
eps: ( $i > $o ) > $i ).
thf(func_def_2,type,
epsa: ( $i > $i > $o ) > $i ).
thf(func_def_3,type,
epsb: ( $i > $i > $o ) > $i ).
thf(func_def_4,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_12,type,
sK0: $i > $i > $o ).
thf(func_def_16,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f73,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f40,f64,f65,f72]) ).
thf(f72,plain,
( spl3_4
| ~ spl3_1 ),
inference(avatar_split_clause,[status(thm)],[f71,f34,f46]) ).
thf(f46,definition,
( spl3_4
<=> ! [X2: $i,X1: $i] :
( ( sK0 @ X1 @ X2 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl3_4])],[avatar_definition]) ).
thf(f34,definition,
( spl3_1
<=> ! [X1: $i] :
( ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) )
@ X1 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl3_1])],[avatar_definition]) ).
thf(f71,plain,
( ! [X2: $i,X1: $i] :
( ( sK0 @ X1 @ X2 )
= $false )
| ~ spl3_1 ),
inference(trivial_inequality_removal,[status(thm)],[f70]) ).
thf(f70,plain,
( ! [X2: $i,X1: $i] :
( ( ( sK0 @ X1 @ X2 )
= $false )
| ( $true = $false ) )
| ~ spl3_1 ),
inference(forward_demodulation,[status(thm)],[f69,f35]) ).
thf(f35,plain,
( ! [X1: $i] :
( ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) )
@ X1 )
= $false )
| ~ spl3_1 ),
inference(avatar_component_clause,[status(thm)],[f34]) ).
thf(f69,plain,
! [X2: $i,X1: $i] :
( ( ( sK0 @ X1 @ X2 )
= $false )
| ( $true
= ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) )
@ sK7 ) ) ),
inference(sigma_clausification,[status(thm)],[f68]) ).
thf(f68,plain,
! [X2: $i,X1: $i] :
( ( ( sK0 @ X1 @ X2 )
= $false )
| ( $true
= ( ?? @ $i
@ ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) ) ) ) ) ),
inference(pi_clausification,[status(thm)],[f67]) ).
thf(f67,plain,
! [X1: $i] :
( ( $false
= ( ?? @ $i @ ( sK0 @ X1 ) ) )
| ( $true
= ( ?? @ $i
@ ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f66]) ).
thf(f66,plain,
! [X1: $i] :
( ( ( ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) )
@ X1 )
= $false )
| ( $true
= ( ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) )
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f65,plain,
~ spl3_2,
inference(avatar_split_clause,[status(thm)],[f27,f37]) ).
thf(f37,definition,
( spl3_2
<=> ( $true
= ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) )
@ ( eps
@ ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) ) ) ) ) ) ),
introduced(definition,[new_symbols(naming,[spl3_2])],[avatar_definition]) ).
thf(f27,plain,
( $true
!= ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) )
@ ( eps
@ ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f26]) ).
thf(f26,plain,
( $true
!= ( sK0
@ ( ^ [Y0: $i > $i > $o] :
( eps
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) )
@ sK0 )
@ ( ^ [Y0: $i > $i > $o] :
( eps
@ ^ [Y1: $i] :
( Y0
@ ( ^ [Y2: $i > $i > $o] :
( eps
@ ^ [Y3: $i] :
( ?? @ $i
@ ^ [Y4: $i] : ( Y2 @ Y3 @ Y4 ) ) )
@ Y0 )
@ Y1 ) )
@ sK0 ) ) ),
inference(definition_unfolding,[status(thm)],[f21,f22,f25]) ).
thf(f25,plain,
( epsb
= ( ^ [Y0: $i > $i > $o] :
( eps
@ ^ [Y1: $i] :
( Y0
@ ( ^ [Y2: $i > $i > $o] :
( eps
@ ^ [Y3: $i] :
( ?? @ $i
@ ^ [Y4: $i] : ( Y2 @ Y3 @ Y4 ) ) )
@ Y0 )
@ Y1 ) ) ) ),
inference(definition_unfolding,[status(thm)],[f23,f22]) ).
thf(f23,plain,
( epsb
= ( ^ [Y0: $i > $i > $o] :
( eps
@ ^ [Y1: $i] : ( Y0 @ ( epsa @ Y0 ) @ Y1 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( epsb
= ( ^ [Y0: $i > $i > $o] :
( eps
@ ^ [Y1: $i] : ( Y0 @ ( epsa @ Y0 ) @ Y1 ) ) ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
( ( ^ [X0: $i > $i > $o] :
( eps
@ ^ [X1: $i] : ( X0 @ ( epsa @ X0 ) @ X1 ) ) )
= epsb ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
( ( ^ [X2: $i > $i > $o] :
( eps
@ ^ [X3: $i] : ( X2 @ ( epsa @ X2 ) @ X3 ) ) )
= epsb ),
file('/export/starexec/sandbox2/tmp/tmp.PFZBRNFuAa/DTF2THF_13034.p',epsbd) ).
thf(f22,plain,
( epsa
= ( ^ [Y0: $i > $i > $o] :
( eps
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( epsa
= ( ^ [Y0: $i > $i > $o] :
( eps
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ^ [X0: $i > $i > $o] :
( eps
@ ^ [X1: $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) ) )
= epsa ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
( ( ^ [X2: $i > $i > $o] :
( eps
@ ^ [X1: $i] :
? [X3: $i] : ( X2 @ X1 @ X3 ) ) )
= epsa ),
file('/export/starexec/sandbox2/tmp/tmp.PFZBRNFuAa/DTF2THF_13034.p',epsad) ).
thf(f21,plain,
( $true
!= ( sK0 @ ( epsa @ sK0 ) @ ( epsb @ sK0 ) ) ),
inference(cnf_transformation,[status(thm)],[f19]) ).
thf(f19,plain,
( ( $true
!= ( sK0 @ ( epsa @ sK0 ) @ ( epsb @ sK0 ) ) )
& ( $true
= ( sK0 @ sK1 @ sK2 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f18,f17]) ).
thf(f17,plain,
( ? [X0: $i > $i > $o] :
( ( $true
!= ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) )
& ? [X1: $i,X2: $i] :
( $true
= ( X0 @ X1 @ X2 ) ) )
=> ( ( $true
!= ( sK0 @ ( epsa @ sK0 ) @ ( epsb @ sK0 ) ) )
& ? [X2: $i,X1: $i] :
( $true
= ( sK0 @ X1 @ X2 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f18,plain,
( ? [X2: $i,X1: $i] :
( $true
= ( sK0 @ X1 @ X2 ) )
=> ( $true
= ( sK0 @ sK1 @ sK2 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f16,plain,
? [X0: $i > $i > $o] :
( ( $true
!= ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) )
& ? [X1: $i,X2: $i] :
( $true
= ( X0 @ X1 @ X2 ) ) ),
inference(ennf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
~ ! [X0: $i > $i > $o] :
( ? [X1: $i,X2: $i] :
( $true
= ( X0 @ X1 @ X2 ) )
=> ( $true
= ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) ) ),
inference(fool_elimination,[status(thm)],[f13]) ).
thf(f13,plain,
~ ! [X0: $i > $i > $o] :
( ? [X1: $i,X2: $i] : ( X0 @ X1 @ X2 )
=> ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X2: $i > $i > $o] :
( ? [X1: $i,X3: $i] : ( X2 @ X1 @ X3 )
=> ( X2 @ ( epsa @ X2 ) @ ( epsb @ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
! [X2: $i > $i > $o] :
( ? [X1: $i,X3: $i] : ( X2 @ X1 @ X3 )
=> ( X2 @ ( epsa @ X2 ) @ ( epsb @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.PFZBRNFuAa/DTF2THF_13034.p',conj) ).
thf(f64,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[status(thm)],[f63]) ).
thf(f63,plain,
( $false
| ~ spl3_4 ),
inference(trivial_inequality_removal,[status(thm)],[f58]) ).
thf(f58,plain,
( ( $true = $false )
| ~ spl3_4 ),
inference(backward_demodulation,[status(thm)],[f20,f47]) ).
thf(f47,plain,
( ! [X2: $i,X1: $i] :
( ( sK0 @ X1 @ X2 )
= $false )
| ~ spl3_4 ),
inference(avatar_component_clause,[status(thm)],[f46]) ).
thf(f20,plain,
( $true
= ( sK0 @ sK1 @ sK2 ) ),
inference(cnf_transformation,[status(thm)],[f19]) ).
thf(f40,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[status(thm)],[f29,f37,f34]) ).
thf(f29,plain,
! [X1: $i] :
( ( ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) )
@ X1 )
= $false )
| ( $true
= ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) )
@ ( eps
@ ( sK0
@ ( eps
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) ) ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO530^1 : TPTP v9.2.1. Released v5.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.34 % Computer : n004.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 14:33:11 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.29/0.45 ---- Original DTF file ---
% 0.29/0.45 thf(spec,logic,$$dhol).
% 0.29/0.45 %------------------------------------------------------------------------------
% 0.29/0.45 % File : SYO530^1 : TPTP v9.2.1. Released v5.2.0.
% 0.29/0.45 % Domain : Syntactic
% 0.29/0.45 % Problem : Binary choice on individuals
% 0.29/0.45 % Version : Especial.
% 0.29/0.45 % English : epsa and epsb work together to give an a and b such that R a b
% 0.29/0.45 % holds, if such an a and b exist for a binary relation R on $i.
% 0.29/0.45 % A choice operator on i can be used to define a choice operator on
% 0.29/0.45 % i*i (Curried). In this version, the solution is given and the
% 0.29/0.45 % goal is to check that it works.
% 0.29/0.45
% 0.29/0.45 % Refs : [Bac10] Backes (2010), Tableaux for Higher-Order Logic with If
% 0.29/0.45 % : [Bro11] Brown E. (2011), Email to Geoff Sutcliffe
% 0.29/0.45 % Source : [Bro11]
% 0.29/0.45 % Names : CHOICE7 [Bro11]
% 0.29/0.45
% 0.29/0.45 % Status : Theorem
% 0.29/0.45 % Rating : 0.00 v9.0.0, 0.10 v8.2.0, 0.23 v8.1.0, 0.09 v7.5.0, 0.00 v7.4.0, 0.22 v7.2.0, 0.12 v7.1.0, 0.25 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.43 v6.1.0, 0.29 v5.5.0, 0.50 v5.4.0, 0.60 v5.2.0
% 0.29/0.45 % Syntax : Number of formulae : 7 ( 2 unt; 3 typ; 2 def)
% 0.29/0.45 % Number of atoms : 2 ( 2 equ; 0 cnn)
% 0.29/0.45 % Maximal formula atoms : 1 ( 0 avg)
% 0.29/0.45 % Number of connectives : 18 ( 0 ~; 0 |; 0 &; 16 @)
% 0.29/0.45 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.29/0.45 % Maximal formula depth : 7 ( 4 avg)
% 0.29/0.45 % Number of types : 2 ( 0 usr)
% 0.29/0.45 % Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% 0.29/0.45 % Number of symbols : 4 ( 3 usr; 0 con; 1-2 aty)
% 0.29/0.45 % Number of variables : 10 ( 4 ^; 2 !; 4 ?; 10 :)
% 0.29/0.45 % SPC : TH0_THM_EQU_NAR
% 0.29/0.45
% 0.29/0.45 % Comments :
% 0.29/0.45 %------------------------------------------------------------------------------
% 0.29/0.45 thf(eps,type,
% 0.29/0.45 eps: ( $i > $o ) > $i ).
% 0.29/0.45
% 0.29/0.45 thf(choiceax,axiom,
% 0.29/0.45 ! [P: $i > $o] :
% 0.29/0.45 ( ? [X: $i] : ( P @ X )
% 0.29/0.45 => ( P @ ( eps @ P ) ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(epsa,type,
% 0.29/0.45 epsa: ( $i > $i > $o ) > $i ).
% 0.29/0.45
% 0.29/0.45 thf(epsad,definition,
% 0.29/0.45 ( epsa
% 0.29/0.45 = ( ^ [R: $i > $i > $o] :
% 0.29/0.45 ( eps
% 0.29/0.45 @ ^ [X: $i] :
% 0.29/0.45 ? [Y: $i] : ( R @ X @ Y ) ) ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(epsb,type,
% 0.29/0.45 epsb: ( $i > $i > $o ) > $i ).
% 0.29/0.45
% 0.29/0.45 thf(epsbd,definition,
% 0.29/0.45 ( epsb
% 0.29/0.45 = ( ^ [R: $i > $i > $o] :
% 0.29/0.45 ( eps
% 0.29/0.45 @ ^ [Y: $i] : ( R @ ( epsa @ R ) @ Y ) ) ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(conj,conjecture,
% 0.29/0.45 ! [R: $i > $i > $o] :
% 0.29/0.45 ( ? [X: $i,Y: $i] : ( R @ X @ Y )
% 0.29/0.45 => ( R @ ( epsa @ R ) @ ( epsb @ R ) ) ) ).
% 0.29/0.45
% 0.29/0.45 %------------------------------------------------------------------------------
% 0.29/0.45 ------------------------
% 1.46/1.28 ---- Embedded in THF ---
% 1.46/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.46/1.28 %%% Generated on Tue Feb 24 14:33:12 EST 2026
% 1.46/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.46/1.28 %%% Logic specification used:
% 1.46/1.28 %%% thf(spec, logic, $$dhol).
% 1.46/1.28
% 1.46/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.PFZBRNFuAa/DTF2DTF13034.p
% See solution above
% 1.46/1.28 ------------------------
% 1.46/1.29 ---- Cleaned THF ---
% 1.46/1.29 thf(eps,type,
% 1.46/1.29 eps: ( $i > $o ) > $i ).
% 1.46/1.29
% 1.46/1.29 thf(choiceax,axiom,
% 1.46/1.29 ! [P: $i > $o] :
% 1.46/1.29 ( ? [X: $i] : ( P @ X )
% 1.46/1.29 => ( P @ ( eps @ P ) ) ) ).
% 1.46/1.29
% 1.46/1.29 thf(epsa,type,
% 1.46/1.29 epsa: ( $i > $i > $o ) > $i ).
% 1.46/1.29
% 1.46/1.29 thf(epsad,definition,
% 1.46/1.29 ( epsa
% 1.46/1.29 = ( ^ [R: $i > $i > $o] :
% 1.46/1.29 ( eps
% 1.46/1.29 @ ^ [X: $i] :
% 1.46/1.29 ? [Y: $i] : ( R @ X @ Y ) ) ) ) ).
% 1.46/1.29
% 1.46/1.29 thf(epsb,type,
% 1.46/1.29 epsb: ( $i > $i > $o ) > $i ).
% 1.46/1.29
% 1.46/1.29 thf(epsbd,definition,
% 1.46/1.29 ( epsb
% 1.46/1.29 = ( ^ [R: $i > $i > $o] :
% 1.46/1.29 ( eps
% 1.46/1.29 @ ^ [Y: $i] : ( R @ ( epsa @ R ) @ Y ) ) ) ) ).
% 1.46/1.29
% 1.46/1.29 thf(conj,conjecture,
% 1.46/1.29 ! [R: $i > $i > $o] :
% 1.46/1.29 ( ? [X: $i,Y: $i] : ( R @ X @ Y )
% 1.46/1.29 => ( R @ ( epsa @ R ) @ ( epsb @ R ) ) ) ).
% 1.46/1.29 ------------------------
% 1.65/1.31 % (13254)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_13034 for (2999ds/4Mi)
% 1.65/1.31 % (13254)Instruction limit reached!
% 1.65/1.31 % (13254)------------------------------
% 1.65/1.31 % (13254)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.31 % (13254)Termination reason: Unknown
% 1.65/1.31 % (13254)Termination phase: Saturation
% 1.65/1.31
% 1.65/1.31 % (13254)Memory used [KB]: 5500
% 1.65/1.31 % (13254)Time elapsed: 0.003 s
% 1.65/1.31 % (13254)Instructions burned: 4 (million)
% 1.65/1.31 % (13254)------------------------------
% 1.65/1.31 % (13254)------------------------------
% 1.65/1.32 % (13253)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_13034 for (2999ds/183Mi)
% 1.65/1.32 % (13255)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_13034 for (2999ds/27Mi)
% 1.65/1.32 % (13256)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_13034 for (2999ds/2Mi)
% 1.65/1.32 % (13257)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_13034 for (2999ds/2Mi)
% 1.65/1.32 % (13258)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_13034 for (2999ds/275Mi)
% 1.65/1.32 % (13259)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_13034 for (2999ds/18Mi)
% 1.65/1.32 % (13257)Instruction limit reached!
% 1.65/1.32 % (13257)------------------------------
% 1.65/1.32 % (13257)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.32 % (13257)Termination reason: Unknown
% 1.65/1.32 % (13257)Termination phase: Property scanning
% 1.65/1.32
% 1.65/1.32 % (13257)Memory used [KB]: 895
% 1.65/1.32 % (13257)Time elapsed: 0.003 s
% 1.65/1.32 % (13257)Instructions burned: 2 (million)
% 1.65/1.32 % (13257)------------------------------
% 1.65/1.32 % (13257)------------------------------
% 1.65/1.32 % (13256)Instruction limit reached!
% 1.65/1.32 % (13256)------------------------------
% 1.65/1.32 % (13256)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.32 % (13256)Termination reason: Unknown
% 1.65/1.32 % (13256)Termination phase: Saturation
% 1.65/1.32
% 1.65/1.32 % (13256)Memory used [KB]: 5500
% 1.65/1.32 % (13256)Time elapsed: 0.004 s
% 1.65/1.32 % (13256)Instructions burned: 2 (million)
% 1.65/1.32 % (13256)------------------------------
% 1.65/1.32 % (13256)------------------------------
% 1.65/1.32 % (13258)Refutation not found, incomplete strategy
% 1.65/1.32 % (13258)------------------------------
% 1.65/1.32 % (13258)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.32 % (13258)Termination reason: Refutation not found, incomplete strategy
% 1.65/1.32
% 1.65/1.32
% 1.65/1.32 % (13258)Memory used [KB]: 5500
% 1.65/1.32 % (13258)Time elapsed: 0.004 s
% 1.65/1.32 % (13258)Instructions burned: 2 (million)
% 1.65/1.32 % (13258)------------------------------
% 1.65/1.32 % (13258)------------------------------
% 1.65/1.32 % (13255)First to succeed.
% 1.65/1.32 % (13260)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_13034 for (2999ds/3Mi)
% 1.65/1.32 % (13255)Refutation found. Thanks to Tanya!
% 1.65/1.32 % SZS status Theorem for DTF2THF_13034
% 1.65/1.32 % SZS output start Proof for DTF2THF_13034
% 1.65/1.32 thf(func_def_0, type, eps: ($i > $o) > $i).
% 1.65/1.32 thf(func_def_2, type, epsa: ($i > $i > $o) > $i).
% 1.65/1.32 thf(func_def_3, type, epsb: ($i > $i > $o) > $i).
% 1.65/1.32 thf(func_def_4, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 1.65/1.32 thf(func_def_12, type, sK0: $i > $i > $o).
% 1.65/1.32 thf(func_def_16, type, ph4: !>[X0: $tType]:(X0)).
% 1.65/1.32 thf(f73,plain,(
% 1.65/1.32 $false),
% 1.65/1.32 inference(avatar_sat_refutation,[status(thm)],[f40,f64,f65,f72])).
% 1.65/1.32 thf(f72,plain,(
% 1.65/1.32 spl3_4 | ~spl3_1),
% 1.65/1.32 inference(avatar_split_clause,[status(thm)],[f71,f34,f46])).
% 1.65/1.32 thf(f46,definition,(
% 1.65/1.32 spl3_4 <=> ! [X2 : $i,X1 : $i] : ((sK0 @ X1 @ X2) = $false)),
% 1.65/1.32 introduced(definition,[new_symbols(naming,[spl3_4])],[avatar_definition])).
% 1.65/1.32 thf(f34,definition,(
% 1.65/1.32 spl3_1 <=> ! [X1 : $i] : ((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0)))) @ X1) = $false)),
% 1.65/1.32 introduced(definition,[new_symbols(naming,[spl3_1])],[avatar_definition])).
% 1.65/1.32 thf(f71,plain,(
% 1.65/1.32 ( ! [X2 : $i,X1 : $i] : (((sK0 @ X1 @ X2) = $false)) ) | ~spl3_1),
% 1.65/1.32 inference(trivial_inequality_removal,[status(thm)],[f70])).
% 1.65/1.32 thf(f70,plain,(
% 1.65/1.32 ( ! [X2 : $i,X1 : $i] : (((sK0 @ X1 @ X2) = $false) | ($true = $false)) ) | ~spl3_1),
% 1.65/1.32 inference(forward_demodulation,[status(thm)],[f69,f35])).
% 1.65/1.32 thf(f35,plain,(
% 1.65/1.32 ( ! [X1 : $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0)))) @ X1) = $false)) ) | ~spl3_1),
% 1.65/1.32 inference(avatar_component_clause,[status(thm)],[f34])).
% 1.65/1.32 thf(f69,plain,(
% 1.65/1.32 ( ! [X2 : $i,X1 : $i] : (((sK0 @ X1 @ X2) = $false) | ($true = (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0)))) @ sK7))) )),
% 1.65/1.32 inference(sigma_clausification,[status(thm)],[f68])).
% 1.65/1.32 thf(f68,plain,(
% 1.65/1.32 ( ! [X2 : $i,X1 : $i] : (((sK0 @ X1 @ X2) = $false) | ($true = (?? @ $i @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0)))))))) )),
% 1.65/1.32 inference(pi_clausification,[status(thm)],[f67])).
% 1.65/1.32 thf(f67,plain,(
% 1.65/1.32 ( ! [X1 : $i] : (($false = (?? @ $i @ (sK0 @ X1))) | ($true = (?? @ $i @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0)))))))) )),
% 1.65/1.32 inference(beta_eta_normalization,[status(thm)],[f66])).
% 1.65/1.32 thf(f66,plain,(
% 1.65/1.32 ( ! [X1 : $i] : ((((^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0))) @ X1) = $false) | ($true = ((^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0))) @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0))))))) )),
% 1.65/1.32 introduced(definition,[],[choice_axiom])).
% 1.65/1.32 thf(f65,plain,(
% 1.65/1.32 ~spl3_2),
% 1.65/1.32 inference(avatar_split_clause,[status(thm)],[f27,f37])).
% 1.65/1.32 thf(f37,definition,(
% 1.65/1.32 spl3_2 <=> ($true = (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0)))) @ (eps @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0))))))))),
% 1.65/1.32 introduced(definition,[new_symbols(naming,[spl3_2])],[avatar_definition])).
% 1.65/1.32 thf(f27,plain,(
% 1.65/1.32 ($true != (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0)))) @ (eps @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0))))))))),
% 1.65/1.32 inference(beta_eta_normalization,[status(thm)],[f26])).
% 1.65/1.32 thf(f26,plain,(
% 1.65/1.32 ($true != (sK0 @ ((^[Y0 : $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))) @ sK0) @ ((^[Y0 : $i > $i > $o]: (eps @ (^[Y1 : $i]: (Y0 @ ((^[Y2 : $i > $i > $o]: (eps @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (Y2 @ Y3 @ Y4)))))) @ Y0) @ Y1)))) @ sK0)))),
% 1.65/1.32 inference(definition_unfolding,[status(thm)],[f21,f22,f25])).
% 1.65/1.32 thf(f25,plain,(
% 1.65/1.32 (epsb = (^[Y0 : $i > $i > $o]: (eps @ (^[Y1 : $i]: (Y0 @ ((^[Y2 : $i > $i > $o]: (eps @ (^[Y3 : $i]: (?? @ $i @ (^[Y4 : $i]: (Y2 @ Y3 @ Y4)))))) @ Y0) @ Y1)))))),
% 1.65/1.32 inference(definition_unfolding,[status(thm)],[f23,f22])).
% 1.65/1.32 thf(f23,plain,(
% 1.65/1.32 (epsb = (^[Y0 : $i > $i > $o]: (eps @ (^[Y1 : $i]: (Y0 @ (epsa @ Y0) @ Y1)))))),
% 1.65/1.32 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.32 thf(f8,plain,(
% 1.65/1.32 (epsb = (^[Y0 : $i > $i > $o]: (eps @ (^[Y1 : $i]: (Y0 @ (epsa @ Y0) @ Y1)))))),
% 1.65/1.32 inference(fool_elimination,[status(thm)],[f7])).
% 1.65/1.32 thf(f7,plain,(
% 1.65/1.32 ((^[X0 : $i > $i > $o] : (eps @ (^[X1 : $i] : (X0 @ (epsa @ X0) @ X1)))) = epsb)),
% 1.65/1.32 inference(rectify,[status(thm)],[f3])).
% 1.65/1.32 thf(f3,axiom,(
% 1.65/1.32 ((^[X2 : $i > $i > $o] : (eps @ (^[X3 : $i] : (X2 @ (epsa @ X2) @ X3)))) = epsb)),
% 1.65/1.32 file('/export/starexec/sandbox2/tmp/tmp.PFZBRNFuAa/DTF2THF_13034.p',epsbd)).
% 1.65/1.32 thf(f22,plain,(
% 1.65/1.32 (epsa = (^[Y0 : $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 1.65/1.32 inference(cnf_transformation,[status(thm)],[f10])).
% 1.65/1.32 thf(f10,plain,(
% 1.65/1.32 (epsa = (^[Y0 : $i > $i > $o]: (eps @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 1.65/1.32 inference(fool_elimination,[status(thm)],[f9])).
% 1.65/1.32 thf(f9,plain,(
% 1.65/1.32 ((^[X0 : $i > $i > $o] : (eps @ (^[X1 : $i] : (? [X2 : $i] : (X0 @ X1 @ X2))))) = epsa)),
% 1.65/1.32 inference(rectify,[status(thm)],[f2])).
% 1.65/1.32 thf(f2,axiom,(
% 1.65/1.32 ((^[X2 : $i > $i > $o] : (eps @ (^[X1 : $i] : (? [X3 : $i] : (X2 @ X1 @ X3))))) = epsa)),
% 1.65/1.32 file('/export/starexec/sandbox2/tmp/tmp.PFZBRNFuAa/DTF2THF_13034.p',epsad)).
% 1.65/1.32 thf(f21,plain,(
% 1.65/1.32 ($true != (sK0 @ (epsa @ sK0) @ (epsb @ sK0)))),
% 1.65/1.32 inference(cnf_transformation,[status(thm)],[f19])).
% 1.65/1.32 thf(f19,plain,(
% 1.65/1.32 ($true != (sK0 @ (epsa @ sK0) @ (epsb @ sK0))) & ($true = (sK0 @ sK1 @ sK2))),
% 1.65/1.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f18,f17])).
% 1.65/1.32 thf(f17,plain,(
% 1.65/1.32 ? [X0 : $i > $i > $o] : (($true != (X0 @ (epsa @ X0) @ (epsb @ X0))) & ? [X1 : $i,X2 : $i] : ($true = (X0 @ X1 @ X2))) => (($true != (sK0 @ (epsa @ sK0) @ (epsb @ sK0))) & ? [X2 : $i,X1 : $i] : ($true = (sK0 @ X1 @ X2)))),
% 1.65/1.32 introduced(definition,[],[choice_axiom])).
% 1.65/1.32 thf(f18,plain,(
% 1.65/1.32 ? [X2 : $i,X1 : $i] : ($true = (sK0 @ X1 @ X2)) => ($true = (sK0 @ sK1 @ sK2))),
% 1.65/1.32 introduced(definition,[],[choice_axiom])).
% 1.65/1.32 thf(f16,plain,(
% 1.65/1.32 ? [X0 : $i > $i > $o] : (($true != (X0 @ (epsa @ X0) @ (epsb @ X0))) & ? [X1 : $i,X2 : $i] : ($true = (X0 @ X1 @ X2)))),
% 1.65/1.32 inference(ennf_transformation,[status(thm)],[f14])).
% 1.65/1.32 thf(f14,plain,(
% 1.65/1.32 ~! [X0 : $i > $i > $o] : (? [X1 : $i,X2 : $i] : ($true = (X0 @ X1 @ X2)) => ($true = (X0 @ (epsa @ X0) @ (epsb @ X0))))),
% 1.65/1.32 inference(fool_elimination,[status(thm)],[f13])).
% 1.65/1.32 thf(f13,plain,(
% 1.65/1.32 ~! [X0 : $i > $i > $o] : (? [X1 : $i,X2 : $i] : (X0 @ X1 @ X2) => (X0 @ (epsa @ X0) @ (epsb @ X0)))),
% 1.65/1.32 inference(rectify,[status(thm)],[f5])).
% 1.65/1.32 thf(f5,negated_conjecture,(
% 1.65/1.32 ~! [X2 : $i > $i > $o] : (? [X1 : $i,X3 : $i] : (X2 @ X1 @ X3) => (X2 @ (epsa @ X2) @ (epsb @ X2)))),
% 1.65/1.32 inference(negated_conjecture,[status(cth)],[f4])).
% 1.65/1.32 thf(f4,conjecture,(
% 1.65/1.32 ! [X2 : $i > $i > $o] : (? [X1 : $i,X3 : $i] : (X2 @ X1 @ X3) => (X2 @ (epsa @ X2) @ (epsb @ X2)))),
% 1.65/1.32 file('/export/starexec/sandbox2/tmp/tmp.PFZBRNFuAa/DTF2THF_13034.p',conj)).
% 1.65/1.32 thf(f64,plain,(
% 1.65/1.32 ~spl3_4),
% 1.65/1.32 inference(avatar_contradiction_clause,[status(thm)],[f63])).
% 1.65/1.32 thf(f63,plain,(
% 1.65/1.32 $false | ~spl3_4),
% 1.65/1.32 inference(trivial_inequality_removal,[status(thm)],[f58])).
% 1.65/1.32 thf(f58,plain,(
% 1.65/1.32 ($true = $false) | ~spl3_4),
% 1.65/1.32 inference(backward_demodulation,[status(thm)],[f20,f47])).
% 1.65/1.32 thf(f47,plain,(
% 1.65/1.32 ( ! [X2 : $i,X1 : $i] : (((sK0 @ X1 @ X2) = $false)) ) | ~spl3_4),
% 1.65/1.32 inference(avatar_component_clause,[status(thm)],[f46])).
% 1.65/1.32 thf(f20,plain,(
% 1.65/1.32 ($true = (sK0 @ sK1 @ sK2))),
% 1.65/1.32 inference(cnf_transformation,[status(thm)],[f19])).
% 1.65/1.32 thf(f40,plain,(
% 1.65/1.32 spl3_1 | spl3_2),
% 1.65/1.32 inference(avatar_split_clause,[status(thm)],[f29,f37,f34])).
% 1.65/1.32 thf(f29,plain,(
% 1.65/1.32 ( ! [X1 : $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0)))) @ X1) = $false) | ($true = (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0)))) @ (eps @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0))))))))) )),
% 1.65/1.32 introduced(definition,[],[choice_axiom])).
% 1.65/1.32 % SZS output end Proof for DTF2THF_13034
% 1.65/1.32 % (13255)------------------------------
% 1.65/1.32 % (13255)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.32 % (13255)Termination reason: Refutation
% 1.65/1.32
% 1.65/1.32 % (13255)Memory used [KB]: 5500
% 1.65/1.32 % (13255)Time elapsed: 0.007 s
% 1.65/1.32 % (13255)Instructions burned: 5 (million)
% 1.65/1.32 % (13255)------------------------------
% 1.65/1.32 % (13255)------------------------------
% 1.65/1.32 % (13252)Success in time 0.022 s
%------------------------------------------------------------------------------