%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYN989^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n009.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:51:40 AM UTC 2026
% Result : Theorem 1.48s 1.27s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 38 ( 15 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 25 ( 15 ~; 5 |; 4 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 36 ( 22 fml; 14 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 3 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 7 ( 5 !; 2 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
tff(f14,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f13]) ).
tff(f13,plain,
$true != $true,
inference(definition_unfolding,[status(thm)],[f12,f11]) ).
tff(f11,plain,
sK0 = $true,
inference(cnf_transformation,[status(thm)],[f10]) ).
tff(f10,plain,
( ( sK0 != $true )
& ( sK0 = $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
tff(f9,plain,
( ? [X0: $o] :
( ( $true != (X0) )
& ( $true = (X0) ) )
=> ( ( sK0 != $true )
& ( sK0 = $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
tff(f8,plain,
? [X0: $o] :
( ( $true != (X0) )
& ( $true = (X0) ) ),
inference(ennf_transformation,[status(thm)],[f7]) ).
tff(f7,plain,
~ ! [X0: $o] :
( ( $true != (X0) )
| ( $true = (X0) ) ),
inference(flattening,[status(thm)],[f6]) ).
tff(f6,plain,
~ ! [X0: $o] :
( ( $true = (X0) )
| ( $true != (X0) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
tff(f5,plain,
~ ! [X0: $o] :
( (X0)
| ~ (X0) ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $o] :
( (X0)
| ~ (X0) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
! [X0: $o] :
( (X0)
| ~ (X0) ),
file('/export/starexec/sandbox2/tmp/tmp.3j4q9c3iyV/DTF2THF_15008.p',thm) ).
tff(f12,plain,
sK0 != $true,
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN989^1 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n009.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:20:55 EST 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.18/0.45 ---- Original DTF file ---
% 0.18/0.45 thf(spec,logic,$$dhol).
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 % File : SYN989^1 : TPTP v9.2.1. Released v3.7.0.
% 0.18/0.45 % Domain : Syntactic
% 0.18/0.45 % Problem : All things are true or false
% 0.18/0.45 % Version : Especial.
% 0.18/0.45 % English :
% 0.18/0.45
% 0.18/0.45 % Refs :
% 0.18/0.45 % Source : [TPTP]
% 0.18/0.45 % Names :
% 0.18/0.45
% 0.18/0.45 % Status : Theorem
% 0.18/0.45 % Rating : 0.08 v9.1.0, 0.00 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v3.7.0
% 0.18/0.45 % Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% 0.18/0.45 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.18/0.45 % Maximal formula atoms : 0 ( 0 avg)
% 0.18/0.45 % Number of connectives : 2 ( 1 ~; 1 |; 0 &; 0 @)
% 0.18/0.45 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.18/0.45 % Maximal formula depth : 4 ( 4 avg)
% 0.18/0.45 % Number of types : 1 ( 0 usr)
% 0.18/0.45 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.18/0.45 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.18/0.45 % Number of variables : 1 ( 0 ^; 1 !; 0 ?; 1 :)
% 0.18/0.45 % SPC : TH0_THM_NEQ_NAR
% 0.18/0.45
% 0.18/0.45 % Comments :
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 thf(thm,conjecture,
% 0.18/0.45 ! [X: $o] :
% 0.18/0.45 ( X
% 0.18/0.45 | ~ X ) ).
% 0.18/0.45
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 ------------------------
% 1.48/1.24 ---- Embedded in THF ---
% 1.48/1.24 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.24 %%% Generated on Tue Feb 24 14:20:56 EST 2026
% 1.48/1.24 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.24 %%% Logic specification used:
% 1.48/1.24 %%% thf(spec, logic, $$dhol).
% 1.48/1.24
% 1.48/1.24 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.3j4q9c3iyV/DTF2DTF15008.p
% See solution above
% 1.48/1.24 ------------------------
% 1.48/1.25 ---- Cleaned THF ---
% 1.48/1.25 thf(thm,conjecture,
% 1.48/1.25 ! [X: $o] :
% 1.48/1.25 ( X
% 1.48/1.25 | ~ X ) ).
% 1.48/1.25 ------------------------
% 1.48/1.26 % (15126)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_15008 for (3000ds/2Mi)
% 1.48/1.26 % (15126)First to succeed.
% 1.48/1.27 % (15126)Refutation found. Thanks to Tanya!
% 1.48/1.27 % SZS status Theorem for DTF2THF_15008
% 1.48/1.27 % SZS output start Proof for DTF2THF_15008
% 1.48/1.27 tff(f14,plain,(
% 1.48/1.27 $false),
% 1.48/1.27 inference(trivial_inequality_removal,[status(thm)],[f13])).
% 1.48/1.27 tff(f13,plain,(
% 1.48/1.27 ($true != $true)),
% 1.48/1.27 inference(definition_unfolding,[status(thm)],[f12,f11])).
% 1.48/1.27 tff(f11,plain,(
% 1.48/1.27 (sK0 = $true)),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f10])).
% 1.48/1.27 tff(f10,plain,(
% 1.48/1.27 (sK0 != $true) & (sK0 = $true)),
% 1.48/1.27 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 1.48/1.27 tff(f9,plain,(
% 1.48/1.27 ? [X0 : $o] : (($true != X0) & ($true = X0)) => ((sK0 != $true) & (sK0 = $true))),
% 1.48/1.27 introduced(definition,[],[choice_axiom])).
% 1.48/1.27 tff(f8,plain,(
% 1.48/1.27 ? [X0 : $o] : (($true != X0) & ($true = X0))),
% 1.48/1.27 inference(ennf_transformation,[status(thm)],[f7])).
% 1.48/1.27 tff(f7,plain,(
% 1.48/1.27 ~! [X0 : $o] : (($true != X0) | ($true = X0))),
% 1.48/1.27 inference(flattening,[status(thm)],[f6])).
% 1.48/1.27 tff(f6,plain,(
% 1.48/1.27 ~! [X0 : $o] : (($true = X0) | ~($true = X0))),
% 1.48/1.27 inference(fool_elimination,[status(thm)],[f5])).
% 1.48/1.27 tff(f5,plain,(
% 1.48/1.27 ~! [X0 : $o] : (X0 | ~X0)),
% 1.48/1.27 inference(rectify,[status(thm)],[f2])).
% 1.48/1.27 tff(f2,negated_conjecture,(
% 1.48/1.27 ~! [X0 : $o] : (X0 | ~X0)),
% 1.48/1.27 inference(negated_conjecture,[status(cth)],[f1])).
% 1.48/1.27 tff(f1,conjecture,(
% 1.48/1.27 ! [X0 : $o] : (X0 | ~X0)),
% 1.48/1.27 file('/export/starexec/sandbox2/tmp/tmp.3j4q9c3iyV/DTF2THF_15008.p',thm)).
% 1.48/1.27 tff(f12,plain,(
% 1.48/1.27 (sK0 != $true)),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f10])).
% 1.48/1.27 % SZS output end Proof for DTF2THF_15008
% 1.48/1.27 % (15126)------------------------------
% 1.48/1.27 % (15126)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.27 % (15126)Termination reason: Refutation
% 1.48/1.27
% 1.48/1.27 % (15126)Memory used [KB]: 5373
% 1.48/1.27 % (15126)Time elapsed: 0.002 s
% 1.48/1.27 % (15126)------------------------------
% 1.48/1.27 % (15126)------------------------------
% 1.48/1.27 % (15122)Success in time 0.001 s
%------------------------------------------------------------------------------