%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO128^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 : n003.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:26 AM UTC 2026
% Result : Theorem 1.12s 1.10s
% Output : Refutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 127 ( 35 equ)
% Maximal formula atoms : 7 ( 7 avg)
% Number of connectives : 62 ( 21 ~; 19 |; 18 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 70 ( 70 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 5 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(f18,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f17,f16]) ).
tff(f16,plain,
q != $true,
inference(trivial_inequality_removal,[status(thm)],[f13]) ).
tff(f13,plain,
( ( q != $true )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f11,f9]) ).
tff(f9,plain,
p = $true,
inference(cnf_transformation,[status(thm)],[f8]) ).
tff(f8,plain,
( ( ( q = $true )
| ( r = $true ) )
& ( ( p != $true )
| ( q != $true ) )
& ( ( p != $true )
| ( r != $true ) )
& ( p = $true ) ),
inference(flattening,[status(thm)],[f7]) ).
tff(f7,plain,
( ( ( p != $true )
| ( r != $true ) )
& ( ( p != $true )
| ( q != $true ) )
& ( ( q = $true )
| ( r = $true ) )
& ( p = $true ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
tff(f6,plain,
~ ( ( ( ( q = $true )
| ( r = $true ) )
& ( p = $true ) )
=> ( ( ( r = $true )
& ( p = $true ) )
| ( ( q = $true )
& ( p = $true ) ) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
tff(f5,plain,
~ ( ( p
& ( q
| r ) )
=> ( ( p
& q )
| ( r
& p ) ) ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( p
& ( q
| r ) )
=> ( ( p
& q )
| ( r
& p ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
( ( p
& ( q
| r ) )
=> ( ( p
& q )
| ( r
& p ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BetPsnPK56/DTF2THF_29632.p',cDISJ_BUG_2) ).
tff(f11,plain,
( ( p != $true )
| ( q != $true ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
tff(f17,plain,
q = $true,
inference(subsumption_resolution,[status(thm)],[f12,f15]) ).
tff(f15,plain,
r != $true,
inference(trivial_inequality_removal,[status(thm)],[f14]) ).
tff(f14,plain,
( ( $true != $true )
| ( r != $true ) ),
inference(definition_unfolding,[status(thm)],[f10,f9]) ).
tff(f10,plain,
( ( p != $true )
| ( r != $true ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
tff(f12,plain,
( ( r = $true )
| ( q = $true ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYO128^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.31 % Computer : n003.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Feb 24 14:24:25 EST 2026
% 0.11/0.31 % CPUTime :
% 0.11/0.31 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/0.41 ---- Original DTF file ---
% 0.14/0.41 thf(spec,logic,$$dhol).
% 0.14/0.41 %------------------------------------------------------------------------------
% 0.14/0.41 % File : SYO128^5 : TPTP v9.2.1. Released v4.0.0.
% 0.14/0.41 % Domain : Syntactic
% 0.14/0.41 % Problem : TPS problem from BASIC-FO-THMS
% 0.14/0.41 % Version : Especial.
% 0.14/0.41 % English :
% 0.14/0.41
% 0.14/0.41 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.14/0.41 % Source : [Bro09]
% 0.14/0.41 % Names : tps_0677 [Bro09]
% 0.14/0.41
% 0.14/0.41 % Status : Theorem
% 0.14/0.41 % Rating : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% 0.14/0.41 % Syntax : Number of formulae : 4 ( 0 unt; 3 typ; 0 def)
% 0.14/0.41 % Number of atoms : 7 ( 0 equ; 0 cnn)
% 0.14/0.41 % Maximal formula atoms : 7 ( 7 avg)
% 0.14/0.41 % Number of connectives : 6 ( 0 ~; 2 |; 3 &; 0 @)
% 0.14/0.41 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.14/0.41 % Maximal formula depth : 4 ( 4 avg)
% 0.14/0.41 % Number of types : 1 ( 0 usr)
% 0.14/0.41 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.14/0.41 % Number of symbols : 3 ( 3 usr; 3 con; 0-0 aty)
% 0.14/0.41 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.14/0.41 % SPC : TH0_THM_NEQ_NAR
% 0.14/0.41
% 0.14/0.41 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.14/0.41 % project in the Department of Mathematical Sciences at Carnegie
% 0.14/0.41 % Mellon University. Distributed under the Creative Commons copyleft
% 0.14/0.41 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.14/0.41 %------------------------------------------------------------------------------
% 0.14/0.41 thf(r,type,
% 0.14/0.41 r: $o ).
% 0.14/0.41
% 0.14/0.41 thf(p,type,
% 0.14/0.41 p: $o ).
% 0.14/0.41
% 0.14/0.41 thf(q,type,
% 0.14/0.41 q: $o ).
% 0.14/0.41
% 0.14/0.41 thf(cDISJ_BUG_2,conjecture,
% 0.14/0.41 ( ( p
% 0.14/0.41 & ( q
% 0.14/0.41 | r ) )
% 0.14/0.41 => ( ( p
% 0.14/0.41 & q )
% 0.14/0.41 | ( p
% 0.14/0.41 & r ) ) ) ).
% 0.14/0.41
% 0.14/0.41 %------------------------------------------------------------------------------
% 0.14/0.41 ------------------------
% 1.12/1.07 ---- Embedded in THF ---
% 1.12/1.07 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.12/1.07 %%% Generated on Tue Feb 24 14:24:26 EST 2026
% 1.12/1.07 %%% using '$$dhol' embedding, version 1.3.0.
% 1.12/1.07 %%% Logic specification used:
% 1.12/1.07 %%% thf(spec, logic, $$dhol).
% 1.12/1.07
% 1.12/1.07 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.BetPsnPK56/DTF2DTF29632.p
% See solution above
% 1.12/1.07 ------------------------
% 1.12/1.08 ---- Cleaned THF ---
% 1.12/1.08 thf(r,type,
% 1.12/1.08 r: $o ).
% 1.12/1.08
% 1.12/1.08 thf(p,type,
% 1.12/1.08 p: $o ).
% 1.12/1.08
% 1.12/1.08 thf(q,type,
% 1.12/1.08 q: $o ).
% 1.12/1.08
% 1.12/1.08 thf(cDISJ_BUG_2,conjecture,
% 1.12/1.08 ( ( p
% 1.12/1.08 & ( q
% 1.12/1.08 | r ) )
% 1.12/1.08 => ( ( p
% 1.12/1.08 & q )
% 1.12/1.08 | ( p
% 1.12/1.08 & r ) ) ) ).
% 1.12/1.08 ------------------------
% 1.12/1.09 % (29730)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_29632 for (3000ds/183Mi)
% 1.12/1.09 % (29730)First to succeed.
% 1.12/1.10 % (29730)Refutation found. Thanks to Tanya!
% 1.12/1.10 % SZS status Theorem for DTF2THF_29632
% 1.12/1.10 % SZS output start Proof for DTF2THF_29632
% 1.12/1.10 tff(f18,plain,(
% 1.12/1.10 $false),
% 1.12/1.10 inference(subsumption_resolution,[status(thm)],[f17,f16])).
% 1.12/1.10 tff(f16,plain,(
% 1.12/1.10 (q != $true)),
% 1.12/1.10 inference(trivial_inequality_removal,[status(thm)],[f13])).
% 1.12/1.10 tff(f13,plain,(
% 1.12/1.10 (q != $true) | ($true != $true)),
% 1.12/1.10 inference(definition_unfolding,[status(thm)],[f11,f9])).
% 1.12/1.10 tff(f9,plain,(
% 1.12/1.10 (p = $true)),
% 1.12/1.10 inference(cnf_transformation,[status(thm)],[f8])).
% 1.12/1.10 tff(f8,plain,(
% 1.12/1.10 ((q = $true) | (r = $true)) & ((p != $true) | (q != $true)) & ((p != $true) | (r != $true)) & (p = $true)),
% 1.12/1.10 inference(flattening,[status(thm)],[f7])).
% 1.12/1.10 tff(f7,plain,(
% 1.12/1.10 (((p != $true) | (r != $true)) & ((p != $true) | (q != $true))) & (((q = $true) | (r = $true)) & (p = $true))),
% 1.12/1.10 inference(ennf_transformation,[status(thm)],[f6])).
% 1.12/1.10 tff(f6,plain,(
% 1.12/1.10 ~((((q = $true) | (r = $true)) & (p = $true)) => (((r = $true) & (p = $true)) | ((q = $true) & (p = $true))))),
% 1.12/1.10 inference(fool_elimination,[status(thm)],[f5])).
% 1.12/1.10 tff(f5,plain,(
% 1.12/1.10 ~((p & (q | r)) => ((p & q) | (r & p)))),
% 1.12/1.10 inference(rectify,[status(thm)],[f2])).
% 1.12/1.10 tff(f2,negated_conjecture,(
% 1.12/1.10 ~((p & (q | r)) => ((p & q) | (r & p)))),
% 1.12/1.10 inference(negated_conjecture,[status(cth)],[f1])).
% 1.12/1.10 tff(f1,conjecture,(
% 1.12/1.10 (p & (q | r)) => ((p & q) | (r & p))),
% 1.12/1.10 file('/export/starexec/sandbox/tmp/tmp.BetPsnPK56/DTF2THF_29632.p',cDISJ_BUG_2)).
% 1.12/1.10 tff(f11,plain,(
% 1.12/1.10 (p != $true) | (q != $true)),
% 1.12/1.10 inference(cnf_transformation,[status(thm)],[f8])).
% 1.12/1.10 tff(f17,plain,(
% 1.12/1.10 (q = $true)),
% 1.12/1.10 inference(subsumption_resolution,[status(thm)],[f12,f15])).
% 1.12/1.10 tff(f15,plain,(
% 1.12/1.10 (r != $true)),
% 1.12/1.10 inference(trivial_inequality_removal,[status(thm)],[f14])).
% 1.12/1.10 tff(f14,plain,(
% 1.12/1.10 ($true != $true) | (r != $true)),
% 1.12/1.10 inference(definition_unfolding,[status(thm)],[f10,f9])).
% 1.12/1.10 tff(f10,plain,(
% 1.12/1.10 (p != $true) | (r != $true)),
% 1.12/1.10 inference(cnf_transformation,[status(thm)],[f8])).
% 1.12/1.10 tff(f12,plain,(
% 1.12/1.10 (r = $true) | (q = $true)),
% 1.12/1.10 inference(cnf_transformation,[status(thm)],[f8])).
% 1.12/1.10 % SZS output end Proof for DTF2THF_29632
% 1.12/1.10 % (29730)------------------------------
% 1.12/1.10 % (29730)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.12/1.10 % (29730)Termination reason: Refutation
% 1.12/1.10
% 1.12/1.10 % (29730)Memory used [KB]: 5373
% 1.12/1.10 % (29730)Time elapsed: 0.002 s
% 1.12/1.10 % (29730)------------------------------
% 1.12/1.10 % (29730)------------------------------
% 1.12/1.10 % (29729)Success in time 0.004 s
%------------------------------------------------------------------------------