%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO003^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n012.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:53:06 AM UTC 2026
% Result : Theorem 1.54s 1.31s
% Output : Refutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 119 ( 35 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 114 ( 10 ~; 2 |; 14 &; 71 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 5 con; 0-2 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 41 ( 15 ^; 17 !; 9 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
leibeq: $i > $i > $o ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_11,type,
sK0: $i > $o ).
thf(func_def_15,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f27,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f26]) ).
thf(f26,plain,
$true != $true,
inference(superposition,[status(thm)],[f13,f24]) ).
thf(f24,plain,
( ( sK0 @ sK1 )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f22]) ).
thf(f22,plain,
( ( ( sK0 @ sK1 )
= $true )
| ( $true = $false ) ),
inference(superposition,[status(thm)],[f21,f15]) ).
thf(f15,plain,
( $true
= ( sK0 @ sK2 ) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( ( $true
= ( sK0 @ sK2 ) )
& ( ( leibeq @ sK2 @ sK1 )
= $true )
& ( ( sK0 @ sK1 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11]) ).
thf(f11,plain,
( ? [X0: $i > $o,X1: $i,X2: $i] :
( ( $true
= ( X0 @ X2 ) )
& ( ( leibeq @ X2 @ X1 )
= $true )
& ( $true
!= ( X0 @ X1 ) ) )
=> ( ( $true
= ( sK0 @ sK2 ) )
& ( ( leibeq @ sK2 @ sK1 )
= $true )
& ( ( sK0 @ sK1 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
? [X0: $i > $o,X1: $i,X2: $i] :
( ( $true
= ( X0 @ X2 ) )
& ( ( leibeq @ X2 @ X1 )
= $true )
& ( $true
!= ( X0 @ X1 ) ) ),
inference(flattening,[status(thm)],[f9]) ).
thf(f9,plain,
? [X0: $i > $o,X1: $i,X2: $i] :
( ( $true
!= ( X0 @ X1 ) )
& ( ( leibeq @ X2 @ X1 )
= $true )
& ( $true
= ( X0 @ X2 ) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ! [X0: $i > $o,X1: $i,X2: $i] :
( ( ( ( leibeq @ X2 @ X1 )
= $true )
& ( $true
= ( X0 @ X2 ) ) )
=> ( $true
= ( X0 @ X1 ) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: $i > $o,X1: $i,X2: $i] :
( ( ( leibeq @ X2 @ X1 )
& ( X0 @ X2 ) )
=> ( X0 @ X1 ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,negated_conjecture,
~ ! [X2: $i > $o,X1: $i,X0: $i] :
( ( ( leibeq @ X0 @ X1 )
& ( X2 @ X0 ) )
=> ( X2 @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f2,conjecture,
! [X2: $i > $o,X1: $i,X0: $i] :
( ( ( leibeq @ X0 @ X1 )
& ( X2 @ X0 ) )
=> ( X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.zclfHsQkE0/DTF2THF_836.p',conj) ).
thf(f21,plain,
! [X1: $i > $o] :
( ( ( X1 @ sK2 )
= $false )
| ( ( X1 @ sK1 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f20]) ).
thf(f20,plain,
! [X1: $i > $o] :
( $true
= ( ( X1 @ sK2 )
=> ( X1 @ sK1 ) ) ),
inference(beta_eta_normalization,[status(thm)],[f19]) ).
thf(f19,plain,
! [X1: $i > $o] :
( $true
= ( ^ [Y0: $i > $o] :
( ( Y0 @ sK2 )
=> ( Y0 @ sK1 ) )
@ X1 ) ),
inference(pi_clausification,[status(thm)],[f18]) ).
thf(f18,plain,
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( Y0 @ sK2 )
=> ( Y0 @ sK1 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f17]) ).
thf(f17,plain,
( $true
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ sK2
@ sK1 ) ),
inference(definition_unfolding,[status(thm)],[f14,f16]) ).
thf(f16,plain,
( leibeq
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( leibeq
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
( leibeq
= ( ^ [X0: $i,X1: $i] :
! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) ) ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( leibeq
= ( ^ [X0: $i,X1: $i] :
! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zclfHsQkE0/DTF2THF_836.p',leibeq) ).
thf(f14,plain,
( ( leibeq @ sK2 @ sK1 )
= $true ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f13,plain,
( ( sK0 @ sK1 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO003^1 : TPTP v9.2.1. Released v3.7.0.
% 0.00/0.10 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.29 % Computer : n012.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue Feb 24 14:21:45 EST 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.30 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.39 ---- Original DTF file ---
% 0.16/0.39 thf(spec,logic,$$dhol).
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 % File : SYO003^1 : TPTP v9.2.1. Released v3.7.0.
% 0.16/0.39 % Domain : Syntactic
% 0.16/0.39 % Problem : Leibniz equality obeys the congruence property under predicates
% 0.16/0.39 % Version : Especial.
% 0.16/0.39 % English :
% 0.16/0.39
% 0.16/0.39 % Refs : [BB05] Benzmueller & Brown (2005), A Structured Set of Higher
% 0.16/0.39 % : [Ben09] Benzmueller (2009), Email to Geoff Sutcliffe
% 0.16/0.39 % Source : [Ben09]
% 0.16/0.39 % Names : Example 7b [BB05]
% 0.16/0.39
% 0.16/0.39 % Status : Theorem
% 0.16/0.39 % Rating : 0.00 v8.2.0, 0.15 v8.1.0, 0.09 v7.5.0, 0.00 v6.2.0, 0.14 v6.1.0, 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v4.0.1, 0.33 v4.0.0, 0.00 v3.7.0
% 0.16/0.39 % Syntax : Number of formulae : 3 ( 2 unt; 1 typ; 1 def)
% 0.16/0.39 % Number of atoms : 3 ( 1 equ; 0 cnn)
% 0.16/0.39 % Maximal formula atoms : 1 ( 1 avg)
% 0.16/0.39 % Number of connectives : 9 ( 0 ~; 0 |; 1 &; 6 @)
% 0.16/0.39 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.16/0.39 % Maximal formula depth : 8 ( 5 avg)
% 0.16/0.39 % Number of types : 2 ( 0 usr)
% 0.16/0.39 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.16/0.39 % Number of symbols : 2 ( 1 usr; 0 con; 2-2 aty)
% 0.16/0.39 % Number of variables : 6 ( 2 ^; 4 !; 0 ?; 6 :)
% 0.16/0.39 % SPC : TH0_THM_EQU_NAR
% 0.16/0.39
% 0.16/0.39 % Comments :
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 thf(leibeq_decl,type,
% 0.16/0.39 leibeq: $i > $i > $o ).
% 0.16/0.39
% 0.16/0.39 thf(leibeq,definition,
% 0.16/0.39 ( leibeq
% 0.16/0.39 = ( ^ [X: $i,Y: $i] :
% 0.16/0.39 ! [P: $i > $o] :
% 0.16/0.39 ( ( P @ X )
% 0.16/0.39 => ( P @ Y ) ) ) ) ).
% 0.16/0.39
% 0.16/0.39 thf(conj,conjecture,
% 0.16/0.39 ! [X: $i,Y: $i,P: $i > $o] :
% 0.16/0.39 ( ( ( leibeq @ X @ Y )
% 0.16/0.39 & ( P @ X ) )
% 0.16/0.39 => ( P @ Y ) ) ).
% 0.16/0.39
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 ------------------------
% 1.36/1.28 ---- Embedded in THF ---
% 1.36/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.36/1.28 %%% Generated on Tue Feb 24 14:21:46 EST 2026
% 1.36/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.36/1.28 %%% Logic specification used:
% 1.36/1.28 %%% thf(spec, logic, $$dhol).
% 1.36/1.28
% 1.36/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.zclfHsQkE0/DTF2DTF836.p
% See solution above
% 1.36/1.28 ------------------------
% 1.36/1.29 ---- Cleaned THF ---
% 1.36/1.29 thf(leibeq_decl,type,
% 1.36/1.29 leibeq: $i > $i > $o ).
% 1.36/1.29
% 1.36/1.29 thf(leibeq,definition,
% 1.36/1.29 ( leibeq
% 1.36/1.29 = ( ^ [X: $i,Y: $i] :
% 1.36/1.29 ! [P: $i > $o] :
% 1.36/1.29 ( ( P @ X )
% 1.36/1.29 => ( P @ Y ) ) ) ) ).
% 1.36/1.29
% 1.36/1.29 thf(conj,conjecture,
% 1.36/1.29 ! [X: $i,Y: $i,P: $i > $o] :
% 1.36/1.29 ( ( ( leibeq @ X @ Y )
% 1.36/1.29 & ( P @ X ) )
% 1.36/1.29 => ( P @ Y ) ) ).
% 1.36/1.29 ------------------------
% 1.54/1.31 % (940)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_836 for (3000ds/27Mi)
% 1.54/1.31 % (941)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_836 for (3000ds/2Mi)
% 1.54/1.31 % (939)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_836 for (3000ds/4Mi)
% 1.54/1.31 % (943)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_836 for (3000ds/2Mi)
% 1.54/1.31 % (946)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_836 for (3000ds/18Mi)
% 1.54/1.31 % (938)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_836 for (3000ds/183Mi)
% 1.54/1.31 % (945)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_836 for (3000ds/275Mi)
% 1.54/1.31 % (941)Instruction limit reached!
% 1.54/1.31 % (941)------------------------------
% 1.54/1.31 % (941)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.54/1.31 % (941)Termination reason: Unknown
% 1.54/1.31 % (941)Termination phase: Saturation
% 1.54/1.31
% 1.54/1.31 % (941)Memory used [KB]: 5373
% 1.54/1.31 % (941)Time elapsed: 0.003 s
% 1.54/1.31 % (941)Instructions burned: 2 (million)
% 1.54/1.31 % (941)------------------------------
% 1.54/1.31 % (941)------------------------------
% 1.54/1.31 % (943)Instruction limit reached!
% 1.54/1.31 % (943)------------------------------
% 1.54/1.31 % (943)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.54/1.31 % (943)Termination reason: Unknown
% 1.54/1.31 % (943)Termination phase: Saturation
% 1.54/1.31
% 1.54/1.31 % (943)Memory used [KB]: 5373
% 1.54/1.31 % (943)Time elapsed: 0.003 s
% 1.54/1.31 % (943)Instructions burned: 2 (million)
% 1.54/1.31 % (943)------------------------------
% 1.54/1.31 % (943)------------------------------
% 1.54/1.31 % (945)Refutation not found, incomplete strategy
% 1.54/1.31 % (945)------------------------------
% 1.54/1.31 % (945)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.54/1.31 % (945)Termination reason: Refutation not found, incomplete strategy
% 1.54/1.31
% 1.54/1.31
% 1.54/1.31 % (945)Memory used [KB]: 5500
% 1.54/1.31 % (945)Time elapsed: 0.003 s
% 1.54/1.31 % (945)Instructions burned: 2 (million)
% 1.54/1.31 % (945)------------------------------
% 1.54/1.31 % (945)------------------------------
% 1.54/1.31 % (940)First to succeed.
% 1.54/1.31 % (946)Also succeeded, but the first one will report.
% 1.54/1.31 % (940)Refutation found. Thanks to Tanya!
% 1.54/1.31 % SZS status Theorem for DTF2THF_836
% 1.54/1.31 % SZS output start Proof for DTF2THF_836
% 1.54/1.31 thf(func_def_0, type, leibeq: $i > $i > $o).
% 1.54/1.31 thf(func_def_2, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 1.54/1.31 thf(func_def_11, type, sK0: $i > $o).
% 1.54/1.31 thf(func_def_15, type, ph4: !>[X0: $tType]:(X0)).
% 1.54/1.31 thf(f27,plain,(
% 1.54/1.31 $false),
% 1.54/1.31 inference(trivial_inequality_removal,[status(thm)],[f26])).
% 1.54/1.31 thf(f26,plain,(
% 1.54/1.31 ($true != $true)),
% 1.54/1.31 inference(superposition,[status(thm)],[f13,f24])).
% 1.54/1.31 thf(f24,plain,(
% 1.54/1.31 ((sK0 @ sK1) = $true)),
% 1.54/1.31 inference(trivial_inequality_removal,[status(thm)],[f22])).
% 1.54/1.31 thf(f22,plain,(
% 1.54/1.31 ((sK0 @ sK1) = $true) | ($true = $false)),
% 1.54/1.31 inference(superposition,[status(thm)],[f21,f15])).
% 1.54/1.31 thf(f15,plain,(
% 1.54/1.31 ($true = (sK0 @ sK2))),
% 1.54/1.31 inference(cnf_transformation,[status(thm)],[f12])).
% 1.54/1.31 thf(f12,plain,(
% 1.54/1.31 ($true = (sK0 @ sK2)) & ((leibeq @ sK2 @ sK1) = $true) & ((sK0 @ sK1) != $true)),
% 1.54/1.31 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11])).
% 1.54/1.31 thf(f11,plain,(
% 1.54/1.31 ? [X0 : $i > $o,X1 : $i,X2 : $i] : (($true = (X0 @ X2)) & ((leibeq @ X2 @ X1) = $true) & ($true != (X0 @ X1))) => (($true = (sK0 @ sK2)) & ((leibeq @ sK2 @ sK1) = $true) & ((sK0 @ sK1) != $true))),
% 1.54/1.31 introduced(definition,[],[choice_axiom])).
% 1.54/1.31 thf(f10,plain,(
% 1.54/1.31 ? [X0 : $i > $o,X1 : $i,X2 : $i] : (($true = (X0 @ X2)) & ((leibeq @ X2 @ X1) = $true) & ($true != (X0 @ X1)))),
% 1.54/1.31 inference(flattening,[status(thm)],[f9])).
% 1.54/1.31 thf(f9,plain,(
% 1.54/1.31 ? [X0 : $i > $o,X1 : $i,X2 : $i] : (($true != (X0 @ X1)) & (((leibeq @ X2 @ X1) = $true) & ($true = (X0 @ X2))))),
% 1.54/1.31 inference(ennf_transformation,[status(thm)],[f6])).
% 1.54/1.31 thf(f6,plain,(
% 1.54/1.31 ~! [X0 : $i > $o,X1 : $i,X2 : $i] : ((((leibeq @ X2 @ X1) = $true) & ($true = (X0 @ X2))) => ($true = (X0 @ X1)))),
% 1.54/1.31 inference(fool_elimination,[status(thm)],[f5])).
% 1.54/1.31 thf(f5,plain,(
% 1.54/1.31 ~! [X0 : $i > $o,X1 : $i,X2 : $i] : (((leibeq @ X2 @ X1) & (X0 @ X2)) => (X0 @ X1))),
% 1.54/1.31 inference(rectify,[status(thm)],[f3])).
% 1.54/1.31 thf(f3,negated_conjecture,(
% 1.54/1.31 ~! [X2 : $i > $o,X1 : $i,X0 : $i] : (((leibeq @ X0 @ X1) & (X2 @ X0)) => (X2 @ X1))),
% 1.54/1.31 inference(negated_conjecture,[status(cth)],[f2])).
% 1.54/1.31 thf(f2,conjecture,(
% 1.54/1.31 ! [X2 : $i > $o,X1 : $i,X0 : $i] : (((leibeq @ X0 @ X1) & (X2 @ X0)) => (X2 @ X1))),
% 1.54/1.31 file('/export/starexec/sandbox/tmp/tmp.zclfHsQkE0/DTF2THF_836.p',conj)).
% 1.54/1.31 thf(f21,plain,(
% 1.54/1.31 ( ! [X1 : $i > $o] : (((X1 @ sK2) = $false) | ((X1 @ sK1) = $true)) )),
% 1.54/1.31 inference(binary_proxy_clausification,[status(thm)],[f20])).
% 1.54/1.31 thf(f20,plain,(
% 1.54/1.31 ( ! [X1 : $i > $o] : (($true = ((X1 @ sK2) => (X1 @ sK1)))) )),
% 1.54/1.31 inference(beta_eta_normalization,[status(thm)],[f19])).
% 1.54/1.31 thf(f19,plain,(
% 1.54/1.31 ( ! [X1 : $i > $o] : (($true = ((^[Y0 : $i > $o]: ((Y0 @ sK2) => (Y0 @ sK1))) @ X1))) )),
% 1.54/1.31 inference(pi_clausification,[status(thm)],[f18])).
% 1.54/1.31 thf(f18,plain,(
% 1.54/1.31 ($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((Y0 @ sK2) => (Y0 @ sK1)))))),
% 1.54/1.31 inference(beta_eta_normalization,[status(thm)],[f17])).
% 1.54/1.31 thf(f17,plain,(
% 1.54/1.31 ($true = ((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))) @ sK2 @ sK1))),
% 1.54/1.31 inference(definition_unfolding,[status(thm)],[f14,f16])).
% 1.54/1.31 thf(f16,plain,(
% 1.54/1.31 (leibeq = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 1.54/1.31 inference(cnf_transformation,[status(thm)],[f8])).
% 1.54/1.31 thf(f8,plain,(
% 1.54/1.31 (leibeq = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 1.54/1.31 inference(fool_elimination,[status(thm)],[f7])).
% 1.54/1.31 thf(f7,plain,(
% 1.54/1.31 (leibeq = (^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)))))),
% 1.54/1.31 inference(rectify,[status(thm)],[f1])).
% 1.54/1.31 thf(f1,axiom,(
% 1.54/1.31 (leibeq = (^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)))))),
% 1.54/1.31 file('/export/starexec/sandbox/tmp/tmp.zclfHsQkE0/DTF2THF_836.p',leibeq)).
% 1.54/1.31 thf(f14,plain,(
% 1.54/1.31 ((leibeq @ sK2 @ sK1) = $true)),
% 1.54/1.31 inference(cnf_transformation,[status(thm)],[f12])).
% 1.54/1.31 thf(f13,plain,(
% 1.54/1.31 ((sK0 @ sK1) != $true)),
% 1.54/1.31 inference(cnf_transformation,[status(thm)],[f12])).
% 1.54/1.31 % SZS output end Proof for DTF2THF_836
% 1.54/1.31 % (940)------------------------------
% 1.54/1.31 % (940)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.54/1.31 % (940)Termination reason: Refutation
% 1.54/1.31
% 1.54/1.31 % (940)Memory used [KB]: 5500
% 1.54/1.31 % (940)Time elapsed: 0.004 s
% 1.54/1.31 % (940)Instructions burned: 2 (million)
% 1.54/1.31 % (940)------------------------------
% 1.54/1.31 % (940)------------------------------
% 1.54/1.31 % (937)Success in time 0.018 s
%------------------------------------------------------------------------------