%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO132^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 : n021.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.62s 1.30s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 126 ( 27 equ; 0 cnn)
% Maximal formula atoms : 9 ( 9 avg)
% Number of connectives : 70 ( 12 ~; 4 |; 18 &; 32 @)
% ( 0 <=>; 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 : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
cS: $i > $o ).
thf(func_def_2,type,
cT: $i > $o ).
thf(func_def_3,type,
cP: ( $i > $o ) > $o ).
thf(f15,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f14,f12]) ).
thf(f12,plain,
( ( cP @ cT )
= $true ),
inference(definition_unfolding,[status(thm)],[f9,f10]) ).
thf(f10,plain,
cS = cT,
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
( ( ( cT @ cX )
= $true )
& ( cS = cT )
& ( ( cP @ cS )
= $true )
& ( ( ( cP @ cT )
!= $true )
| ( ( cS @ cX )
!= $true ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
( ( ( ( cP @ cT )
!= $true )
| ( ( cS @ cX )
!= $true ) )
& ( cS = cT )
& ( ( cP @ cS )
= $true )
& ( ( cT @ cX )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ( cS = cT )
& ( ( cP @ cS )
= $true )
& ( ( cT @ cX )
= $true ) )
=> ( ( ( cP @ cT )
= $true )
& ( ( cS @ cX )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( ( cP @ cS )
& ( cS = cT )
& ( cT @ cX ) )
=> ( ( cP @ cT )
& ( cS @ cX ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ( cP @ cS )
& ( cS = cT )
& ( cT @ cX ) )
=> ( ( cP @ cT )
& ( cS @ cX ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ( cP @ cS )
& ( cS = cT )
& ( cT @ cX ) )
=> ( ( cP @ cT )
& ( cS @ cX ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MZ187UZmSV/DTF2THF_30656.p',cTHM503) ).
thf(f9,plain,
( ( cP @ cS )
= $true ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f14,plain,
( ( cP @ cT )
!= $true ),
inference(subsumption_resolution,[status(thm)],[f13,f11]) ).
thf(f11,plain,
( ( cT @ cX )
= $true ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f13,plain,
( ( ( cT @ cX )
!= $true )
| ( ( cP @ cT )
!= $true ) ),
inference(definition_unfolding,[status(thm)],[f8,f10]) ).
thf(f8,plain,
( ( ( cP @ cT )
!= $true )
| ( ( cS @ cX )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO132^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 : n021.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:25:09 EST 2026
% 0.17/0.35 % CPUTime :
% 0.17/0.35 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.32/0.47 ---- Original DTF file ---
% 0.32/0.47 thf(spec,logic,$$dhol).
% 0.32/0.47 %------------------------------------------------------------------------------
% 0.32/0.47 % File : SYO132^5 : TPTP v9.2.1. Released v4.0.0.
% 0.32/0.47 % Domain : Syntactic
% 0.32/0.47 % Problem : TPS problem from BASIC-FO-THMS
% 0.32/0.47 % Version : Especial.
% 0.32/0.47 % English :
% 0.32/0.47
% 0.32/0.47 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.32/0.47 % Source : [Bro09]
% 0.32/0.47 % Names : tps_0714 [Bro09]
% 0.32/0.47
% 0.32/0.47 % Status : Theorem
% 0.32/0.47 % Rating : 0.00 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v6.1.0, 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v4.1.0, 0.33 v4.0.0
% 0.32/0.47 % Syntax : Number of formulae : 5 ( 0 unt; 4 typ; 0 def)
% 0.32/0.47 % Number of atoms : 9 ( 1 equ; 0 cnn)
% 0.32/0.47 % Maximal formula atoms : 7 ( 9 avg)
% 0.32/0.47 % Number of connectives : 8 ( 0 ~; 0 |; 3 &; 4 @)
% 0.32/0.47 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.32/0.47 % Maximal formula depth : 5 ( 5 avg)
% 0.32/0.47 % Number of types : 2 ( 0 usr)
% 0.32/0.47 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.32/0.47 % Number of symbols : 5 ( 4 usr; 1 con; 0-2 aty)
% 0.32/0.47 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.32/0.47 % SPC : TH0_THM_EQU_NAR
% 0.32/0.47
% 0.32/0.47 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.32/0.47 % project in the Department of Mathematical Sciences at Carnegie
% 0.32/0.47 % Mellon University. Distributed under the Creative Commons copyleft
% 0.32/0.47 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.32/0.47 %------------------------------------------------------------------------------
% 0.32/0.47 thf(cX,type,
% 0.32/0.47 cX: $i ).
% 0.32/0.47
% 0.32/0.47 thf(cS,type,
% 0.32/0.47 cS: $i > $o ).
% 0.32/0.47
% 0.32/0.47 thf(cT,type,
% 0.32/0.47 cT: $i > $o ).
% 0.32/0.47
% 0.32/0.47 thf(cP,type,
% 0.32/0.47 cP: ( $i > $o ) > $o ).
% 0.32/0.47
% 0.32/0.47 thf(cTHM503,conjecture,
% 0.32/0.47 ( ( ( cP @ cS )
% 0.32/0.47 & ( cT @ cX )
% 0.32/0.47 & ( cS = cT ) )
% 0.32/0.47 => ( ( cP @ cT )
% 0.32/0.47 & ( cS @ cX ) ) ) ).
% 0.32/0.47
% 0.32/0.47 %------------------------------------------------------------------------------
% 0.32/0.47 ------------------------
% 1.44/1.27 ---- Embedded in THF ---
% 1.44/1.27 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.44/1.27 %%% Generated on Tue Feb 24 14:25:09 EST 2026
% 1.44/1.27 %%% using '$$dhol' embedding, version 1.3.0.
% 1.44/1.27 %%% Logic specification used:
% 1.44/1.27 %%% thf(spec, logic, $$dhol).
% 1.44/1.27
% 1.44/1.27 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.MZ187UZmSV/DTF2DTF30656.p
% See solution above
% 1.44/1.27 ------------------------
% 1.44/1.28 ---- Cleaned THF ---
% 1.44/1.28 thf(cX,type,
% 1.44/1.28 cX: $i ).
% 1.44/1.28
% 1.44/1.28 thf(cS,type,
% 1.44/1.28 cS: $i > $o ).
% 1.44/1.28
% 1.44/1.28 thf(cT,type,
% 1.44/1.28 cT: $i > $o ).
% 1.44/1.28
% 1.44/1.28 thf(cP,type,
% 1.44/1.28 cP: ( $i > $o ) > $o ).
% 1.44/1.28
% 1.44/1.28 thf(cTHM503,conjecture,
% 1.44/1.28 ( ( ( cP @ cS )
% 1.44/1.28 & ( cT @ cX )
% 1.44/1.28 & ( cS = cT ) )
% 1.44/1.28 => ( ( cP @ cT )
% 1.44/1.28 & ( cS @ cX ) ) ) ).
% 1.44/1.28 ------------------------
% 1.44/1.30 % (30983)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_30656 for (3000ds/183Mi)
% 1.44/1.30 % (30983)First to succeed.
% 1.62/1.30 % (30983)Refutation found. Thanks to Tanya!
% 1.62/1.30 % SZS status Theorem for DTF2THF_30656
% 1.62/1.30 % SZS output start Proof for DTF2THF_30656
% 1.62/1.30 thf(func_def_1, type, cS: $i > $o).
% 1.62/1.30 thf(func_def_2, type, cT: $i > $o).
% 1.62/1.30 thf(func_def_3, type, cP: ($i > $o) > $o).
% 1.62/1.30 thf(f15,plain,(
% 1.62/1.30 $false),
% 1.62/1.30 inference(subsumption_resolution,[status(thm)],[f14,f12])).
% 1.62/1.30 thf(f12,plain,(
% 1.62/1.30 ((cP @ cT) = $true)),
% 1.62/1.30 inference(definition_unfolding,[status(thm)],[f9,f10])).
% 1.62/1.30 thf(f10,plain,(
% 1.62/1.30 (cS = cT)),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f7])).
% 1.62/1.30 thf(f7,plain,(
% 1.62/1.30 ((cT @ cX) = $true) & (cS = cT) & ((cP @ cS) = $true) & (((cP @ cT) != $true) | ((cS @ cX) != $true))),
% 1.62/1.30 inference(flattening,[status(thm)],[f6])).
% 1.62/1.30 thf(f6,plain,(
% 1.62/1.30 (((cP @ cT) != $true) | ((cS @ cX) != $true)) & ((cS = cT) & ((cP @ cS) = $true) & ((cT @ cX) = $true))),
% 1.62/1.30 inference(ennf_transformation,[status(thm)],[f5])).
% 1.62/1.30 thf(f5,plain,(
% 1.62/1.30 ~(((cS = cT) & ((cP @ cS) = $true) & ((cT @ cX) = $true)) => (((cP @ cT) = $true) & ((cS @ cX) = $true)))),
% 1.62/1.30 inference(fool_elimination,[status(thm)],[f4])).
% 1.62/1.30 thf(f4,plain,(
% 1.62/1.30 ~(((cP @ cS) & (cS = cT) & (cT @ cX)) => ((cP @ cT) & (cS @ cX)))),
% 1.62/1.30 inference(rectify,[status(thm)],[f2])).
% 1.62/1.30 thf(f2,negated_conjecture,(
% 1.62/1.30 ~(((cP @ cS) & (cS = cT) & (cT @ cX)) => ((cP @ cT) & (cS @ cX)))),
% 1.62/1.30 inference(negated_conjecture,[status(cth)],[f1])).
% 1.62/1.30 thf(f1,conjecture,(
% 1.62/1.30 ((cP @ cS) & (cS = cT) & (cT @ cX)) => ((cP @ cT) & (cS @ cX))),
% 1.62/1.30 file('/export/starexec/sandbox/tmp/tmp.MZ187UZmSV/DTF2THF_30656.p',cTHM503)).
% 1.62/1.30 thf(f9,plain,(
% 1.62/1.30 ((cP @ cS) = $true)),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f7])).
% 1.62/1.30 thf(f14,plain,(
% 1.62/1.30 ((cP @ cT) != $true)),
% 1.62/1.30 inference(subsumption_resolution,[status(thm)],[f13,f11])).
% 1.62/1.30 thf(f11,plain,(
% 1.62/1.30 ((cT @ cX) = $true)),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f7])).
% 1.62/1.30 thf(f13,plain,(
% 1.62/1.30 ((cT @ cX) != $true) | ((cP @ cT) != $true)),
% 1.62/1.30 inference(definition_unfolding,[status(thm)],[f8,f10])).
% 1.62/1.30 thf(f8,plain,(
% 1.62/1.30 ((cP @ cT) != $true) | ((cS @ cX) != $true)),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f7])).
% 1.62/1.30 % SZS output end Proof for DTF2THF_30656
% 1.62/1.30 % (30983)------------------------------
% 1.62/1.30 % (30983)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.62/1.30 % (30983)Termination reason: Refutation
% 1.62/1.30
% 1.62/1.30 % (30983)Memory used [KB]: 5373
% 1.62/1.30 % (30983)Time elapsed: 0.002 s
% 1.62/1.30 % (30983)------------------------------
% 1.62/1.30 % (30983)------------------------------
% 1.62/1.30 % (30982)Success in time 0.011 s
%------------------------------------------------------------------------------