%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO136^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 : n004.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.65s 1.47s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 98 ( 24 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 64 ( 10 ~; 3 |; 9 &; 25 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 15 ( 0 ^; 4 !; 11 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cQ: $i > $o ).
thf(func_def_3,type,
cP: $i > $o ).
thf(f23,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f11,f10]) ).
thf(f10,plain,
! [X1: $i] :
( ( cQ @ X1 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ( ( cB != $true )
& ( ( cP @ sK0 )
= $true ) )
| ( cB = $true ) )
& ( ( cQ @ x )
= $true )
& ! [X1: $i] :
( ( cQ @ X1 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: $i] :
( ( cP @ X0 )
= $true )
=> ( ( cP @ sK0 )
= $true ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
( ( ( ( cB != $true )
& ? [X0: $i] :
( ( cP @ X0 )
= $true ) )
| ( cB = $true ) )
& ( ( cQ @ x )
= $true )
& ! [X1: $i] :
( ( cQ @ X1 )
!= $true ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
( ! [X1: $i] :
( ( cQ @ X1 )
!= $true )
& ( ( cQ @ x )
= $true )
& ( ( ( cB != $true )
& ? [X0: $i] :
( ( cP @ X0 )
= $true ) )
| ( cB = $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ( ? [X0: $i] :
( ( cP @ X0 )
= $true )
=> ( cB = $true ) )
=> ( cB = $true ) )
=> ( ( ( cQ @ x )
= $true )
=> ? [X1: $i] :
( ( cQ @ X1 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( ( ? [X0: $i] : ( cP @ X0 )
=> cB )
=> cB )
=> ( ( cQ @ x )
=> ? [X1: $i] : ( cQ @ X1 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ( ? [X0: $i] : ( cP @ X0 )
=> cB )
=> cB )
=> ( ( cQ @ x )
=> ? [X0: $i] : ( cQ @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ( ? [X0: $i] : ( cP @ X0 )
=> cB )
=> cB )
=> ( ( cQ @ x )
=> ? [X0: $i] : ( cQ @ X0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EWHkI0zpCz/DTF2THF_13307.p',cADDHYP3) ).
thf(f11,plain,
( ( cQ @ x )
= $true ),
inference(cnf_transformation,[status(thm)],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO136^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.17/0.34 % Computer : n004.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 14:24:56 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.31/0.49 ---- Original DTF file ---
% 0.31/0.49 thf(spec,logic,$$dhol).
% 0.31/0.49 %------------------------------------------------------------------------------
% 0.31/0.49 % File : SYO136^5 : TPTP v9.2.1. Released v4.0.0.
% 0.31/0.49 % Domain : Syntactic
% 0.31/0.49 % Problem : TPS problem from BASIC-FO-THMS
% 0.31/0.49 % Version : Especial.
% 0.31/0.49 % English :
% 0.31/0.49
% 0.31/0.49 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.31/0.49 % Source : [Bro09]
% 0.31/0.49 % Names : tps_0732 [Bro09]
% 0.31/0.49
% 0.31/0.49 % Status : Theorem
% 0.31/0.49 % Rating : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% 0.31/0.49 % Syntax : Number of formulae : 5 ( 0 unt; 4 typ; 0 def)
% 0.31/0.49 % Number of atoms : 5 ( 0 equ; 0 cnn)
% 0.31/0.49 % Maximal formula atoms : 5 ( 5 avg)
% 0.31/0.49 % Number of connectives : 7 ( 0 ~; 0 |; 0 &; 3 @)
% 0.31/0.49 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.31/0.49 % Maximal formula depth : 6 ( 6 avg)
% 0.31/0.49 % Number of types : 2 ( 0 usr)
% 0.31/0.49 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.31/0.49 % Number of symbols : 4 ( 4 usr; 2 con; 0-1 aty)
% 0.31/0.49 % Number of variables : 2 ( 0 ^; 0 !; 2 ?; 2 :)
% 0.31/0.49 % SPC : TH0_THM_NEQ_NAR
% 0.31/0.49
% 0.31/0.49 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.31/0.49 % project in the Department of Mathematical Sciences at Carnegie
% 0.31/0.49 % Mellon University. Distributed under the Creative Commons copyleft
% 0.31/0.49 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.31/0.49 %------------------------------------------------------------------------------
% 0.31/0.49 thf(cQ,type,
% 0.31/0.49 cQ: $i > $o ).
% 0.31/0.49
% 0.31/0.49 thf(x,type,
% 0.31/0.49 x: $i ).
% 0.31/0.49
% 0.31/0.49 thf(cB,type,
% 0.31/0.49 cB: $o ).
% 0.31/0.49
% 0.31/0.49 thf(cP,type,
% 0.31/0.49 cP: $i > $o ).
% 0.31/0.49
% 0.31/0.49 thf(cADDHYP3,conjecture,
% 0.31/0.49 ( ( ( ? [Xx0: $i] : ( cP @ Xx0 )
% 0.31/0.49 => cB )
% 0.31/0.49 => cB )
% 0.31/0.49 => ( ( cQ @ x )
% 0.31/0.49 => ? [Xx0: $i] : ( cQ @ Xx0 ) ) ) ).
% 0.31/0.49
% 0.31/0.49 %------------------------------------------------------------------------------
% 0.31/0.49 ------------------------
% 1.65/1.44 ---- Embedded in THF ---
% 1.65/1.44 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.65/1.44 %%% Generated on Tue Feb 24 14:24:57 EST 2026
% 1.65/1.44 %%% using '$$dhol' embedding, version 1.3.0.
% 1.65/1.44 %%% Logic specification used:
% 1.65/1.44 %%% thf(spec, logic, $$dhol).
% 1.65/1.44
% 1.65/1.44 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.EWHkI0zpCz/DTF2DTF13307.p
% See solution above
% 1.65/1.44 ------------------------
% 1.65/1.45 ---- Cleaned THF ---
% 1.65/1.45 thf(cQ,type,
% 1.65/1.45 cQ: $i > $o ).
% 1.65/1.45
% 1.65/1.45 thf(x,type,
% 1.65/1.45 x: $i ).
% 1.65/1.45
% 1.65/1.45 thf(cB,type,
% 1.65/1.45 cB: $o ).
% 1.65/1.45
% 1.65/1.45 thf(cP,type,
% 1.65/1.45 cP: $i > $o ).
% 1.65/1.45
% 1.65/1.45 thf(cADDHYP3,conjecture,
% 1.65/1.45 ( ( ( ? [Xx0: $i] : ( cP @ Xx0 )
% 1.65/1.45 => cB )
% 1.65/1.45 => cB )
% 1.65/1.45 => ( ( cQ @ x )
% 1.65/1.45 => ? [Xx0: $i] : ( cQ @ Xx0 ) ) ) ).
% 1.65/1.45 ------------------------
% 1.65/1.47 % (13437)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_13307 for (3000ds/183Mi)
% 1.65/1.47 % (13439)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_13307 for (3000ds/27Mi)
% 1.65/1.47 % (13441)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_13307 for (3000ds/2Mi)
% 1.65/1.47 % (13438)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_13307 for (3000ds/4Mi)
% 1.65/1.47 % (13442)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_13307 for (3000ds/275Mi)
% 1.65/1.47 % (13443)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_13307 for (3000ds/18Mi)
% 1.65/1.47 % (13442)First to succeed.
% 1.65/1.47 % (13440)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_13307 for (3000ds/2Mi)
% 1.65/1.47 % (13441)Instruction limit reached!
% 1.65/1.47 % (13441)------------------------------
% 1.65/1.47 % (13441)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.47 % (13441)Termination reason: Unknown
% 1.65/1.47 % (13441)Termination phase: Saturation
% 1.65/1.47
% 1.65/1.47 % (13441)Memory used [KB]: 5500
% 1.65/1.47 % (13441)Time elapsed: 0.003 s
% 1.65/1.47 % (13441)Instructions burned: 2 (million)
% 1.65/1.47 % (13441)------------------------------
% 1.65/1.47 % (13441)------------------------------
% 1.65/1.47 % (13437)Also succeeded, but the first one will report.
% 1.65/1.47 % (13442)Refutation found. Thanks to Tanya!
% 1.65/1.47 % SZS status Theorem for DTF2THF_13307
% 1.65/1.47 % SZS output start Proof for DTF2THF_13307
% 1.65/1.47 thf(func_def_0, type, cQ: $i > $o).
% 1.65/1.47 thf(func_def_3, type, cP: $i > $o).
% 1.65/1.47 thf(f23,plain,(
% 1.65/1.47 $false),
% 1.65/1.47 inference(subsumption_resolution,[status(thm)],[f11,f10])).
% 1.65/1.47 thf(f10,plain,(
% 1.65/1.47 ( ! [X1 : $i] : (((cQ @ X1) != $true)) )),
% 1.65/1.47 inference(cnf_transformation,[status(thm)],[f9])).
% 1.65/1.47 thf(f9,plain,(
% 1.65/1.47 (((cB != $true) & ((cP @ sK0) = $true)) | (cB = $true)) & ((cQ @ x) = $true) & ! [X1 : $i] : ((cQ @ X1) != $true)),
% 1.65/1.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 1.65/1.47 thf(f8,plain,(
% 1.65/1.47 ? [X0 : $i] : ((cP @ X0) = $true) => ((cP @ sK0) = $true)),
% 1.65/1.47 introduced(definition,[],[choice_axiom])).
% 1.65/1.47 thf(f7,plain,(
% 1.65/1.47 (((cB != $true) & ? [X0 : $i] : ((cP @ X0) = $true)) | (cB = $true)) & ((cQ @ x) = $true) & ! [X1 : $i] : ((cQ @ X1) != $true)),
% 1.65/1.47 inference(flattening,[status(thm)],[f6])).
% 1.65/1.47 thf(f6,plain,(
% 1.65/1.47 (! [X1 : $i] : ((cQ @ X1) != $true) & ((cQ @ x) = $true)) & (((cB != $true) & ? [X0 : $i] : ((cP @ X0) = $true)) | (cB = $true))),
% 1.65/1.47 inference(ennf_transformation,[status(thm)],[f5])).
% 1.65/1.47 thf(f5,plain,(
% 1.65/1.47 ~(((? [X0 : $i] : ((cP @ X0) = $true) => (cB = $true)) => (cB = $true)) => (((cQ @ x) = $true) => ? [X1 : $i] : ((cQ @ X1) = $true)))),
% 1.65/1.47 inference(fool_elimination,[status(thm)],[f4])).
% 1.65/1.47 thf(f4,plain,(
% 1.65/1.47 ~(((? [X0 : $i] : (cP @ X0) => cB) => cB) => ((cQ @ x) => ? [X1 : $i] : (cQ @ X1)))),
% 1.65/1.47 inference(rectify,[status(thm)],[f2])).
% 1.65/1.47 thf(f2,negated_conjecture,(
% 1.65/1.47 ~(((? [X0 : $i] : (cP @ X0) => cB) => cB) => ((cQ @ x) => ? [X0 : $i] : (cQ @ X0)))),
% 1.65/1.47 inference(negated_conjecture,[status(cth)],[f1])).
% 1.65/1.47 thf(f1,conjecture,(
% 1.65/1.47 ((? [X0 : $i] : (cP @ X0) => cB) => cB) => ((cQ @ x) => ? [X0 : $i] : (cQ @ X0))),
% 1.65/1.47 file('/export/starexec/sandbox/tmp/tmp.EWHkI0zpCz/DTF2THF_13307.p',cADDHYP3)).
% 1.65/1.47 thf(f11,plain,(
% 1.65/1.47 ((cQ @ x) = $true)),
% 1.65/1.47 inference(cnf_transformation,[status(thm)],[f9])).
% 1.65/1.47 % SZS output end Proof for DTF2THF_13307
% 1.65/1.47 % (13442)------------------------------
% 1.65/1.47 % (13442)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.47 % (13442)Termination reason: Refutation
% 1.65/1.47
% 1.65/1.47 % (13442)Memory used [KB]: 5373
% 1.65/1.47 % (13442)Time elapsed: 0.003 s
% 1.65/1.47 % (13442)Instructions burned: 1 (million)
% 1.65/1.47 % (13442)------------------------------
% 1.65/1.47 % (13442)------------------------------
% 1.65/1.47 % (13436)Success in time 0.017 s
%------------------------------------------------------------------------------