%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO198^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 : n003.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:38 AM UTC 2026
% Result : Theorem 1.53s 1.31s
% Output : Refutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 48 ( 17 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 50 ( 18 ~; 7 |; 4 &; 20 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 2 ^; 13 !; 8 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_6,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f16,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f15]) ).
thf(f15,plain,
$true != $true,
inference(duplicate_literal_removal,[status(thm)],[f14]) ).
thf(f14,plain,
( ( $true != $true )
| ( $true != $true ) ),
inference(beta_eta_normalization,[status(thm)],[f11]) ).
thf(f11,plain,
( ( $true
!= ( ^ [Y0: $o] : $true
@ sK1 ) )
| ( ( ^ [Y0: $o] : $true
@ sK0 )
!= $true ) ),
inference(primitive_instantiation,[status(thm)],[f9]) ).
thf(f9,plain,
! [X2: $o > $o] :
( ( ( X2 @ sK1 )
!= $true )
| ( ( X2 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
! [X2: $o > $o] :
( ( ( X2 @ sK1 )
!= $true )
| ( ( X2 @ sK0 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( ( X2 @ X1 )
!= $true )
| ( ( X2 @ X0 )
!= $true ) )
=> ! [X2: $o > $o] :
( ( ( X2 @ sK1 )
!= $true )
| ( ( X2 @ sK0 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
? [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( ( X2 @ X1 )
!= $true )
| ( ( X2 @ X0 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: $o,X1: $o] :
? [X2: $o > $o] :
( ( ( X2 @ X0 )
= $true )
& ( ( X2 @ X1 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: $o,X1: $o] :
? [X2: $o > $o] :
( ( X2 @ X0 )
& ( X2 @ X1 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: $o,X0: $o] :
? [X2: $o > $o] :
( ( X2 @ X1 )
& ( X2 @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: $o,X0: $o] :
? [X2: $o > $o] :
( ( X2 @ X1 )
& ( X2 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.v1iKFU2hxP/DTF2THF_4302.p',cCT8) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO198^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.29 % Computer : n003.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % 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 14:26:10 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.16/0.39 ---- Original DTF file ---
% 0.16/0.39 thf(spec,logic,$$dhol).
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 % File : SYO198^5 : TPTP v9.2.1. Released v4.0.0.
% 0.16/0.39 % Domain : Syntactic
% 0.16/0.39 % Problem : TPS problem CT8
% 0.16/0.39 % Version : Especial.
% 0.16/0.39 % English :
% 0.16/0.39
% 0.16/0.39 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.16/0.39 % Source : [Bro09]
% 0.16/0.39 % Names : tps_0038 [Bro09]
% 0.16/0.39 % : CT8 [TPS]
% 0.16/0.39
% 0.16/0.39 % Status : Theorem
% 0.16/0.39 % Rating : 0.08 v9.1.0, 0.12 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.17 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.2.0, 0.33 v6.1.0, 0.17 v6.0.0, 0.00 v4.0.1, 0.33 v4.0.0
% 0.16/0.39 % Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% 0.16/0.39 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.16/0.39 % Maximal formula atoms : 0 ( 0 avg)
% 0.16/0.39 % Number of connectives : 3 ( 0 ~; 0 |; 1 &; 2 @)
% 0.16/0.39 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.16/0.39 % Maximal formula depth : 6 ( 6 avg)
% 0.16/0.39 % Number of types : 1 ( 0 usr)
% 0.16/0.39 % Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% 0.16/0.39 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.16/0.39 % Number of variables : 3 ( 0 ^; 2 !; 1 ?; 3 :)
% 0.16/0.39 % SPC : TH0_THM_NEQ_NAR
% 0.16/0.39
% 0.16/0.39 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.16/0.39 % project in the Department of Mathematical Sciences at Carnegie
% 0.16/0.39 % Mellon University. Distributed under the Creative Commons copyleft
% 0.16/0.39 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 thf(cCT8,conjecture,
% 0.16/0.39 ! [Xx: $o,Xy: $o] :
% 0.16/0.39 ? [Xp: $o > $o] :
% 0.16/0.39 ( ( Xp @ Xx )
% 0.16/0.39 & ( Xp @ Xy ) ) ).
% 0.16/0.39
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 ------------------------
% 1.37/1.27 ---- Embedded in THF ---
% 1.37/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.37/1.28 %%% Generated on Tue Feb 24 14:26:11 EST 2026
% 1.37/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.37/1.28 %%% Logic specification used:
% 1.37/1.28 %%% thf(spec, logic, $$dhol).
% 1.37/1.28
% 1.37/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.v1iKFU2hxP/DTF2DTF4302.p
% See solution above
% 1.37/1.28 ------------------------
% 1.37/1.28 ---- Cleaned THF ---
% 1.37/1.29 thf(cCT8,conjecture,
% 1.37/1.29 ! [Xx: $o,Xy: $o] :
% 1.37/1.29 ? [Xp: $o > $o] :
% 1.37/1.29 ( ( Xp @ Xx )
% 1.37/1.29 & ( Xp @ Xy ) ) ).
% 1.37/1.29 ------------------------
% 1.53/1.30 % (4400)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_4302 for (3000ds/4Mi)
% 1.53/1.30 % (4404)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_4302 for (3000ds/275Mi)
% 1.53/1.30 % (4399)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_4302 for (3000ds/183Mi)
% 1.53/1.30 % (4402)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_4302 for (3000ds/2Mi)
% 1.53/1.30 % (4401)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_4302 for (3000ds/27Mi)
% 1.53/1.30 % (4403)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_4302 for (3000ds/2Mi)
% 1.53/1.31 % (4405)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_4302 for (3000ds/18Mi)
% 1.53/1.31 % (4404)First to succeed.
% 1.53/1.31 % (4401)Refutation not found, incomplete strategy
% 1.53/1.31 % (4401)------------------------------
% 1.53/1.31 % (4401)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.31 % (4402)Instruction limit reached!
% 1.53/1.31 % (4402)------------------------------
% 1.53/1.31 % (4402)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.31 % (4401)Termination reason: Refutation not found, incomplete strategy
% 1.53/1.31
% 1.53/1.31
% 1.53/1.31 % (4401)Memory used [KB]: 5373
% 1.53/1.31 % (4401)Time elapsed: 0.003 s
% 1.53/1.31 % (4401)Instructions burned: 1 (million)
% 1.53/1.31 % (4401)------------------------------
% 1.53/1.31 % (4401)------------------------------
% 1.53/1.31 % (4402)Termination reason: Unknown
% 1.53/1.31 % (4403)Instruction limit reached!
% 1.53/1.31 % (4403)------------------------------
% 1.53/1.31 % (4403)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.31 % (4403)Termination reason: Unknown
% 1.53/1.31 % (4403)Termination phase: Saturation
% 1.53/1.31
% 1.53/1.31 % (4403)Memory used [KB]: 5500
% 1.53/1.31 % (4403)Time elapsed: 0.003 s
% 1.53/1.31 % (4403)Instructions burned: 2 (million)
% 1.53/1.31 % (4403)------------------------------
% 1.53/1.31 % (4403)------------------------------
% 1.53/1.31 % (4402)Termination phase: Saturation
% 1.53/1.31
% 1.53/1.31 % (4402)Memory used [KB]: 5500
% 1.53/1.31 % (4402)Time elapsed: 0.003 s
% 1.53/1.31 % (4402)Instructions burned: 2 (million)
% 1.53/1.31 % (4402)------------------------------
% 1.53/1.31 % (4402)------------------------------
% 1.53/1.31 % (4400)Also succeeded, but the first one will report.
% 1.53/1.31 % (4404)Refutation found. Thanks to Tanya!
% 1.53/1.31 % SZS status Theorem for DTF2THF_4302
% 1.53/1.31 % SZS output start Proof for DTF2THF_4302
% 1.53/1.31 thf(func_def_6, type, ph3: !>[X0: $tType]:(X0)).
% 1.53/1.31 thf(f16,plain,(
% 1.53/1.31 $false),
% 1.53/1.31 inference(trivial_inequality_removal,[status(thm)],[f15])).
% 1.53/1.31 thf(f15,plain,(
% 1.53/1.31 ($true != $true)),
% 1.53/1.31 inference(duplicate_literal_removal,[status(thm)],[f14])).
% 1.53/1.31 thf(f14,plain,(
% 1.53/1.31 ($true != $true) | ($true != $true)),
% 1.53/1.31 inference(beta_eta_normalization,[status(thm)],[f11])).
% 1.53/1.31 thf(f11,plain,(
% 1.53/1.31 ($true != ((^[Y0 : $o]: ($true)) @ sK1)) | (((^[Y0 : $o]: ($true)) @ sK0) != $true)),
% 1.53/1.31 inference(primitive_instantiation,[status(thm)],[f9])).
% 1.53/1.31 thf(f9,plain,(
% 1.53/1.31 ( ! [X2 : $o > $o] : (((X2 @ sK1) != $true) | ((X2 @ sK0) != $true)) )),
% 1.53/1.31 inference(cnf_transformation,[status(thm)],[f8])).
% 1.53/1.31 thf(f8,plain,(
% 1.53/1.31 ! [X2 : $o > $o] : (((X2 @ sK1) != $true) | ((X2 @ sK0) != $true))),
% 1.53/1.31 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7])).
% 1.53/1.31 thf(f7,plain,(
% 1.53/1.31 ? [X0 : $o,X1 : $o] : ! [X2 : $o > $o] : (((X2 @ X1) != $true) | ((X2 @ X0) != $true)) => ! [X2 : $o > $o] : (((X2 @ sK1) != $true) | ((X2 @ sK0) != $true))),
% 1.53/1.31 introduced(definition,[],[choice_axiom])).
% 1.53/1.31 thf(f6,plain,(
% 1.53/1.31 ? [X0 : $o,X1 : $o] : ! [X2 : $o > $o] : (((X2 @ X1) != $true) | ((X2 @ X0) != $true))),
% 1.53/1.31 inference(ennf_transformation,[status(thm)],[f5])).
% 1.53/1.31 thf(f5,plain,(
% 1.53/1.31 ~! [X0 : $o,X1 : $o] : ? [X2 : $o > $o] : (((X2 @ X0) = $true) & ((X2 @ X1) = $true))),
% 1.53/1.31 inference(fool_elimination,[status(thm)],[f4])).
% 1.53/1.31 thf(f4,plain,(
% 1.53/1.31 ~! [X0 : $o,X1 : $o] : ? [X2 : $o > $o] : ((X2 @ X0) & (X2 @ X1))),
% 1.53/1.31 inference(rectify,[status(thm)],[f2])).
% 1.53/1.31 thf(f2,negated_conjecture,(
% 1.53/1.31 ~! [X1 : $o,X0 : $o] : ? [X2 : $o > $o] : ((X2 @ X1) & (X2 @ X0))),
% 1.53/1.31 inference(negated_conjecture,[status(cth)],[f1])).
% 1.53/1.31 thf(f1,conjecture,(
% 1.53/1.31 ! [X1 : $o,X0 : $o] : ? [X2 : $o > $o] : ((X2 @ X1) & (X2 @ X0))),
% 1.53/1.31 file('/export/starexec/sandbox/tmp/tmp.v1iKFU2hxP/DTF2THF_4302.p',cCT8)).
% 1.53/1.31 % SZS output end Proof for DTF2THF_4302
% 1.53/1.31 % (4404)------------------------------
% 1.53/1.31 % (4404)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.31 % (4404)Termination reason: Refutation
% 1.53/1.31
% 1.53/1.31 % (4404)Memory used [KB]: 5373
% 1.53/1.31 % (4404)Time elapsed: 0.003 s
% 1.53/1.31 % (4404)Instructions burned: 1 (million)
% 1.53/1.31 % (4404)------------------------------
% 1.53/1.31 % (4404)------------------------------
% 1.53/1.31 % (4398)Success in time 0.017 s
%------------------------------------------------------------------------------