%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO118^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 : n005.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:24 AM UTC 2026
% Result : Theorem 1.48s 1.30s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 49 ( 12 equ)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 22 ( 6 ~; 2 |; 2 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 24 ( 24 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 2 usr; 4 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(f12,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f11,f8]) ).
tff(f8,plain,
p != $true,
inference(cnf_transformation,[status(thm)],[f7]) ).
tff(f7,plain,
( ( ( p = $true )
| ( ( q != $true )
& ( p = $true ) ) )
& ( p != $true ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
tff(f6,plain,
~ ( ( ( ( p = $true )
=> ( q = $true ) )
=> ( p = $true ) )
=> ( p = $true ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
tff(f5,plain,
~ ( ( ( p
=> q )
=> p )
=> p ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ( p
=> q )
=> p )
=> p ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
( ( ( p
=> q )
=> p )
=> p ),
file('/export/starexec/sandbox2/tmp/tmp.SqEZouDuFO/DTF2THF_19164.p',cPEIRCE) ).
tff(f11,plain,
p = $true,
inference(duplicate_literal_removal,[status(thm)],[f9]) ).
tff(f9,plain,
( ( p = $true )
| ( p = $true ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO118^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.34 % Computer : n005.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:24:29 EST 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.20/0.47 ---- Original DTF file ---
% 0.20/0.47 thf(spec,logic,$$dhol).
% 0.20/0.47 %------------------------------------------------------------------------------
% 0.20/0.47 % File : SYO118^5 : TPTP v9.2.1. Released v4.0.0.
% 0.20/0.47 % Domain : Syntactic
% 0.20/0.47 % Problem : TPS problem from BASIC-FO-THMS
% 0.20/0.47 % Version : Especial.
% 0.20/0.47 % English :
% 0.20/0.47
% 0.20/0.47 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.20/0.47 % Source : [Bro09]
% 0.20/0.47 % Names : tps_0615 [Bro09]
% 0.20/0.47
% 0.20/0.47 % Status : Theorem
% 0.20/0.47 % Rating : 0.08 v9.1.0, 0.12 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.20/0.47 % Syntax : Number of formulae : 3 ( 0 unt; 2 typ; 0 def)
% 0.20/0.47 % Number of atoms : 4 ( 0 equ; 0 cnn)
% 0.20/0.47 % Maximal formula atoms : 4 ( 4 avg)
% 0.20/0.47 % Number of connectives : 3 ( 0 ~; 0 |; 0 &; 0 @)
% 0.20/0.47 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.20/0.47 % Maximal formula depth : 4 ( 4 avg)
% 0.20/0.47 % Number of types : 1 ( 0 usr)
% 0.20/0.47 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.20/0.47 % Number of symbols : 2 ( 2 usr; 2 con; 0-0 aty)
% 0.20/0.47 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.20/0.47 % SPC : TH0_THM_NEQ_NAR
% 0.20/0.47
% 0.20/0.47 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.20/0.47 % project in the Department of Mathematical Sciences at Carnegie
% 0.20/0.47 % Mellon University. Distributed under the Creative Commons copyleft
% 0.20/0.47 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.20/0.47 %------------------------------------------------------------------------------
% 0.20/0.47 thf(p,type,
% 0.20/0.47 p: $o ).
% 0.20/0.47
% 0.20/0.47 thf(q,type,
% 0.20/0.47 q: $o ).
% 0.20/0.47
% 0.20/0.47 thf(cPEIRCE,conjecture,
% 0.20/0.47 ( ( ( p
% 0.20/0.47 => q )
% 0.20/0.47 => p )
% 0.20/0.47 => p ) ).
% 0.20/0.47
% 0.20/0.47 %------------------------------------------------------------------------------
% 0.20/0.47 ------------------------
% 1.48/1.27 ---- Embedded in THF ---
% 1.48/1.27 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.27 %%% Generated on Tue Feb 24 14:24:30 EST 2026
% 1.48/1.27 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.27 %%% Logic specification used:
% 1.48/1.27 %%% thf(spec, logic, $$dhol).
% 1.48/1.27
% 1.48/1.27 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.SqEZouDuFO/DTF2DTF19164.p
% See solution above
% 1.48/1.27 ------------------------
% 1.48/1.28 ---- Cleaned THF ---
% 1.48/1.28 thf(p,type,
% 1.48/1.28 p: $o ).
% 1.48/1.28
% 1.48/1.28 thf(q,type,
% 1.48/1.28 q: $o ).
% 1.48/1.28
% 1.48/1.28 thf(cPEIRCE,conjecture,
% 1.48/1.28 ( ( ( p
% 1.48/1.28 => q )
% 1.48/1.28 => p )
% 1.48/1.28 => p ) ).
% 1.48/1.28 ------------------------
% 1.48/1.29 % (19329)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_19164 for (3000ds/18Mi)
% 1.48/1.29 % (19326)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_19164 for (3000ds/2Mi)
% 1.48/1.29 % (19324)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_19164 for (3000ds/4Mi)
% 1.48/1.29 % (19329)First to succeed.
% 1.48/1.30 % (19324)Also succeeded, but the first one will report.
% 1.48/1.30 % (19326)Also succeeded, but the first one will report.
% 1.48/1.30 % (19329)Refutation found. Thanks to Tanya!
% 1.48/1.30 % SZS status Theorem for DTF2THF_19164
% 1.48/1.30 % SZS output start Proof for DTF2THF_19164
% 1.48/1.30 tff(f12,plain,(
% 1.48/1.30 $false),
% 1.48/1.30 inference(subsumption_resolution,[status(thm)],[f11,f8])).
% 1.48/1.30 tff(f8,plain,(
% 1.48/1.30 (p != $true)),
% 1.48/1.30 inference(cnf_transformation,[status(thm)],[f7])).
% 1.48/1.30 tff(f7,plain,(
% 1.48/1.30 ((p = $true) | ((q != $true) & (p = $true))) & (p != $true)),
% 1.48/1.30 inference(ennf_transformation,[status(thm)],[f6])).
% 1.48/1.30 tff(f6,plain,(
% 1.48/1.30 ~((((p = $true) => (q = $true)) => (p = $true)) => (p = $true))),
% 1.48/1.30 inference(fool_elimination,[status(thm)],[f5])).
% 1.48/1.30 tff(f5,plain,(
% 1.48/1.30 ~(((p => q) => p) => p)),
% 1.48/1.30 inference(rectify,[status(thm)],[f2])).
% 1.48/1.30 tff(f2,negated_conjecture,(
% 1.48/1.30 ~(((p => q) => p) => p)),
% 1.48/1.30 inference(negated_conjecture,[status(cth)],[f1])).
% 1.48/1.30 tff(f1,conjecture,(
% 1.48/1.30 ((p => q) => p) => p),
% 1.48/1.30 file('/export/starexec/sandbox2/tmp/tmp.SqEZouDuFO/DTF2THF_19164.p',cPEIRCE)).
% 1.48/1.30 tff(f11,plain,(
% 1.48/1.30 (p = $true)),
% 1.48/1.30 inference(duplicate_literal_removal,[status(thm)],[f9])).
% 1.48/1.30 tff(f9,plain,(
% 1.48/1.30 (p = $true) | (p = $true)),
% 1.48/1.30 inference(cnf_transformation,[status(thm)],[f7])).
% 1.48/1.30 % SZS output end Proof for DTF2THF_19164
% 1.48/1.30 % (19329)------------------------------
% 1.48/1.30 % (19329)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.30 % (19329)Termination reason: Refutation
% 1.48/1.30
% 1.48/1.30 % (19329)Memory used [KB]: 5373
% 1.48/1.30 % (19329)Time elapsed: 0.002 s
% 1.48/1.30 % (19329)------------------------------
% 1.48/1.30 % (19329)------------------------------
% 1.48/1.30 % (19320)Success in time 0.012 s
%------------------------------------------------------------------------------