%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO513^1 : TPTP v9.2.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n007.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:26 AM UTC 2026
% Result : Theorem 1.48s 1.28s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 65 ( 20 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 80 ( 9 ~; 2 |; 4 &; 56 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 4 usr; 3 con; 0-2 aty)
% ( 0 !!; 0 ??; 3 @@+; 0 @@-)
% Number of variables : 28 ( 0 ^; 14 !; 14 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_4,type,
sK0: ( ( $o > $o ) > $o ) > $o > $o ).
thf(func_def_5,type,
sK1: ( ( $o > $o ) > $o ) > $o ).
thf(func_def_7,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f23,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f21]) ).
thf(f21,plain,
$false = $true,
inference(superposition,[status(thm)],[f10,f16]) ).
thf(f16,plain,
! [X0: $o] :
( $false
= ( sK0 @ @@+ @ $o @ X0 ) ),
inference(trivial_inequality_removal,[status(thm)],[f14]) ).
thf(f14,plain,
! [X0: $o] :
( ( $false
= ( sK0 @ @@+ @ $o @ X0 ) )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f11,f12]) ).
thf(f12,plain,
! [X0: ( $o > $o ) > $o,X1: $o] :
( ( ( sK0 @ X0 @ ( @@+ @ $o @ ( sK0 @ X0 ) ) )
= $true )
| ( ( sK0 @ X0 @ X1 )
= $false ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f11,plain,
! [X0: ( $o > $o ) > $o] :
( ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
! [X0: ( $o > $o ) > $o] :
( ( ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) )
!= $true )
& ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
thf(f7,plain,
! [X0: ( $o > $o ) > $o] :
( ? [X1: $o > $o] :
( ( ( X1 @ ( X0 @ X1 ) )
!= $true )
& ? [X2: $o] :
( ( X1 @ X2 )
= $true ) )
=> ( ( ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) )
!= $true )
& ? [X2: $o] :
( ( sK0 @ X0 @ X2 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
! [X0: ( $o > $o ) > $o] :
( ? [X2: $o] :
( ( sK0 @ X0 @ X2 )
= $true )
=> ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
! [X0: ( $o > $o ) > $o] :
? [X1: $o > $o] :
( ( ( X1 @ ( X0 @ X1 ) )
!= $true )
& ? [X2: $o] :
( ( X1 @ X2 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ? [X0: ( $o > $o ) > $o] :
! [X1: $o > $o] :
( ? [X2: $o] :
( ( X1 @ X2 )
= $true )
=> ( ( X1 @ ( X0 @ X1 ) )
= $true ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ? [X0: ( $o > $o ) > $o] :
! [X1: $o > $o] :
( ? [X2: $o] : ( X1 @ X2 )
=> ( X1 @ ( X0 @ X1 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ? [X0: ( $o > $o ) > $o] :
! [X1: $o > $o] :
( ? [X2: $o] : ( X1 @ X2 )
=> ( X1 @ ( X0 @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
? [X0: ( $o > $o ) > $o] :
! [X1: $o > $o] :
( ? [X2: $o] : ( X1 @ X2 )
=> ( X1 @ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Z75rJ5Qebf/DTF2THF_10267.p',choiceo) ).
thf(f10,plain,
! [X0: ( $o > $o ) > $o] :
( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO513^1 : TPTP v9.2.1. Released v4.1.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n007.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 14:32:23 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.28/0.45 ---- Original DTF file ---
% 0.28/0.45 thf(spec,logic,$$dhol).
% 0.28/0.45 %------------------------------------------------------------------------------
% 0.28/0.45 % File : SYO513^1 : TPTP v9.2.1. Released v4.1.0.
% 0.28/0.45 % Domain : Syntactic
% 0.28/0.45 % Problem : There is a choice operator at type o
% 0.28/0.45 % Version : Especial.
% 0.28/0.45 % English :
% 0.28/0.45
% 0.28/0.45 % Refs : [Bro09] Brown E. (2009), Email to Geoff Sutcliffe
% 0.28/0.45 % Source : [Bro09]
% 0.28/0.45 % Names : choiceo [Bro09]
% 0.28/0.45
% 0.28/0.45 % Status : Theorem
% 0.28/0.45 % : Without choice : Theorem
% 0.28/0.45 % Rating : 0.00 v8.1.0, 0.08 v7.4.0, 0.00 v7.3.0, 0.10 v7.2.0, 0.00 v6.2.0, 0.33 v6.1.0, 0.00 v5.5.0, 0.20 v5.4.0, 0.50 v5.3.0, 0.75 v5.2.0, 1.00 v4.1.0
% 0.28/0.45 % Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% 0.28/0.45 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.28/0.45 % Maximal formula atoms : 0 ( 0 avg)
% 0.28/0.45 % Number of connectives : 4 ( 0 ~; 0 |; 0 &; 3 @)
% 0.28/0.45 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.28/0.45 % Maximal formula depth : 6 ( 6 avg)
% 0.28/0.45 % Number of types : 1 ( 0 usr)
% 0.28/0.45 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.28/0.45 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.28/0.45 % Number of variables : 3 ( 0 ^; 1 !; 2 ?; 3 :)
% 0.28/0.45 % SPC : TH0_THM_NEQ_NAR
% 0.28/0.45
% 0.28/0.45 % Comments : This theorem is in a sense trivial because the semantics is Henkin
% 0.28/0.45 % with choice. It is also a theorem if we do not assume choice
% 0.28/0.45 % because \x.x $true is a choice operator at type o.
% 0.28/0.45 %------------------------------------------------------------------------------
% 0.28/0.45 thf(choiceo,conjecture,
% 0.28/0.45 ? [C: ( $o > $o ) > $o] :
% 0.28/0.45 ! [P: $o > $o] :
% 0.28/0.45 ( ? [X: $o] : ( P @ X )
% 0.28/0.45 => ( P @ ( C @ P ) ) ) ).
% 0.28/0.45
% 0.28/0.45 %------------------------------------------------------------------------------
% 0.28/0.45 ------------------------
% 1.48/1.24 ---- Embedded in THF ---
% 1.48/1.24 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.24 %%% Generated on Tue Feb 24 14:32:24 EST 2026
% 1.48/1.24 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.24 %%% Logic specification used:
% 1.48/1.24 %%% thf(spec, logic, $$dhol).
% 1.48/1.24
% 1.48/1.24 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.Z75rJ5Qebf/DTF2DTF10267.p
% See solution above
% 1.48/1.24 ------------------------
% 1.48/1.25 ---- Cleaned THF ---
% 1.48/1.25 thf(choiceo,conjecture,
% 1.48/1.25 ? [C: ( $o > $o ) > $o] :
% 1.48/1.25 ! [P: $o > $o] :
% 1.48/1.25 ( ? [X: $o] : ( P @ X )
% 1.48/1.25 => ( P @ ( C @ P ) ) ) ).
% 1.48/1.25 ------------------------
% 1.48/1.27 % (10378)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_10267 for (2999ds/2Mi)
% 1.48/1.27 % (10375)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_10267 for (2999ds/4Mi)
% 1.48/1.27 % (10378)Instruction limit reached!
% 1.48/1.27 % (10378)------------------------------
% 1.48/1.27 % (10378)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.27 % (10378)Termination reason: Unknown
% 1.48/1.27 % (10378)Termination phase: Saturation
% 1.48/1.27
% 1.48/1.27 % (10378)Memory used [KB]: 5500
% 1.48/1.27 % (10378)Time elapsed: 0.002 s
% 1.48/1.27 % (10378)Instructions burned: 2 (million)
% 1.48/1.27 % (10378)------------------------------
% 1.48/1.27 % (10378)------------------------------
% 1.48/1.27 % (10375)Instruction limit reached!
% 1.48/1.27 % (10375)------------------------------
% 1.48/1.27 % (10375)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.27 % (10375)Termination reason: Unknown
% 1.48/1.27 % (10375)Termination phase: Saturation
% 1.48/1.27
% 1.48/1.27 % (10375)Memory used [KB]: 5500
% 1.48/1.27 % (10375)Time elapsed: 0.003 s
% 1.48/1.27 % (10375)Instructions burned: 5 (million)
% 1.48/1.27 % (10375)------------------------------
% 1.48/1.27 % (10375)------------------------------
% 1.48/1.27 % (10374)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_10267 for (2999ds/183Mi)
% 1.48/1.27 % (10376)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_10267 for (2999ds/27Mi)
% 1.48/1.27 % (10377)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_10267 for (2999ds/2Mi)
% 1.48/1.28 % (10379)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_10267 for (2999ds/275Mi)
% 1.48/1.28 % (10380)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_10267 for (2999ds/18Mi)
% 1.48/1.28 % (10377)Refutation not found, incomplete strategy
% 1.48/1.28 % (10377)------------------------------
% 1.48/1.28 % (10377)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (10377)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.28
% 1.48/1.28 % (10379)Refutation not found, incomplete strategy
% 1.48/1.28 % (10379)------------------------------
% 1.48/1.28 % (10379)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (10379)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.28
% 1.48/1.28
% 1.48/1.28 % (10379)Memory used [KB]: 5500
% 1.48/1.28 % (10379)Time elapsed: 0.003 s
% 1.48/1.28 % (10379)Instructions burned: 1 (million)
% 1.48/1.28 % (10379)------------------------------
% 1.48/1.28 % (10379)------------------------------
% 1.48/1.28
% 1.48/1.28 % (10377)Memory used [KB]: 5500
% 1.48/1.28 % (10377)Time elapsed: 0.003 s
% 1.48/1.28 % (10377)Instructions burned: 1 (million)
% 1.48/1.28 % (10377)------------------------------
% 1.48/1.28 % (10377)------------------------------
% 1.48/1.28 % (10381)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_10267 for (2999ds/3Mi)
% 1.48/1.28 % (10376)First to succeed.
% 1.48/1.28 % (10381)Instruction limit reached!
% 1.48/1.28 % (10381)------------------------------
% 1.48/1.28 % (10381)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (10381)Termination reason: Unknown
% 1.48/1.28 % (10381)Termination phase: Saturation
% 1.48/1.28
% 1.48/1.28 % (10381)Memory used [KB]: 5500
% 1.48/1.28 % (10381)Time elapsed: 0.002 s
% 1.48/1.28 % (10381)Instructions burned: 3 (million)
% 1.48/1.28 % (10381)------------------------------
% 1.48/1.28 % (10381)------------------------------
% 1.48/1.28 % (10376)Refutation found. Thanks to Tanya!
% 1.48/1.28 % SZS status Theorem for DTF2THF_10267
% 1.48/1.28 % SZS output start Proof for DTF2THF_10267
% 1.48/1.28 thf(func_def_1, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 1.48/1.28 thf(func_def_4, type, sK0: (($o > $o) > $o) > $o > $o).
% 1.48/1.28 thf(func_def_5, type, sK1: (($o > $o) > $o) > $o).
% 1.48/1.28 thf(func_def_7, type, ph3: !>[X0: $tType]:(X0)).
% 1.48/1.28 thf(f23,plain,(
% 1.48/1.28 $false),
% 1.48/1.28 inference(trivial_inequality_removal,[status(thm)],[f21])).
% 1.48/1.28 thf(f21,plain,(
% 1.48/1.28 ($false = $true)),
% 1.48/1.28 inference(superposition,[status(thm)],[f10,f16])).
% 1.48/1.28 thf(f16,plain,(
% 1.48/1.28 ( ! [X0 : $o] : (($false = (sK0 @ @@+ @ $o @ X0))) )),
% 1.48/1.28 inference(trivial_inequality_removal,[status(thm)],[f14])).
% 1.48/1.28 thf(f14,plain,(
% 1.48/1.28 ( ! [X0 : $o] : (($false = (sK0 @ @@+ @ $o @ X0)) | ($true != $true)) )),
% 1.48/1.28 inference(superposition,[status(thm)],[f11,f12])).
% 1.48/1.28 thf(f12,plain,(
% 1.48/1.28 ( ! [X0 : ($o > $o) > $o,X1 : $o] : (((sK0 @ X0 @ (@@+ @ $o @ (sK0 @ X0))) = $true) | ((sK0 @ X0 @ X1) = $false)) )),
% 1.48/1.28 introduced(definition,[],[choice_axiom])).
% 1.48/1.28 thf(f11,plain,(
% 1.48/1.28 ( ! [X0 : ($o > $o) > $o] : (((sK0 @ X0 @ (X0 @ (sK0 @ X0))) != $true)) )),
% 1.48/1.28 inference(cnf_transformation,[status(thm)],[f9])).
% 1.48/1.28 thf(f9,plain,(
% 1.48/1.28 ! [X0 : ($o > $o) > $o] : (((sK0 @ X0 @ (X0 @ (sK0 @ X0))) != $true) & ((sK0 @ X0 @ (sK1 @ X0)) = $true))),
% 1.48/1.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7])).
% 1.48/1.28 thf(f7,plain,(
% 1.48/1.28 ! [X0 : ($o > $o) > $o] : (? [X1 : $o > $o] : (((X1 @ (X0 @ X1)) != $true) & ? [X2 : $o] : ((X1 @ X2) = $true)) => (((sK0 @ X0 @ (X0 @ (sK0 @ X0))) != $true) & ? [X2 : $o] : ((sK0 @ X0 @ X2) = $true)))),
% 1.48/1.28 introduced(definition,[],[choice_axiom])).
% 1.48/1.28 thf(f8,plain,(
% 1.48/1.28 ! [X0 : ($o > $o) > $o] : (? [X2 : $o] : ((sK0 @ X0 @ X2) = $true) => ((sK0 @ X0 @ (sK1 @ X0)) = $true))),
% 1.48/1.28 introduced(definition,[],[choice_axiom])).
% 1.48/1.28 thf(f6,plain,(
% 1.48/1.28 ! [X0 : ($o > $o) > $o] : ? [X1 : $o > $o] : (((X1 @ (X0 @ X1)) != $true) & ? [X2 : $o] : ((X1 @ X2) = $true))),
% 1.48/1.28 inference(ennf_transformation,[status(thm)],[f5])).
% 1.48/1.28 thf(f5,plain,(
% 1.48/1.28 ~? [X0 : ($o > $o) > $o] : ! [X1 : $o > $o] : (? [X2 : $o] : ((X1 @ X2) = $true) => ((X1 @ (X0 @ X1)) = $true))),
% 1.48/1.28 inference(fool_elimination,[status(thm)],[f4])).
% 1.48/1.28 thf(f4,plain,(
% 1.48/1.28 ~? [X0 : ($o > $o) > $o] : ! [X1 : $o > $o] : (? [X2 : $o] : (X1 @ X2) => (X1 @ (X0 @ X1)))),
% 1.48/1.28 inference(rectify,[status(thm)],[f2])).
% 1.48/1.28 thf(f2,negated_conjecture,(
% 1.48/1.28 ~? [X0 : ($o > $o) > $o] : ! [X1 : $o > $o] : (? [X2 : $o] : (X1 @ X2) => (X1 @ (X0 @ X1)))),
% 1.48/1.28 inference(negated_conjecture,[status(cth)],[f1])).
% 1.48/1.28 thf(f1,conjecture,(
% 1.48/1.28 ? [X0 : ($o > $o) > $o] : ! [X1 : $o > $o] : (? [X2 : $o] : (X1 @ X2) => (X1 @ (X0 @ X1)))),
% 1.48/1.28 file('/export/starexec/sandbox/tmp/tmp.Z75rJ5Qebf/DTF2THF_10267.p',choiceo)).
% 1.48/1.28 thf(f10,plain,(
% 1.48/1.28 ( ! [X0 : ($o > $o) > $o] : (((sK0 @ X0 @ (sK1 @ X0)) = $true)) )),
% 1.48/1.28 inference(cnf_transformation,[status(thm)],[f9])).
% 1.48/1.28 % SZS output end Proof for DTF2THF_10267
% 1.48/1.28 % (10376)------------------------------
% 1.48/1.28 % (10376)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (10376)Termination reason: Refutation
% 1.48/1.28
% 1.48/1.28 % (10376)Memory used [KB]: 5500
% 1.48/1.28 % (10376)Time elapsed: 0.005 s
% 1.48/1.28 % (10376)Instructions burned: 2 (million)
% 1.48/1.28 % (10376)------------------------------
% 1.48/1.28 % (10376)------------------------------
% 1.48/1.28 % (10373)Success in time 0.012 s
%------------------------------------------------------------------------------