%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO085^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:20 AM UTC 2026
% Result : Theorem 1.65s 1.45s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 175 ( 48 equ)
% Maximal formula atoms : 10 ( 10 avg)
% Number of connectives : 102 ( 39 ~; 33 |; 26 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 96 ( 96 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 5 usr; 7 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(f18,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f17,f13]) ).
tff(f13,plain,
s != $true,
inference(cnf_transformation,[status(thm)],[f8]) ).
tff(f8,plain,
( ( ( b != $true )
| ( s = $true )
| ( a != $true )
| ( c != $true )
| ( d != $true ) )
& ( s != $true )
& ( c = $true )
& ( d = $true )
& ( a = $true )
& ( b = $true ) ),
inference(flattening,[status(thm)],[f7]) ).
tff(f7,plain,
( ( c = $true )
& ( d = $true )
& ( b = $true )
& ( a = $true )
& ( s != $true )
& ( ( d != $true )
| ( c != $true )
| ( b != $true )
| ( a != $true )
| ( s = $true ) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
tff(f6,plain,
~ ( ( ~ ( ( d = $true )
& ( c = $true ) )
| ~ ( ( b = $true )
& ( a = $true ) )
| ( s = $true ) )
=> ( ~ ( ( c = $true )
& ( d = $true ) )
| ~ ( ( b = $true )
& ( a = $true ) )
| ( s = $true ) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
tff(f5,plain,
~ ( ( ~ ( a
& b )
| ~ ( c
& d )
| s )
=> ( s
| ~ ( c
& d )
| ~ ( b
& a ) ) ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ~ ( a
& b )
| ~ ( c
& d )
| s )
=> ( s
| ~ ( c
& d )
| ~ ( b
& a ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
( ( ~ ( a
& b )
| ~ ( c
& d )
| s )
=> ( s
| ~ ( c
& d )
| ~ ( b
& a ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JhKhVDbYMq/DTF2THF_11364.p',cCOM_DMG02) ).
tff(f17,plain,
s = $true,
inference(trivial_inequality_removal,[status(thm)],[f16]) ).
tff(f16,plain,
( ( s = $true )
| ( $true != $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f15]) ).
tff(f15,plain,
( ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( s = $true )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f14,f9,f10,f12,f11]) ).
tff(f11,plain,
d = $true,
inference(cnf_transformation,[status(thm)],[f8]) ).
tff(f12,plain,
c = $true,
inference(cnf_transformation,[status(thm)],[f8]) ).
tff(f10,plain,
a = $true,
inference(cnf_transformation,[status(thm)],[f8]) ).
tff(f9,plain,
b = $true,
inference(cnf_transformation,[status(thm)],[f8]) ).
tff(f14,plain,
( ( b != $true )
| ( s = $true )
| ( a != $true )
| ( c != $true )
| ( d != $true ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO085^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.12 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.33 % Computer : n026.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 14:24:10 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.29/0.49 ---- Original DTF file ---
% 0.29/0.49 thf(spec,logic,$$dhol).
% 0.29/0.49 %------------------------------------------------------------------------------
% 0.29/0.49 % File : SYO085^5 : TPTP v9.2.1. Released v4.0.0.
% 0.29/0.49 % Domain : Syntactic
% 0.29/0.49 % Problem : TPS problem COM-DMG02
% 0.29/0.49 % Version : Especial.
% 0.29/0.49 % English : A propositional problem suggested by Jay Hunschel Kim.
% 0.29/0.49
% 0.29/0.49 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.29/0.49 % Source : [Bro09]
% 0.29/0.49 % Names : tps_0119 [Bro09]
% 0.29/0.49 % : COM-DMG02 [TPS]
% 0.29/0.49
% 0.29/0.49 % Status : Theorem
% 0.29/0.49 % Rating : 0.00 v6.2.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.29/0.49 % Syntax : Number of formulae : 6 ( 0 unt; 5 typ; 0 def)
% 0.29/0.49 % Number of atoms : 10 ( 0 equ; 0 cnn)
% 0.29/0.49 % Maximal formula atoms : 10 ( 10 avg)
% 0.29/0.49 % Number of connectives : 13 ( 4 ~; 4 |; 4 &; 0 @)
% 0.29/0.49 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.29/0.49 % Maximal formula depth : 6 ( 6 avg)
% 0.29/0.49 % Number of types : 1 ( 0 usr)
% 0.29/0.49 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.29/0.49 % Number of symbols : 5 ( 5 usr; 5 con; 0-0 aty)
% 0.29/0.49 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.29/0.49 % SPC : TH0_THM_NEQ_NAR
% 0.29/0.49
% 0.29/0.49 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.29/0.49 % project in the Department of Mathematical Sciences at Carnegie
% 0.29/0.49 % Mellon University. Distributed under the Creative Commons copyleft
% 0.29/0.49 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.29/0.49 %------------------------------------------------------------------------------
% 0.29/0.49 thf(d,type,
% 0.29/0.49 d: $o ).
% 0.29/0.49
% 0.29/0.49 thf(c,type,
% 0.29/0.49 c: $o ).
% 0.29/0.49
% 0.29/0.49 thf(b,type,
% 0.29/0.49 b: $o ).
% 0.29/0.49
% 0.29/0.49 thf(a,type,
% 0.29/0.49 a: $o ).
% 0.29/0.49
% 0.29/0.49 thf(s,type,
% 0.29/0.49 s: $o ).
% 0.29/0.49
% 0.29/0.49 thf(cCOM_DMG02,conjecture,
% 0.29/0.49 ( ( ~ ( c
% 0.29/0.49 & d )
% 0.29/0.49 | ~ ( a
% 0.29/0.49 & b )
% 0.29/0.49 | s )
% 0.29/0.49 => ( s
% 0.29/0.49 | ~ ( a
% 0.29/0.49 & b )
% 0.29/0.49 | ~ ( c
% 0.29/0.49 & d ) ) ) ).
% 0.29/0.49
% 0.29/0.49 %------------------------------------------------------------------------------
% 0.29/0.49 ------------------------
% 1.65/1.42 ---- Embedded in THF ---
% 1.65/1.42 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.65/1.42 %%% Generated on Tue Feb 24 14:24:11 EST 2026
% 1.65/1.42 %%% using '$$dhol' embedding, version 1.3.0.
% 1.65/1.42 %%% Logic specification used:
% 1.65/1.42 %%% thf(spec, logic, $$dhol).
% 1.65/1.42
% 1.65/1.42 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.JhKhVDbYMq/DTF2DTF11364.p
% See solution above
% 1.65/1.42 ------------------------
% 1.65/1.43 ---- Cleaned THF ---
% 1.65/1.43 thf(d,type,
% 1.65/1.43 d: $o ).
% 1.65/1.43
% 1.65/1.43 thf(c,type,
% 1.65/1.43 c: $o ).
% 1.65/1.43
% 1.65/1.43 thf(b,type,
% 1.65/1.43 b: $o ).
% 1.65/1.43
% 1.65/1.43 thf(a,type,
% 1.65/1.43 a: $o ).
% 1.65/1.43
% 1.65/1.43 thf(s,type,
% 1.65/1.43 s: $o ).
% 1.65/1.43
% 1.65/1.43 thf(cCOM_DMG02,conjecture,
% 1.65/1.43 ( ( ~ ( c
% 1.65/1.43 & d )
% 1.65/1.43 | ~ ( a
% 1.65/1.43 & b )
% 1.65/1.43 | s )
% 1.65/1.43 => ( s
% 1.65/1.43 | ~ ( a
% 1.65/1.43 & b )
% 1.65/1.43 | ~ ( c
% 1.65/1.43 & d ) ) ) ).
% 1.65/1.43 ------------------------
% 1.65/1.45 % (11469)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_11364 for (3000ds/183Mi)
% 1.65/1.45 % (11471)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_11364 for (3000ds/27Mi)
% 1.65/1.45 % (11472)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_11364 for (3000ds/2Mi)
% 1.65/1.45 % (11474)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_11364 for (3000ds/275Mi)
% 1.65/1.45 % (11470)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_11364 for (3000ds/4Mi)
% 1.65/1.45 % (11475)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_11364 for (3000ds/18Mi)
% 1.65/1.45 % (11474)First to succeed.
% 1.65/1.45 % (11475)Also succeeded, but the first one will report.
% 1.65/1.45 % (11473)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_11364 for (3000ds/2Mi)
% 1.65/1.45 % (11472)Also succeeded, but the first one will report.
% 1.65/1.45 % (11474)Refutation found. Thanks to Tanya!
% 1.65/1.45 % SZS status Theorem for DTF2THF_11364
% 1.65/1.45 % SZS output start Proof for DTF2THF_11364
% 1.65/1.45 tff(f18,plain,(
% 1.65/1.45 $false),
% 1.65/1.45 inference(subsumption_resolution,[status(thm)],[f17,f13])).
% 1.65/1.45 tff(f13,plain,(
% 1.65/1.45 (s != $true)),
% 1.65/1.45 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.45 tff(f8,plain,(
% 1.65/1.45 ((b != $true) | (s = $true) | (a != $true) | (c != $true) | (d != $true)) & (s != $true) & (c = $true) & (d = $true) & (a = $true) & (b = $true)),
% 1.65/1.45 inference(flattening,[status(thm)],[f7])).
% 1.65/1.45 tff(f7,plain,(
% 1.65/1.45 (((c = $true) & (d = $true)) & ((b = $true) & (a = $true)) & (s != $true)) & (((d != $true) | (c != $true)) | ((b != $true) | (a != $true)) | (s = $true))),
% 1.65/1.45 inference(ennf_transformation,[status(thm)],[f6])).
% 1.65/1.45 tff(f6,plain,(
% 1.65/1.45 ~((~((d = $true) & (c = $true)) | ~((b = $true) & (a = $true)) | (s = $true)) => (~((c = $true) & (d = $true)) | ~((b = $true) & (a = $true)) | (s = $true)))),
% 1.65/1.45 inference(fool_elimination,[status(thm)],[f5])).
% 1.65/1.45 tff(f5,plain,(
% 1.65/1.45 ~((~(a & b) | ~(c & d) | s) => (s | ~(c & d) | ~(b & a)))),
% 1.65/1.45 inference(rectify,[status(thm)],[f2])).
% 1.65/1.45 tff(f2,negated_conjecture,(
% 1.65/1.45 ~((~(a & b) | ~(c & d) | s) => (s | ~(c & d) | ~(b & a)))),
% 1.65/1.45 inference(negated_conjecture,[status(cth)],[f1])).
% 1.65/1.45 tff(f1,conjecture,(
% 1.65/1.45 (~(a & b) | ~(c & d) | s) => (s | ~(c & d) | ~(b & a))),
% 1.65/1.45 file('/export/starexec/sandbox/tmp/tmp.JhKhVDbYMq/DTF2THF_11364.p',cCOM_DMG02)).
% 1.65/1.45 tff(f17,plain,(
% 1.65/1.45 (s = $true)),
% 1.65/1.45 inference(trivial_inequality_removal,[status(thm)],[f16])).
% 1.65/1.45 tff(f16,plain,(
% 1.65/1.45 (s = $true) | ($true != $true)),
% 1.65/1.45 inference(duplicate_literal_removal,[status(thm)],[f15])).
% 1.65/1.45 tff(f15,plain,(
% 1.65/1.45 ($true != $true) | ($true != $true) | ($true != $true) | (s = $true) | ($true != $true)),
% 1.65/1.45 inference(definition_unfolding,[status(thm)],[f14,f9,f10,f12,f11])).
% 1.65/1.45 tff(f11,plain,(
% 1.65/1.45 (d = $true)),
% 1.65/1.45 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.45 tff(f12,plain,(
% 1.65/1.45 (c = $true)),
% 1.65/1.45 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.45 tff(f10,plain,(
% 1.65/1.45 (a = $true)),
% 1.65/1.45 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.45 tff(f9,plain,(
% 1.65/1.45 (b = $true)),
% 1.65/1.45 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.45 tff(f14,plain,(
% 1.65/1.45 (b != $true) | (s = $true) | (a != $true) | (c != $true) | (d != $true)),
% 1.65/1.45 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.45 % SZS output end Proof for DTF2THF_11364
% 1.65/1.45 % (11474)------------------------------
% 1.65/1.45 % (11474)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.45 % (11474)Termination reason: Refutation
% 1.65/1.45
% 1.65/1.45 % (11474)Memory used [KB]: 5373
% 1.65/1.45 % (11474)Time elapsed: 0.002 s
% 1.65/1.45 % (11474)Instructions burned: 1 (million)
% 1.65/1.45 % (11474)------------------------------
% 1.65/1.45 % (11474)------------------------------
% 1.65/1.45 % (11468)Success in time 0.018 s
%------------------------------------------------------------------------------