%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO344^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 : n028.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:59 AM UTC 2026
% Result : Theorem 1.60s 1.31s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 73 ( 17 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 44 ( 17 ~; 10 |; 2 &; 15 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
cQ: $i > $o ).
thf(func_def_4,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(f13,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f12]) ).
thf(f12,plain,
$true != $true,
inference(superposition,[status(thm)],[f10,f11]) ).
thf(f11,plain,
( ( cQ @ cD )
= $true ),
inference(definition_unfolding,[status(thm)],[f8,f9]) ).
thf(f9,plain,
cC = cD,
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
( ( ( cQ @ cD )
!= $true )
& ( cC = cD )
& ( ( cQ @ cC )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ( ( ( cQ @ cC )
!= $true )
| ( cC != cD )
| ( ( cQ @ cD )
= $true ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ( cQ @ cD )
= $true )
| ( cC != cD )
| ( ( cQ @ cC )
!= $true ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( cQ @ cD )
| ( cC != cD )
| ~ ( cQ @ cC ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( cQ @ cD )
| ( cC != cD )
| ~ ( cQ @ cC ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( cQ @ cD )
| ( cC != cD )
| ~ ( cQ @ cC ) ),
file('/export/starexec/sandbox/tmp/tmp.5r0KCg071H/DTF2THF_26509.p',cTHM618) ).
thf(f8,plain,
( ( cQ @ cC )
= $true ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f10,plain,
( ( cQ @ cD )
!= $true ),
inference(cnf_transformation,[status(thm)],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO344^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.34 % Computer : n028.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 14:28:27 EST 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.19/0.46 ---- Original DTF file ---
% 0.19/0.46 thf(spec,logic,$$dhol).
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 % File : SYO344^5 : TPTP v9.2.1. Released v4.0.0.
% 0.19/0.46 % Domain : Syntactic
% 0.19/0.46 % Problem : TPS problem THM618
% 0.19/0.46 % Version : Especial.
% 0.19/0.46 % English : Simple E-unification example.
% 0.19/0.46
% 0.19/0.46 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.19/0.46 % Source : [Bro09]
% 0.19/0.46 % Names : tps_0052 [Bro09]
% 0.19/0.46 % : THM618 [TPS]
% 0.19/0.46
% 0.19/0.46 % Status : Theorem
% 0.19/0.46 % Rating : 0.00 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.19/0.46 % Syntax : Number of formulae : 4 ( 0 unt; 3 typ; 0 def)
% 0.19/0.46 % Number of atoms : 3 ( 1 equ; 0 cnn)
% 0.19/0.46 % Maximal formula atoms : 3 ( 3 avg)
% 0.19/0.46 % Number of connectives : 6 ( 2 ~; 2 |; 0 &; 2 @)
% 0.19/0.46 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.19/0.46 % Maximal formula depth : 5 ( 5 avg)
% 0.19/0.46 % Number of types : 2 ( 0 usr)
% 0.19/0.46 % Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% 0.19/0.46 % Number of symbols : 4 ( 3 usr; 2 con; 0-2 aty)
% 0.19/0.46 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.19/0.46 % SPC : TH0_THM_EQU_NAR
% 0.19/0.46
% 0.19/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.19/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.19/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.19/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 thf(cD,type,
% 0.19/0.46 cD: $i ).
% 0.19/0.46
% 0.19/0.46 thf(cQ,type,
% 0.19/0.46 cQ: $i > $o ).
% 0.19/0.46
% 0.19/0.46 thf(cC,type,
% 0.19/0.46 cC: $i ).
% 0.19/0.46
% 0.19/0.46 thf(cTHM618,conjecture,
% 0.19/0.46 ( ( cC != cD )
% 0.19/0.46 | ~ ( cQ @ cC )
% 0.19/0.46 | ( cQ @ cD ) ) ).
% 0.19/0.46
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 ------------------------
% 1.44/1.28 ---- Embedded in THF ---
% 1.44/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.44/1.28 %%% Generated on Tue Feb 24 14:28:27 EST 2026
% 1.44/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.44/1.28 %%% Logic specification used:
% 1.44/1.28 %%% thf(spec, logic, $$dhol).
% 1.44/1.28
% 1.44/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.5r0KCg071H/DTF2DTF26509.p
% See solution above
% 1.44/1.28 ------------------------
% 1.44/1.29 ---- Cleaned THF ---
% 1.44/1.29 thf(cD,type,
% 1.44/1.29 cD: $i ).
% 1.44/1.29
% 1.44/1.29 thf(cQ,type,
% 1.44/1.29 cQ: $i > $o ).
% 1.44/1.29
% 1.44/1.29 thf(cC,type,
% 1.44/1.29 cC: $i ).
% 1.44/1.29
% 1.44/1.29 thf(cTHM618,conjecture,
% 1.44/1.29 ( ( cC != cD )
% 1.44/1.29 | ~ ( cQ @ cC )
% 1.44/1.29 | ( cQ @ cD ) ) ).
% 1.44/1.29 ------------------------
% 1.60/1.30 % (26838)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_26509 for (3000ds/27Mi)
% 1.60/1.30 % (26838)First to succeed.
% 1.60/1.31 % (26838)Refutation found. Thanks to Tanya!
% 1.60/1.31 % SZS status Theorem for DTF2THF_26509
% 1.60/1.31 % SZS output start Proof for DTF2THF_26509
% 1.60/1.31 thf(func_def_1, type, cQ: $i > $o).
% 1.60/1.31 thf(func_def_4, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 1.60/1.31 thf(f13,plain,(
% 1.60/1.31 $false),
% 1.60/1.31 inference(trivial_inequality_removal,[status(thm)],[f12])).
% 1.60/1.31 thf(f12,plain,(
% 1.60/1.31 ($true != $true)),
% 1.60/1.31 inference(superposition,[status(thm)],[f10,f11])).
% 1.60/1.31 thf(f11,plain,(
% 1.60/1.31 ((cQ @ cD) = $true)),
% 1.60/1.31 inference(definition_unfolding,[status(thm)],[f8,f9])).
% 1.60/1.31 thf(f9,plain,(
% 1.60/1.31 (cC = cD)),
% 1.60/1.31 inference(cnf_transformation,[status(thm)],[f7])).
% 1.60/1.31 thf(f7,plain,(
% 1.60/1.31 ((cQ @ cD) != $true) & (cC = cD) & ((cQ @ cC) = $true)),
% 1.60/1.31 inference(ennf_transformation,[status(thm)],[f6])).
% 1.60/1.31 thf(f6,plain,(
% 1.60/1.31 ~(((cQ @ cC) != $true) | (cC != cD) | ((cQ @ cD) = $true))),
% 1.60/1.31 inference(flattening,[status(thm)],[f5])).
% 1.60/1.31 thf(f5,plain,(
% 1.60/1.31 ~(((cQ @ cD) = $true) | (cC != cD) | ~((cQ @ cC) = $true))),
% 1.60/1.31 inference(fool_elimination,[status(thm)],[f4])).
% 1.60/1.31 thf(f4,plain,(
% 1.60/1.31 ~((cQ @ cD) | (cC != cD) | ~(cQ @ cC))),
% 1.60/1.31 inference(rectify,[status(thm)],[f2])).
% 1.60/1.31 thf(f2,negated_conjecture,(
% 1.60/1.31 ~((cQ @ cD) | (cC != cD) | ~(cQ @ cC))),
% 1.60/1.31 inference(negated_conjecture,[status(cth)],[f1])).
% 1.60/1.31 thf(f1,conjecture,(
% 1.60/1.31 (cQ @ cD) | (cC != cD) | ~(cQ @ cC)),
% 1.60/1.31 file('/export/starexec/sandbox/tmp/tmp.5r0KCg071H/DTF2THF_26509.p',cTHM618)).
% 1.60/1.31 thf(f8,plain,(
% 1.60/1.31 ((cQ @ cC) = $true)),
% 1.60/1.31 inference(cnf_transformation,[status(thm)],[f7])).
% 1.60/1.31 thf(f10,plain,(
% 1.60/1.31 ((cQ @ cD) != $true)),
% 1.60/1.31 inference(cnf_transformation,[status(thm)],[f7])).
% 1.60/1.31 % SZS output end Proof for DTF2THF_26509
% 1.60/1.31 % (26838)------------------------------
% 1.60/1.31 % (26838)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.60/1.31 % (26838)Termination reason: Refutation
% 1.60/1.31
% 1.60/1.31 % (26838)Memory used [KB]: 5500
% 1.60/1.31 % (26838)Time elapsed: 0.002 s
% 1.60/1.31 % (26838)------------------------------
% 1.60/1.31 % (26838)------------------------------
% 1.60/1.31 % (26835)Success in time 0.011 s
%------------------------------------------------------------------------------