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