%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV131^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/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:40:21 AM UTC 2026
% Result : Theorem 1.22s 1.19s
% Output : Refutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 167 ( 68 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 207 ( 34 ~; 22 |; 26 &; 107 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 60 ( 0 ^; 42 !; 18 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > a > $o ).
thf(func_def_5,type,
sK1: a ).
thf(func_def_6,type,
sK2: a ).
thf(func_def_7,type,
sK3: a > $o ).
thf(f31,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f30]) ).
thf(f30,plain,
$true = $false,
inference(superposition,[status(thm)],[f18,f27]) ).
thf(f27,plain,
( $true
= ( sK3 @ sK1 ) ),
inference(subsumption_resolution,[status(thm)],[f25,f12]) ).
thf(f12,plain,
( ( sK3 @ sK2 )
= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ( $true
= ( sK0 @ sK2 @ sK1 ) )
& ( $true
!= ( sK3 @ sK1 ) )
& ! [X4: a,X5: a] :
( ( ( sK0 @ X4 @ X5 )
!= $true )
| ( $true
!= ( sK3 @ X4 ) )
| ( $true
= ( sK3 @ X5 ) ) )
& ( ( sK3 @ sK2 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > a > $o,X1: a,X2: a] :
( ( $true
= ( X0 @ X2 @ X1 ) )
& ? [X3: a > $o] :
( ( ( X3 @ X1 )
!= $true )
& ! [X4: a,X5: a] :
( ( ( X0 @ X4 @ X5 )
!= $true )
| ( ( X3 @ X4 )
!= $true )
| ( ( X3 @ X5 )
= $true ) )
& ( ( X3 @ X2 )
= $true ) ) )
=> ( ( $true
= ( sK0 @ sK2 @ sK1 ) )
& ? [X3: a > $o] :
( ( $true
!= ( X3 @ sK1 ) )
& ! [X5: a,X4: a] :
( ( ( sK0 @ X4 @ X5 )
!= $true )
| ( ( X3 @ X4 )
!= $true )
| ( ( X3 @ X5 )
= $true ) )
& ( $true
= ( X3 @ sK2 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
( ? [X3: a > $o] :
( ( $true
!= ( X3 @ sK1 ) )
& ! [X5: a,X4: a] :
( ( ( sK0 @ X4 @ X5 )
!= $true )
| ( ( X3 @ X4 )
!= $true )
| ( ( X3 @ X5 )
= $true ) )
& ( $true
= ( X3 @ sK2 ) ) )
=> ( ( $true
!= ( sK3 @ sK1 ) )
& ! [X5: a,X4: a] :
( ( ( sK0 @ X4 @ X5 )
!= $true )
| ( $true
!= ( sK3 @ X4 ) )
| ( $true
= ( sK3 @ X5 ) ) )
& ( ( sK3 @ sK2 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
? [X0: a > a > $o,X1: a,X2: a] :
( ( $true
= ( X0 @ X2 @ X1 ) )
& ? [X3: a > $o] :
( ( ( X3 @ X1 )
!= $true )
& ! [X4: a,X5: a] :
( ( ( X0 @ X4 @ X5 )
!= $true )
| ( ( X3 @ X4 )
!= $true )
| ( ( X3 @ X5 )
= $true ) )
& ( ( X3 @ X2 )
= $true ) ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
? [X2: a > a > $o,X1: a,X0: a] :
( ( ( X2 @ X0 @ X1 )
= $true )
& ? [X3: a > $o] :
( ( ( X3 @ X1 )
!= $true )
& ! [X4: a,X5: a] :
( ( $true
!= ( X2 @ X4 @ X5 ) )
| ( ( X3 @ X4 )
!= $true )
| ( ( X3 @ X5 )
= $true ) )
& ( $true
= ( X3 @ X0 ) ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: a,X1: a,X2: a > a > $o] :
( ? [X3: a > $o] :
( ( ( X3 @ X1 )
!= $true )
& ( $true
= ( X3 @ X0 ) )
& ! [X5: a,X4: a] :
( ( ( X3 @ X5 )
= $true )
| ( ( X3 @ X4 )
!= $true )
| ( $true
!= ( X2 @ X4 @ X5 ) ) ) )
& ( ( X2 @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a,X1: a,X2: a > a > $o] :
( ( ( X2 @ X0 @ X1 )
= $true )
=> ! [X3: a > $o] :
( ! [X5: a,X4: a] :
( ( ( ( X3 @ X4 )
= $true )
& ( $true
= ( X2 @ X4 @ X5 ) ) )
=> ( ( X3 @ X5 )
= $true ) )
=> ( ( $true
= ( X3 @ X0 ) )
=> ( ( X3 @ X1 )
= $true ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a,X1: a,X2: a > a > $o] :
( ( X2 @ X0 @ X1 )
=> ! [X3: a > $o] :
( ! [X4: a,X5: a] :
( ( ( X3 @ X4 )
& ( X2 @ X4 @ X5 ) )
=> ( X3 @ X5 ) )
=> ( ( X3 @ X0 )
=> ( X3 @ X1 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a,X2: a,X0: a > a > $o] :
( ( X0 @ X1 @ X2 )
=> ! [X3: a > $o] :
( ! [X4: a,X5: a] :
( ( ( X3 @ X4 )
& ( X0 @ X4 @ X5 ) )
=> ( X3 @ X5 ) )
=> ( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: a,X2: a,X0: a > a > $o] :
( ( X0 @ X1 @ X2 )
=> ! [X3: a > $o] :
( ! [X4: a,X5: a] :
( ( ( X3 @ X4 )
& ( X0 @ X4 @ X5 ) )
=> ( X3 @ X5 ) )
=> ( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mcqRVwRy35/DTF2THF_14538.p',cTHM202_pme) ).
thf(f25,plain,
( ( $true
= ( sK3 @ sK1 ) )
| ( ( sK3 @ sK2 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f24]) ).
thf(f24,plain,
( ( $true
= ( sK3 @ sK1 ) )
| ( ( sK3 @ sK2 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f13,f15]) ).
thf(f15,plain,
( $true
= ( sK0 @ sK2 @ sK1 ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f13,plain,
! [X4: a,X5: a] :
( ( ( sK0 @ X4 @ X5 )
!= $true )
| ( $true
= ( sK3 @ X5 ) )
| ( $true
!= ( sK3 @ X4 ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f18,plain,
( $false
= ( sK3 @ sK1 ) ),
inference(trivial_inequality_removal,[status(thm)],[f17]) ).
thf(f17,plain,
( ( $true != $true )
| ( $false
= ( sK3 @ sK1 ) ) ),
inference(fool_paramodulation,[status(thm)],[f14]) ).
thf(f14,plain,
( $true
!= ( sK3 @ sK1 ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV131^5 : TPTP v9.2.1. Released v4.0.0.
% 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.33 % Computer : n029.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 12:41:14 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.20/0.44 ---- Original DTF file ---
% 0.20/0.44 thf(spec,logic,$$dhol).
% 0.20/0.44 %------------------------------------------------------------------------------
% 0.20/0.44 % File : SEV131^5 : TPTP v9.2.1. Released v4.0.0.
% 0.20/0.44 % Domain : Set Theory (Relations)
% 0.20/0.44 % Problem : TPS problem THM202
% 0.20/0.44 % Version : Especial.
% 0.20/0.44 % English :
% 0.20/0.44
% 0.20/0.44 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.20/0.44 % Source : [Bro09]
% 0.20/0.44 % Names : tps_0245 [Bro09]
% 0.20/0.44 % : THM202 [TPS]
% 0.20/0.44
% 0.20/0.44 % Status : Theorem
% 0.20/0.44 % Rating : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% 0.20/0.44 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.20/0.44 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.20/0.44 % Maximal formula atoms : 0 ( 0 avg)
% 0.20/0.44 % Number of connectives : 13 ( 0 ~; 0 |; 1 &; 8 @)
% 0.20/0.44 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.20/0.44 % Maximal formula depth : 13 ( 13 avg)
% 0.20/0.44 % Number of types : 2 ( 1 usr)
% 0.20/0.44 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.20/0.44 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.44 % Number of variables : 6 ( 0 ^; 6 !; 0 ?; 6 :)
% 0.20/0.44 % SPC : TH0_THM_NEQ_NAR
% 0.20/0.44
% 0.20/0.44 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.20/0.44 % project in the Department of Mathematical Sciences at Carnegie
% 0.20/0.44 % Mellon University. Distributed under the Creative Commons copyleft
% 0.20/0.44 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.20/0.44 % : Polymorphic definitions expanded.
% 0.20/0.44 %------------------------------------------------------------------------------
% 0.20/0.44 thf(a_type,type,
% 0.20/0.44 a: $tType ).
% 0.20/0.44
% 0.20/0.44 thf(cTHM202_pme,conjecture,
% 0.20/0.44 ! [Xr: a > a > $o,Xx: a,Xy: a] :
% 0.20/0.44 ( ( Xr @ Xx @ Xy )
% 0.20/0.44 => ! [Xx0: a > $o] :
% 0.20/0.44 ( ! [Xy0: a,Xz: a] :
% 0.20/0.44 ( ( ( Xr @ Xy0 @ Xz )
% 0.20/0.44 & ( Xx0 @ Xy0 ) )
% 0.20/0.44 => ( Xx0 @ Xz ) )
% 0.20/0.44 => ( ( Xx0 @ Xx )
% 0.20/0.44 => ( Xx0 @ Xy ) ) ) ) ).
% 0.20/0.44
% 0.20/0.44 %------------------------------------------------------------------------------
% 0.20/0.44 ------------------------
% 1.22/1.17 ---- Embedded in THF ---
% 1.22/1.17 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.22/1.17 %%% Generated on Tue Feb 24 12:41:15 EST 2026
% 1.22/1.17 %%% using '$$dhol' embedding, version 1.3.0.
% 1.22/1.17 %%% Logic specification used:
% 1.22/1.17 %%% thf(spec, logic, $$dhol).
% 1.22/1.17
% 1.22/1.17 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.mcqRVwRy35/DTF2DTF14538.p
% See solution above
% 1.22/1.17 ------------------------
% 1.22/1.18 ---- Cleaned THF ---
% 1.22/1.18 thf(a_type,type,
% 1.22/1.18 a: $tType ).
% 1.22/1.18
% 1.22/1.18 thf(cTHM202_pme,conjecture,
% 1.22/1.18 ! [Xr: a > a > $o,Xx: a,Xy: a] :
% 1.22/1.18 ( ( Xr @ Xx @ Xy )
% 1.22/1.18 => ! [Xx0: a > $o] :
% 1.22/1.18 ( ! [Xy0: a,Xz: a] :
% 1.22/1.18 ( ( ( Xr @ Xy0 @ Xz )
% 1.22/1.18 & ( Xx0 @ Xy0 ) )
% 1.22/1.18 => ( Xx0 @ Xz ) )
% 1.22/1.18 => ( ( Xx0 @ Xx )
% 1.22/1.18 => ( Xx0 @ Xy ) ) ) ) ).
% 1.22/1.18 ------------------------
% 1.22/1.19 % (14637)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_14538 for (3000ds/4Mi)
% 1.22/1.19 % (14640)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_14538 for (3000ds/2Mi)
% 1.22/1.19 % (14639)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_14538 for (3000ds/2Mi)
% 1.22/1.19 % (14640)Instruction limit reached!
% 1.22/1.19 % (14640)------------------------------
% 1.22/1.19 % (14640)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.22/1.19 % (14640)Termination reason: Unknown
% 1.22/1.19 % (14640)Termination phase: Saturation
% 1.22/1.19
% 1.22/1.19 % (14640)Memory used [KB]: 5500
% 1.22/1.19 % (14640)Time elapsed: 0.002 s
% 1.22/1.19 % (14640)Instructions burned: 2 (million)
% 1.22/1.19 % (14640)------------------------------
% 1.22/1.19 % (14640)------------------------------
% 1.22/1.19 % (14637)First to succeed.
% 1.22/1.19 % (14639)Instruction limit reached!
% 1.22/1.19 % (14639)------------------------------
% 1.22/1.19 % (14639)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.22/1.19 % (14639)Termination reason: Unknown
% 1.22/1.19 % (14639)Termination phase: Saturation
% 1.22/1.19
% 1.22/1.19 % (14639)Memory used [KB]: 5500
% 1.22/1.19 % (14639)Time elapsed: 0.002 s
% 1.22/1.19 % (14639)Instructions burned: 2 (million)
% 1.22/1.19 % (14639)------------------------------
% 1.22/1.19 % (14639)------------------------------
% 1.22/1.19 % (14637)Refutation found. Thanks to Tanya!
% 1.22/1.19 % SZS status Theorem for DTF2THF_14538
% 1.22/1.19 % SZS output start Proof for DTF2THF_14538
% 1.22/1.19 thf(type_def_5, type, a: $tType).
% 1.22/1.19 thf(func_def_0, type, a: $tType).
% 1.22/1.19 thf(func_def_4, type, sK0: a > a > $o).
% 1.22/1.19 thf(func_def_5, type, sK1: a).
% 1.22/1.19 thf(func_def_6, type, sK2: a).
% 1.22/1.19 thf(func_def_7, type, sK3: a > $o).
% 1.22/1.19 thf(f31,plain,(
% 1.22/1.19 $false),
% 1.22/1.19 inference(trivial_inequality_removal,[status(thm)],[f30])).
% 1.22/1.19 thf(f30,plain,(
% 1.22/1.19 ($true = $false)),
% 1.22/1.19 inference(superposition,[status(thm)],[f18,f27])).
% 1.22/1.19 thf(f27,plain,(
% 1.22/1.19 ($true = (sK3 @ sK1))),
% 1.22/1.19 inference(subsumption_resolution,[status(thm)],[f25,f12])).
% 1.22/1.19 thf(f12,plain,(
% 1.22/1.19 ((sK3 @ sK2) = $true)),
% 1.22/1.19 inference(cnf_transformation,[status(thm)],[f11])).
% 1.22/1.19 thf(f11,plain,(
% 1.22/1.19 ($true = (sK0 @ sK2 @ sK1)) & (($true != (sK3 @ sK1)) & ! [X4 : a,X5 : a] : (((sK0 @ X4 @ X5) != $true) | ($true != (sK3 @ X4)) | ($true = (sK3 @ X5))) & ((sK3 @ sK2) = $true))),
% 1.22/1.19 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9])).
% 1.22/1.19 thf(f9,plain,(
% 1.22/1.19 ? [X0 : a > a > $o,X1 : a,X2 : a] : (($true = (X0 @ X2 @ X1)) & ? [X3 : a > $o] : (((X3 @ X1) != $true) & ! [X4 : a,X5 : a] : (((X0 @ X4 @ X5) != $true) | ((X3 @ X4) != $true) | ((X3 @ X5) = $true)) & ((X3 @ X2) = $true))) => (($true = (sK0 @ sK2 @ sK1)) & ? [X3 : a > $o] : (($true != (X3 @ sK1)) & ! [X5 : a,X4 : a] : (((sK0 @ X4 @ X5) != $true) | ((X3 @ X4) != $true) | ((X3 @ X5) = $true)) & ($true = (X3 @ sK2))))),
% 1.22/1.19 introduced(definition,[],[choice_axiom])).
% 1.22/1.19 thf(f10,plain,(
% 1.22/1.19 ? [X3 : a > $o] : (($true != (X3 @ sK1)) & ! [X5 : a,X4 : a] : (((sK0 @ X4 @ X5) != $true) | ((X3 @ X4) != $true) | ((X3 @ X5) = $true)) & ($true = (X3 @ sK2))) => (($true != (sK3 @ sK1)) & ! [X5 : a,X4 : a] : (((sK0 @ X4 @ X5) != $true) | ($true != (sK3 @ X4)) | ($true = (sK3 @ X5))) & ((sK3 @ sK2) = $true))),
% 1.22/1.19 introduced(definition,[],[choice_axiom])).
% 1.22/1.19 thf(f8,plain,(
% 1.22/1.19 ? [X0 : a > a > $o,X1 : a,X2 : a] : (($true = (X0 @ X2 @ X1)) & ? [X3 : a > $o] : (((X3 @ X1) != $true) & ! [X4 : a,X5 : a] : (((X0 @ X4 @ X5) != $true) | ((X3 @ X4) != $true) | ((X3 @ X5) = $true)) & ((X3 @ X2) = $true)))),
% 1.22/1.19 inference(rectify,[status(thm)],[f7])).
% 1.22/1.19 thf(f7,plain,(
% 1.22/1.19 ? [X2 : a > a > $o,X1 : a,X0 : a] : (((X2 @ X0 @ X1) = $true) & ? [X3 : a > $o] : (((X3 @ X1) != $true) & ! [X4 : a,X5 : a] : (($true != (X2 @ X4 @ X5)) | ((X3 @ X4) != $true) | ((X3 @ X5) = $true)) & ($true = (X3 @ X0))))),
% 1.22/1.19 inference(flattening,[status(thm)],[f6])).
% 1.22/1.19 thf(f6,plain,(
% 1.22/1.19 ? [X0 : a,X1 : a,X2 : a > a > $o] : (? [X3 : a > $o] : ((((X3 @ X1) != $true) & ($true = (X3 @ X0))) & ! [X5 : a,X4 : a] : (((X3 @ X5) = $true) | (((X3 @ X4) != $true) | ($true != (X2 @ X4 @ X5))))) & ((X2 @ X0 @ X1) = $true))),
% 1.22/1.19 inference(ennf_transformation,[status(thm)],[f5])).
% 1.22/1.19 thf(f5,plain,(
% 1.22/1.19 ~! [X0 : a,X1 : a,X2 : a > a > $o] : (((X2 @ X0 @ X1) = $true) => ! [X3 : a > $o] : (! [X5 : a,X4 : a] : ((((X3 @ X4) = $true) & ($true = (X2 @ X4 @ X5))) => ((X3 @ X5) = $true)) => (($true = (X3 @ X0)) => ((X3 @ X1) = $true))))),
% 1.22/1.19 inference(fool_elimination,[status(thm)],[f4])).
% 1.22/1.19 thf(f4,plain,(
% 1.22/1.19 ~! [X0 : a,X1 : a,X2 : a > a > $o] : ((X2 @ X0 @ X1) => ! [X3 : a > $o] : (! [X4 : a,X5 : a] : (((X3 @ X4) & (X2 @ X4 @ X5)) => (X3 @ X5)) => ((X3 @ X0) => (X3 @ X1))))),
% 1.22/1.19 inference(rectify,[status(thm)],[f2])).
% 1.22/1.19 thf(f2,negated_conjecture,(
% 1.22/1.19 ~! [X1 : a,X2 : a,X0 : a > a > $o] : ((X0 @ X1 @ X2) => ! [X3 : a > $o] : (! [X4 : a,X5 : a] : (((X3 @ X4) & (X0 @ X4 @ X5)) => (X3 @ X5)) => ((X3 @ X1) => (X3 @ X2))))),
% 1.22/1.19 inference(negated_conjecture,[status(cth)],[f1])).
% 1.22/1.19 thf(f1,conjecture,(
% 1.22/1.19 ! [X1 : a,X2 : a,X0 : a > a > $o] : ((X0 @ X1 @ X2) => ! [X3 : a > $o] : (! [X4 : a,X5 : a] : (((X3 @ X4) & (X0 @ X4 @ X5)) => (X3 @ X5)) => ((X3 @ X1) => (X3 @ X2))))),
% 1.22/1.19 file('/export/starexec/sandbox/tmp/tmp.mcqRVwRy35/DTF2THF_14538.p',cTHM202_pme)).
% 1.22/1.19 thf(f25,plain,(
% 1.22/1.19 ($true = (sK3 @ sK1)) | ((sK3 @ sK2) != $true)),
% 1.22/1.19 inference(trivial_inequality_removal,[status(thm)],[f24])).
% 1.22/1.19 thf(f24,plain,(
% 1.22/1.19 ($true = (sK3 @ sK1)) | ((sK3 @ sK2) != $true) | ($true != $true)),
% 1.22/1.19 inference(superposition,[status(thm)],[f13,f15])).
% 1.22/1.19 thf(f15,plain,(
% 1.22/1.19 ($true = (sK0 @ sK2 @ sK1))),
% 1.22/1.19 inference(cnf_transformation,[status(thm)],[f11])).
% 1.22/1.19 thf(f13,plain,(
% 1.22/1.19 ( ! [X4 : a,X5 : a] : (((sK0 @ X4 @ X5) != $true) | ($true = (sK3 @ X5)) | ($true != (sK3 @ X4))) )),
% 1.22/1.19 inference(cnf_transformation,[status(thm)],[f11])).
% 1.22/1.19 thf(f18,plain,(
% 1.22/1.19 ($false = (sK3 @ sK1))),
% 1.22/1.19 inference(trivial_inequality_removal,[status(thm)],[f17])).
% 1.22/1.19 thf(f17,plain,(
% 1.22/1.19 ($true != $true) | ($false = (sK3 @ sK1))),
% 1.22/1.19 inference(fool_paramodulation,[status(thm)],[f14])).
% 1.22/1.19 thf(f14,plain,(
% 1.22/1.19 ($true != (sK3 @ sK1))),
% 1.22/1.19 inference(cnf_transformation,[status(thm)],[f11])).
% 1.22/1.19 % SZS output end Proof for DTF2THF_14538
% 1.22/1.19 % (14637)------------------------------
% 1.22/1.19 % (14637)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.22/1.19 % (14637)Termination reason: Refutation
% 1.22/1.19
% 1.22/1.19 % (14637)Memory used [KB]: 5500
% 1.22/1.19 % (14637)Time elapsed: 0.003 s
% 1.22/1.19 % (14637)Instructions burned: 2 (million)
% 1.22/1.19 % (14637)------------------------------
% 1.22/1.19 % (14637)------------------------------
% 1.22/1.19 % (14635)Success in time 0.01 s
%------------------------------------------------------------------------------