%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU941^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 : n029.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:48 AM UTC 2026
% Result : Theorem 1.14s 1.11s
% Output : Refutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 71 ( 70 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 176 ( 27 ~; 16 |; 23 &; 96 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 0 ^; 54 !; 20 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(type_def_8,type,
c: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
b: $tType ).
thf(func_def_2,type,
c: $tType ).
thf(func_def_6,type,
sK0: b > c ).
thf(func_def_7,type,
sK1: a > b ).
thf(func_def_8,type,
sK2: a ).
thf(func_def_9,type,
sK3: a ).
thf(f25,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f24,f13]) ).
thf(f13,plain,
sK3 != sK2,
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ( sK0 @ ( sK1 @ sK2 ) )
= ( sK0 @ ( sK1 @ sK3 ) ) )
& ( sK3 != sK2 )
& ! [X4: a,X5: a] :
( ( X4 = X5 )
| ( ( sK1 @ X4 )
!= ( sK1 @ X5 ) ) )
& ! [X6: b,X7: b] :
( ( X6 = X7 )
| ( ( sK0 @ X7 )
!= ( sK0 @ X6 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f9,f8]) ).
thf(f8,plain,
( ? [X0: b > c,X1: a > b] :
( ? [X2: a,X3: a] :
( ( ( X0 @ ( X1 @ X3 ) )
= ( X0 @ ( X1 @ X2 ) ) )
& ( X2 != X3 ) )
& ! [X4: a,X5: a] :
( ( X4 = X5 )
| ( ( X1 @ X5 )
!= ( X1 @ X4 ) ) )
& ! [X6: b,X7: b] :
( ( X6 = X7 )
| ( ( X0 @ X6 )
!= ( X0 @ X7 ) ) ) )
=> ( ? [X3: a,X2: a] :
( ( ( sK0 @ ( sK1 @ X2 ) )
= ( sK0 @ ( sK1 @ X3 ) ) )
& ( X2 != X3 ) )
& ! [X5: a,X4: a] :
( ( X4 = X5 )
| ( ( sK1 @ X4 )
!= ( sK1 @ X5 ) ) )
& ! [X7: b,X6: b] :
( ( X6 = X7 )
| ( ( sK0 @ X7 )
!= ( sK0 @ X6 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
( ? [X3: a,X2: a] :
( ( ( sK0 @ ( sK1 @ X2 ) )
= ( sK0 @ ( sK1 @ X3 ) ) )
& ( X2 != X3 ) )
=> ( ( ( sK0 @ ( sK1 @ sK2 ) )
= ( sK0 @ ( sK1 @ sK3 ) ) )
& ( sK3 != sK2 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
? [X0: b > c,X1: a > b] :
( ? [X2: a,X3: a] :
( ( ( X0 @ ( X1 @ X3 ) )
= ( X0 @ ( X1 @ X2 ) ) )
& ( X2 != X3 ) )
& ! [X4: a,X5: a] :
( ( X4 = X5 )
| ( ( X1 @ X5 )
!= ( X1 @ X4 ) ) )
& ! [X6: b,X7: b] :
( ( X6 = X7 )
| ( ( X0 @ X6 )
!= ( X0 @ X7 ) ) ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: b > c,X1: a > b] :
( ? [X7: a,X6: a] :
( ( ( X0 @ ( X1 @ X6 ) )
= ( X0 @ ( X1 @ X7 ) ) )
& ( X6 != X7 ) )
& ! [X5: a,X4: a] :
( ( X4 = X5 )
| ( ( X1 @ X5 )
!= ( X1 @ X4 ) ) )
& ! [X3: b,X2: b] :
( ( X2 = X3 )
| ( ( X0 @ X3 )
!= ( X0 @ X2 ) ) ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
? [X0: b > c,X1: a > b] :
( ? [X7: a,X6: a] :
( ( ( X0 @ ( X1 @ X6 ) )
= ( X0 @ ( X1 @ X7 ) ) )
& ( X6 != X7 ) )
& ! [X5: a,X4: a] :
( ( X4 = X5 )
| ( ( X1 @ X5 )
!= ( X1 @ X4 ) ) )
& ! [X3: b,X2: b] :
( ( X2 = X3 )
| ( ( X0 @ X3 )
!= ( X0 @ X2 ) ) ) ),
inference(ennf_transformation,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: b > c,X1: a > b] :
( ( ! [X4: a,X5: a] :
( ( ( X1 @ X5 )
= ( X1 @ X4 ) )
=> ( X4 = X5 ) )
& ! [X2: b,X3: b] :
( ( ( X0 @ X3 )
= ( X0 @ X2 ) )
=> ( X2 = X3 ) ) )
=> ! [X7: a,X6: a] :
( ( ( X0 @ ( X1 @ X6 ) )
= ( X0 @ ( X1 @ X7 ) ) )
=> ( X6 = X7 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: b > c,X0: a > b] :
( ( ! [X3: b,X2: b] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
& ! [X3: a,X2: a] :
( ( ( X0 @ X2 )
= ( X0 @ X3 ) )
=> ( X2 = X3 ) ) )
=> ! [X2: a,X3: a] :
( ( ( X1 @ ( X0 @ X2 ) )
= ( X1 @ ( X0 @ X3 ) ) )
=> ( X2 = X3 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: b > c,X0: a > b] :
( ( ! [X3: b,X2: b] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
& ! [X3: a,X2: a] :
( ( ( X0 @ X2 )
= ( X0 @ X3 ) )
=> ( X2 = X3 ) ) )
=> ! [X2: a,X3: a] :
( ( ( X1 @ ( X0 @ X2 ) )
= ( X1 @ ( X0 @ X3 ) ) )
=> ( X2 = X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SfA4VGiYt9/DTF2THF_331.p',cFN_THM_1_pme) ).
thf(f24,plain,
sK3 = sK2,
inference(equality_resolution,[status(thm)],[f22]) ).
thf(f22,plain,
! [X0: a] :
( ( ( sK1 @ sK2 )
!= ( sK1 @ X0 ) )
| ( sK3 = X0 ) ),
inference(superposition,[status(thm)],[f12,f20]) ).
thf(f20,plain,
( ( sK1 @ sK2 )
= ( sK1 @ sK3 ) ),
inference(equality_resolution,[status(thm)],[f17]) ).
thf(f17,plain,
! [X0: b] :
( ( ( sK0 @ X0 )
!= ( sK0 @ ( sK1 @ sK2 ) ) )
| ( ( sK1 @ sK3 )
= X0 ) ),
inference(superposition,[status(thm)],[f11,f14]) ).
thf(f14,plain,
( ( sK0 @ ( sK1 @ sK2 ) )
= ( sK0 @ ( sK1 @ sK3 ) ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f11,plain,
! [X6: b,X7: b] :
( ( ( sK0 @ X7 )
!= ( sK0 @ X6 ) )
| ( X6 = X7 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f12,plain,
! [X4: a,X5: a] :
( ( ( sK1 @ X4 )
!= ( sK1 @ X5 ) )
| ( X4 = X5 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU941^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.12/0.31 % Computer : n029.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Tue Feb 24 12:36:44 EST 2026
% 0.12/0.31 % CPUTime :
% 0.12/0.31 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.41 ---- Original DTF file ---
% 0.15/0.41 thf(spec,logic,$$dhol).
% 0.15/0.41 %------------------------------------------------------------------------------
% 0.15/0.41 % File : SEU941^5 : TPTP v9.2.1. Released v4.0.0.
% 0.15/0.41 % Domain : Set Theory (Functions)
% 0.15/0.41 % Problem : TPS problem FN-THM-1
% 0.15/0.41 % Version : Especial.
% 0.15/0.41 % English :
% 0.15/0.41
% 0.15/0.41 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.15/0.41 % Source : [Bro09]
% 0.15/0.41 % Names : tps_0422 [Bro09]
% 0.15/0.41 % : FN-THM-1 [TPS]
% 0.15/0.41
% 0.15/0.41 % Status : Theorem
% 0.15/0.41 % Rating : 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.0
% 0.15/0.41 % Syntax : Number of formulae : 4 ( 0 unt; 3 typ; 0 def)
% 0.15/0.41 % Number of atoms : 6 ( 6 equ; 0 cnn)
% 0.15/0.41 % Maximal formula atoms : 6 ( 6 avg)
% 0.15/0.41 % Number of connectives : 13 ( 0 ~; 0 |; 1 &; 8 @)
% 0.15/0.41 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.15/0.41 % Maximal formula depth : 8 ( 8 avg)
% 0.15/0.41 % Number of types : 3 ( 3 usr)
% 0.15/0.41 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.15/0.41 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.15/0.41 % Number of variables : 8 ( 0 ^; 8 !; 0 ?; 8 :)
% 0.15/0.41 % SPC : TH0_THM_EQU_NAR
% 0.15/0.41
% 0.15/0.41 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.15/0.41 % project in the Department of Mathematical Sciences at Carnegie
% 0.15/0.41 % Mellon University. Distributed under the Creative Commons copyleft
% 0.15/0.41 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.15/0.41 % : Polymorphic definitions expanded.
% 0.15/0.41 %------------------------------------------------------------------------------
% 0.15/0.41 thf(a_type,type,
% 0.15/0.41 a: $tType ).
% 0.15/0.41
% 0.15/0.41 thf(b_type,type,
% 0.15/0.41 b: $tType ).
% 0.15/0.41
% 0.15/0.41 thf(c_type,type,
% 0.15/0.41 c: $tType ).
% 0.15/0.41
% 0.15/0.41 thf(cFN_THM_1_pme,conjecture,
% 0.15/0.41 ! [F: a > b,G: b > c] :
% 0.15/0.41 ( ( ! [Xx: a,Xy: a] :
% 0.15/0.41 ( ( ( F @ Xx )
% 0.15/0.41 = ( F @ Xy ) )
% 0.15/0.41 => ( Xx = Xy ) )
% 0.15/0.41 & ! [Xx: b,Xy: b] :
% 0.15/0.41 ( ( ( G @ Xx )
% 0.15/0.41 = ( G @ Xy ) )
% 0.15/0.41 => ( Xx = Xy ) ) )
% 0.15/0.41 => ! [Xx: a,Xy: a] :
% 0.15/0.41 ( ( ( G @ ( F @ Xx ) )
% 0.15/0.41 = ( G @ ( F @ Xy ) ) )
% 0.15/0.41 => ( Xx = Xy ) ) ) ).
% 0.15/0.41
% 0.15/0.41 %------------------------------------------------------------------------------
% 0.15/0.41 ------------------------
% 1.14/1.09 ---- Embedded in THF ---
% 1.14/1.09 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.14/1.09 %%% Generated on Tue Feb 24 12:36:44 EST 2026
% 1.14/1.09 %%% using '$$dhol' embedding, version 1.3.0.
% 1.14/1.09 %%% Logic specification used:
% 1.14/1.09 %%% thf(spec, logic, $$dhol).
% 1.14/1.09
% 1.14/1.09 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.SfA4VGiYt9/DTF2DTF331.p
% See solution above
% 1.14/1.09 ------------------------
% 1.14/1.09 ---- Cleaned THF ---
% 1.14/1.10 thf(a_type,type,
% 1.14/1.10 a: $tType ).
% 1.14/1.10
% 1.14/1.10 thf(b_type,type,
% 1.14/1.10 b: $tType ).
% 1.14/1.10
% 1.14/1.10 thf(c_type,type,
% 1.14/1.10 c: $tType ).
% 1.14/1.10
% 1.14/1.10 thf(cFN_THM_1_pme,conjecture,
% 1.14/1.10 ! [F: a > b,G: b > c] :
% 1.14/1.10 ( ( ! [Xx: a,Xy: a] :
% 1.14/1.10 ( ( ( F @ Xx )
% 1.14/1.10 = ( F @ Xy ) )
% 1.14/1.10 => ( Xx = Xy ) )
% 1.14/1.10 & ! [Xx: b,Xy: b] :
% 1.14/1.10 ( ( ( G @ Xx )
% 1.14/1.10 = ( G @ Xy ) )
% 1.14/1.10 => ( Xx = Xy ) ) )
% 1.14/1.10 => ! [Xx: a,Xy: a] :
% 1.14/1.10 ( ( ( G @ ( F @ Xx ) )
% 1.14/1.10 = ( G @ ( F @ Xy ) ) )
% 1.14/1.10 => ( Xx = Xy ) ) ) ).
% 1.14/1.10 ------------------------
% 1.14/1.11 % (429)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_331 for (2999ds/183Mi)
% 1.14/1.11 % (429)First to succeed.
% 1.14/1.11 % (429)Refutation found. Thanks to Tanya!
% 1.14/1.11 % SZS status Theorem for DTF2THF_331
% 1.14/1.11 % SZS output start Proof for DTF2THF_331
% 1.14/1.11 thf(type_def_5, type, a: $tType).
% 1.14/1.11 thf(type_def_6, type, b: $tType).
% 1.14/1.11 thf(type_def_8, type, c: $tType).
% 1.14/1.11 thf(func_def_0, type, a: $tType).
% 1.14/1.11 thf(func_def_1, type, b: $tType).
% 1.14/1.11 thf(func_def_2, type, c: $tType).
% 1.14/1.11 thf(func_def_6, type, sK0: b > c).
% 1.14/1.11 thf(func_def_7, type, sK1: a > b).
% 1.14/1.11 thf(func_def_8, type, sK2: a).
% 1.14/1.11 thf(func_def_9, type, sK3: a).
% 1.14/1.11 thf(f25,plain,(
% 1.14/1.11 $false),
% 1.14/1.11 inference(subsumption_resolution,[status(thm)],[f24,f13])).
% 1.14/1.11 thf(f13,plain,(
% 1.14/1.11 (sK3 != sK2)),
% 1.14/1.11 inference(cnf_transformation,[status(thm)],[f10])).
% 1.14/1.11 thf(f10,plain,(
% 1.14/1.11 (((sK0 @ (sK1 @ sK2)) = (sK0 @ (sK1 @ sK3))) & (sK3 != sK2)) & ! [X4 : a,X5 : a] : ((X4 = X5) | ((sK1 @ X4) != (sK1 @ X5))) & ! [X6 : b,X7 : b] : ((X6 = X7) | ((sK0 @ X7) != (sK0 @ X6)))),
% 1.14/1.11 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f9,f8])).
% 1.14/1.11 thf(f8,plain,(
% 1.14/1.11 ? [X0 : b > c,X1 : a > b] : (? [X2 : a,X3 : a] : (((X0 @ (X1 @ X3)) = (X0 @ (X1 @ X2))) & (X2 != X3)) & ! [X4 : a,X5 : a] : ((X4 = X5) | ((X1 @ X5) != (X1 @ X4))) & ! [X6 : b,X7 : b] : ((X6 = X7) | ((X0 @ X6) != (X0 @ X7)))) => (? [X3 : a,X2 : a] : (((sK0 @ (sK1 @ X2)) = (sK0 @ (sK1 @ X3))) & (X2 != X3)) & ! [X5 : a,X4 : a] : ((X4 = X5) | ((sK1 @ X4) != (sK1 @ X5))) & ! [X7 : b,X6 : b] : ((X6 = X7) | ((sK0 @ X7) != (sK0 @ X6))))),
% 1.14/1.11 introduced(definition,[],[choice_axiom])).
% 1.14/1.11 thf(f9,plain,(
% 1.14/1.11 ? [X3 : a,X2 : a] : (((sK0 @ (sK1 @ X2)) = (sK0 @ (sK1 @ X3))) & (X2 != X3)) => (((sK0 @ (sK1 @ sK2)) = (sK0 @ (sK1 @ sK3))) & (sK3 != sK2))),
% 1.14/1.11 introduced(definition,[],[choice_axiom])).
% 1.14/1.11 thf(f7,plain,(
% 1.14/1.11 ? [X0 : b > c,X1 : a > b] : (? [X2 : a,X3 : a] : (((X0 @ (X1 @ X3)) = (X0 @ (X1 @ X2))) & (X2 != X3)) & ! [X4 : a,X5 : a] : ((X4 = X5) | ((X1 @ X5) != (X1 @ X4))) & ! [X6 : b,X7 : b] : ((X6 = X7) | ((X0 @ X6) != (X0 @ X7))))),
% 1.14/1.11 inference(rectify,[status(thm)],[f6])).
% 1.14/1.11 thf(f6,plain,(
% 1.14/1.11 ? [X0 : b > c,X1 : a > b] : (? [X7 : a,X6 : a] : (((X0 @ (X1 @ X6)) = (X0 @ (X1 @ X7))) & (X6 != X7)) & ! [X5 : a,X4 : a] : ((X4 = X5) | ((X1 @ X5) != (X1 @ X4))) & ! [X3 : b,X2 : b] : ((X2 = X3) | ((X0 @ X3) != (X0 @ X2))))),
% 1.14/1.11 inference(flattening,[status(thm)],[f5])).
% 1.14/1.11 thf(f5,plain,(
% 1.14/1.11 ? [X0 : b > c,X1 : a > b] : (? [X7 : a,X6 : a] : (((X0 @ (X1 @ X6)) = (X0 @ (X1 @ X7))) & (X6 != X7)) & (! [X5 : a,X4 : a] : ((X4 = X5) | ((X1 @ X5) != (X1 @ X4))) & ! [X3 : b,X2 : b] : ((X2 = X3) | ((X0 @ X3) != (X0 @ X2)))))),
% 1.14/1.11 inference(ennf_transformation,[status(thm)],[f4])).
% 1.14/1.11 thf(f4,plain,(
% 1.14/1.11 ~! [X0 : b > c,X1 : a > b] : ((! [X4 : a,X5 : a] : (((X1 @ X5) = (X1 @ X4)) => (X4 = X5)) & ! [X2 : b,X3 : b] : (((X0 @ X3) = (X0 @ X2)) => (X2 = X3))) => ! [X7 : a,X6 : a] : (((X0 @ (X1 @ X6)) = (X0 @ (X1 @ X7))) => (X6 = X7)))),
% 1.14/1.11 inference(rectify,[status(thm)],[f2])).
% 1.14/1.11 thf(f2,negated_conjecture,(
% 1.14/1.11 ~! [X1 : b > c,X0 : a > b] : ((! [X3 : b,X2 : b] : (((X1 @ X2) = (X1 @ X3)) => (X2 = X3)) & ! [X3 : a,X2 : a] : (((X0 @ X2) = (X0 @ X3)) => (X2 = X3))) => ! [X2 : a,X3 : a] : (((X1 @ (X0 @ X2)) = (X1 @ (X0 @ X3))) => (X2 = X3)))),
% 1.14/1.11 inference(negated_conjecture,[status(cth)],[f1])).
% 1.14/1.11 thf(f1,conjecture,(
% 1.14/1.11 ! [X1 : b > c,X0 : a > b] : ((! [X3 : b,X2 : b] : (((X1 @ X2) = (X1 @ X3)) => (X2 = X3)) & ! [X3 : a,X2 : a] : (((X0 @ X2) = (X0 @ X3)) => (X2 = X3))) => ! [X2 : a,X3 : a] : (((X1 @ (X0 @ X2)) = (X1 @ (X0 @ X3))) => (X2 = X3)))),
% 1.14/1.11 file('/export/starexec/sandbox2/tmp/tmp.SfA4VGiYt9/DTF2THF_331.p',cFN_THM_1_pme)).
% 1.14/1.11 thf(f24,plain,(
% 1.14/1.11 (sK3 = sK2)),
% 1.14/1.11 inference(equality_resolution,[status(thm)],[f22])).
% 1.14/1.11 thf(f22,plain,(
% 1.14/1.11 ( ! [X0 : a] : (((sK1 @ sK2) != (sK1 @ X0)) | (sK3 = X0)) )),
% 1.14/1.11 inference(superposition,[status(thm)],[f12,f20])).
% 1.14/1.11 thf(f20,plain,(
% 1.14/1.11 ((sK1 @ sK2) = (sK1 @ sK3))),
% 1.14/1.11 inference(equality_resolution,[status(thm)],[f17])).
% 1.14/1.11 thf(f17,plain,(
% 1.14/1.11 ( ! [X0 : b] : (((sK0 @ X0) != (sK0 @ (sK1 @ sK2))) | ((sK1 @ sK3) = X0)) )),
% 1.14/1.11 inference(superposition,[status(thm)],[f11,f14])).
% 1.14/1.11 thf(f14,plain,(
% 1.14/1.11 ((sK0 @ (sK1 @ sK2)) = (sK0 @ (sK1 @ sK3)))),
% 1.14/1.11 inference(cnf_transformation,[status(thm)],[f10])).
% 1.14/1.11 thf(f11,plain,(
% 1.14/1.11 ( ! [X6 : b,X7 : b] : (((sK0 @ X7) != (sK0 @ X6)) | (X6 = X7)) )),
% 1.14/1.11 inference(cnf_transformation,[status(thm)],[f10])).
% 1.14/1.11 thf(f12,plain,(
% 1.14/1.11 ( ! [X4 : a,X5 : a] : (((sK1 @ X4) != (sK1 @ X5)) | (X4 = X5)) )),
% 1.14/1.11 inference(cnf_transformation,[status(thm)],[f10])).
% 1.14/1.11 % SZS output end Proof for DTF2THF_331
% 1.14/1.11 % (429)------------------------------
% 1.14/1.11 % (429)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.14/1.11 % (429)Termination reason: Refutation
% 1.14/1.11
% 1.14/1.11 % (429)Memory used [KB]: 5500
% 1.14/1.11 % (429)Time elapsed: 0.003 s
% 1.14/1.11 % (429)Instructions burned: 1 (million)
% 1.14/1.11 % (429)------------------------------
% 1.14/1.11 % (429)------------------------------
% 1.14/1.11 % (428)Success in time 0.013 s
%------------------------------------------------------------------------------