%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO554^1 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n017.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:54:32 AM UTC 2026
% Result : Unsatisfiable 1.80s 1.59s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 96 ( 21 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 48 ( 13 ~; 11 |; 0 &; 24 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
p: $i > $o ).
thf(f20,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f18,f19]) ).
thf(f19,plain,
( ( p @ u )
!= $true ),
inference(duplicate_literal_removal,[status(thm)],[f17]) ).
thf(f17,plain,
( ( ( p @ u )
!= $true )
| ( ( p @ u )
!= $true ) ),
inference(definition_unfolding,[status(thm)],[f12,f14]) ).
thf(f14,plain,
t = u,
inference(cnf_transformation,[status(thm)],[f4]) ).
thf(f4,axiom,
t = u,
file('/export/starexec/sandbox/tmp/tmp.6KM0aWBRAY/DTF2THF_20960.p',tu) ).
thf(f12,plain,
( ( ( p @ u )
!= $true )
| ( ( p @ t )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ( p @ u )
!= $true )
| ( ( p @ t )
!= $true ) ),
inference(flattening,[status(thm)],[f7]) ).
thf(f7,plain,
( ( ( p @ t )
!= $true )
| ( ( p @ u )
!= $true ) ),
inference(fool_elimination,[status(thm)],[f6]) ).
thf(f6,plain,
( ~ ( p @ t )
| ~ ( p @ u ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
( ~ ( p @ t )
| ~ ( p @ u ) ),
file('/export/starexec/sandbox/tmp/tmp.6KM0aWBRAY/DTF2THF_20960.p',puv) ).
thf(f18,plain,
( ( p @ u )
= $true ),
inference(duplicate_literal_removal,[status(thm)],[f16]) ).
thf(f16,plain,
( ( ( p @ u )
= $true )
| ( ( p @ u )
= $true ) ),
inference(definition_unfolding,[status(thm)],[f11,f15,f14]) ).
thf(f15,plain,
s = u,
inference(definition_unfolding,[status(thm)],[f13,f14]) ).
thf(f13,plain,
s = t,
inference(cnf_transformation,[status(thm)],[f3]) ).
thf(f3,axiom,
s = t,
file('/export/starexec/sandbox/tmp/tmp.6KM0aWBRAY/DTF2THF_20960.p',st) ).
thf(f11,plain,
( ( ( p @ s )
= $true )
| ( ( p @ t )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ( p @ s )
= $true )
| ( ( p @ t )
= $true ) ),
inference(fool_elimination,[status(thm)],[f8]) ).
thf(f8,plain,
( ( p @ s )
| ( p @ t ) ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( ( p @ s )
| ( p @ t ) ),
file('/export/starexec/sandbox/tmp/tmp.6KM0aWBRAY/DTF2THF_20960.p',pst) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO554^1 : TPTP v9.2.1. Released v5.2.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 : n017.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.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue Feb 24 14:32:26 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.30/0.48 ---- Original DTF file ---
% 0.30/0.48 thf(spec,logic,$$dhol).
% 0.30/0.48 %------------------------------------------------------------------------------
% 0.30/0.48 % File : SYO554^1 : TPTP v9.2.1. Released v5.2.0.
% 0.30/0.48 % Domain : Syntactic
% 0.30/0.48 % Problem : Teucke's example
% 0.30/0.48 % Version : Especial.
% 0.30/0.48 % English :
% 0.30/0.48
% 0.30/0.48 % Refs : [Bro11] Brown E. (2011), Email to Geoff Sutcliffe
% 0.30/0.48 % Source : [Bro11]
% 0.30/0.48 % Names : TEUCKE1 [Bro11]
% 0.30/0.48
% 0.30/0.48 % Status : Unsatisfiable
% 0.30/0.48 % Rating : 0.00 v5.2.0
% 0.30/0.48 % Syntax : Number of formulae : 8 ( 2 unt; 4 typ; 0 def)
% 0.30/0.48 % Number of atoms : 6 ( 2 equ; 0 cnn)
% 0.30/0.48 % Maximal formula atoms : 2 ( 1 avg)
% 0.30/0.48 % Number of connectives : 8 ( 2 ~; 2 |; 0 &; 4 @)
% 0.30/0.48 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.30/0.48 % Maximal formula depth : 4 ( 2 avg)
% 0.30/0.48 % Number of types : 2 ( 0 usr)
% 0.30/0.48 % Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% 0.30/0.48 % Number of symbols : 5 ( 4 usr; 3 con; 0-2 aty)
% 0.30/0.48 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.30/0.48 % SPC : TH0_UNS_EQU_NAR
% 0.30/0.48
% 0.30/0.48 % Comments : Andreas Teucke created this first-order example to demonstrate
% 0.30/0.48 % that sometimes analytic cut sneaks into Satallax proofs.
% 0.30/0.48 %------------------------------------------------------------------------------
% 0.30/0.48 thf(p,type,
% 0.30/0.48 p: $i > $o ).
% 0.30/0.48
% 0.30/0.48 thf(s,type,
% 0.30/0.48 s: $i ).
% 0.30/0.48
% 0.30/0.48 thf(t,type,
% 0.30/0.48 t: $i ).
% 0.30/0.48
% 0.30/0.48 thf(u,type,
% 0.30/0.48 u: $i ).
% 0.30/0.48
% 0.30/0.48 thf(pst,axiom,
% 0.30/0.48 ( ( p @ s )
% 0.30/0.48 | ( p @ t ) ) ).
% 0.30/0.48
% 0.30/0.48 thf(puv,axiom,
% 0.30/0.48 ( ~ ( p @ u )
% 0.30/0.48 | ~ ( p @ t ) ) ).
% 0.30/0.48
% 0.30/0.48 thf(st,axiom,
% 0.30/0.48 s = t ).
% 0.30/0.48
% 0.30/0.48 thf(tu,axiom,
% 0.30/0.48 t = u ).
% 0.30/0.48
% 0.30/0.48 %------------------------------------------------------------------------------
% 0.30/0.48 ------------------------
% 1.80/1.56 ---- Embedded in THF ---
% 1.80/1.56 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.80/1.56 %%% Generated on Tue Feb 24 14:32:27 EST 2026
% 1.80/1.56 %%% using '$$dhol' embedding, version 1.3.0.
% 1.80/1.56 %%% Logic specification used:
% 1.80/1.56 %%% thf(spec, logic, $$dhol).
% 1.80/1.56
% 1.80/1.56 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.6KM0aWBRAY/DTF2DTF20960.p
% See solution above
% 1.80/1.56 ------------------------
% 1.80/1.57 ---- Cleaned THF ---
% 1.80/1.57 thf(p,type,
% 1.80/1.57 p: $i > $o ).
% 1.80/1.57
% 1.80/1.57 thf(s,type,
% 1.80/1.57 s: $i ).
% 1.80/1.57
% 1.80/1.57 thf(t,type,
% 1.80/1.57 t: $i ).
% 1.80/1.57
% 1.80/1.57 thf(u,type,
% 1.80/1.57 u: $i ).
% 1.80/1.57
% 1.80/1.57 thf(pst,axiom,
% 1.80/1.57 ( ( p @ s )
% 1.80/1.57 | ( p @ t ) ) ).
% 1.80/1.57
% 1.80/1.57 thf(puv,axiom,
% 1.80/1.57 ( ~ ( p @ u )
% 1.80/1.57 | ~ ( p @ t ) ) ).
% 1.80/1.57
% 1.80/1.57 thf(st,axiom,
% 1.80/1.57 s = t ).
% 1.80/1.57
% 1.80/1.57 thf(tu,axiom,
% 1.80/1.57 t = u ).
% 1.80/1.57 ------------------------
% 1.80/1.59 % (21077)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_20960 for (3000ds/2Mi)
% 1.80/1.59 % (21079)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_20960 for (3000ds/18Mi)
% 1.80/1.59 % (21073)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_20960 for (3000ds/183Mi)
% 1.80/1.59 % (21075)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_20960 for (3000ds/27Mi)
% 1.80/1.59 % (21074)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_20960 for (3000ds/4Mi)
% 1.80/1.59 % (21078)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_20960 for (3000ds/275Mi)
% 1.80/1.59 % (21076)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_20960 for (3000ds/2Mi)
% 1.80/1.59 % (21079)First to succeed.
% 1.80/1.59 % (21077)Refutation not found, incomplete strategy
% 1.80/1.59 % (21077)------------------------------
% 1.80/1.59 % (21077)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.80/1.59 % (21077)Termination reason: Refutation not found, incomplete strategy
% 1.80/1.59
% 1.80/1.59
% 1.80/1.59 % (21077)Memory used [KB]: 5373
% 1.80/1.59 % (21077)Time elapsed: 0.002 s
% 1.80/1.59 % (21077)Instructions burned: 1 (million)
% 1.80/1.59 % (21077)------------------------------
% 1.80/1.59 % (21077)------------------------------
% 1.80/1.59 % (21078)Refutation not found, incomplete strategy
% 1.80/1.59 % (21078)------------------------------
% 1.80/1.59 % (21078)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.80/1.59 % (21078)Termination reason: Refutation not found, incomplete strategy
% 1.80/1.59
% 1.80/1.59
% 1.80/1.59 % (21078)Memory used [KB]: 5373
% 1.80/1.59 % (21078)Time elapsed: 0.002 s
% 1.80/1.59 % (21078)------------------------------
% 1.80/1.59 % (21078)------------------------------
% 1.80/1.59 % (21073)Also succeeded, but the first one will report.
% 1.80/1.59 % (21079)Refutation found. Thanks to Tanya!
% 1.80/1.59 % SZS status Unsatisfiable for DTF2THF_20960
% 1.80/1.59 % SZS output start Proof for DTF2THF_20960
% 1.80/1.59 thf(func_def_0, type, p: $i > $o).
% 1.80/1.59 thf(f20,plain,(
% 1.80/1.59 $false),
% 1.80/1.59 inference(subsumption_resolution,[status(thm)],[f18,f19])).
% 1.80/1.59 thf(f19,plain,(
% 1.80/1.59 ((p @ u) != $true)),
% 1.80/1.59 inference(duplicate_literal_removal,[status(thm)],[f17])).
% 1.80/1.59 thf(f17,plain,(
% 1.80/1.59 ((p @ u) != $true) | ((p @ u) != $true)),
% 1.80/1.59 inference(definition_unfolding,[status(thm)],[f12,f14])).
% 1.80/1.59 thf(f14,plain,(
% 1.80/1.59 (t = u)),
% 1.80/1.59 inference(cnf_transformation,[status(thm)],[f4])).
% 1.80/1.59 thf(f4,axiom,(
% 1.80/1.59 (t = u)),
% 1.80/1.59 file('/export/starexec/sandbox/tmp/tmp.6KM0aWBRAY/DTF2THF_20960.p',tu)).
% 1.80/1.59 thf(f12,plain,(
% 1.80/1.59 ((p @ u) != $true) | ((p @ t) != $true)),
% 1.80/1.59 inference(cnf_transformation,[status(thm)],[f10])).
% 1.80/1.59 thf(f10,plain,(
% 1.80/1.59 ((p @ u) != $true) | ((p @ t) != $true)),
% 1.80/1.59 inference(flattening,[status(thm)],[f7])).
% 1.80/1.59 thf(f7,plain,(
% 1.80/1.59 ~((p @ t) = $true) | ~((p @ u) = $true)),
% 1.80/1.59 inference(fool_elimination,[status(thm)],[f6])).
% 1.80/1.59 thf(f6,plain,(
% 1.80/1.59 ~(p @ t) | ~(p @ u)),
% 1.80/1.59 inference(rectify,[status(thm)],[f2])).
% 1.80/1.59 thf(f2,axiom,(
% 1.80/1.59 ~(p @ t) | ~(p @ u)),
% 1.80/1.59 file('/export/starexec/sandbox/tmp/tmp.6KM0aWBRAY/DTF2THF_20960.p',puv)).
% 1.80/1.59 thf(f18,plain,(
% 1.80/1.59 ((p @ u) = $true)),
% 1.80/1.59 inference(duplicate_literal_removal,[status(thm)],[f16])).
% 1.80/1.59 thf(f16,plain,(
% 1.80/1.59 ((p @ u) = $true) | ((p @ u) = $true)),
% 1.80/1.59 inference(definition_unfolding,[status(thm)],[f11,f15,f14])).
% 1.80/1.59 thf(f15,plain,(
% 1.80/1.59 (s = u)),
% 1.80/1.59 inference(definition_unfolding,[status(thm)],[f13,f14])).
% 1.80/1.59 thf(f13,plain,(
% 1.80/1.59 (s = t)),
% 1.80/1.59 inference(cnf_transformation,[status(thm)],[f3])).
% 1.80/1.59 thf(f3,axiom,(
% 1.80/1.59 (s = t)),
% 1.80/1.59 file('/export/starexec/sandbox/tmp/tmp.6KM0aWBRAY/DTF2THF_20960.p',st)).
% 1.80/1.59 thf(f11,plain,(
% 1.80/1.59 ((p @ s) = $true) | ((p @ t) = $true)),
% 1.80/1.59 inference(cnf_transformation,[status(thm)],[f9])).
% 1.80/1.59 thf(f9,plain,(
% 1.80/1.59 ((p @ s) = $true) | ((p @ t) = $true)),
% 1.80/1.59 inference(fool_elimination,[status(thm)],[f8])).
% 1.80/1.59 thf(f8,plain,(
% 1.80/1.59 (p @ s) | (p @ t)),
% 1.80/1.59 inference(rectify,[status(thm)],[f1])).
% 1.80/1.59 thf(f1,axiom,(
% 1.80/1.59 (p @ s) | (p @ t)),
% 1.80/1.59 file('/export/starexec/sandbox/tmp/tmp.6KM0aWBRAY/DTF2THF_20960.p',pst)).
% 1.80/1.59 % SZS output end Proof for DTF2THF_20960
% 1.80/1.59 % (21079)------------------------------
% 1.80/1.59 % (21079)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.80/1.59 % (21079)Termination reason: Refutation
% 1.80/1.59
% 1.80/1.59 % (21079)Memory used [KB]: 5373
% 1.80/1.59 % (21079)Time elapsed: 0.003 s
% 1.80/1.59 % (21079)Instructions burned: 1 (million)
% 1.80/1.59 % (21079)------------------------------
% 1.80/1.59 % (21079)------------------------------
% 1.80/1.59 % (21072)Success in time 0.018 s
%------------------------------------------------------------------------------