%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO255^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 : n026.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:46 AM UTC 2026
% Result : Theorem 1.49s 1.26s
% Output : Refutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 3 unt; 0 typ; 1 def)
% Number of atoms : 109 ( 33 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 109 ( 26 ~; 12 |; 12 &; 49 @)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 ^; 21 !; 11 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cP: $i > $o ).
thf(func_def_5,type,
sK0: ( $i > $o ) > $i ).
thf(func_def_8,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f37,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f31,f36]) ).
thf(f36,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[status(thm)],[f35]) ).
thf(f35,plain,
( $false
| ~ spl1_1 ),
inference(trivial_inequality_removal,[status(thm)],[f32]) ).
thf(f32,plain,
( ( $true != $true )
| ~ spl1_1 ),
inference(superposition,[status(thm)],[f30,f12]) ).
thf(f12,plain,
( ( cP @ a )
= $true ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ( cP @ a )
= $true )
& ! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
!= $true )
| ( ( $true
!= ( cP @ ( sK0 @ X0 ) ) )
& ( $true
= ( X0 @ ( sK0 @ X0 ) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
thf(f8,plain,
! [X0: $i > $o] :
( ? [X2: $i] :
( ( ( cP @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
=> ( ( $true
!= ( cP @ ( sK0 @ X0 ) ) )
& ( $true
= ( X0 @ ( sK0 @ X0 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
( ( ( cP @ a )
= $true )
& ! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
!= $true )
| ? [X2: $i] :
( ( ( cP @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) ) ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,plain,
( ( ( cP @ a )
= $true )
& ! [X0: $i > $o] :
( ! [X2: $i] :
( ( X0 @ X2 )
!= $true )
| ? [X1: $i] :
( ( ( cP @ X1 )
!= $true )
& ( ( X0 @ X1 )
= $true ) ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ( cP @ a )
= $true )
=> ? [X0: $i > $o] :
( ! [X1: $i] :
( ( ( X0 @ X1 )
= $true )
=> ( ( cP @ X1 )
= $true ) )
& ? [X2: $i] :
( ( X0 @ X2 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( cP @ a )
=> ? [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
=> ( cP @ X1 ) )
& ? [X2: $i] : ( X0 @ X2 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( cP @ a )
=> ? [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
=> ( cP @ X1 ) )
& ? [X2: $i] : ( X0 @ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( cP @ a )
=> ? [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
=> ( cP @ X1 ) )
& ? [X2: $i] : ( X0 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.OZ2Qsu7Q27/DTF2THF_21388.p',cBLEDSOE3) ).
thf(f30,plain,
( ! [X0: $i] :
( $true
!= ( cP @ X0 ) )
| ~ spl1_1 ),
inference(avatar_component_clause,[status(thm)],[f29]) ).
thf(f29,definition,
( spl1_1
<=> ! [X0: $i] :
( $true
!= ( cP @ X0 ) ) ),
introduced(definition,[new_symbols(naming,[spl1_1])],[avatar_definition]) ).
thf(f31,plain,
( spl1_1
| spl1_1 ),
inference(avatar_split_clause,[status(thm)],[f26,f29,f29]) ).
thf(f26,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( cP @ X0 ) )
| ( ( cP @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f25]) ).
thf(f25,plain,
! [X0: $i,X1: $i] :
( ( $true != $true )
| ( $true
!= ( cP @ X0 ) )
| ( ( cP @ X1 )
!= $true ) ),
inference(superposition,[status(thm)],[f11,f10]) ).
thf(f10,plain,
! [X0: $i > $o,X1: $i] :
( ( $true
= ( X0 @ ( sK0 @ X0 ) ) )
| ( ( X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f11,plain,
! [X0: $i > $o,X1: $i] :
( ( $true
!= ( cP @ ( sK0 @ X0 ) ) )
| ( ( X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO255^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.34 % Computer : n026.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % 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:27:10 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.29/0.46 ---- Original DTF file ---
% 0.29/0.46 thf(spec,logic,$$dhol).
% 0.29/0.46 %------------------------------------------------------------------------------
% 0.29/0.46 % File : SYO255^5 : TPTP v9.2.1. Released v4.0.0.
% 0.29/0.46 % Domain : Syntactic
% 0.29/0.46 % Problem : TPS problem BLEDSOE3
% 0.29/0.46 % Version : Especial.
% 0.29/0.46 % English :
% 0.29/0.46
% 0.29/0.46 % Refs : [BF93] Bledsoe & Feng (1993), SET-VAR
% 0.29/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.29/0.46 % Source : [Bro09]
% 0.29/0.46 % Names : tps_0096 [Bro09]
% 0.29/0.46 % : BLEDSOE3 [TPS]
% 0.29/0.46 % : Example 3 [BF93]
% 0.29/0.46
% 0.29/0.46 % Status : Theorem
% 0.29/0.46 % Rating : 0.00 v8.1.0, 0.08 v7.4.0, 0.00 v6.2.0, 0.33 v6.1.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.29/0.46 % Syntax : Number of formulae : 3 ( 0 unt; 2 typ; 0 def)
% 0.29/0.46 % Number of atoms : 2 ( 0 equ; 0 cnn)
% 0.29/0.46 % Maximal formula atoms : 2 ( 2 avg)
% 0.29/0.46 % Number of connectives : 7 ( 0 ~; 0 |; 1 &; 4 @)
% 0.29/0.46 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.29/0.46 % Maximal formula depth : 7 ( 7 avg)
% 0.29/0.46 % Number of types : 2 ( 0 usr)
% 0.29/0.46 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.29/0.46 % Number of symbols : 2 ( 2 usr; 1 con; 0-1 aty)
% 0.29/0.46 % Number of variables : 3 ( 0 ^; 1 !; 2 ?; 3 :)
% 0.29/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.29/0.46
% 0.29/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.29/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.29/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.29/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.29/0.46 %------------------------------------------------------------------------------
% 0.29/0.46 thf(cP,type,
% 0.29/0.46 cP: $i > $o ).
% 0.29/0.46
% 0.29/0.46 thf(a,type,
% 0.29/0.46 a: $i ).
% 0.29/0.46
% 0.29/0.46 thf(cBLEDSOE3,conjecture,
% 0.29/0.46 ( ( cP @ a )
% 0.29/0.46 => ? [A: $i > $o] :
% 0.29/0.46 ( ! [Xx: $i] :
% 0.29/0.46 ( ( A @ Xx )
% 0.29/0.46 => ( cP @ Xx ) )
% 0.29/0.46 & ? [Xy: $i] : ( A @ Xy ) ) ) ).
% 0.29/0.46
% 0.29/0.46 %------------------------------------------------------------------------------
% 0.29/0.46 ------------------------
% 1.49/1.23 ---- Embedded in THF ---
% 1.49/1.23 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.49/1.23 %%% Generated on Tue Feb 24 14:27:11 EST 2026
% 1.49/1.23 %%% using '$$dhol' embedding, version 1.3.0.
% 1.49/1.23 %%% Logic specification used:
% 1.49/1.23 %%% thf(spec, logic, $$dhol).
% 1.49/1.23
% 1.49/1.23 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.OZ2Qsu7Q27/DTF2DTF21388.p
% See solution above
% 1.49/1.23 ------------------------
% 1.49/1.24 ---- Cleaned THF ---
% 1.49/1.25 thf(cP,type,
% 1.49/1.25 cP: $i > $o ).
% 1.49/1.25
% 1.49/1.25 thf(a,type,
% 1.49/1.25 a: $i ).
% 1.49/1.25
% 1.49/1.25 thf(cBLEDSOE3,conjecture,
% 1.49/1.25 ( ( cP @ a )
% 1.49/1.25 => ? [A: $i > $o] :
% 1.49/1.25 ( ! [Xx: $i] :
% 1.49/1.25 ( ( A @ Xx )
% 1.49/1.25 => ( cP @ Xx ) )
% 1.49/1.25 & ? [Xy: $i] : ( A @ Xy ) ) ) ).
% 1.49/1.25 ------------------------
% 1.49/1.26 % (21674)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_21388 for (2999ds/275Mi)
% 1.49/1.26 % (21672)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_21388 for (2999ds/2Mi)
% 1.49/1.26 % (21672)Instruction limit reached!
% 1.49/1.26 % (21672)------------------------------
% 1.49/1.26 % (21672)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.26 % (21672)Termination reason: Unknown
% 1.49/1.26 % (21672)Termination phase: Saturation
% 1.49/1.26
% 1.49/1.26 % (21672)Memory used [KB]: 5500
% 1.49/1.26 % (21672)Time elapsed: 0.002 s
% 1.49/1.26 % (21672)Instructions burned: 2 (million)
% 1.49/1.26 % (21672)------------------------------
% 1.49/1.26 % (21672)------------------------------
% 1.49/1.26 % (21674)First to succeed.
% 1.49/1.26 % (21674)Refutation found. Thanks to Tanya!
% 1.49/1.26 % SZS status Theorem for DTF2THF_21388
% 1.49/1.26 % SZS output start Proof for DTF2THF_21388
% 1.49/1.26 thf(func_def_0, type, cP: $i > $o).
% 1.49/1.26 thf(func_def_5, type, sK0: ($i > $o) > $i).
% 1.49/1.26 thf(func_def_8, type, ph2: !>[X0: $tType]:(X0)).
% 1.49/1.26 thf(f37,plain,(
% 1.49/1.26 $false),
% 1.49/1.26 inference(avatar_sat_refutation,[status(thm)],[f31,f36])).
% 1.49/1.26 thf(f36,plain,(
% 1.49/1.26 ~spl1_1),
% 1.49/1.26 inference(avatar_contradiction_clause,[status(thm)],[f35])).
% 1.49/1.26 thf(f35,plain,(
% 1.49/1.26 $false | ~spl1_1),
% 1.49/1.26 inference(trivial_inequality_removal,[status(thm)],[f32])).
% 1.49/1.26 thf(f32,plain,(
% 1.49/1.26 ($true != $true) | ~spl1_1),
% 1.49/1.26 inference(superposition,[status(thm)],[f30,f12])).
% 1.49/1.26 thf(f12,plain,(
% 1.49/1.26 ((cP @ a) = $true)),
% 1.49/1.26 inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.26 thf(f9,plain,(
% 1.49/1.26 ((cP @ a) = $true) & ! [X0 : $i > $o] : (! [X1 : $i] : ((X0 @ X1) != $true) | (($true != (cP @ (sK0 @ X0))) & ($true = (X0 @ (sK0 @ X0)))))),
% 1.49/1.26 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 1.49/1.26 thf(f8,plain,(
% 1.49/1.26 ! [X0 : $i > $o] : (? [X2 : $i] : (((cP @ X2) != $true) & ((X0 @ X2) = $true)) => (($true != (cP @ (sK0 @ X0))) & ($true = (X0 @ (sK0 @ X0)))))),
% 1.49/1.26 introduced(definition,[],[choice_axiom])).
% 1.49/1.26 thf(f7,plain,(
% 1.49/1.26 ((cP @ a) = $true) & ! [X0 : $i > $o] : (! [X1 : $i] : ((X0 @ X1) != $true) | ? [X2 : $i] : (((cP @ X2) != $true) & ((X0 @ X2) = $true)))),
% 1.49/1.26 inference(rectify,[status(thm)],[f6])).
% 1.49/1.26 thf(f6,plain,(
% 1.49/1.26 ((cP @ a) = $true) & ! [X0 : $i > $o] : (! [X2 : $i] : ((X0 @ X2) != $true) | ? [X1 : $i] : (((cP @ X1) != $true) & ((X0 @ X1) = $true)))),
% 1.49/1.26 inference(ennf_transformation,[status(thm)],[f5])).
% 1.49/1.26 thf(f5,plain,(
% 1.49/1.26 ~(((cP @ a) = $true) => ? [X0 : $i > $o] : (! [X1 : $i] : (((X0 @ X1) = $true) => ((cP @ X1) = $true)) & ? [X2 : $i] : ((X0 @ X2) = $true)))),
% 1.49/1.26 inference(fool_elimination,[status(thm)],[f4])).
% 1.49/1.26 thf(f4,plain,(
% 1.49/1.26 ~((cP @ a) => ? [X0 : $i > $o] : (! [X1 : $i] : ((X0 @ X1) => (cP @ X1)) & ? [X2 : $i] : (X0 @ X2)))),
% 1.49/1.26 inference(rectify,[status(thm)],[f2])).
% 1.49/1.26 thf(f2,negated_conjecture,(
% 1.49/1.26 ~((cP @ a) => ? [X0 : $i > $o] : (! [X1 : $i] : ((X0 @ X1) => (cP @ X1)) & ? [X2 : $i] : (X0 @ X2)))),
% 1.49/1.26 inference(negated_conjecture,[status(cth)],[f1])).
% 1.49/1.26 thf(f1,conjecture,(
% 1.49/1.26 (cP @ a) => ? [X0 : $i > $o] : (! [X1 : $i] : ((X0 @ X1) => (cP @ X1)) & ? [X2 : $i] : (X0 @ X2))),
% 1.49/1.26 file('/export/starexec/sandbox/tmp/tmp.OZ2Qsu7Q27/DTF2THF_21388.p',cBLEDSOE3)).
% 1.49/1.26 thf(f30,plain,(
% 1.49/1.26 ( ! [X0 : $i] : (($true != (cP @ X0))) ) | ~spl1_1),
% 1.49/1.26 inference(avatar_component_clause,[status(thm)],[f29])).
% 1.49/1.26 thf(f29,definition,(
% 1.49/1.26 spl1_1 <=> ! [X0 : $i] : ($true != (cP @ X0))),
% 1.49/1.26 introduced(definition,[new_symbols(naming,[spl1_1])],[avatar_definition])).
% 1.49/1.26 thf(f31,plain,(
% 1.49/1.26 spl1_1 | spl1_1),
% 1.49/1.26 inference(avatar_split_clause,[status(thm)],[f26,f29,f29])).
% 1.49/1.26 thf(f26,plain,(
% 1.49/1.26 ( ! [X0 : $i,X1 : $i] : (($true != (cP @ X0)) | ((cP @ X1) != $true)) )),
% 1.49/1.26 inference(trivial_inequality_removal,[status(thm)],[f25])).
% 1.49/1.26 thf(f25,plain,(
% 1.49/1.26 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ($true != (cP @ X0)) | ((cP @ X1) != $true)) )),
% 1.49/1.26 inference(superposition,[status(thm)],[f11,f10])).
% 1.49/1.26 thf(f10,plain,(
% 1.49/1.26 ( ! [X0 : $i > $o,X1 : $i] : (($true = (X0 @ (sK0 @ X0))) | ((X0 @ X1) != $true)) )),
% 1.49/1.26 inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.26 thf(f11,plain,(
% 1.49/1.26 ( ! [X0 : $i > $o,X1 : $i] : (($true != (cP @ (sK0 @ X0))) | ((X0 @ X1) != $true)) )),
% 1.49/1.26 inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.26 % SZS output end Proof for DTF2THF_21388
% 1.49/1.26 % (21674)------------------------------
% 1.49/1.26 % (21674)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.26 % (21674)Termination reason: Refutation
% 1.49/1.26
% 1.49/1.26 % (21674)Memory used [KB]: 5500
% 1.49/1.26 % (21674)Time elapsed: 0.003 s
% 1.49/1.26 % (21674)Instructions burned: 1 (million)
% 1.49/1.26 % (21674)------------------------------
% 1.49/1.26 % (21674)------------------------------
% 1.49/1.26 % (21668)Success in time 0.012 s
%------------------------------------------------------------------------------