%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO139^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 : n031.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:28 AM UTC 2026
% Result : Theorem 1.28s 1.12s
% Output : Refutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 70 ( 19 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 71 ( 20 ~; 13 |; 7 &; 31 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 ^; 9 !; 10 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cQ: $i > $o ).
thf(func_def_1,type,
cP: $i > $o ).
thf(f13,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f12,f11]) ).
thf(f11,plain,
! [X1: $i] :
( ( cP @ X1 )
!= $true ),
inference(subsumption_resolution,[status(thm)],[f9,f10]) ).
thf(f10,plain,
! [X0: $i] :
( ( cQ @ X0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
! [X0: $i] :
( ( ( cQ @ X0 )
= $true )
& ( ( ( cQ @ X0 )
!= $true )
| ! [X1: $i] :
( ( ( cP @ X1 )
!= $true )
& ( ( cP @ X1 )
= $true ) ) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ? [X0: $i] :
( ( ( cQ @ X0 )
!= $true )
| ( ? [X1: $i] :
( ( ( cP @ X1 )
!= $true )
| ( ( cP @ X1 )
= $true ) )
& ( ( cQ @ X0 )
= $true ) ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
~ ? [X0: $i] :
( ( ( cQ @ X0 )
!= $true )
| ( ? [X1: $i] :
( ( ( cP @ X1 )
!= $true )
| ( ( cP @ X1 )
= $true ) )
& ( ( cQ @ X0 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ? [X0: $i] :
( ~ ( cQ @ X0 )
| ( ? [X1: $i] :
( ~ ( cP @ X1 )
| ( cP @ X1 ) )
& ( cQ @ X0 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ? [X0: $i] :
( ~ ( cQ @ X0 )
| ( ? [X1: $i] :
( ~ ( cP @ X1 )
| ( cP @ X1 ) )
& ( cQ @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
? [X0: $i] :
( ~ ( cQ @ X0 )
| ( ? [X1: $i] :
( ~ ( cP @ X1 )
| ( cP @ X1 ) )
& ( cQ @ X0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z6dPGx4ty5/DTF2THF_15487.p',cCOUNTER1) ).
thf(f9,plain,
! [X0: $i,X1: $i] :
( ( ( cP @ X1 )
!= $true )
| ( ( cQ @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f12,plain,
! [X1: $i] :
( ( cP @ X1 )
= $true ),
inference(subsumption_resolution,[status(thm)],[f8,f10]) ).
thf(f8,plain,
! [X0: $i,X1: $i] :
( ( ( cQ @ X0 )
!= $true )
| ( ( cP @ X1 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYO139^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.13/0.32 % Computer : n031.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue Feb 24 14:26:18 EST 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.32 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.42 ---- Original DTF file ---
% 0.16/0.42 thf(spec,logic,$$dhol).
% 0.16/0.42 %------------------------------------------------------------------------------
% 0.16/0.42 % File : SYO139^5 : TPTP v9.2.1. Released v4.0.0.
% 0.16/0.42 % Domain : Syntactic
% 0.16/0.42 % Problem : TPS problem from BASIC-FO-THMS
% 0.16/0.42 % Version : Especial.
% 0.16/0.42 % English :
% 0.16/0.42
% 0.16/0.42 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.16/0.42 % Source : [Bro09]
% 0.16/0.42 % Names : tps_0737 [Bro09]
% 0.16/0.42
% 0.16/0.42 % Status : Theorem
% 0.16/0.42 % 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.16/0.42 % Syntax : Number of formulae : 3 ( 0 unt; 2 typ; 0 def)
% 0.16/0.42 % Number of atoms : 4 ( 0 equ; 0 cnn)
% 0.16/0.42 % Maximal formula atoms : 4 ( 4 avg)
% 0.16/0.42 % Number of connectives : 9 ( 2 ~; 2 |; 1 &; 4 @)
% 0.16/0.42 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.16/0.42 % Maximal formula depth : 8 ( 8 avg)
% 0.16/0.42 % Number of types : 2 ( 0 usr)
% 0.16/0.42 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.16/0.42 % Number of symbols : 2 ( 2 usr; 0 con; 1-1 aty)
% 0.16/0.42 % Number of variables : 2 ( 0 ^; 0 !; 2 ?; 2 :)
% 0.16/0.42 % SPC : TH0_THM_NEQ_NAR
% 0.16/0.42
% 0.16/0.42 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.16/0.42 % project in the Department of Mathematical Sciences at Carnegie
% 0.16/0.42 % Mellon University. Distributed under the Creative Commons copyleft
% 0.16/0.42 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.16/0.42 %------------------------------------------------------------------------------
% 0.16/0.42 thf(cQ,type,
% 0.16/0.42 cQ: $i > $o ).
% 0.16/0.42
% 0.16/0.42 thf(cP,type,
% 0.16/0.42 cP: $i > $o ).
% 0.16/0.42
% 0.16/0.42 thf(cCOUNTER1,conjecture,
% 0.16/0.42 ? [Xy: $i] :
% 0.16/0.42 ( ( ? [Xx: $i] :
% 0.16/0.42 ( ( cP @ Xx )
% 0.16/0.42 | ~ ( cP @ Xx ) )
% 0.16/0.42 & ( cQ @ Xy ) )
% 0.16/0.42 | ~ ( cQ @ Xy ) ) ).
% 0.16/0.42
% 0.16/0.42 %------------------------------------------------------------------------------
% 0.16/0.42 ------------------------
% 1.10/1.10 ---- 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:26:19 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.z6dPGx4ty5/DTF2DTF15487.p
% See solution above
% 1.10/1.10 ------------------------
% 1.10/1.11 ---- Cleaned THF ---
% 1.10/1.11 thf(cQ,type,
% 1.10/1.11 cQ: $i > $o ).
% 1.10/1.11
% 1.10/1.11 thf(cP,type,
% 1.10/1.11 cP: $i > $o ).
% 1.10/1.11
% 1.10/1.11 thf(cCOUNTER1,conjecture,
% 1.10/1.11 ? [Xy: $i] :
% 1.10/1.11 ( ( ? [Xx: $i] :
% 1.10/1.11 ( ( cP @ Xx )
% 1.10/1.11 | ~ ( cP @ Xx ) )
% 1.10/1.11 & ( cQ @ Xy ) )
% 1.10/1.11 | ~ ( cQ @ Xy ) ) ).
% 1.10/1.11 ------------------------
% 1.28/1.12 % (15614)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_15487 for (3000ds/183Mi)
% 1.28/1.12 % (15614)First to succeed.
% 1.28/1.12 % (15614)Refutation found. Thanks to Tanya!
% 1.28/1.12 % SZS status Theorem for DTF2THF_15487
% 1.28/1.12 % SZS output start Proof for DTF2THF_15487
% 1.28/1.12 thf(func_def_0, type, cQ: $i > $o).
% 1.28/1.12 thf(func_def_1, type, cP: $i > $o).
% 1.28/1.12 thf(f13,plain,(
% 1.28/1.12 $false),
% 1.28/1.12 inference(subsumption_resolution,[status(thm)],[f12,f11])).
% 1.28/1.12 thf(f11,plain,(
% 1.28/1.12 ( ! [X1 : $i] : (((cP @ X1) != $true)) )),
% 1.28/1.12 inference(subsumption_resolution,[status(thm)],[f9,f10])).
% 1.28/1.12 thf(f10,plain,(
% 1.28/1.12 ( ! [X0 : $i] : (((cQ @ X0) = $true)) )),
% 1.28/1.12 inference(cnf_transformation,[status(thm)],[f7])).
% 1.28/1.12 thf(f7,plain,(
% 1.28/1.12 ! [X0 : $i] : (((cQ @ X0) = $true) & (((cQ @ X0) != $true) | ! [X1 : $i] : (((cP @ X1) != $true) & ((cP @ X1) = $true))))),
% 1.28/1.12 inference(ennf_transformation,[status(thm)],[f6])).
% 1.28/1.12 thf(f6,plain,(
% 1.28/1.12 ~? [X0 : $i] : (((cQ @ X0) != $true) | (? [X1 : $i] : (((cP @ X1) != $true) | ((cP @ X1) = $true)) & ((cQ @ X0) = $true)))),
% 1.28/1.12 inference(flattening,[status(thm)],[f5])).
% 1.28/1.12 thf(f5,plain,(
% 1.28/1.12 ~? [X0 : $i] : (~((cQ @ X0) = $true) | (? [X1 : $i] : (~((cP @ X1) = $true) | ((cP @ X1) = $true)) & ((cQ @ X0) = $true)))),
% 1.28/1.12 inference(fool_elimination,[status(thm)],[f4])).
% 1.28/1.12 thf(f4,plain,(
% 1.28/1.12 ~? [X0 : $i] : (~(cQ @ X0) | (? [X1 : $i] : (~(cP @ X1) | (cP @ X1)) & (cQ @ X0)))),
% 1.28/1.12 inference(rectify,[status(thm)],[f2])).
% 1.28/1.12 thf(f2,negated_conjecture,(
% 1.28/1.12 ~? [X0 : $i] : (~(cQ @ X0) | (? [X1 : $i] : (~(cP @ X1) | (cP @ X1)) & (cQ @ X0)))),
% 1.28/1.12 inference(negated_conjecture,[status(cth)],[f1])).
% 1.28/1.12 thf(f1,conjecture,(
% 1.28/1.12 ? [X0 : $i] : (~(cQ @ X0) | (? [X1 : $i] : (~(cP @ X1) | (cP @ X1)) & (cQ @ X0)))),
% 1.28/1.12 file('/export/starexec/sandbox/tmp/tmp.z6dPGx4ty5/DTF2THF_15487.p',cCOUNTER1)).
% 1.28/1.12 thf(f9,plain,(
% 1.28/1.12 ( ! [X0 : $i,X1 : $i] : (((cP @ X1) != $true) | ((cQ @ X0) != $true)) )),
% 1.28/1.12 inference(cnf_transformation,[status(thm)],[f7])).
% 1.28/1.12 thf(f12,plain,(
% 1.28/1.12 ( ! [X1 : $i] : (((cP @ X1) = $true)) )),
% 1.28/1.12 inference(subsumption_resolution,[status(thm)],[f8,f10])).
% 1.28/1.12 thf(f8,plain,(
% 1.28/1.12 ( ! [X0 : $i,X1 : $i] : (((cQ @ X0) != $true) | ((cP @ X1) = $true)) )),
% 1.28/1.12 inference(cnf_transformation,[status(thm)],[f7])).
% 1.28/1.12 % SZS output end Proof for DTF2THF_15487
% 1.28/1.12 % (15614)------------------------------
% 1.28/1.12 % (15614)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.28/1.12 % (15614)Termination reason: Refutation
% 1.28/1.12
% 1.28/1.12 % (15614)Memory used [KB]: 5373
% 1.28/1.12 % (15614)Time elapsed: 0.002 s
% 1.28/1.12 % (15614)Instructions burned: 1 (million)
% 1.28/1.12 % (15614)------------------------------
% 1.28/1.12 % (15614)------------------------------
% 1.28/1.12 % (15613)Success in time 0.011 s
%------------------------------------------------------------------------------