%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU887^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n019.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:37:40 AM UTC 2026
% Result : Theorem 1.43s 1.24s
% Output : Refutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 85 ( 54 equ; 0 cnn)
% Maximal formula atoms : 10 ( 5 avg)
% Number of connectives : 149 ( 27 ~; 15 |; 24 &; 77 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 60 ( 0 ^; 31 !; 29 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(type_def_8,type,
c: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
c: $tType ).
thf(func_def_6,type,
sK0: c > $o ).
thf(func_def_7,type,
sK1: c > b ).
thf(func_def_8,type,
sK2: a ).
thf(func_def_9,type,
sK3: b > a ).
thf(func_def_10,type,
sK4: c ).
thf(f17,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f16,f11]) ).
thf(f11,plain,
( $true
= ( sK0 @ sK4 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ! [X4: b] :
( ( sK2
!= ( sK3 @ X4 ) )
| ! [X5: c] :
( ( ( sK1 @ X5 )
!= X4 )
| ( $true
!= ( sK0 @ X5 ) ) ) )
& ( sK2
= ( sK3 @ ( sK1 @ sK4 ) ) )
& ( $true
= ( sK0 @ sK4 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f7,f9,f8]) ).
thf(f8,plain,
( ? [X0: c > $o,X1: c > b,X2: a,X3: b > a] :
( ! [X4: b] :
( ( ( X3 @ X4 )
!= X2 )
| ! [X5: c] :
( ( ( X1 @ X5 )
!= X4 )
| ( ( X0 @ X5 )
!= $true ) ) )
& ? [X6: c] :
( ( ( X3 @ ( X1 @ X6 ) )
= X2 )
& ( ( X0 @ X6 )
= $true ) ) )
=> ( ! [X4: b] :
( ( sK2
!= ( sK3 @ X4 ) )
| ! [X5: c] :
( ( ( sK1 @ X5 )
!= X4 )
| ( $true
!= ( sK0 @ X5 ) ) ) )
& ? [X6: c] :
( ( sK2
= ( sK3 @ ( sK1 @ X6 ) ) )
& ( ( sK0 @ X6 )
= $true ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
( ? [X6: c] :
( ( sK2
= ( sK3 @ ( sK1 @ X6 ) ) )
& ( ( sK0 @ X6 )
= $true ) )
=> ( ( sK2
= ( sK3 @ ( sK1 @ sK4 ) ) )
& ( $true
= ( sK0 @ sK4 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
? [X0: c > $o,X1: c > b,X2: a,X3: b > a] :
( ! [X4: b] :
( ( ( X3 @ X4 )
!= X2 )
| ! [X5: c] :
( ( ( X1 @ X5 )
!= X4 )
| ( ( X0 @ X5 )
!= $true ) ) )
& ? [X6: c] :
( ( ( X3 @ ( X1 @ X6 ) )
= X2 )
& ( ( X0 @ X6 )
= $true ) ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,plain,
? [X2: c > $o,X0: c > b,X3: a,X1: b > a] :
( ! [X5: b] :
( ( ( X1 @ X5 )
!= X3 )
| ! [X6: c] :
( ( ( X0 @ X6 )
!= X5 )
| ( ( X2 @ X6 )
!= $true ) ) )
& ? [X4: c] :
( ( ( X1 @ ( X0 @ X4 ) )
= X3 )
& ( ( X2 @ X4 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: c > b,X3: a,X1: b > a,X2: c > $o] :
( ? [X4: c] :
( ( ( X1 @ ( X0 @ X4 ) )
= X3 )
& ( ( X2 @ X4 )
= $true ) )
=> ? [X5: b] :
( ? [X6: c] :
( ( ( X2 @ X6 )
= $true )
& ( ( X0 @ X6 )
= X5 ) )
& ( ( X1 @ X5 )
= X3 ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: c > b,X1: b > a,X2: c > $o,X3: a] :
( ? [X4: c] :
( ( X2 @ X4 )
& ( ( X1 @ ( X0 @ X4 ) )
= X3 ) )
=> ? [X5: b] :
( ? [X6: c] :
( ( X2 @ X6 )
& ( ( X0 @ X6 )
= X5 ) )
& ( ( X1 @ X5 )
= X3 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: c > b,X0: b > a,X2: c > $o,X3: a] :
( ? [X4: c] :
( ( X2 @ X4 )
& ( ( X0 @ ( X1 @ X4 ) )
= X3 ) )
=> ? [X4: b] :
( ? [X5: c] :
( ( X2 @ X5 )
& ( ( X1 @ X5 )
= X4 ) )
& ( ( X0 @ X4 )
= X3 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: c > b,X0: b > a,X2: c > $o,X3: a] :
( ? [X4: c] :
( ( X2 @ X4 )
& ( ( X0 @ ( X1 @ X4 ) )
= X3 ) )
=> ? [X4: b] :
( ? [X5: c] :
( ( X2 @ X5 )
& ( ( X1 @ X5 )
= X4 ) )
& ( ( X0 @ X4 )
= X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.35nCGl2TOt/DTF2THF_5545.p',cTHM28_pme) ).
thf(f16,plain,
( $true
!= ( sK0 @ sK4 ) ),
inference(equality_resolution,[status(thm)],[f15]) ).
thf(f15,plain,
! [X5: c] :
( ( ( sK3 @ ( sK1 @ X5 ) )
!= ( sK3 @ ( sK1 @ sK4 ) ) )
| ( $true
!= ( sK0 @ X5 ) ) ),
inference(equality_resolution,[status(thm)],[f14]) ).
thf(f14,plain,
! [X4: b,X5: c] :
( ( ( sK3 @ X4 )
!= ( sK3 @ ( sK1 @ sK4 ) ) )
| ( ( sK1 @ X5 )
!= X4 )
| ( $true
!= ( sK0 @ X5 ) ) ),
inference(definition_unfolding,[status(thm)],[f13,f12]) ).
thf(f12,plain,
( sK2
= ( sK3 @ ( sK1 @ sK4 ) ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f13,plain,
! [X4: b,X5: c] :
( ( sK2
!= ( sK3 @ X4 ) )
| ( ( sK1 @ X5 )
!= X4 )
| ( $true
!= ( sK0 @ X5 ) ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU887^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.34 % Computer : n019.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Feb 24 12:36:09 EST 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.25/0.47 ---- Original DTF file ---
% 0.25/0.47 thf(spec,logic,$$dhol).
% 0.25/0.47 %------------------------------------------------------------------------------
% 0.25/0.47 % File : SEU887^5 : TPTP v9.2.1. Released v4.0.0.
% 0.25/0.47 % Domain : Set Theory
% 0.25/0.47 % Problem : TPS problem THM28
% 0.25/0.47 % Version : Especial.
% 0.25/0.47 % English :
% 0.25/0.47
% 0.25/0.47 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.25/0.47 % Source : [Bro09]
% 0.25/0.47 % Names : tps_0257 [Bro09]
% 0.25/0.47 % : THM28 [TPS]
% 0.25/0.47
% 0.25/0.47 % Status : Theorem
% 0.25/0.47 % Rating : 0.00 v6.1.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.25/0.47 % Syntax : Number of formulae : 4 ( 0 unt; 3 typ; 0 def)
% 0.25/0.47 % Number of atoms : 3 ( 3 equ; 0 cnn)
% 0.25/0.47 % Maximal formula atoms : 3 ( 3 avg)
% 0.25/0.47 % Number of connectives : 10 ( 0 ~; 0 |; 3 &; 6 @)
% 0.25/0.47 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.25/0.47 % Maximal formula depth : 11 ( 11 avg)
% 0.25/0.47 % Number of types : 4 ( 3 usr)
% 0.25/0.47 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.25/0.47 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.25/0.47 % Number of variables : 7 ( 0 ^; 4 !; 3 ?; 7 :)
% 0.25/0.47 % SPC : TH0_THM_EQU_NAR
% 0.25/0.47
% 0.25/0.47 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.25/0.47 % project in the Department of Mathematical Sciences at Carnegie
% 0.25/0.47 % Mellon University. Distributed under the Creative Commons copyleft
% 0.25/0.47 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.25/0.47 % : Polymorphic definitions expanded.
% 0.25/0.47 %------------------------------------------------------------------------------
% 0.25/0.47 thf(b_type,type,
% 0.25/0.47 b: $tType ).
% 0.25/0.47
% 0.25/0.47 thf(a_type,type,
% 0.25/0.47 a: $tType ).
% 0.25/0.47
% 0.25/0.47 thf(c_type,type,
% 0.25/0.47 c: $tType ).
% 0.25/0.47
% 0.25/0.47 thf(cTHM28_pme,conjecture,
% 0.25/0.47 ! [F: b > a,G: c > b,S: c > $o,Xx: a] :
% 0.25/0.47 ( ? [Xt: c] :
% 0.25/0.47 ( ( S @ Xt )
% 0.25/0.47 & ( Xx
% 0.25/0.47 = ( F @ ( G @ Xt ) ) ) )
% 0.25/0.47 => ? [Xt: b] :
% 0.25/0.47 ( ? [Xt0: c] :
% 0.25/0.47 ( ( S @ Xt0 )
% 0.25/0.47 & ( Xt
% 0.25/0.47 = ( G @ Xt0 ) ) )
% 0.25/0.47 & ( Xx
% 0.25/0.47 = ( F @ Xt ) ) ) ) ).
% 0.25/0.47
% 0.25/0.47 %------------------------------------------------------------------------------
% 0.25/0.47 ------------------------
% 1.43/1.21 ---- Embedded in THF ---
% 1.43/1.21 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.43/1.21 %%% Generated on Tue Feb 24 12:36:10 EST 2026
% 1.43/1.21 %%% using '$$dhol' embedding, version 1.3.0.
% 1.43/1.21 %%% Logic specification used:
% 1.43/1.21 %%% thf(spec, logic, $$dhol).
% 1.43/1.21
% 1.43/1.21 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.35nCGl2TOt/DTF2DTF5545.p
% See solution above
% 1.43/1.21 ------------------------
% 1.43/1.22 ---- Cleaned THF ---
% 1.43/1.22 thf(b_type,type,
% 1.43/1.22 b: $tType ).
% 1.43/1.22
% 1.43/1.22 thf(a_type,type,
% 1.43/1.22 a: $tType ).
% 1.43/1.22
% 1.43/1.22 thf(c_type,type,
% 1.43/1.22 c: $tType ).
% 1.43/1.22
% 1.43/1.22 thf(cTHM28_pme,conjecture,
% 1.43/1.22 ! [F: b > a,G: c > b,S: c > $o,Xx: a] :
% 1.43/1.22 ( ? [Xt: c] :
% 1.43/1.22 ( ( S @ Xt )
% 1.43/1.22 & ( Xx
% 1.43/1.22 = ( F @ ( G @ Xt ) ) ) )
% 1.43/1.22 => ? [Xt: b] :
% 1.43/1.22 ( ? [Xt0: c] :
% 1.43/1.22 ( ( S @ Xt0 )
% 1.43/1.22 & ( Xt
% 1.43/1.22 = ( G @ Xt0 ) ) )
% 1.43/1.22 & ( Xx
% 1.43/1.22 = ( F @ Xt ) ) ) ) ).
% 1.43/1.22 ------------------------
% 1.43/1.23 % (5647)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_5545 for (3000ds/2Mi)
% 1.43/1.23 % (5647)Instruction limit reached!
% 1.43/1.23 % (5647)------------------------------
% 1.43/1.23 % (5647)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.43/1.23 % (5647)Termination reason: Unknown
% 1.43/1.23 % (5647)Termination phase: Saturation
% 1.43/1.23
% 1.43/1.23 % (5647)Memory used [KB]: 5500
% 1.43/1.23 % (5647)Time elapsed: 0.003 s
% 1.43/1.23 % (5647)Instructions burned: 2 (million)
% 1.43/1.23 % (5647)------------------------------
% 1.43/1.23 % (5647)------------------------------
% 1.43/1.24 % (5648)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_5545 for (3000ds/275Mi)
% 1.43/1.24 % (5644)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_5545 for (3000ds/4Mi)
% 1.43/1.24 % (5643)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_5545 for (3000ds/183Mi)
% 1.43/1.24 % (5645)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_5545 for (3000ds/27Mi)
% 1.43/1.24 % (5648)First to succeed.
% 1.43/1.24 % (5644)Also succeeded, but the first one will report.
% 1.43/1.24 % (5649)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_5545 for (3000ds/18Mi)
% 1.43/1.24 % (5646)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_5545 for (3000ds/2Mi)
% 1.43/1.24 % (5643)Also succeeded, but the first one will report.
% 1.43/1.24 % (5648)Refutation found. Thanks to Tanya!
% 1.43/1.24 % SZS status Theorem for DTF2THF_5545
% 1.43/1.24 % SZS output start Proof for DTF2THF_5545
% 1.43/1.24 thf(type_def_5, type, b: $tType).
% 1.43/1.24 thf(type_def_6, type, a: $tType).
% 1.43/1.24 thf(type_def_8, type, c: $tType).
% 1.43/1.24 thf(func_def_0, type, b: $tType).
% 1.43/1.24 thf(func_def_1, type, a: $tType).
% 1.43/1.24 thf(func_def_2, type, c: $tType).
% 1.43/1.24 thf(func_def_6, type, sK0: c > $o).
% 1.43/1.24 thf(func_def_7, type, sK1: c > b).
% 1.43/1.24 thf(func_def_8, type, sK2: a).
% 1.43/1.24 thf(func_def_9, type, sK3: b > a).
% 1.43/1.24 thf(func_def_10, type, sK4: c).
% 1.43/1.24 thf(f17,plain,(
% 1.43/1.24 $false),
% 1.43/1.24 inference(subsumption_resolution,[status(thm)],[f16,f11])).
% 1.43/1.24 thf(f11,plain,(
% 1.43/1.24 ($true = (sK0 @ sK4))),
% 1.43/1.24 inference(cnf_transformation,[status(thm)],[f10])).
% 1.43/1.24 thf(f10,plain,(
% 1.43/1.24 ! [X4 : b] : ((sK2 != (sK3 @ X4)) | ! [X5 : c] : (((sK1 @ X5) != X4) | ($true != (sK0 @ X5)))) & ((sK2 = (sK3 @ (sK1 @ sK4))) & ($true = (sK0 @ sK4)))),
% 1.43/1.24 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f7,f9,f8])).
% 1.43/1.24 thf(f8,plain,(
% 1.43/1.24 ? [X0 : c > $o,X1 : c > b,X2 : a,X3 : b > a] : (! [X4 : b] : (((X3 @ X4) != X2) | ! [X5 : c] : (((X1 @ X5) != X4) | ((X0 @ X5) != $true))) & ? [X6 : c] : (((X3 @ (X1 @ X6)) = X2) & ((X0 @ X6) = $true))) => (! [X4 : b] : ((sK2 != (sK3 @ X4)) | ! [X5 : c] : (((sK1 @ X5) != X4) | ($true != (sK0 @ X5)))) & ? [X6 : c] : ((sK2 = (sK3 @ (sK1 @ X6))) & ((sK0 @ X6) = $true)))),
% 1.43/1.24 introduced(definition,[],[choice_axiom])).
% 1.43/1.24 thf(f9,plain,(
% 1.43/1.24 ? [X6 : c] : ((sK2 = (sK3 @ (sK1 @ X6))) & ((sK0 @ X6) = $true)) => ((sK2 = (sK3 @ (sK1 @ sK4))) & ($true = (sK0 @ sK4)))),
% 1.43/1.24 introduced(definition,[],[choice_axiom])).
% 1.43/1.24 thf(f7,plain,(
% 1.43/1.24 ? [X0 : c > $o,X1 : c > b,X2 : a,X3 : b > a] : (! [X4 : b] : (((X3 @ X4) != X2) | ! [X5 : c] : (((X1 @ X5) != X4) | ((X0 @ X5) != $true))) & ? [X6 : c] : (((X3 @ (X1 @ X6)) = X2) & ((X0 @ X6) = $true)))),
% 1.43/1.24 inference(rectify,[status(thm)],[f6])).
% 1.43/1.24 thf(f6,plain,(
% 1.43/1.24 ? [X2 : c > $o,X0 : c > b,X3 : a,X1 : b > a] : (! [X5 : b] : (((X1 @ X5) != X3) | ! [X6 : c] : (((X0 @ X6) != X5) | ((X2 @ X6) != $true))) & ? [X4 : c] : (((X1 @ (X0 @ X4)) = X3) & ((X2 @ X4) = $true)))),
% 1.43/1.24 inference(ennf_transformation,[status(thm)],[f5])).
% 1.43/1.24 thf(f5,plain,(
% 1.43/1.24 ~! [X0 : c > b,X3 : a,X1 : b > a,X2 : c > $o] : (? [X4 : c] : (((X1 @ (X0 @ X4)) = X3) & ((X2 @ X4) = $true)) => ? [X5 : b] : (? [X6 : c] : (((X2 @ X6) = $true) & ((X0 @ X6) = X5)) & ((X1 @ X5) = X3)))),
% 1.43/1.24 inference(fool_elimination,[status(thm)],[f4])).
% 1.43/1.24 thf(f4,plain,(
% 1.43/1.24 ~! [X0 : c > b,X1 : b > a,X2 : c > $o,X3 : a] : (? [X4 : c] : ((X2 @ X4) & ((X1 @ (X0 @ X4)) = X3)) => ? [X5 : b] : (? [X6 : c] : ((X2 @ X6) & ((X0 @ X6) = X5)) & ((X1 @ X5) = X3)))),
% 1.43/1.24 inference(rectify,[status(thm)],[f2])).
% 1.43/1.24 thf(f2,negated_conjecture,(
% 1.43/1.24 ~! [X1 : c > b,X0 : b > a,X2 : c > $o,X3 : a] : (? [X4 : c] : ((X2 @ X4) & ((X0 @ (X1 @ X4)) = X3)) => ? [X4 : b] : (? [X5 : c] : ((X2 @ X5) & ((X1 @ X5) = X4)) & ((X0 @ X4) = X3)))),
% 1.43/1.24 inference(negated_conjecture,[status(cth)],[f1])).
% 1.43/1.24 thf(f1,conjecture,(
% 1.43/1.24 ! [X1 : c > b,X0 : b > a,X2 : c > $o,X3 : a] : (? [X4 : c] : ((X2 @ X4) & ((X0 @ (X1 @ X4)) = X3)) => ? [X4 : b] : (? [X5 : c] : ((X2 @ X5) & ((X1 @ X5) = X4)) & ((X0 @ X4) = X3)))),
% 1.43/1.24 file('/export/starexec/sandbox2/tmp/tmp.35nCGl2TOt/DTF2THF_5545.p',cTHM28_pme)).
% 1.43/1.24 thf(f16,plain,(
% 1.43/1.24 ($true != (sK0 @ sK4))),
% 1.43/1.24 inference(equality_resolution,[status(thm)],[f15])).
% 1.43/1.24 thf(f15,plain,(
% 1.43/1.24 ( ! [X5 : c] : (((sK3 @ (sK1 @ X5)) != (sK3 @ (sK1 @ sK4))) | ($true != (sK0 @ X5))) )),
% 1.43/1.24 inference(equality_resolution,[status(thm)],[f14])).
% 1.43/1.24 thf(f14,plain,(
% 1.43/1.24 ( ! [X4 : b,X5 : c] : (((sK3 @ X4) != (sK3 @ (sK1 @ sK4))) | ((sK1 @ X5) != X4) | ($true != (sK0 @ X5))) )),
% 1.43/1.24 inference(definition_unfolding,[status(thm)],[f13,f12])).
% 1.43/1.24 thf(f12,plain,(
% 1.43/1.24 (sK2 = (sK3 @ (sK1 @ sK4)))),
% 1.43/1.24 inference(cnf_transformation,[status(thm)],[f10])).
% 1.43/1.24 thf(f13,plain,(
% 1.43/1.24 ( ! [X4 : b,X5 : c] : ((sK2 != (sK3 @ X4)) | ((sK1 @ X5) != X4) | ($true != (sK0 @ X5))) )),
% 1.43/1.24 inference(cnf_transformation,[status(thm)],[f10])).
% 1.43/1.24 % SZS output end Proof for DTF2THF_5545
% 1.43/1.24 % (5648)------------------------------
% 1.43/1.24 % (5648)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.43/1.24 % (5648)Termination reason: Refutation
% 1.43/1.24
% 1.43/1.24 % (5648)Memory used [KB]: 5500
% 1.43/1.24 % (5648)Time elapsed: 0.003 s
% 1.43/1.24 % (5648)Instructions burned: 1 (million)
% 1.43/1.24 % (5648)------------------------------
% 1.43/1.24 % (5648)------------------------------
% 1.43/1.24 % (5642)Success in time 0.018 s
%------------------------------------------------------------------------------