%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO077^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 : n016.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:19 AM UTC 2026
% Result : Theorem 1.64s 1.48s
% Output : Refutation 1.64s
% 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 : 40 ( 10 equ; 0 cnn)
% Maximal formula atoms : 2 ( 4 avg)
% Number of connectives : 31 ( 8 ~; 0 |; 2 &; 16 @)
% ( 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 : 13 ( 0 ^; 7 !; 6 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cP: $i > $o ).
thf(f11,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f9,f10]) ).
thf(f10,plain,
! [X0: $i] :
( ( cP @ X0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
! [X0: $i] :
( ( ( cP @ X0 )
= $true )
& ( $true
!= ( cP @ sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
thf(f7,plain,
( ? [X1: $i] :
( ( cP @ X1 )
!= $true )
=> ( $true
!= ( cP @ sK0 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
! [X0: $i] :
( ( ( cP @ X0 )
= $true )
& ? [X1: $i] :
( ( cP @ X1 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ? [X0: $i] :
( ( ( cP @ X0 )
= $true )
=> ! [X1: $i] :
( ( cP @ X1 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ? [X0: $i] :
( ( cP @ X0 )
=> ! [X1: $i] : ( cP @ X1 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ? [X0: $i] :
( ( cP @ X0 )
=> ! [X1: $i] : ( cP @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
? [X0: $i] :
( ( cP @ X0 )
=> ! [X1: $i] : ( cP @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.qpKkqHKZOh/DTF2THF_28302.p',cTHM64) ).
thf(f9,plain,
( $true
!= ( cP @ sK0 ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO077^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.16/0.33 % Computer : n016.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 14:24:21 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.32/0.48 ---- Original DTF file ---
% 0.32/0.48 thf(spec,logic,$$dhol).
% 0.32/0.48 %------------------------------------------------------------------------------
% 0.32/0.48 % File : SYO077^5 : TPTP v9.2.1. Released v4.0.0.
% 0.32/0.48 % Domain : Syntactic
% 0.32/0.48 % Problem : TPS problem THM64
% 0.32/0.48 % Version : Especial.
% 0.32/0.48 % English :
% 0.32/0.48
% 0.32/0.48 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.32/0.48 % Source : [Bro09]
% 0.32/0.48 % Names : tps_0031 [Bro09]
% 0.32/0.48 % : THM64 [TPS]
% 0.32/0.48
% 0.32/0.48 % Status : Theorem
% 0.32/0.48 % 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.32/0.48 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.32/0.48 % Number of atoms : 2 ( 0 equ; 0 cnn)
% 0.32/0.48 % Maximal formula atoms : 2 ( 2 avg)
% 0.32/0.48 % Number of connectives : 3 ( 0 ~; 0 |; 0 &; 2 @)
% 0.32/0.48 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.32/0.48 % Maximal formula depth : 5 ( 5 avg)
% 0.32/0.48 % Number of types : 2 ( 0 usr)
% 0.32/0.48 % Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% 0.32/0.48 % Number of symbols : 1 ( 1 usr; 0 con; 1-1 aty)
% 0.32/0.48 % Number of variables : 2 ( 0 ^; 1 !; 1 ?; 2 :)
% 0.32/0.48 % SPC : TH0_THM_NEQ_NAR
% 0.32/0.48
% 0.32/0.48 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.32/0.48 % project in the Department of Mathematical Sciences at Carnegie
% 0.32/0.48 % Mellon University. Distributed under the Creative Commons copyleft
% 0.32/0.48 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.32/0.48 %------------------------------------------------------------------------------
% 0.32/0.48 thf(cP,type,
% 0.32/0.48 cP: $i > $o ).
% 0.32/0.48
% 0.32/0.48 thf(cTHM64,conjecture,
% 0.32/0.48 ? [X: $i] :
% 0.32/0.48 ( ( cP @ X )
% 0.32/0.48 => ! [Y: $i] : ( cP @ Y ) ) ).
% 0.32/0.48
% 0.32/0.48 %------------------------------------------------------------------------------
% 0.32/0.48 ------------------------
% 1.64/1.45 ---- Embedded in THF ---
% 1.64/1.45 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.64/1.45 %%% Generated on Tue Feb 24 14:24:22 EST 2026
% 1.64/1.45 %%% using '$$dhol' embedding, version 1.3.0.
% 1.64/1.45 %%% Logic specification used:
% 1.64/1.45 %%% thf(spec, logic, $$dhol).
% 1.64/1.45
% 1.64/1.45 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.qpKkqHKZOh/DTF2DTF28302.p
% See solution above
% 1.64/1.45 ------------------------
% 1.64/1.46 ---- Cleaned THF ---
% 1.64/1.46 thf(cP,type,
% 1.64/1.46 cP: $i > $o ).
% 1.64/1.46
% 1.64/1.46 thf(cTHM64,conjecture,
% 1.64/1.46 ? [X: $i] :
% 1.64/1.46 ( ( cP @ X )
% 1.64/1.46 => ! [Y: $i] : ( cP @ Y ) ) ).
% 1.64/1.46 ------------------------
% 1.64/1.48 % (28408)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_28302 for (3000ds/4Mi)
% 1.64/1.48 % (28413)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_28302 for (3000ds/18Mi)
% 1.64/1.48 % (28407)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_28302 for (3000ds/183Mi)
% 1.64/1.48 % (28412)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_28302 for (3000ds/275Mi)
% 1.64/1.48 % (28411)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_28302 for (3000ds/2Mi)
% 1.64/1.48 % (28409)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_28302 for (3000ds/27Mi)
% 1.64/1.48 % (28408)First to succeed.
% 1.64/1.48 % (28411)Instruction limit reached!
% 1.64/1.48 % (28411)------------------------------
% 1.64/1.48 % (28411)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.48 % (28411)Termination reason: Unknown
% 1.64/1.48 % (28411)Termination phase: Saturation
% 1.64/1.48
% 1.64/1.48 % (28411)Memory used [KB]: 5500
% 1.64/1.48 % (28411)Time elapsed: 0.003 s
% 1.64/1.48 % (28411)Instructions burned: 2 (million)
% 1.64/1.48 % (28411)------------------------------
% 1.64/1.48 % (28411)------------------------------
% 1.64/1.48 % (28410)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_28302 for (3000ds/2Mi)
% 1.64/1.48 % (28407)Also succeeded, but the first one will report.
% 1.64/1.48 % (28412)Also succeeded, but the first one will report.
% 1.64/1.48 % (28408)Refutation found. Thanks to Tanya!
% 1.64/1.48 % SZS status Theorem for DTF2THF_28302
% 1.64/1.48 % SZS output start Proof for DTF2THF_28302
% 1.64/1.48 thf(func_def_0, type, cP: $i > $o).
% 1.64/1.48 thf(f11,plain,(
% 1.64/1.48 $false),
% 1.64/1.48 inference(subsumption_resolution,[status(thm)],[f9,f10])).
% 1.64/1.48 thf(f10,plain,(
% 1.64/1.48 ( ! [X0 : $i] : (((cP @ X0) = $true)) )),
% 1.64/1.48 inference(cnf_transformation,[status(thm)],[f8])).
% 1.64/1.48 thf(f8,plain,(
% 1.64/1.48 ! [X0 : $i] : (((cP @ X0) = $true) & ($true != (cP @ sK0)))),
% 1.64/1.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
% 1.64/1.48 thf(f7,plain,(
% 1.64/1.48 ? [X1 : $i] : ((cP @ X1) != $true) => ($true != (cP @ sK0))),
% 1.64/1.48 introduced(definition,[],[choice_axiom])).
% 1.64/1.48 thf(f6,plain,(
% 1.64/1.48 ! [X0 : $i] : (((cP @ X0) = $true) & ? [X1 : $i] : ((cP @ X1) != $true))),
% 1.64/1.48 inference(ennf_transformation,[status(thm)],[f5])).
% 1.64/1.48 thf(f5,plain,(
% 1.64/1.48 ~? [X0 : $i] : (((cP @ X0) = $true) => ! [X1 : $i] : ((cP @ X1) = $true))),
% 1.64/1.48 inference(fool_elimination,[status(thm)],[f4])).
% 1.64/1.48 thf(f4,plain,(
% 1.64/1.48 ~? [X0 : $i] : ((cP @ X0) => ! [X1 : $i] : (cP @ X1))),
% 1.64/1.48 inference(rectify,[status(thm)],[f2])).
% 1.64/1.48 thf(f2,negated_conjecture,(
% 1.64/1.48 ~? [X0 : $i] : ((cP @ X0) => ! [X1 : $i] : (cP @ X1))),
% 1.64/1.48 inference(negated_conjecture,[status(cth)],[f1])).
% 1.64/1.48 thf(f1,conjecture,(
% 1.64/1.48 ? [X0 : $i] : ((cP @ X0) => ! [X1 : $i] : (cP @ X1))),
% 1.64/1.48 file('/export/starexec/sandbox/tmp/tmp.qpKkqHKZOh/DTF2THF_28302.p',cTHM64)).
% 1.64/1.48 thf(f9,plain,(
% 1.64/1.48 ($true != (cP @ sK0))),
% 1.64/1.48 inference(cnf_transformation,[status(thm)],[f8])).
% 1.64/1.48 % SZS output end Proof for DTF2THF_28302
% 1.64/1.48 % (28408)------------------------------
% 1.64/1.48 % (28408)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.48 % (28408)Termination reason: Refutation
% 1.64/1.48
% 1.64/1.48 % (28408)Memory used [KB]: 5373
% 1.64/1.48 % (28408)Time elapsed: 0.003 s
% 1.64/1.48 % (28408)Instructions burned: 1 (million)
% 1.64/1.48 % (28408)------------------------------
% 1.64/1.48 % (28408)------------------------------
% 1.64/1.48 % (28406)Success in time 0.017 s
%------------------------------------------------------------------------------