%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV013^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 : n023.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:40:03 AM UTC 2026
% Result : Theorem 1.29s 1.19s
% Output : Refutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 1 unt; 0 typ; 4 def)
% Number of atoms : 121 ( 92 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 132 ( 50 ~; 42 |; 27 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 42 ( 18 !; 24 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(func_def_0,type,
a: $tType ).
tff(func_def_1,type,
sK0: a ).
tff(func_def_2,type,
sK1: a ).
tff(func_def_3,type,
sK2: a ).
tff(func_def_4,type,
sK3: a ).
tff(func_def_5,type,
sK4: a ).
tff(func_def_6,type,
sK5: a ).
tff(f51,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f31,f36,f41,f42,f43,f44,f50]) ).
tff(f50,plain,
( ~ spl6_2
| ~ spl6_3
| spl6_4 ),
inference(avatar_contradiction_clause,[status(thm)],[f49]) ).
tff(f49,plain,
( $false
| ~ spl6_2
| ~ spl6_3
| spl6_4 ),
inference(subsumption_resolution,[status(thm)],[f46,f40]) ).
tff(f40,plain,
( ( sK0 != sK1 )
| spl6_4 ),
inference(avatar_component_clause,[status(thm)],[f38]) ).
tff(f38,definition,
( spl6_4
<=> ( sK0 = sK1 ) ),
introduced(definition,[new_symbols(naming,[spl6_4])],[avatar_definition]) ).
tff(f46,plain,
( ( sK0 = sK1 )
| ~ spl6_2
| ~ spl6_3 ),
inference(superposition,[status(thm)],[f30,f35]) ).
tff(f35,plain,
( ( sK0 = sK2 )
| ~ spl6_3 ),
inference(avatar_component_clause,[status(thm)],[f33]) ).
tff(f33,definition,
( spl6_3
<=> ( sK0 = sK2 ) ),
introduced(definition,[new_symbols(naming,[spl6_3])],[avatar_definition]) ).
tff(f30,plain,
( ( sK2 = sK1 )
| ~ spl6_2 ),
inference(avatar_component_clause,[status(thm)],[f28]) ).
tff(f28,definition,
( spl6_2
<=> ( sK2 = sK1 ) ),
introduced(definition,[new_symbols(naming,[spl6_2])],[avatar_definition]) ).
tff(f44,plain,
( ~ spl6_1
| ~ spl6_4 ),
inference(avatar_split_clause,[status(thm)],[f17,f38,f24]) ).
tff(f24,definition,
( spl6_1
<=> ( sK4 = sK5 ) ),
introduced(definition,[new_symbols(naming,[spl6_1])],[avatar_definition]) ).
tff(f17,plain,
( ( sK0 != sK1 )
| ( sK4 != sK5 ) ),
inference(trivial_inequality_removal,[status(thm)],[f11]) ).
tff(f11,plain,
( ( sK3 != sK3 )
| ( sK4 != sK5 )
| ( sK0 != sK1 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
tff(f10,plain,
( ( ( sK2 = sK1 )
& ( sK0 = sK2 )
& ( sK0 != sK1 ) )
| ( sK3 != sK3 )
| ( ( sK4 = sK5 )
& ( sK4 != sK5 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f6,f9,f8,f7]) ).
tff(f7,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X1 = X2 )
& ( X0 = X2 )
& ( X0 != X1 ) )
=> ( ( sK2 = sK1 )
& ( sK0 = sK2 )
& ( sK0 != sK1 ) ) ),
introduced(definition,[],[choice_axiom]) ).
tff(f8,plain,
( ? [X3: a] : ( X3 != X3 )
=> ( sK3 != sK3 ) ),
introduced(definition,[],[choice_axiom]) ).
tff(f9,plain,
( ? [X4: a,X5: a] :
( ( X4 = X5 )
& ( X4 != X5 ) )
=> ( ( sK4 = sK5 )
& ( sK4 != sK5 ) ) ),
introduced(definition,[],[choice_axiom]) ).
tff(f6,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X1 = X2 )
& ( X0 = X2 )
& ( X0 != X1 ) )
| ? [X3: a] : ( X3 != X3 )
| ? [X4: a,X5: a] :
( ( X4 = X5 )
& ( X4 != X5 ) ) ),
inference(rectify,[status(thm)],[f5]) ).
tff(f5,plain,
( ? [X3: a,X1: a,X2: a] :
( ( X1 = X2 )
& ( X2 = X3 )
& ( X1 != X3 ) )
| ? [X0: a] : ( X0 != X0 )
| ? [X4: a,X5: a] :
( ( X4 = X5 )
& ( X4 != X5 ) ) ),
inference(flattening,[status(thm)],[f4]) ).
tff(f4,plain,
( ? [X2: a,X3: a,X1: a] :
( ( X1 != X3 )
& ( X1 = X2 )
& ( X2 = X3 ) )
| ? [X0: a] : ( X0 != X0 )
| ? [X4: a,X5: a] :
( ( X4 = X5 )
& ( X4 != X5 ) ) ),
inference(ennf_transformation,[status(thm)],[f3]) ).
tff(f3,plain,
~ ( ! [X2: a,X3: a,X1: a] :
( ( ( X1 = X2 )
& ( X2 = X3 ) )
=> ( X1 = X3 ) )
& ! [X0: a] : ( X0 = X0 )
& ! [X5: a,X4: a] :
( ( X4 = X5 )
=> ( X4 = X5 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ( ! [X0: a] : ( X0 = X0 )
& ! [X0: a,X1: a,X2: a] :
( ( ( X0 = X1 )
& ( X1 = X2 ) )
=> ( X0 = X2 ) )
& ! [X1: a,X0: a] :
( ( X0 = X1 )
=> ( X0 = X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
( ! [X0: a] : ( X0 = X0 )
& ! [X0: a,X1: a,X2: a] :
( ( ( X0 = X1 )
& ( X1 = X2 ) )
=> ( X0 = X2 ) )
& ! [X1: a,X0: a] :
( ( X0 = X1 )
=> ( X0 = X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nVQVvvGqdO/DTF2THF_27876.p',cTHM511_pme) ).
tff(f43,plain,
( spl6_3
| ~ spl6_1 ),
inference(avatar_split_clause,[status(thm)],[f18,f24,f33]) ).
tff(f18,plain,
( ( sK4 != sK5 )
| ( sK0 = sK2 ) ),
inference(trivial_inequality_removal,[status(thm)],[f13]) ).
tff(f13,plain,
( ( sK4 != sK5 )
| ( sK0 = sK2 )
| ( sK3 != sK3 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
tff(f42,plain,
( spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[status(thm)],[f19,f24,f28]) ).
tff(f19,plain,
( ( sK4 != sK5 )
| ( sK2 = sK1 ) ),
inference(trivial_inequality_removal,[status(thm)],[f15]) ).
tff(f15,plain,
( ( sK3 != sK3 )
| ( sK2 = sK1 )
| ( sK4 != sK5 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
tff(f41,plain,
( ~ spl6_4
| spl6_1 ),
inference(avatar_split_clause,[status(thm)],[f20,f24,f38]) ).
tff(f20,plain,
( ( sK0 != sK1 )
| ( sK4 = sK5 ) ),
inference(trivial_inequality_removal,[status(thm)],[f12]) ).
tff(f12,plain,
( ( sK0 != sK1 )
| ( sK3 != sK3 )
| ( sK4 = sK5 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
tff(f36,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[status(thm)],[f21,f33,f24]) ).
tff(f21,plain,
( ( sK4 = sK5 )
| ( sK0 = sK2 ) ),
inference(trivial_inequality_removal,[status(thm)],[f14]) ).
tff(f14,plain,
( ( sK3 != sK3 )
| ( sK4 = sK5 )
| ( sK0 = sK2 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
tff(f31,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[status(thm)],[f22,f28,f24]) ).
tff(f22,plain,
( ( sK2 = sK1 )
| ( sK4 = sK5 ) ),
inference(trivial_inequality_removal,[status(thm)],[f16]) ).
tff(f16,plain,
( ( sK3 != sK3 )
| ( sK2 = sK1 )
| ( sK4 = sK5 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV013^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/0.33 % Computer : n023.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Feb 24 12:39:04 EST 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.25/0.44 ---- Original DTF file ---
% 0.25/0.44 thf(spec,logic,$$dhol).
% 0.25/0.44 %------------------------------------------------------------------------------
% 0.25/0.44 % File : SEV013^5 : TPTP v9.2.1. Released v4.0.0.
% 0.25/0.44 % Domain : Set Theory (Relations)
% 0.25/0.44 % Problem : TPS problem from EQUIVALENCE-RELATIONS-THMS
% 0.25/0.44 % Version : Especial.
% 0.25/0.44 % English :
% 0.25/0.44
% 0.25/0.44 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.25/0.44 % Source : [Bro09]
% 0.25/0.44 % Names : tps_0871 [Bro09]
% 0.25/0.44
% 0.25/0.44 % Status : Theorem
% 0.25/0.44 % Rating : 0.00 v9.0.0, 0.10 v8.2.0, 0.00 v6.2.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.25/0.44 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.25/0.44 % Number of atoms : 6 ( 6 equ; 0 cnn)
% 0.25/0.44 % Maximal formula atoms : 6 ( 6 avg)
% 0.25/0.44 % Number of connectives : 5 ( 0 ~; 0 |; 3 &; 0 @)
% 0.25/0.44 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.25/0.44 % Maximal formula depth : 8 ( 8 avg)
% 0.25/0.44 % Number of types : 1 ( 1 usr)
% 0.25/0.44 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.25/0.44 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.25/0.44 % Number of variables : 6 ( 0 ^; 6 !; 0 ?; 6 :)
% 0.25/0.44 % SPC : TH0_THM_EQU_NAR
% 0.25/0.44
% 0.25/0.44 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.25/0.44 % project in the Department of Mathematical Sciences at Carnegie
% 0.25/0.44 % Mellon University. Distributed under the Creative Commons copyleft
% 0.25/0.44 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.25/0.44 %------------------------------------------------------------------------------
% 0.25/0.44 thf(a_type,type,
% 0.25/0.44 a: $tType ).
% 0.25/0.44
% 0.25/0.44 thf(cTHM511_pme,conjecture,
% 0.25/0.44 ( ! [Xx: a] : ( Xx = Xx )
% 0.25/0.44 & ! [Xx: a,Xy: a] :
% 0.25/0.44 ( ( Xx = Xy )
% 0.25/0.44 => ( Xy = Xx ) )
% 0.25/0.44 & ! [Xx: a,Xy: a,Xz: a] :
% 0.25/0.44 ( ( ( Xx = Xy )
% 0.25/0.44 & ( Xy = Xz ) )
% 0.25/0.44 => ( Xx = Xz ) ) ) ).
% 0.25/0.44
% 0.25/0.44 %------------------------------------------------------------------------------
% 0.25/0.44 ------------------------
% 1.29/1.17 ---- Embedded in THF ---
% 1.29/1.17 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.29/1.17 %%% Generated on Tue Feb 24 12:39:05 EST 2026
% 1.29/1.17 %%% using '$$dhol' embedding, version 1.3.0.
% 1.29/1.17 %%% Logic specification used:
% 1.29/1.17 %%% thf(spec, logic, $$dhol).
% 1.29/1.17
% 1.29/1.17 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.nVQVvvGqdO/DTF2DTF27876.p
% See solution above
% 1.29/1.17 ------------------------
% 1.29/1.18 ---- Cleaned THF ---
% 1.29/1.18 thf(a_type,type,
% 1.29/1.18 a: $tType ).
% 1.29/1.18
% 1.29/1.18 thf(cTHM511_pme,conjecture,
% 1.29/1.18 ( ! [Xx: a] : ( Xx = Xx )
% 1.29/1.18 & ! [Xx: a,Xy: a] :
% 1.29/1.18 ( ( Xx = Xy )
% 1.29/1.18 => ( Xy = Xx ) )
% 1.29/1.18 & ! [Xx: a,Xy: a,Xz: a] :
% 1.29/1.18 ( ( ( Xx = Xy )
% 1.29/1.18 & ( Xy = Xz ) )
% 1.29/1.18 => ( Xx = Xz ) ) ) ).
% 1.29/1.18 ------------------------
% 1.29/1.19 % (27973)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_27876 for (3000ds/183Mi)
% 1.29/1.19 % (27973)First to succeed.
% 1.29/1.19 % (27973)Refutation found. Thanks to Tanya!
% 1.29/1.19 % SZS status Theorem for DTF2THF_27876
% 1.29/1.19 % SZS output start Proof for DTF2THF_27876
% 1.29/1.19 tff(type_def_5, type, a: $tType).
% 1.29/1.19 tff(func_def_0, type, a: $tType).
% 1.29/1.19 tff(func_def_1, type, sK0: a).
% 1.29/1.19 tff(func_def_2, type, sK1: a).
% 1.29/1.19 tff(func_def_3, type, sK2: a).
% 1.29/1.19 tff(func_def_4, type, sK3: a).
% 1.29/1.19 tff(func_def_5, type, sK4: a).
% 1.29/1.19 tff(func_def_6, type, sK5: a).
% 1.29/1.19 tff(f51,plain,(
% 1.29/1.19 $false),
% 1.29/1.19 inference(avatar_sat_refutation,[status(thm)],[f31,f36,f41,f42,f43,f44,f50])).
% 1.29/1.19 tff(f50,plain,(
% 1.29/1.19 ~spl6_2 | ~spl6_3 | spl6_4),
% 1.29/1.19 inference(avatar_contradiction_clause,[status(thm)],[f49])).
% 1.29/1.19 tff(f49,plain,(
% 1.29/1.19 $false | (~spl6_2 | ~spl6_3 | spl6_4)),
% 1.29/1.19 inference(subsumption_resolution,[status(thm)],[f46,f40])).
% 1.29/1.19 tff(f40,plain,(
% 1.29/1.19 sK0 != sK1 | spl6_4),
% 1.29/1.19 inference(avatar_component_clause,[status(thm)],[f38])).
% 1.29/1.19 tff(f38,definition,(
% 1.29/1.19 spl6_4 <=> sK0 = sK1),
% 1.29/1.19 introduced(definition,[new_symbols(naming,[spl6_4])],[avatar_definition])).
% 1.29/1.19 tff(f46,plain,(
% 1.29/1.19 sK0 = sK1 | (~spl6_2 | ~spl6_3)),
% 1.29/1.19 inference(superposition,[status(thm)],[f30,f35])).
% 1.29/1.19 tff(f35,plain,(
% 1.29/1.19 sK0 = sK2 | ~spl6_3),
% 1.29/1.19 inference(avatar_component_clause,[status(thm)],[f33])).
% 1.29/1.19 tff(f33,definition,(
% 1.29/1.19 spl6_3 <=> sK0 = sK2),
% 1.29/1.19 introduced(definition,[new_symbols(naming,[spl6_3])],[avatar_definition])).
% 1.29/1.19 tff(f30,plain,(
% 1.29/1.19 sK2 = sK1 | ~spl6_2),
% 1.29/1.19 inference(avatar_component_clause,[status(thm)],[f28])).
% 1.29/1.19 tff(f28,definition,(
% 1.29/1.19 spl6_2 <=> sK2 = sK1),
% 1.29/1.19 introduced(definition,[new_symbols(naming,[spl6_2])],[avatar_definition])).
% 1.29/1.19 tff(f44,plain,(
% 1.29/1.19 ~spl6_1 | ~spl6_4),
% 1.29/1.19 inference(avatar_split_clause,[status(thm)],[f17,f38,f24])).
% 1.29/1.19 tff(f24,definition,(
% 1.29/1.19 spl6_1 <=> sK4 = sK5),
% 1.29/1.19 introduced(definition,[new_symbols(naming,[spl6_1])],[avatar_definition])).
% 1.29/1.19 tff(f17,plain,(
% 1.29/1.19 sK0 != sK1 | sK4 != sK5),
% 1.29/1.19 inference(trivial_inequality_removal,[status(thm)],[f11])).
% 1.29/1.19 tff(f11,plain,(
% 1.29/1.19 sK3 != sK3 | sK4 != sK5 | sK0 != sK1),
% 1.29/1.19 inference(cnf_transformation,[status(thm)],[f10])).
% 1.29/1.19 tff(f10,plain,(
% 1.29/1.19 (sK2 = sK1 & sK0 = sK2 & sK0 != sK1) | sK3 != sK3 | (sK4 = sK5 & sK4 != sK5)),
% 1.29/1.19 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f6,f9,f8,f7])).
% 1.29/1.19 tff(f7,plain,(
% 1.29/1.19 ? [X0 : a,X1 : a,X2 : a] : (X1 = X2 & X0 = X2 & X0 != X1) => (sK2 = sK1 & sK0 = sK2 & sK0 != sK1)),
% 1.29/1.19 introduced(definition,[],[choice_axiom])).
% 1.29/1.19 tff(f8,plain,(
% 1.29/1.19 ? [X3 : a] : X3 != X3 => sK3 != sK3),
% 1.29/1.19 introduced(definition,[],[choice_axiom])).
% 1.29/1.19 tff(f9,plain,(
% 1.29/1.19 ? [X4 : a,X5 : a] : (X4 = X5 & X4 != X5) => (sK4 = sK5 & sK4 != sK5)),
% 1.29/1.19 introduced(definition,[],[choice_axiom])).
% 1.29/1.19 tff(f6,plain,(
% 1.29/1.19 ? [X0 : a,X1 : a,X2 : a] : (X1 = X2 & X0 = X2 & X0 != X1) | ? [X3 : a] : X3 != X3 | ? [X4 : a,X5 : a] : (X4 = X5 & X4 != X5)),
% 1.29/1.19 inference(rectify,[status(thm)],[f5])).
% 1.29/1.19 tff(f5,plain,(
% 1.29/1.19 ? [X3 : a,X1 : a,X2 : a] : (X1 = X2 & X2 = X3 & X1 != X3) | ? [X0 : a] : X0 != X0 | ? [X4 : a,X5 : a] : (X4 = X5 & X4 != X5)),
% 1.29/1.19 inference(flattening,[status(thm)],[f4])).
% 1.29/1.19 tff(f4,plain,(
% 1.29/1.19 ? [X2 : a,X3 : a,X1 : a] : (X1 != X3 & (X1 = X2 & X2 = X3)) | ? [X0 : a] : X0 != X0 | ? [X4 : a,X5 : a] : (X4 = X5 & X4 != X5)),
% 1.29/1.19 inference(ennf_transformation,[status(thm)],[f3])).
% 1.29/1.19 tff(f3,plain,(
% 1.29/1.19 ~(! [X2 : a,X3 : a,X1 : a] : ((X1 = X2 & X2 = X3) => X1 = X3) & ! [X0 : a] : X0 = X0 & ! [X5 : a,X4 : a] : (X4 = X5 => X4 = X5))),
% 1.29/1.19 inference(rectify,[status(thm)],[f2])).
% 1.29/1.19 tff(f2,negated_conjecture,(
% 1.29/1.19 ~(! [X0 : a] : X0 = X0 & ! [X0 : a,X1 : a,X2 : a] : ((X0 = X1 & X1 = X2) => X0 = X2) & ! [X1 : a,X0 : a] : (X0 = X1 => X0 = X1))),
% 1.29/1.19 inference(negated_conjecture,[status(cth)],[f1])).
% 1.29/1.19 tff(f1,conjecture,(
% 1.29/1.19 ! [X0 : a] : X0 = X0 & ! [X0 : a,X1 : a,X2 : a] : ((X0 = X1 & X1 = X2) => X0 = X2) & ! [X1 : a,X0 : a] : (X0 = X1 => X0 = X1)),
% 1.29/1.19 file('/export/starexec/sandbox2/tmp/tmp.nVQVvvGqdO/DTF2THF_27876.p',cTHM511_pme)).
% 1.29/1.19 tff(f43,plain,(
% 1.29/1.19 spl6_3 | ~spl6_1),
% 1.29/1.19 inference(avatar_split_clause,[status(thm)],[f18,f24,f33])).
% 1.29/1.19 tff(f18,plain,(
% 1.29/1.19 sK4 != sK5 | sK0 = sK2),
% 1.29/1.19 inference(trivial_inequality_removal,[status(thm)],[f13])).
% 1.29/1.19 tff(f13,plain,(
% 1.29/1.19 sK4 != sK5 | sK0 = sK2 | sK3 != sK3),
% 1.29/1.19 inference(cnf_transformation,[status(thm)],[f10])).
% 1.29/1.19 tff(f42,plain,(
% 1.29/1.19 spl6_2 | ~spl6_1),
% 1.29/1.19 inference(avatar_split_clause,[status(thm)],[f19,f24,f28])).
% 1.29/1.20 tff(f19,plain,(
% 1.29/1.20 sK4 != sK5 | sK2 = sK1),
% 1.29/1.20 inference(trivial_inequality_removal,[status(thm)],[f15])).
% 1.29/1.20 tff(f15,plain,(
% 1.29/1.20 sK3 != sK3 | sK2 = sK1 | sK4 != sK5),
% 1.29/1.20 inference(cnf_transformation,[status(thm)],[f10])).
% 1.29/1.20 tff(f41,plain,(
% 1.29/1.20 ~spl6_4 | spl6_1),
% 1.29/1.20 inference(avatar_split_clause,[status(thm)],[f20,f24,f38])).
% 1.29/1.20 tff(f20,plain,(
% 1.29/1.20 sK0 != sK1 | sK4 = sK5),
% 1.29/1.20 inference(trivial_inequality_removal,[status(thm)],[f12])).
% 1.29/1.20 tff(f12,plain,(
% 1.29/1.20 sK0 != sK1 | sK3 != sK3 | sK4 = sK5),
% 1.29/1.20 inference(cnf_transformation,[status(thm)],[f10])).
% 1.29/1.20 tff(f36,plain,(
% 1.29/1.20 spl6_1 | spl6_3),
% 1.29/1.20 inference(avatar_split_clause,[status(thm)],[f21,f33,f24])).
% 1.29/1.20 tff(f21,plain,(
% 1.29/1.20 sK4 = sK5 | sK0 = sK2),
% 1.29/1.20 inference(trivial_inequality_removal,[status(thm)],[f14])).
% 1.29/1.20 tff(f14,plain,(
% 1.29/1.20 sK3 != sK3 | sK4 = sK5 | sK0 = sK2),
% 1.29/1.20 inference(cnf_transformation,[status(thm)],[f10])).
% 1.29/1.20 tff(f31,plain,(
% 1.29/1.20 spl6_1 | spl6_2),
% 1.29/1.20 inference(avatar_split_clause,[status(thm)],[f22,f28,f24])).
% 1.29/1.20 tff(f22,plain,(
% 1.29/1.20 sK2 = sK1 | sK4 = sK5),
% 1.29/1.20 inference(trivial_inequality_removal,[status(thm)],[f16])).
% 1.29/1.20 tff(f16,plain,(
% 1.29/1.20 sK3 != sK3 | sK2 = sK1 | sK4 = sK5),
% 1.29/1.20 inference(cnf_transformation,[status(thm)],[f10])).
% 1.29/1.20 % SZS output end Proof for DTF2THF_27876
% 1.29/1.20 % (27973)------------------------------
% 1.29/1.20 % (27973)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.29/1.20 % (27973)Termination reason: Refutation
% 1.29/1.20
% 1.29/1.20 % (27973)Memory used [KB]: 5500
% 1.29/1.20 % (27973)Time elapsed: 0.003 s
% 1.29/1.20 % (27973)Instructions burned: 1 (million)
% 1.29/1.20 % (27973)------------------------------
% 1.29/1.20 % (27973)------------------------------
% 1.29/1.20 % (27972)Success in time 0.012 s
%------------------------------------------------------------------------------