%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYN357^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 : n015.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:50:50 AM UTC 2026
% Result : Theorem 1.63s 1.40s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 46 ( 12 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 35 ( 8 ~; 0 |; 4 &; 18 @)
% ( 0 <=>; 5 =>; 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 : 5 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 ^; 9 !; 6 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cP: $i > $o ).
thf(f11,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f10,f9]) ).
thf(f9,plain,
! [X1: $i] :
( ( cP @ X1 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
! [X1: $i] :
( ( ( cP @ sK0 )
= $true )
& ( ( cP @ X1 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: $i] :
! [X1: $i] :
( ( ( cP @ X0 )
= $true )
& ( ( cP @ X1 )
!= $true ) )
=> ! [X1: $i] :
( ( ( cP @ sK0 )
= $true )
& ( ( cP @ X1 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
? [X0: $i] :
! [X1: $i] :
( ( ( cP @ X0 )
= $true )
& ( ( cP @ X1 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: $i] :
? [X1: $i] :
( ( ( cP @ X0 )
= $true )
=> ( ( cP @ X1 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: $i] :
? [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: $i] :
? [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: $i] :
? [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.XqiEj3EF2Q/DTF2THF_26746.p',cLX2108) ).
thf(f10,plain,
( ( cP @ sK0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN357^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.10 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.30 % Computer : n015.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue Feb 24 13:56:01 EST 2026
% 0.11/0.30 % CPUTime :
% 0.11/0.30 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.40 ---- Original DTF file ---
% 0.17/0.40 thf(spec,logic,$$dhol).
% 0.17/0.40 %------------------------------------------------------------------------------
% 0.17/0.40 % File : SYN357^5 : TPTP v9.2.1. Released v4.0.0.
% 0.17/0.40 % Domain : Syntactic
% 0.17/0.40 % Problem : TPS problem from BASIC-FO-THMS
% 0.17/0.40 % Version : Especial.
% 0.17/0.40 % English :
% 0.17/0.40
% 0.17/0.40 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.17/0.40 % Source : [Bro09]
% 0.17/0.40 % Names : tps_0632 [Bro09]
% 0.17/0.40
% 0.17/0.40 % Status : Theorem
% 0.17/0.40 % Rating : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.0.0
% 0.17/0.40 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.17/0.40 % Number of atoms : 2 ( 0 equ; 0 cnn)
% 0.17/0.40 % Maximal formula atoms : 2 ( 2 avg)
% 0.17/0.40 % Number of connectives : 3 ( 0 ~; 0 |; 0 &; 2 @)
% 0.17/0.40 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.17/0.40 % Maximal formula depth : 5 ( 5 avg)
% 0.17/0.40 % Number of types : 2 ( 0 usr)
% 0.17/0.40 % Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% 0.17/0.40 % Number of symbols : 1 ( 1 usr; 0 con; 1-1 aty)
% 0.17/0.40 % Number of variables : 2 ( 0 ^; 1 !; 1 ?; 2 :)
% 0.17/0.40 % SPC : TH0_THM_NEQ_NAR
% 0.17/0.40
% 0.17/0.40 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.17/0.40 % project in the Department of Mathematical Sciences at Carnegie
% 0.17/0.40 % Mellon University. Distributed under the Creative Commons copyleft
% 0.17/0.40 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.17/0.40 % :
% 0.17/0.40 %------------------------------------------------------------------------------
% 0.17/0.40 thf(cP,type,
% 0.17/0.40 cP: $i > $o ).
% 0.17/0.40
% 0.17/0.40 thf(cLX2108,conjecture,
% 0.17/0.40 ! [X: $i] :
% 0.17/0.40 ? [Y: $i] :
% 0.17/0.40 ( ( cP @ X )
% 0.17/0.40 => ( cP @ Y ) ) ).
% 0.17/0.40
% 0.17/0.40 %------------------------------------------------------------------------------
% 0.17/0.40 ------------------------
% 1.47/1.37 ---- Embedded in THF ---
% 1.47/1.37 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.47/1.37 %%% Generated on Tue Feb 24 13:56:02 EST 2026
% 1.47/1.37 %%% using '$$dhol' embedding, version 1.3.0.
% 1.47/1.37 %%% Logic specification used:
% 1.47/1.37 %%% thf(spec, logic, $$dhol).
% 1.47/1.37
% 1.47/1.37 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.XqiEj3EF2Q/DTF2DTF26746.p
% See solution above
% 1.47/1.37 ------------------------
% 1.47/1.38 ---- Cleaned THF ---
% 1.47/1.38 thf(cP,type,
% 1.47/1.38 cP: $i > $o ).
% 1.47/1.38
% 1.47/1.38 thf(cLX2108,conjecture,
% 1.47/1.38 ! [X: $i] :
% 1.47/1.38 ? [Y: $i] :
% 1.47/1.38 ( ( cP @ X )
% 1.47/1.38 => ( cP @ Y ) ) ).
% 1.47/1.38 ------------------------
% 1.63/1.40 % (26848)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_26746 for (3000ds/275Mi)
% 1.63/1.40 % (26844)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_26746 for (3000ds/4Mi)
% 1.63/1.40 % (26847)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_26746 for (3000ds/2Mi)
% 1.63/1.40 % (26846)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_26746 for (3000ds/2Mi)
% 1.63/1.40 % (26843)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_26746 for (3000ds/183Mi)
% 1.63/1.40 % (26849)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_26746 for (3000ds/18Mi)
% 1.63/1.40 % (26846)First to succeed.
% 1.63/1.40 % (26845)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_26746 for (3000ds/27Mi)
% 1.63/1.40 % (26849)Also succeeded, but the first one will report.
% 1.63/1.40 % (26847)Also succeeded, but the first one will report.
% 1.63/1.40 % (26846)Refutation found. Thanks to Tanya!
% 1.63/1.40 % SZS status Theorem for DTF2THF_26746
% 1.63/1.40 % SZS output start Proof for DTF2THF_26746
% 1.63/1.40 thf(func_def_0, type, cP: $i > $o).
% 1.63/1.40 thf(f11,plain,(
% 1.63/1.40 $false),
% 1.63/1.40 inference(subsumption_resolution,[status(thm)],[f10,f9])).
% 1.63/1.40 thf(f9,plain,(
% 1.63/1.40 ( ! [X1 : $i] : (((cP @ X1) != $true)) )),
% 1.63/1.40 inference(cnf_transformation,[status(thm)],[f8])).
% 1.63/1.40 thf(f8,plain,(
% 1.63/1.40 ! [X1 : $i] : (((cP @ sK0) = $true) & ((cP @ X1) != $true))),
% 1.63/1.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
% 1.63/1.40 thf(f7,plain,(
% 1.63/1.40 ? [X0 : $i] : ! [X1 : $i] : (((cP @ X0) = $true) & ((cP @ X1) != $true)) => ! [X1 : $i] : (((cP @ sK0) = $true) & ((cP @ X1) != $true))),
% 1.63/1.40 introduced(definition,[],[choice_axiom])).
% 1.63/1.40 thf(f6,plain,(
% 1.63/1.40 ? [X0 : $i] : ! [X1 : $i] : (((cP @ X0) = $true) & ((cP @ X1) != $true))),
% 1.63/1.40 inference(ennf_transformation,[status(thm)],[f5])).
% 1.63/1.40 thf(f5,plain,(
% 1.63/1.40 ~! [X0 : $i] : ? [X1 : $i] : (((cP @ X0) = $true) => ((cP @ X1) = $true))),
% 1.63/1.40 inference(fool_elimination,[status(thm)],[f4])).
% 1.63/1.40 thf(f4,plain,(
% 1.63/1.40 ~! [X0 : $i] : ? [X1 : $i] : ((cP @ X0) => (cP @ X1))),
% 1.63/1.40 inference(rectify,[status(thm)],[f2])).
% 1.63/1.40 thf(f2,negated_conjecture,(
% 1.63/1.40 ~! [X0 : $i] : ? [X1 : $i] : ((cP @ X0) => (cP @ X1))),
% 1.63/1.40 inference(negated_conjecture,[status(cth)],[f1])).
% 1.63/1.40 thf(f1,conjecture,(
% 1.63/1.40 ! [X0 : $i] : ? [X1 : $i] : ((cP @ X0) => (cP @ X1))),
% 1.63/1.40 file('/export/starexec/sandbox/tmp/tmp.XqiEj3EF2Q/DTF2THF_26746.p',cLX2108)).
% 1.63/1.40 thf(f10,plain,(
% 1.63/1.40 ((cP @ sK0) = $true)),
% 1.63/1.40 inference(cnf_transformation,[status(thm)],[f8])).
% 1.63/1.40 % SZS output end Proof for DTF2THF_26746
% 1.63/1.40 % (26846)------------------------------
% 1.63/1.40 % (26846)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.63/1.40 % (26846)Termination reason: Refutation
% 1.63/1.40
% 1.63/1.40 % (26846)Memory used [KB]: 5373
% 1.63/1.40 % (26846)Time elapsed: 0.002 s
% 1.63/1.40 % (26846)Instructions burned: 1 (million)
% 1.63/1.40 % (26846)------------------------------
% 1.63/1.40 % (26846)------------------------------
% 1.63/1.40 % (26842)Success in time 0.019 s
%------------------------------------------------------------------------------