%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO190^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n020.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:37 AM UTC 2026
% Result : Theorem 1.26s 1.14s
% Output : Refutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 4 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 20 ( 7 fml; 13 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 2 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 13 ( 5 !; 8 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
tff(f11,plain,
$false,
inference(equality_resolution,[status(thm)],[f8]) ).
tff(f8,plain,
! [X0: $o] : ( $true != (X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
tff(f7,plain,
! [X0: $o,X1: $o] :
( ( $true != (X1) )
& ( $true != (X0) ) ),
inference(rectify,[status(thm)],[f6]) ).
tff(f6,plain,
! [X1: $o,X0: $o] :
( ( $true != (X0) )
& ( $true != (X1) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
tff(f5,plain,
~ ? [X1: $o,X0: $o] :
( ( $true = (X0) )
| ( $true = (X1) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
tff(f4,plain,
~ ? [X0: $o,X1: $o] :
( (X1)
| (X0) ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X1: $o,X0: $o] :
( (X0)
| (X1) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
? [X1: $o,X0: $o] :
( (X0)
| (X1) ),
file('/export/starexec/sandbox2/tmp/tmp.IEhgJ5zxhM/DTF2THF_29291.p',cCT15) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYO190^5 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.14 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Feb 24 14:25:57 EST 2026
% 0.13/0.33 % CPUTime :
% 0.13/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.43 ---- Original DTF file ---
% 0.15/0.43 thf(spec,logic,$$dhol).
% 0.15/0.43 %------------------------------------------------------------------------------
% 0.15/0.43 % File : SYO190^5 : TPTP v9.2.1. Released v4.0.0.
% 0.15/0.43 % Domain : Syntactic
% 0.15/0.43 % Problem : TPS problem CT15
% 0.15/0.43 % Version : Especial.
% 0.15/0.43 % English :
% 0.15/0.43
% 0.15/0.43 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.15/0.43 % Source : [Bro09]
% 0.15/0.43 % Names : tps_0015 [Bro09]
% 0.15/0.43 % : CT15 [TPS]
% 0.15/0.43
% 0.15/0.43 % Status : Theorem
% 0.15/0.43 % 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.15/0.43 % Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% 0.15/0.43 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.15/0.43 % Maximal formula atoms : 0 ( 0 avg)
% 0.15/0.43 % Number of connectives : 1 ( 0 ~; 1 |; 0 &; 0 @)
% 0.15/0.43 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.15/0.43 % Maximal formula depth : 4 ( 4 avg)
% 0.15/0.43 % Number of types : 1 ( 0 usr)
% 0.15/0.43 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.15/0.43 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.15/0.43 % Number of variables : 2 ( 0 ^; 0 !; 2 ?; 2 :)
% 0.15/0.43 % SPC : TH0_THM_NEQ_NAR
% 0.15/0.43
% 0.15/0.43 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.15/0.43 % project in the Department of Mathematical Sciences at Carnegie
% 0.15/0.43 % Mellon University. Distributed under the Creative Commons copyleft
% 0.15/0.43 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.15/0.43 %------------------------------------------------------------------------------
% 0.15/0.43 thf(cCT15,conjecture,
% 0.15/0.43 ? [Xx: $o,Xy: $o] :
% 0.15/0.43 ( Xx
% 0.15/0.43 | Xy ) ).
% 0.15/0.43
% 0.15/0.43 %------------------------------------------------------------------------------
% 0.15/0.43 ------------------------
% 1.07/1.11 ---- Embedded in THF ---
% 1.07/1.12 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.07/1.12 %%% Generated on Tue Feb 24 14:25:58 EST 2026
% 1.07/1.12 %%% using '$$dhol' embedding, version 1.3.0.
% 1.07/1.12 %%% Logic specification used:
% 1.07/1.12 %%% thf(spec, logic, $$dhol).
% 1.07/1.12
% 1.07/1.12 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.IEhgJ5zxhM/DTF2DTF29291.p
% See solution above
% 1.07/1.12 ------------------------
% 1.07/1.12 ---- Cleaned THF ---
% 1.07/1.12 thf(cCT15,conjecture,
% 1.07/1.12 ? [Xx: $o,Xy: $o] :
% 1.07/1.12 ( Xx
% 1.07/1.12 | Xy ) ).
% 1.07/1.13 ------------------------
% 1.26/1.14 % (29521)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_29291 for (3000ds/4Mi)
% 1.26/1.14 % (29522)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_29291 for (3000ds/27Mi)
% 1.26/1.14 % (29524)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_29291 for (3000ds/2Mi)
% 1.26/1.14 % (29521)First to succeed.
% 1.26/1.14 % (29524)Also succeeded, but the first one will report.
% 1.26/1.14 % (29522)Also succeeded, but the first one will report.
% 1.26/1.14 % (29521)Refutation found. Thanks to Tanya!
% 1.26/1.14 % SZS status Theorem for DTF2THF_29291
% 1.26/1.14 % SZS output start Proof for DTF2THF_29291
% 1.26/1.14 tff(f11,plain,(
% 1.26/1.14 $false),
% 1.26/1.14 inference(equality_resolution,[status(thm)],[f8])).
% 1.26/1.14 tff(f8,plain,(
% 1.26/1.14 ( ! [X0 : $o] : (($true != X0)) )),
% 1.26/1.14 inference(cnf_transformation,[status(thm)],[f7])).
% 1.26/1.14 tff(f7,plain,(
% 1.26/1.14 ! [X0 : $o,X1 : $o] : (($true != X1) & ($true != X0))),
% 1.26/1.14 inference(rectify,[status(thm)],[f6])).
% 1.26/1.14 tff(f6,plain,(
% 1.26/1.14 ! [X1 : $o,X0 : $o] : (($true != X0) & ($true != X1))),
% 1.26/1.14 inference(ennf_transformation,[status(thm)],[f5])).
% 1.26/1.14 tff(f5,plain,(
% 1.26/1.14 ~? [X1 : $o,X0 : $o] : (($true = X0) | ($true = X1))),
% 1.26/1.14 inference(fool_elimination,[status(thm)],[f4])).
% 1.26/1.14 tff(f4,plain,(
% 1.26/1.14 ~? [X0 : $o,X1 : $o] : (X1 | X0)),
% 1.26/1.14 inference(rectify,[status(thm)],[f2])).
% 1.26/1.14 tff(f2,negated_conjecture,(
% 1.26/1.14 ~? [X1 : $o,X0 : $o] : (X0 | X1)),
% 1.26/1.14 inference(negated_conjecture,[status(cth)],[f1])).
% 1.26/1.14 tff(f1,conjecture,(
% 1.26/1.14 ? [X1 : $o,X0 : $o] : (X0 | X1)),
% 1.26/1.14 file('/export/starexec/sandbox2/tmp/tmp.IEhgJ5zxhM/DTF2THF_29291.p',cCT15)).
% 1.26/1.14 % SZS output end Proof for DTF2THF_29291
% 1.26/1.14 % (29521)------------------------------
% 1.26/1.14 % (29521)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.26/1.14 % (29521)Termination reason: Refutation
% 1.26/1.14
% 1.26/1.14 % (29521)Memory used [KB]: 5373
% 1.26/1.14 % (29521)Time elapsed: 0.002 s
% 1.26/1.14 % (29521)------------------------------
% 1.26/1.14 % (29521)------------------------------
% 1.26/1.14 % (29517)Success in time 0.01 s
%------------------------------------------------------------------------------