%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO135^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 : n007.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:27 AM UTC 2026
% Result : Theorem 1.28s 1.12s
% Output : Refutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 5 unt; 0 typ; 2 def)
% Number of atoms : 135 ( 25 equ; 0 cnn)
% Maximal formula atoms : 9 ( 6 avg)
% Number of connectives : 89 ( 16 ~; 19 |; 8 &; 40 @)
% ( 2 <=>; 4 =>; 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 : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 8 ( 0 ^; 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
cQ: $i > $o ).
thf(func_def_3,type,
cP: $i > $o ).
thf(f25,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f19,f22,f24]) ).
thf(f24,plain,
spl0_2,
inference(avatar_contradiction_clause,[status(thm)],[f23]) ).
thf(f23,plain,
( $false
| spl0_2 ),
inference(subsumption_resolution,[status(thm)],[f18,f20]) ).
thf(f20,plain,
! [X0: $i] :
( ( cP @ X0 )
= $true ),
inference(subsumption_resolution,[status(thm)],[f9,f8]) ).
thf(f8,plain,
( ( cQ @ x )
!= $true ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
( ( ( ( cP @ b )
!= $true )
| ( ( cP @ a )
!= $true ) )
& ( ( ( cQ @ x )
= $true )
| ! [X0: $i] :
( ( cP @ X0 )
= $true ) )
& ( ( cQ @ x )
!= $true ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
( ( ( cQ @ x )
!= $true )
& ( ( ( cP @ b )
!= $true )
| ( ( cP @ a )
!= $true ) )
& ( ( ( cQ @ x )
= $true )
| ! [X0: $i] :
( ( cP @ X0 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ( ( cQ @ x )
= $true )
| ! [X0: $i] :
( ( cP @ X0 )
= $true ) )
=> ( ( ( cQ @ x )
= $true )
| ( ( ( cP @ b )
= $true )
& ( ( cP @ a )
= $true ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: $i] : ( cP @ X0 )
| ( cQ @ x ) )
=> ( ( ( cP @ b )
& ( cP @ a ) )
| ( cQ @ x ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: $i] : ( cP @ X0 )
| ( cQ @ x ) )
=> ( ( ( cP @ b )
& ( cP @ a ) )
| ( cQ @ x ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ! [X0: $i] : ( cP @ X0 )
| ( cQ @ x ) )
=> ( ( ( cP @ b )
& ( cP @ a ) )
| ( cQ @ x ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YDPdWWOezZ/DTF2THF_11703.p',cDUP_BUG) ).
thf(f9,plain,
! [X0: $i] :
( ( ( cQ @ x )
= $true )
| ( ( cP @ X0 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f18,plain,
( ( ( cP @ b )
!= $true )
| spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f16]) ).
thf(f16,definition,
( spl0_2
<=> ( ( cP @ b )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).
thf(f22,plain,
spl0_1,
inference(avatar_contradiction_clause,[status(thm)],[f21]) ).
thf(f21,plain,
( $false
| spl0_1 ),
inference(subsumption_resolution,[status(thm)],[f14,f20]) ).
thf(f14,plain,
( ( ( cP @ a )
!= $true )
| spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f12]) ).
thf(f12,definition,
( spl0_1
<=> ( ( cP @ a )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).
thf(f19,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[status(thm)],[f10,f16,f12]) ).
thf(f10,plain,
( ( ( cP @ b )
!= $true )
| ( ( cP @ a )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO135^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.32 % Computer : n007.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Feb 24 14:24:23 EST 2026
% 0.12/0.32 % CPUTime :
% 0.12/0.32 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.41 ---- Original DTF file ---
% 0.16/0.41 thf(spec,logic,$$dhol).
% 0.16/0.41 %------------------------------------------------------------------------------
% 0.16/0.41 % File : SYO135^5 : TPTP v9.2.1. Released v4.0.0.
% 0.16/0.41 % Domain : Syntactic
% 0.16/0.41 % Problem : TPS problem from BASIC-FO-THMS
% 0.16/0.41 % Version : Especial.
% 0.16/0.41 % English :
% 0.16/0.41
% 0.16/0.41 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.16/0.41 % Source : [Bro09]
% 0.16/0.41 % Names : tps_0717 [Bro09]
% 0.16/0.41
% 0.16/0.41 % Status : Theorem
% 0.16/0.41 % Rating : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% 0.16/0.41 % Syntax : Number of formulae : 6 ( 0 unt; 5 typ; 0 def)
% 0.16/0.41 % Number of atoms : 5 ( 0 equ; 0 cnn)
% 0.16/0.41 % Maximal formula atoms : 5 ( 5 avg)
% 0.16/0.41 % Number of connectives : 9 ( 0 ~; 2 |; 1 &; 5 @)
% 0.16/0.41 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.16/0.41 % Maximal formula depth : 5 ( 5 avg)
% 0.16/0.41 % Number of types : 2 ( 0 usr)
% 0.16/0.41 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.16/0.41 % Number of symbols : 5 ( 5 usr; 3 con; 0-1 aty)
% 0.16/0.41 % Number of variables : 1 ( 0 ^; 1 !; 0 ?; 1 :)
% 0.16/0.41 % SPC : TH0_THM_NEQ_NAR
% 0.16/0.41
% 0.16/0.41 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.16/0.41 % project in the Department of Mathematical Sciences at Carnegie
% 0.16/0.41 % Mellon University. Distributed under the Creative Commons copyleft
% 0.16/0.41 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.16/0.41 %------------------------------------------------------------------------------
% 0.16/0.41 thf(x,type,
% 0.16/0.41 x: $i ).
% 0.16/0.41
% 0.16/0.41 thf(cQ,type,
% 0.16/0.41 cQ: $i > $o ).
% 0.16/0.41
% 0.16/0.41 thf(b,type,
% 0.16/0.41 b: $i ).
% 0.16/0.41
% 0.16/0.41 thf(cP,type,
% 0.16/0.41 cP: $i > $o ).
% 0.16/0.41
% 0.16/0.41 thf(a,type,
% 0.16/0.41 a: $i ).
% 0.16/0.41
% 0.16/0.41 thf(cDUP_BUG,conjecture,
% 0.16/0.41 ( ( ! [Xx0: $i] : ( cP @ Xx0 )
% 0.16/0.41 | ( cQ @ x ) )
% 0.16/0.41 => ( ( ( cP @ a )
% 0.16/0.41 & ( cP @ b ) )
% 0.16/0.41 | ( cQ @ x ) ) ) ).
% 0.16/0.41
% 0.16/0.41 %------------------------------------------------------------------------------
% 0.16/0.41 ------------------------
% 1.10/1.09 ---- Embedded in THF ---
% 1.10/1.10 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.10/1.10 %%% Generated on Tue Feb 24 14:24:24 EST 2026
% 1.10/1.10 %%% using '$$dhol' embedding, version 1.3.0.
% 1.10/1.10 %%% Logic specification used:
% 1.10/1.10 %%% thf(spec, logic, $$dhol).
% 1.10/1.10
% 1.10/1.10 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.YDPdWWOezZ/DTF2DTF11703.p
% See solution above
% 1.10/1.10 ------------------------
% 1.10/1.10 ---- Cleaned THF ---
% 1.10/1.10 thf(x,type,
% 1.10/1.10 x: $i ).
% 1.10/1.10
% 1.10/1.10 thf(cQ,type,
% 1.10/1.10 cQ: $i > $o ).
% 1.10/1.10
% 1.10/1.10 thf(b,type,
% 1.10/1.10 b: $i ).
% 1.10/1.10
% 1.10/1.10 thf(cP,type,
% 1.10/1.10 cP: $i > $o ).
% 1.10/1.10
% 1.10/1.10 thf(a,type,
% 1.10/1.10 a: $i ).
% 1.10/1.10
% 1.10/1.10 thf(cDUP_BUG,conjecture,
% 1.10/1.10 ( ( ! [Xx0: $i] : ( cP @ Xx0 )
% 1.10/1.10 | ( cQ @ x ) )
% 1.10/1.10 => ( ( ( cP @ a )
% 1.10/1.10 & ( cP @ b ) )
% 1.10/1.10 | ( cQ @ x ) ) ) ).
% 1.10/1.10 ------------------------
% 1.28/1.12 % (11801)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_11703 for (3000ds/183Mi)
% 1.28/1.12 % (11801)First to succeed.
% 1.28/1.12 % (11801)Refutation found. Thanks to Tanya!
% 1.28/1.12 % SZS status Theorem for DTF2THF_11703
% 1.28/1.12 % SZS output start Proof for DTF2THF_11703
% 1.28/1.12 thf(func_def_1, type, cQ: $i > $o).
% 1.28/1.12 thf(func_def_3, type, cP: $i > $o).
% 1.28/1.12 thf(f25,plain,(
% 1.28/1.12 $false),
% 1.28/1.12 inference(avatar_sat_refutation,[status(thm)],[f19,f22,f24])).
% 1.28/1.12 thf(f24,plain,(
% 1.28/1.12 spl0_2),
% 1.28/1.12 inference(avatar_contradiction_clause,[status(thm)],[f23])).
% 1.28/1.12 thf(f23,plain,(
% 1.28/1.12 $false | spl0_2),
% 1.28/1.12 inference(subsumption_resolution,[status(thm)],[f18,f20])).
% 1.28/1.12 thf(f20,plain,(
% 1.28/1.12 ( ! [X0 : $i] : (((cP @ X0) = $true)) )),
% 1.28/1.12 inference(subsumption_resolution,[status(thm)],[f9,f8])).
% 1.28/1.12 thf(f8,plain,(
% 1.28/1.12 ((cQ @ x) != $true)),
% 1.28/1.12 inference(cnf_transformation,[status(thm)],[f7])).
% 1.28/1.12 thf(f7,plain,(
% 1.28/1.12 (((cP @ b) != $true) | ((cP @ a) != $true)) & (((cQ @ x) = $true) | ! [X0 : $i] : ((cP @ X0) = $true)) & ((cQ @ x) != $true)),
% 1.28/1.12 inference(flattening,[status(thm)],[f6])).
% 1.28/1.12 thf(f6,plain,(
% 1.28/1.12 (((cQ @ x) != $true) & (((cP @ b) != $true) | ((cP @ a) != $true))) & (((cQ @ x) = $true) | ! [X0 : $i] : ((cP @ X0) = $true))),
% 1.28/1.12 inference(ennf_transformation,[status(thm)],[f5])).
% 1.28/1.12 thf(f5,plain,(
% 1.28/1.12 ~((((cQ @ x) = $true) | ! [X0 : $i] : ((cP @ X0) = $true)) => (((cQ @ x) = $true) | (((cP @ b) = $true) & ((cP @ a) = $true))))),
% 1.28/1.12 inference(fool_elimination,[status(thm)],[f4])).
% 1.28/1.12 thf(f4,plain,(
% 1.28/1.12 ~((! [X0 : $i] : (cP @ X0) | (cQ @ x)) => (((cP @ b) & (cP @ a)) | (cQ @ x)))),
% 1.28/1.12 inference(rectify,[status(thm)],[f2])).
% 1.28/1.12 thf(f2,negated_conjecture,(
% 1.28/1.12 ~((! [X0 : $i] : (cP @ X0) | (cQ @ x)) => (((cP @ b) & (cP @ a)) | (cQ @ x)))),
% 1.28/1.12 inference(negated_conjecture,[status(cth)],[f1])).
% 1.28/1.12 thf(f1,conjecture,(
% 1.28/1.12 (! [X0 : $i] : (cP @ X0) | (cQ @ x)) => (((cP @ b) & (cP @ a)) | (cQ @ x))),
% 1.28/1.12 file('/export/starexec/sandbox/tmp/tmp.YDPdWWOezZ/DTF2THF_11703.p',cDUP_BUG)).
% 1.28/1.12 thf(f9,plain,(
% 1.28/1.12 ( ! [X0 : $i] : (((cQ @ x) = $true) | ((cP @ X0) = $true)) )),
% 1.28/1.12 inference(cnf_transformation,[status(thm)],[f7])).
% 1.28/1.12 thf(f18,plain,(
% 1.28/1.12 ((cP @ b) != $true) | spl0_2),
% 1.28/1.12 inference(avatar_component_clause,[status(thm)],[f16])).
% 1.28/1.12 thf(f16,definition,(
% 1.28/1.12 spl0_2 <=> ((cP @ b) = $true)),
% 1.28/1.12 introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.28/1.12 thf(f22,plain,(
% 1.28/1.12 spl0_1),
% 1.28/1.12 inference(avatar_contradiction_clause,[status(thm)],[f21])).
% 1.28/1.12 thf(f21,plain,(
% 1.28/1.12 $false | spl0_1),
% 1.28/1.12 inference(subsumption_resolution,[status(thm)],[f14,f20])).
% 1.28/1.12 thf(f14,plain,(
% 1.28/1.12 ((cP @ a) != $true) | spl0_1),
% 1.28/1.12 inference(avatar_component_clause,[status(thm)],[f12])).
% 1.28/1.12 thf(f12,definition,(
% 1.28/1.12 spl0_1 <=> ((cP @ a) = $true)),
% 1.28/1.12 introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.28/1.12 thf(f19,plain,(
% 1.28/1.12 ~spl0_1 | ~spl0_2),
% 1.28/1.12 inference(avatar_split_clause,[status(thm)],[f10,f16,f12])).
% 1.28/1.12 thf(f10,plain,(
% 1.28/1.12 ((cP @ b) != $true) | ((cP @ a) != $true)),
% 1.28/1.12 inference(cnf_transformation,[status(thm)],[f7])).
% 1.28/1.12 % SZS output end Proof for DTF2THF_11703
% 1.28/1.12 % (11801)------------------------------
% 1.28/1.12 % (11801)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.28/1.12 % (11801)Termination reason: Refutation
% 1.28/1.12
% 1.28/1.12 % (11801)Memory used [KB]: 5373
% 1.28/1.12 % (11801)Time elapsed: 0.002 s
% 1.28/1.12 % (11801)Instructions burned: 1 (million)
% 1.28/1.12 % (11801)------------------------------
% 1.28/1.12 % (11801)------------------------------
% 1.28/1.12 % (11800)Success in time 0.011 s
%------------------------------------------------------------------------------