%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO089^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 : n001.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:21 AM UTC 2026
% Result : Theorem 1.48s 1.27s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 397 ( 112 equ)
% Maximal formula atoms : 20 ( 19 avg)
% Number of connectives : 272 ( 119 ~; 78 |; 70 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 224 ( 224 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 5 usr; 6 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_4,type,
vEPSILON:
!>[X0: $tType] : sTfun(sTfun(X0,$o),X0) ).
tff(f44,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f43]) ).
tff(f43,plain,
$true != $true,
inference(superposition,[status(thm)],[f31,f34]) ).
tff(f34,plain,
p = $true,
inference(trivial_inequality_removal,[status(thm)],[f33]) ).
tff(f33,plain,
( ( $true != $true )
| ( p = $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f27]) ).
tff(f27,plain,
( ( $true != $true )
| ( $true != $true )
| ( p = $true )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f13,f10,f11,f20]) ).
tff(f20,plain,
s = $true,
inference(cnf_transformation,[status(thm)],[f9]) ).
tff(f9,plain,
( ( s = $true )
& ( ( t != $true )
| ( ( s = $true )
& ( q = $true )
& ( t = $true )
& ( ( p != $true )
| ( t != $true )
| ( q != $true )
| ( s != $true ) ) )
| ( q != $true )
| ( s != $true ) )
& ( ( t != $true )
| ( ( s = $true )
& ( t = $true )
& ( p = $true )
& ( q = $true ) )
| ( q != $true )
| ( s != $true ) )
& ( q = $true )
& ( t = $true ) ),
inference(flattening,[status(thm)],[f8]) ).
tff(f8,plain,
( ( t = $true )
& ( s = $true )
& ( q = $true )
& ( ( s != $true )
| ( t != $true )
| ( ( q = $true )
& ( p = $true )
& ( s = $true )
& ( t = $true ) )
| ( q != $true ) )
& ( ( q != $true )
| ( t != $true )
| ( s != $true )
| ( ( q = $true )
& ( ( s != $true )
| ( t != $true )
| ( q != $true )
| ( p != $true ) )
& ( t = $true )
& ( s = $true ) ) ) ),
inference(ennf_transformation,[status(thm)],[f7]) ).
tff(f7,plain,
~ ( ( ( q != $true )
| ( t != $true )
| ( s != $true )
| ~ ( ~ ( ( q = $true )
& ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) ) )
| ~ ( ( t = $true )
& ( s = $true ) ) ) )
=> ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( ~ ( ( q = $true )
& ( p = $true ) )
| ~ ( ( s = $true )
& ( t = $true ) ) )
& ( q = $true ) ) ) ) ) ),
inference(flattening,[status(thm)],[f6]) ).
tff(f6,plain,
~ ( ( ( t != $true )
| ( s != $true )
| ~ ( ~ ( ( q = $true )
& ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) ) )
| ~ ( ( t = $true )
& ( s = $true ) ) )
| ( q != $true ) )
=> ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( ~ ( ( q = $true )
& ( p = $true ) )
| ~ ( ( s = $true )
& ( t = $true ) ) )
& ( q = $true ) ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
tff(f5,plain,
~ ( ( ~ t
| ~ s
| ~ ( ~ ( q
& ( ~ ( p
& q )
| ~ ( t
& s ) ) )
| ~ ( s
& t ) )
| ~ q )
=> ( ~ ( t
& s )
| ~ ( ( ~ ( q
& ( ~ ( s
& t )
| ~ ( p
& q ) ) )
| ~ ( t
& s ) )
& q ) ) ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ~ t
| ~ s
| ~ ( ~ ( q
& ( ~ ( p
& q )
| ~ ( t
& s ) ) )
| ~ ( s
& t ) )
| ~ q )
=> ( ~ ( t
& s )
| ~ ( ( ~ ( q
& ( ~ ( s
& t )
| ~ ( p
& q ) ) )
| ~ ( t
& s ) )
& q ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
( ( ~ t
| ~ s
| ~ ( ~ ( q
& ( ~ ( p
& q )
| ~ ( t
& s ) ) )
| ~ ( s
& t ) )
| ~ q )
=> ( ~ ( t
& s )
| ~ ( ( ~ ( q
& ( ~ ( s
& t )
| ~ ( p
& q ) ) )
| ~ ( t
& s ) )
& q ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zooy1nGPuj/DTF2THF_2362.p',cDMG7) ).
tff(f11,plain,
q = $true,
inference(cnf_transformation,[status(thm)],[f9]) ).
tff(f10,plain,
t = $true,
inference(cnf_transformation,[status(thm)],[f9]) ).
tff(f13,plain,
( ( t != $true )
| ( p = $true )
| ( q != $true )
| ( s != $true ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
tff(f31,plain,
p != $true,
inference(trivial_inequality_removal,[status(thm)],[f30]) ).
tff(f30,plain,
( ( $true != $true )
| ( p != $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f24]) ).
tff(f24,plain,
( ( $true != $true )
| ( $true != $true )
| ( p != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f16,f10,f10,f11,f20,f11,f20]) ).
tff(f16,plain,
( ( t != $true )
| ( p != $true )
| ( t != $true )
| ( q != $true )
| ( s != $true )
| ( q != $true )
| ( s != $true ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO089^5 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.18/0.34 % Computer : n001.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Tue Feb 24 14:24:50 EST 2026
% 0.18/0.34 % CPUTime :
% 0.18/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.31/0.46 ---- Original DTF file ---
% 0.31/0.46 thf(spec,logic,$$dhol).
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 % File : SYO089^5 : TPTP v9.2.1. Released v4.0.0.
% 0.31/0.46 % Domain : Syntactic
% 0.31/0.46 % Problem : TPS problem DMG7
% 0.31/0.46 % Version : Especial.
% 0.31/0.46 % English : A propositional problem suggested by Jay Hunschel Kim.
% 0.31/0.46
% 0.31/0.46 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.31/0.46 % Source : [Bro09]
% 0.31/0.46 % Names : tps_0163 [Bro09]
% 0.31/0.46 % : DMG7 [TPS]
% 0.31/0.46
% 0.31/0.46 % Status : Theorem
% 0.31/0.46 % Rating : 0.08 v9.1.0, 0.00 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.00 v6.2.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.31/0.46 % Syntax : Number of formulae : 5 ( 0 unt; 4 typ; 0 def)
% 0.31/0.46 % Number of atoms : 20 ( 0 equ; 0 cnn)
% 0.31/0.46 % Maximal formula atoms : 20 ( 20 avg)
% 0.31/0.46 % Number of connectives : 33 ( 14 ~; 8 |; 10 &; 0 @)
% 0.31/0.46 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.31/0.46 % Maximal formula depth : 11 ( 11 avg)
% 0.31/0.46 % Number of types : 1 ( 0 usr)
% 0.31/0.46 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.31/0.46 % Number of symbols : 4 ( 4 usr; 4 con; 0-0 aty)
% 0.31/0.46 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.31/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.31/0.46
% 0.31/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.31/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.31/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.31/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 thf(t,type,
% 0.31/0.46 t: $o ).
% 0.31/0.46
% 0.31/0.46 thf(s,type,
% 0.31/0.46 s: $o ).
% 0.31/0.46
% 0.31/0.46 thf(q,type,
% 0.31/0.46 q: $o ).
% 0.31/0.46
% 0.31/0.46 thf(p,type,
% 0.31/0.46 p: $o ).
% 0.31/0.46
% 0.31/0.46 thf(cDMG7,conjecture,
% 0.31/0.46 ( ( ~ ( ~ ( ( ~ ( p
% 0.31/0.46 & q )
% 0.31/0.46 | ~ ( s
% 0.31/0.46 & t ) )
% 0.31/0.46 & q )
% 0.31/0.46 | ~ ( s
% 0.31/0.46 & t ) )
% 0.31/0.46 | ~ q
% 0.31/0.46 | ~ s
% 0.31/0.46 | ~ t )
% 0.31/0.46 => ( ~ ( ( ~ ( ( ~ ( p
% 0.31/0.46 & q )
% 0.31/0.46 | ~ ( s
% 0.31/0.46 & t ) )
% 0.31/0.46 & q )
% 0.31/0.46 | ~ ( s
% 0.31/0.46 & t ) )
% 0.31/0.46 & q )
% 0.31/0.46 | ~ ( s
% 0.31/0.46 & t ) ) ) ).
% 0.31/0.46
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 ------------------------
% 1.48/1.24 ---- Embedded in THF ---
% 1.48/1.24 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.24 %%% Generated on Tue Feb 24 14:24:51 EST 2026
% 1.48/1.24 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.24 %%% Logic specification used:
% 1.48/1.24 %%% thf(spec, logic, $$dhol).
% 1.48/1.24
% 1.48/1.24 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.zooy1nGPuj/DTF2DTF2362.p
% See solution above
% 1.48/1.24 ------------------------
% 1.48/1.25 ---- Cleaned THF ---
% 1.48/1.25 thf(t,type,
% 1.48/1.25 t: $o ).
% 1.48/1.25
% 1.48/1.25 thf(s,type,
% 1.48/1.25 s: $o ).
% 1.48/1.25
% 1.48/1.25 thf(q,type,
% 1.48/1.25 q: $o ).
% 1.48/1.25
% 1.48/1.25 thf(p,type,
% 1.48/1.25 p: $o ).
% 1.48/1.25
% 1.48/1.25 thf(cDMG7,conjecture,
% 1.48/1.25 ( ( ~ ( ~ ( ( ~ ( p
% 1.48/1.25 & q )
% 1.48/1.25 | ~ ( s
% 1.48/1.25 & t ) )
% 1.48/1.25 & q )
% 1.48/1.25 | ~ ( s
% 1.48/1.25 & t ) )
% 1.48/1.25 | ~ q
% 1.48/1.25 | ~ s
% 1.48/1.25 | ~ t )
% 1.48/1.25 => ( ~ ( ( ~ ( ( ~ ( p
% 1.48/1.25 & q )
% 1.48/1.25 | ~ ( s
% 1.48/1.25 & t ) )
% 1.48/1.25 & q )
% 1.48/1.25 | ~ ( s
% 1.48/1.25 & t ) )
% 1.48/1.25 & q )
% 1.48/1.25 | ~ ( s
% 1.48/1.25 & t ) ) ) ).
% 1.48/1.25 ------------------------
% 1.48/1.26 % (2698)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_2362 for (2999ds/2Mi)
% 1.48/1.26 % (2698)Instruction limit reached!
% 1.48/1.26 % (2698)------------------------------
% 1.48/1.26 % (2698)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.26 % (2698)Termination reason: Unknown
% 1.48/1.26 % (2698)Termination phase: Saturation
% 1.48/1.26
% 1.48/1.26 % (2698)Memory used [KB]: 5500
% 1.48/1.26 % (2698)Time elapsed: 0.002 s
% 1.48/1.26 % (2698)Instructions burned: 2 (million)
% 1.48/1.26 % (2698)------------------------------
% 1.48/1.26 % (2698)------------------------------
% 1.48/1.27 % (2696)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_2362 for (2999ds/27Mi)
% 1.48/1.27 % (2694)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_2362 for (2999ds/183Mi)
% 1.48/1.27 % (2695)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_2362 for (2999ds/4Mi)
% 1.48/1.27 % (2697)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_2362 for (2999ds/2Mi)
% 1.48/1.27 % (2699)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_2362 for (2999ds/275Mi)
% 1.48/1.27 % (2700)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_2362 for (2999ds/18Mi)
% 1.48/1.27 % (2696)First to succeed.
% 1.48/1.27 % (2697)Instruction limit reached!
% 1.48/1.27 % (2697)------------------------------
% 1.48/1.27 % (2697)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.27 % (2697)Termination reason: Unknown
% 1.48/1.27 % (2697)Termination phase: Saturation
% 1.48/1.27
% 1.48/1.27 % (2697)Memory used [KB]: 895
% 1.48/1.27 % (2697)Time elapsed: 0.003 s
% 1.48/1.27 % (2697)Instructions burned: 2 (million)
% 1.48/1.27 % (2697)------------------------------
% 1.48/1.27 % (2697)------------------------------
% 1.48/1.27 % (2694)Also succeeded, but the first one will report.
% 1.48/1.27 % (2696)Refutation found. Thanks to Tanya!
% 1.48/1.27 % SZS status Theorem for DTF2THF_2362
% 1.48/1.27 % SZS output start Proof for DTF2THF_2362
% 1.48/1.27 tff(func_def_4, type, vEPSILON: !>[X0: $tType]:(sTfun(sTfun(X0,$o),X0))).
% 1.48/1.27 tff(f44,plain,(
% 1.48/1.27 $false),
% 1.48/1.27 inference(trivial_inequality_removal,[status(thm)],[f43])).
% 1.48/1.27 tff(f43,plain,(
% 1.48/1.27 ($true != $true)),
% 1.48/1.27 inference(superposition,[status(thm)],[f31,f34])).
% 1.48/1.27 tff(f34,plain,(
% 1.48/1.27 (p = $true)),
% 1.48/1.27 inference(trivial_inequality_removal,[status(thm)],[f33])).
% 1.48/1.27 tff(f33,plain,(
% 1.48/1.27 ($true != $true) | (p = $true)),
% 1.48/1.27 inference(duplicate_literal_removal,[status(thm)],[f27])).
% 1.48/1.27 tff(f27,plain,(
% 1.48/1.27 ($true != $true) | ($true != $true) | (p = $true) | ($true != $true)),
% 1.48/1.27 inference(definition_unfolding,[status(thm)],[f13,f10,f11,f20])).
% 1.48/1.27 tff(f20,plain,(
% 1.48/1.27 (s = $true)),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f9])).
% 1.48/1.27 tff(f9,plain,(
% 1.48/1.27 (s = $true) & ((t != $true) | ((s = $true) & (q = $true) & (t = $true) & ((p != $true) | (t != $true) | (q != $true) | (s != $true))) | (q != $true) | (s != $true)) & ((t != $true) | ((s = $true) & (t = $true) & (p = $true) & (q = $true)) | (q != $true) | (s != $true)) & (q = $true) & (t = $true)),
% 1.48/1.27 inference(flattening,[status(thm)],[f8])).
% 1.48/1.27 tff(f8,plain,(
% 1.48/1.27 (((t = $true) & (s = $true)) & ((q = $true) & (((s != $true) | (t != $true)) | ((((q = $true) & (p = $true)) & ((s = $true) & (t = $true))) | (q != $true))))) & ((q != $true) | (t != $true) | (s != $true) | (((q = $true) & (((s != $true) | (t != $true)) | ((q != $true) | (p != $true)))) & ((t = $true) & (s = $true))))),
% 1.48/1.27 inference(ennf_transformation,[status(thm)],[f7])).
% 1.48/1.27 tff(f7,plain,(
% 1.48/1.27 ~(((q != $true) | (t != $true) | (s != $true) | ~(~((q = $true) & (~((s = $true) & (t = $true)) | ~((q = $true) & (p = $true)))) | ~((t = $true) & (s = $true)))) => (~((t = $true) & (s = $true)) | ~((q = $true) & (~((s = $true) & (t = $true)) | ~((~((q = $true) & (p = $true)) | ~((s = $true) & (t = $true))) & (q = $true))))))),
% 1.48/1.27 inference(flattening,[status(thm)],[f6])).
% 1.48/1.27 tff(f6,plain,(
% 1.48/1.27 ~((~(t = $true) | ~(s = $true) | ~(~((q = $true) & (~((s = $true) & (t = $true)) | ~((q = $true) & (p = $true)))) | ~((t = $true) & (s = $true))) | ~(q = $true)) => (~((t = $true) & (s = $true)) | ~((q = $true) & (~((s = $true) & (t = $true)) | ~((~((q = $true) & (p = $true)) | ~((s = $true) & (t = $true))) & (q = $true))))))),
% 1.48/1.27 inference(fool_elimination,[status(thm)],[f5])).
% 1.48/1.27 tff(f5,plain,(
% 1.48/1.27 ~((~t | ~s | ~(~(q & (~(p & q) | ~(t & s))) | ~(s & t)) | ~q) => (~(t & s) | ~((~(q & (~(s & t) | ~(p & q))) | ~(t & s)) & q)))),
% 1.48/1.27 inference(rectify,[status(thm)],[f2])).
% 1.48/1.27 tff(f2,negated_conjecture,(
% 1.48/1.27 ~((~t | ~s | ~(~(q & (~(p & q) | ~(t & s))) | ~(s & t)) | ~q) => (~(t & s) | ~((~(q & (~(s & t) | ~(p & q))) | ~(t & s)) & q)))),
% 1.48/1.27 inference(negated_conjecture,[status(cth)],[f1])).
% 1.48/1.27 tff(f1,conjecture,(
% 1.48/1.27 (~t | ~s | ~(~(q & (~(p & q) | ~(t & s))) | ~(s & t)) | ~q) => (~(t & s) | ~((~(q & (~(s & t) | ~(p & q))) | ~(t & s)) & q))),
% 1.48/1.27 file('/export/starexec/sandbox/tmp/tmp.zooy1nGPuj/DTF2THF_2362.p',cDMG7)).
% 1.48/1.27 tff(f11,plain,(
% 1.48/1.27 (q = $true)),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f9])).
% 1.48/1.27 tff(f10,plain,(
% 1.48/1.27 (t = $true)),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f9])).
% 1.48/1.27 tff(f13,plain,(
% 1.48/1.27 (t != $true) | (p = $true) | (q != $true) | (s != $true)),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f9])).
% 1.48/1.27 tff(f31,plain,(
% 1.48/1.27 (p != $true)),
% 1.48/1.27 inference(trivial_inequality_removal,[status(thm)],[f30])).
% 1.48/1.27 tff(f30,plain,(
% 1.48/1.27 ($true != $true) | (p != $true)),
% 1.48/1.27 inference(duplicate_literal_removal,[status(thm)],[f24])).
% 1.48/1.27 tff(f24,plain,(
% 1.48/1.27 ($true != $true) | ($true != $true) | (p != $true) | ($true != $true) | ($true != $true) | ($true != $true) | ($true != $true)),
% 1.48/1.27 inference(definition_unfolding,[status(thm)],[f16,f10,f10,f11,f20,f11,f20])).
% 1.48/1.27 tff(f16,plain,(
% 1.48/1.27 (t != $true) | (p != $true) | (t != $true) | (q != $true) | (s != $true) | (q != $true) | (s != $true)),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f9])).
% 1.48/1.27 % SZS output end Proof for DTF2THF_2362
% 1.48/1.27 % (2696)------------------------------
% 1.48/1.27 % (2696)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.27 % (2696)Termination reason: Refutation
% 1.48/1.27
% 1.48/1.27 % (2696)Memory used [KB]: 5500
% 1.48/1.27 % (2696)Time elapsed: 0.004 s
% 1.48/1.27 % (2696)Instructions burned: 2 (million)
% 1.48/1.27 % (2696)------------------------------
% 1.48/1.27 % (2696)------------------------------
% 1.48/1.27 % (2693)Success in time 0.018 s
%------------------------------------------------------------------------------