%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO499^1 : 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 : n016.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:54:22 AM UTC 2026
% Result : Theorem 1.66s 1.49s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 73 ( 7 unt; 0 typ; 9 def)
% Number of atoms : 363 ( 89 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 254 ( 64 ~; 98 |; 5 &; 78 @)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 14 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_3,type,
f: $o > $i ).
thf(func_def_4,type,
f1: $o > $i ).
thf(func_def_5,type,
f2: $o > $i ).
thf(func_def_6,type,
g: $o > $i ).
thf(func_def_7,type,
g1: $o > $i ).
thf(func_def_8,type,
g2: $o > $i ).
thf(func_def_13,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f118,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f26,f35,f47,f52,f60,f61,f65,f66,f74,f82,f91,f101,f109,f114,f117]) ).
thf(f117,plain,
( spl0_1
| spl0_6
| spl0_7 ),
inference(avatar_contradiction_clause,[status(thm)],[f116]) ).
thf(f116,plain,
( $false
| spl0_1
| spl0_6
| spl0_7 ),
inference(subsumption_resolution,[status(thm)],[f115,f41]) ).
thf(f41,plain,
( ( b != $true )
| spl0_6 ),
inference(avatar_component_clause,[status(thm)],[f40]) ).
thf(f40,definition,
( spl0_6
<=> ( b = $true ) ),
introduced(definition,[new_symbols(naming,[spl0_6])],[avatar_definition]) ).
thf(f115,plain,
( ( b = $true )
| spl0_1
| spl0_7 ),
inference(subsumption_resolution,[status(thm)],[f72,f16]) ).
thf(f16,plain,
( ( a != $true )
| spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f15]) ).
thf(f15,definition,
( spl0_1
<=> ( a = $true ) ),
introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).
thf(f72,plain,
( ( a = $true )
| ( b = $true )
| spl0_7 ),
inference(binary_proxy_clausification,[status(thm)],[f71]) ).
thf(f71,plain,
( ( a != b )
| spl0_7 ),
inference(equality_resolution,[status(thm)],[f46]) ).
thf(f46,plain,
( ( ( f @ a )
!= ( f @ b ) )
| spl0_7 ),
inference(avatar_component_clause,[status(thm)],[f44]) ).
thf(f44,definition,
( spl0_7
<=> ( ( f @ a )
= ( f @ b ) ) ),
introduced(definition,[new_symbols(naming,[spl0_7])],[avatar_definition]) ).
thf(f114,plain,
( spl0_8
| spl0_4
| spl0_9 ),
inference(avatar_split_clause,[status(thm)],[f113,f57,f28,f49]) ).
thf(f49,definition,
( spl0_8
<=> ( b = $false ) ),
introduced(definition,[new_symbols(naming,[spl0_8])],[avatar_definition]) ).
thf(f28,definition,
( spl0_4
<=> ( c = $false ) ),
introduced(definition,[new_symbols(naming,[spl0_4])],[avatar_definition]) ).
thf(f57,definition,
( spl0_9
<=> ( ( f2 @ b )
= ( f2 @ c ) ) ),
introduced(definition,[new_symbols(naming,[spl0_9])],[avatar_definition]) ).
thf(f113,plain,
( ( b = $false )
| spl0_4
| spl0_9 ),
inference(subsumption_resolution,[status(thm)],[f81,f29]) ).
thf(f29,plain,
( ( c != $false )
| spl0_4 ),
inference(avatar_component_clause,[status(thm)],[f28]) ).
thf(f81,plain,
( ( b = $false )
| ( c = $false )
| spl0_9 ),
inference(binary_proxy_clausification,[status(thm)],[f79]) ).
thf(f79,plain,
( ( b != c )
| spl0_9 ),
inference(equality_resolution,[status(thm)],[f59]) ).
thf(f59,plain,
( ( ( f2 @ b )
!= ( f2 @ c ) )
| spl0_9 ),
inference(avatar_component_clause,[status(thm)],[f57]) ).
thf(f109,plain,
( ~ spl0_1
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[status(thm)],[f108]) ).
thf(f108,plain,
( $false
| ~ spl0_1
| ~ spl0_5 ),
inference(trivial_inequality_removal,[status(thm)],[f103]) ).
thf(f103,plain,
( ( $false = $true )
| ~ spl0_1
| ~ spl0_5 ),
inference(superposition,[status(thm)],[f17,f34]) ).
thf(f34,plain,
( ( a = $false )
| ~ spl0_5 ),
inference(avatar_component_clause,[status(thm)],[f32]) ).
thf(f32,definition,
( spl0_5
<=> ( a = $false ) ),
introduced(definition,[new_symbols(naming,[spl0_5])],[avatar_definition]) ).
thf(f17,plain,
( ( a = $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f15]) ).
thf(f101,plain,
( ~ spl0_6
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[status(thm)],[f100]) ).
thf(f100,plain,
( $false
| ~ spl0_6
| ~ spl0_8 ),
inference(trivial_inequality_removal,[status(thm)],[f93]) ).
thf(f93,plain,
( ( $false = $true )
| ~ spl0_6
| ~ spl0_8 ),
inference(superposition,[status(thm)],[f42,f51]) ).
thf(f51,plain,
( ( b = $false )
| ~ spl0_8 ),
inference(avatar_component_clause,[status(thm)],[f49]) ).
thf(f42,plain,
( ( b = $true )
| ~ spl0_6 ),
inference(avatar_component_clause,[status(thm)],[f40]) ).
thf(f91,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[status(thm)],[f90]) ).
thf(f90,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(trivial_inequality_removal,[status(thm)],[f85]) ).
thf(f85,plain,
( ( $false = $true )
| ~ spl0_2
| ~ spl0_4 ),
inference(superposition,[status(thm)],[f30,f21]) ).
thf(f21,plain,
( ( c = $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f19]) ).
thf(f19,definition,
( spl0_2
<=> ( c = $true ) ),
introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).
thf(f30,plain,
( ( c = $false )
| ~ spl0_4 ),
inference(avatar_component_clause,[status(thm)],[f28]) ).
thf(f82,plain,
( spl0_2
| spl0_6
| spl0_9 ),
inference(avatar_split_clause,[status(thm)],[f80,f57,f40,f19]) ).
thf(f80,plain,
( ( c = $true )
| ( b = $true )
| spl0_9 ),
inference(binary_proxy_clausification,[status(thm)],[f79]) ).
thf(f74,plain,
( spl0_5
| spl0_8
| spl0_7 ),
inference(avatar_split_clause,[status(thm)],[f73,f44,f49,f32]) ).
thf(f73,plain,
( ( b = $false )
| ( a = $false )
| spl0_7 ),
inference(binary_proxy_clausification,[status(thm)],[f71]) ).
thf(f66,plain,
( spl0_5
| spl0_4
| spl0_3 ),
inference(avatar_split_clause,[status(thm)],[f64,f23,f28,f32]) ).
thf(f23,definition,
( spl0_3
<=> ( ( f1 @ a )
= ( f1 @ c ) ) ),
introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition]) ).
thf(f64,plain,
( ( a = $false )
| ( c = $false )
| spl0_3 ),
inference(binary_proxy_clausification,[status(thm)],[f62]) ).
thf(f62,plain,
( ( a != c )
| spl0_3 ),
inference(equality_resolution,[status(thm)],[f25]) ).
thf(f25,plain,
( ( ( f1 @ a )
!= ( f1 @ c ) )
| spl0_3 ),
inference(avatar_component_clause,[status(thm)],[f23]) ).
thf(f65,plain,
( spl0_2
| spl0_1
| spl0_3 ),
inference(avatar_split_clause,[status(thm)],[f63,f23,f15,f19]) ).
thf(f63,plain,
( ( c = $true )
| ( a = $true )
| spl0_3 ),
inference(binary_proxy_clausification,[status(thm)],[f62]) ).
thf(f61,plain,
( ~ spl0_9
| spl0_4
| spl0_8 ),
inference(avatar_split_clause,[status(thm)],[f55,f49,f28,f57]) ).
thf(f55,plain,
( ( b = $false )
| ( ( f2 @ b )
!= ( f2 @ c ) )
| ( c = $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f53]) ).
thf(f53,plain,
( ( b != c )
| ( ( f2 @ b )
!= ( f2 @ c ) ) ),
inference(constrained_superposition,[status(thm)],[f6,f10]) ).
thf(f10,plain,
( ( f2 @ c )
= ( g2 @ b ) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
thf(f4,plain,
( ( ( f2 @ c )
= ( g2 @ b ) )
& ( ( f @ b )
= ( g @ a ) )
& ( ( f1 @ a )
!= ( g1 @ c ) )
& ( ( f1 @ c )
= ( g1 @ a ) )
& ( ( f2 @ b )
!= ( g2 @ c ) )
& ( ( f @ a )
!= ( g @ b ) ) ),
inference(ennf_transformation,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ( f @ a )
= ( g @ b ) )
| ( ( f2 @ b )
= ( g2 @ c ) )
| ( ( f @ b )
!= ( g @ a ) )
| ( ( f1 @ a )
= ( g1 @ c ) )
| ( ( f2 @ c )
!= ( g2 @ b ) )
| ( ( f1 @ c )
!= ( g1 @ a ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ( f @ a )
= ( g @ b ) )
| ( ( f2 @ b )
= ( g2 @ c ) )
| ( ( f @ b )
!= ( g @ a ) )
| ( ( f1 @ a )
= ( g1 @ c ) )
| ( ( f2 @ c )
!= ( g2 @ b ) )
| ( ( f1 @ c )
!= ( g1 @ a ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EhqIuTtR11/DTF2THF_30618.p',con) ).
thf(f6,plain,
( ( f2 @ b )
!= ( g2 @ c ) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
thf(f60,plain,
( spl0_2
| spl0_6
| ~ spl0_9 ),
inference(avatar_split_clause,[status(thm)],[f54,f57,f40,f19]) ).
thf(f54,plain,
( ( b = $true )
| ( c = $true )
| ( ( f2 @ b )
!= ( f2 @ c ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f53]) ).
thf(f52,plain,
( ~ spl0_7
| spl0_5
| spl0_8 ),
inference(avatar_split_clause,[status(thm)],[f38,f49,f32,f44]) ).
thf(f38,plain,
( ( ( f @ a )
!= ( f @ b ) )
| ( a = $false )
| ( b = $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f36]) ).
thf(f36,plain,
( ( ( f @ a )
!= ( f @ b ) )
| ( a != b ) ),
inference(constrained_superposition,[status(thm)],[f5,f9]) ).
thf(f9,plain,
( ( f @ b )
= ( g @ a ) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
thf(f5,plain,
( ( f @ a )
!= ( g @ b ) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
thf(f47,plain,
( spl0_6
| ~ spl0_7
| spl0_1 ),
inference(avatar_split_clause,[status(thm)],[f37,f15,f44,f40]) ).
thf(f37,plain,
( ( ( f @ a )
!= ( f @ b ) )
| ( a = $true )
| ( b = $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f36]) ).
thf(f35,plain,
( spl0_4
| spl0_5
| ~ spl0_3 ),
inference(avatar_split_clause,[status(thm)],[f13,f23,f32,f28]) ).
thf(f13,plain,
( ( a = $false )
| ( ( f1 @ a )
!= ( f1 @ c ) )
| ( c = $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
thf(f11,plain,
( ( a != c )
| ( ( f1 @ a )
!= ( f1 @ c ) ) ),
inference(constrained_superposition,[status(thm)],[f8,f7]) ).
thf(f7,plain,
( ( f1 @ c )
= ( g1 @ a ) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
thf(f8,plain,
( ( f1 @ a )
!= ( g1 @ c ) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
thf(f26,plain,
( spl0_1
| spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[status(thm)],[f12,f23,f19,f15]) ).
thf(f12,plain,
( ( a = $true )
| ( ( f1 @ a )
!= ( f1 @ c ) )
| ( c = $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYO499^1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.13/0.31 % Computer : n016.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 300
% 0.13/0.31 % DateTime : Tue Feb 24 14:33:06 EST 2026
% 0.13/0.31 % CPUTime :
% 0.13/0.31 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.19/0.42 ---- Original DTF file ---
% 0.19/0.42 thf(spec,logic,$$dhol).
% 0.19/0.42 %------------------------------------------------------------------------------
% 0.19/0.42 % File : SYO499^1 : TPTP v9.2.1. Released v4.0.0.
% 0.19/0.42 % Domain : Syntactic
% 0.19/0.42 % Problem : Explosive confrontation
% 0.19/0.42 % Version : Especial.
% 0.19/0.42 % English : The Mensa Example: There are not 3 distinct values of type $o.
% 0.19/0.42
% 0.19/0.42 % Refs : [BS09a] Brown & Smolka (2009), Terminating Tableaux for the Ba
% 0.19/0.42 % : [BS09b] Brown E. & Smolka (2009), Extended First-Order Logic
% 0.19/0.42 % : [Smo09] Smolka (2009), Email to Chris Benzmueller
% 0.19/0.42 % : [Bro09] Brown E. (2009), Email to Geoff Sutcliffe
% 0.19/0.42 % Source : [Smo09]
% 0.19/0.42 % Names : Example 3.3 [BS09a]
% 0.19/0.42 % : basic8 [Bro09]
% 0.19/0.42
% 0.19/0.42 % Status : Theorem
% 0.19/0.42 % Rating : 0.00 v9.0.0, 0.10 v8.2.0, 0.08 v8.1.0, 0.09 v7.5.0, 0.14 v7.4.0, 0.22 v7.2.0, 0.12 v7.1.0, 0.25 v7.0.0, 0.29 v6.4.0, 0.33 v6.3.0, 0.40 v6.2.0, 0.29 v6.0.0, 0.43 v5.5.0, 0.33 v5.4.0, 0.40 v5.3.0, 0.60 v4.1.0, 0.67 v4.0.0
% 0.19/0.42 % Syntax : Number of formulae : 10 ( 0 unt; 9 typ; 0 def)
% 0.19/0.42 % Number of atoms : 18 ( 6 equ; 0 cnn)
% 0.19/0.42 % Maximal formula atoms : 6 ( 18 avg)
% 0.19/0.42 % Number of connectives : 20 ( 3 ~; 5 |; 0 &; 12 @)
% 0.19/0.42 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.19/0.42 % Maximal formula depth : 7 ( 7 avg)
% 0.19/0.42 % Number of types : 2 ( 0 usr)
% 0.19/0.42 % Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% 0.19/0.42 % Number of symbols : 10 ( 9 usr; 3 con; 0-2 aty)
% 0.19/0.42 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.19/0.42 % SPC : TH0_THM_EQU_NAR
% 0.19/0.42
% 0.19/0.42 % Comments : The fragment of simple type theory that restricts equations to
% 0.19/0.42 % base types and disallows lambda abstraction and quantification is
% 0.19/0.42 % decidable. This is an example.
% 0.19/0.42 %------------------------------------------------------------------------------
% 0.19/0.42 thf(a,type,
% 0.19/0.42 a: $o ).
% 0.19/0.42
% 0.19/0.42 thf(b,type,
% 0.19/0.42 b: $o ).
% 0.19/0.42
% 0.19/0.42 thf(c,type,
% 0.19/0.42 c: $o ).
% 0.19/0.42
% 0.19/0.42 thf(f,type,
% 0.19/0.42 f: $o > $i ).
% 0.19/0.42
% 0.19/0.42 thf(f1,type,
% 0.19/0.42 f1: $o > $i ).
% 0.19/0.42
% 0.19/0.42 thf(f2,type,
% 0.19/0.42 f2: $o > $i ).
% 0.19/0.42
% 0.19/0.42 thf(g,type,
% 0.19/0.42 g: $o > $i ).
% 0.19/0.42
% 0.19/0.42 thf(g1,type,
% 0.19/0.42 g1: $o > $i ).
% 0.19/0.42
% 0.19/0.42 thf(g2,type,
% 0.19/0.42 g2: $o > $i ).
% 0.19/0.42
% 0.19/0.42 thf(con,conjecture,
% 0.19/0.42 ( ( ( f @ a )
% 0.19/0.42 = ( g @ b ) )
% 0.19/0.42 | ( ( f @ b )
% 0.19/0.42 != ( g @ a ) )
% 0.19/0.42 | ( ( f1 @ a )
% 0.19/0.42 = ( g1 @ c ) )
% 0.19/0.42 | ( ( f1 @ c )
% 0.19/0.42 != ( g1 @ a ) )
% 0.19/0.42 | ( ( f2 @ b )
% 0.19/0.42 = ( g2 @ c ) )
% 0.19/0.42 | ( ( f2 @ c )
% 0.19/0.42 != ( g2 @ b ) ) ) ).
% 0.19/0.42
% 0.19/0.42 %------------------------------------------------------------------------------
% 0.19/0.42 ------------------------
% 1.66/1.45 ---- Embedded in THF ---
% 1.66/1.45 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.66/1.45 %%% Generated on Tue Feb 24 14:33:07 EST 2026
% 1.66/1.45 %%% using '$$dhol' embedding, version 1.3.0.
% 1.66/1.45 %%% Logic specification used:
% 1.66/1.45 %%% thf(spec, logic, $$dhol).
% 1.66/1.45
% 1.66/1.45 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.EhqIuTtR11/DTF2DTF30618.p
% See solution above
% 1.66/1.45 ------------------------
% 1.66/1.46 ---- Cleaned THF ---
% 1.66/1.46 thf(a,type,
% 1.66/1.46 a: $o ).
% 1.66/1.46
% 1.66/1.46 thf(b,type,
% 1.66/1.46 b: $o ).
% 1.66/1.46
% 1.66/1.46 thf(c,type,
% 1.66/1.46 c: $o ).
% 1.66/1.46
% 1.66/1.46 thf(f,type,
% 1.66/1.46 f: $o > $i ).
% 1.66/1.46
% 1.66/1.46 thf(f1,type,
% 1.66/1.46 f1: $o > $i ).
% 1.66/1.46
% 1.66/1.46 thf(f2,type,
% 1.66/1.46 f2: $o > $i ).
% 1.66/1.46
% 1.66/1.46 thf(g,type,
% 1.66/1.46 g: $o > $i ).
% 1.66/1.46
% 1.66/1.46 thf(g1,type,
% 1.66/1.46 g1: $o > $i ).
% 1.66/1.46
% 1.66/1.46 thf(g2,type,
% 1.66/1.46 g2: $o > $i ).
% 1.66/1.46
% 1.66/1.46 thf(con,conjecture,
% 1.66/1.46 ( ( ( f @ a )
% 1.66/1.46 = ( g @ b ) )
% 1.66/1.46 | ( ( f @ b )
% 1.66/1.46 != ( g @ a ) )
% 1.66/1.46 | ( ( f1 @ a )
% 1.66/1.46 = ( g1 @ c ) )
% 1.66/1.46 | ( ( f1 @ c )
% 1.66/1.46 != ( g1 @ a ) )
% 1.66/1.46 | ( ( f2 @ b )
% 1.66/1.46 = ( g2 @ c ) )
% 1.66/1.46 | ( ( f2 @ c )
% 1.66/1.46 != ( g2 @ b ) ) ) ).
% 1.66/1.46 ------------------------
% 1.66/1.48 % (30717)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_30618 for (2999ds/27Mi)
% 1.66/1.48 % (30718)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_30618 for (2999ds/2Mi)
% 1.66/1.48 % (30721)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_30618 for (2999ds/18Mi)
% 1.66/1.48 % (30720)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_30618 for (2999ds/275Mi)
% 1.66/1.48 % (30716)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_30618 for (2999ds/4Mi)
% 1.66/1.48 % (30720)Refutation not found, incomplete strategy
% 1.66/1.48 % (30720)------------------------------
% 1.66/1.48 % (30720)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.66/1.48 % (30718)Refutation not found, incomplete strategy
% 1.66/1.48 % (30718)------------------------------
% 1.66/1.48 % (30718)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.66/1.48 % (30718)Termination reason: Refutation not found, incomplete strategy
% 1.66/1.48
% 1.66/1.48
% 1.66/1.48 % (30718)Memory used [KB]: 5500
% 1.66/1.48 % (30718)Time elapsed: 0.003 s
% 1.66/1.48 % (30718)Instructions burned: 1 (million)
% 1.66/1.48 % (30718)------------------------------
% 1.66/1.48 % (30718)------------------------------
% 1.66/1.48 % (30720)Termination reason: Refutation not found, incomplete strategy
% 1.66/1.48
% 1.66/1.48
% 1.66/1.48 % (30720)Memory used [KB]: 5500
% 1.66/1.48 % (30720)Time elapsed: 0.003 s
% 1.66/1.48 % (30717)Refutation not found, incomplete strategy
% 1.66/1.48 % (30717)------------------------------
% 1.66/1.48 % (30717)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.66/1.48 % (30717)Termination reason: Refutation not found, incomplete strategy
% 1.66/1.48
% 1.66/1.48
% 1.66/1.48 % (30717)Memory used [KB]: 5500
% 1.66/1.48 % (30717)Time elapsed: 0.003 s
% 1.66/1.48 % (30717)Instructions burned: 1 (million)
% 1.66/1.48 % (30717)------------------------------
% 1.66/1.48 % (30717)------------------------------
% 1.66/1.48 % (30720)Instructions burned: 1 (million)
% 1.66/1.48 % (30720)------------------------------
% 1.66/1.48 % (30720)------------------------------
% 1.66/1.48 % (30719)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_30618 for (2999ds/2Mi)
% 1.66/1.48 % (30715)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_30618 for (2999ds/183Mi)
% 1.66/1.49 % (30716)Instruction limit reached!
% 1.66/1.49 % (30716)------------------------------
% 1.66/1.49 % (30716)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.66/1.49 % (30716)Termination reason: Unknown
% 1.66/1.49 % (30716)Termination phase: Saturation
% 1.66/1.49
% 1.66/1.49 % (30716)Memory used [KB]: 5500
% 1.66/1.49 % (30716)Time elapsed: 0.005 s
% 1.66/1.49 % (30716)Instructions burned: 4 (million)
% 1.66/1.49 % (30716)------------------------------
% 1.66/1.49 % (30716)------------------------------
% 1.66/1.49 % (30719)Instruction limit reached!
% 1.66/1.49 % (30719)------------------------------
% 1.66/1.49 % (30719)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.66/1.49 % (30719)Termination reason: Unknown
% 1.66/1.49 % (30719)Termination phase: Saturation
% 1.66/1.49
% 1.66/1.49 % (30719)Memory used [KB]: 5373
% 1.66/1.49 % (30719)Time elapsed: 0.003 s
% 1.66/1.49 % (30719)Instructions burned: 2 (million)
% 1.66/1.49 % (30719)------------------------------
% 1.66/1.49 % (30719)------------------------------
% 1.66/1.49 % (30721)Refutation not found, incomplete strategy
% 1.66/1.49 % (30721)------------------------------
% 1.66/1.49 % (30721)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.66/1.49 % (30721)Termination reason: Refutation not found, incomplete strategy
% 1.66/1.49
% 1.66/1.49
% 1.66/1.49 % (30721)Memory used [KB]: 5500
% 1.66/1.49 % (30721)Time elapsed: 0.006 s
% 1.66/1.49 % (30721)Instructions burned: 5 (million)
% 1.66/1.49 % (30721)------------------------------
% 1.66/1.49 % (30721)------------------------------
% 1.66/1.49 % (30715)First to succeed.
% 1.66/1.49 % (30715)Refutation found. Thanks to Tanya!
% 1.66/1.49 % SZS status Theorem for DTF2THF_30618
% 1.66/1.49 % SZS output start Proof for DTF2THF_30618
% 1.66/1.49 thf(func_def_3, type, f: $o > $i).
% 1.66/1.49 thf(func_def_4, type, f1: $o > $i).
% 1.66/1.49 thf(func_def_5, type, f2: $o > $i).
% 1.66/1.49 thf(func_def_6, type, g: $o > $i).
% 1.66/1.49 thf(func_def_7, type, g1: $o > $i).
% 1.66/1.49 thf(func_def_8, type, g2: $o > $i).
% 1.66/1.49 thf(func_def_13, type, ph1: !>[X0: $tType]:(X0)).
% 1.66/1.49 thf(f118,plain,(
% 1.66/1.49 $false),
% 1.66/1.49 inference(avatar_sat_refutation,[status(thm)],[f26,f35,f47,f52,f60,f61,f65,f66,f74,f82,f91,f101,f109,f114,f117])).
% 1.66/1.49 thf(f117,plain,(
% 1.66/1.49 spl0_1 | spl0_6 | spl0_7),
% 1.66/1.49 inference(avatar_contradiction_clause,[status(thm)],[f116])).
% 1.66/1.49 thf(f116,plain,(
% 1.66/1.49 $false | (spl0_1 | spl0_6 | spl0_7)),
% 1.66/1.49 inference(subsumption_resolution,[status(thm)],[f115,f41])).
% 1.66/1.49 thf(f41,plain,(
% 1.66/1.49 (b != $true) | spl0_6),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f40])).
% 1.66/1.49 thf(f40,definition,(
% 1.66/1.49 spl0_6 <=> (b = $true)),
% 1.66/1.49 introduced(definition,[new_symbols(naming,[spl0_6])],[avatar_definition])).
% 1.66/1.49 thf(f115,plain,(
% 1.66/1.49 (b = $true) | (spl0_1 | spl0_7)),
% 1.66/1.49 inference(subsumption_resolution,[status(thm)],[f72,f16])).
% 1.66/1.49 thf(f16,plain,(
% 1.66/1.49 (a != $true) | spl0_1),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f15])).
% 1.66/1.49 thf(f15,definition,(
% 1.66/1.49 spl0_1 <=> (a = $true)),
% 1.66/1.49 introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.66/1.49 thf(f72,plain,(
% 1.66/1.49 (a = $true) | (b = $true) | spl0_7),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f71])).
% 1.66/1.49 thf(f71,plain,(
% 1.66/1.49 (a != b) | spl0_7),
% 1.66/1.49 inference(equality_resolution,[status(thm)],[f46])).
% 1.66/1.49 thf(f46,plain,(
% 1.66/1.49 ((f @ a) != (f @ b)) | spl0_7),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f44])).
% 1.66/1.49 thf(f44,definition,(
% 1.66/1.49 spl0_7 <=> ((f @ a) = (f @ b))),
% 1.66/1.49 introduced(definition,[new_symbols(naming,[spl0_7])],[avatar_definition])).
% 1.66/1.49 thf(f114,plain,(
% 1.66/1.49 spl0_8 | spl0_4 | spl0_9),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f113,f57,f28,f49])).
% 1.66/1.49 thf(f49,definition,(
% 1.66/1.49 spl0_8 <=> (b = $false)),
% 1.66/1.49 introduced(definition,[new_symbols(naming,[spl0_8])],[avatar_definition])).
% 1.66/1.49 thf(f28,definition,(
% 1.66/1.49 spl0_4 <=> (c = $false)),
% 1.66/1.49 introduced(definition,[new_symbols(naming,[spl0_4])],[avatar_definition])).
% 1.66/1.49 thf(f57,definition,(
% 1.66/1.49 spl0_9 <=> ((f2 @ b) = (f2 @ c))),
% 1.66/1.49 introduced(definition,[new_symbols(naming,[spl0_9])],[avatar_definition])).
% 1.66/1.49 thf(f113,plain,(
% 1.66/1.49 (b = $false) | (spl0_4 | spl0_9)),
% 1.66/1.49 inference(subsumption_resolution,[status(thm)],[f81,f29])).
% 1.66/1.49 thf(f29,plain,(
% 1.66/1.49 (c != $false) | spl0_4),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f28])).
% 1.66/1.49 thf(f81,plain,(
% 1.66/1.49 (b = $false) | (c = $false) | spl0_9),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f79])).
% 1.66/1.49 thf(f79,plain,(
% 1.66/1.49 (b != c) | spl0_9),
% 1.66/1.49 inference(equality_resolution,[status(thm)],[f59])).
% 1.66/1.49 thf(f59,plain,(
% 1.66/1.49 ((f2 @ b) != (f2 @ c)) | spl0_9),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f57])).
% 1.66/1.49 thf(f109,plain,(
% 1.66/1.49 ~spl0_1 | ~spl0_5),
% 1.66/1.49 inference(avatar_contradiction_clause,[status(thm)],[f108])).
% 1.66/1.49 thf(f108,plain,(
% 1.66/1.49 $false | (~spl0_1 | ~spl0_5)),
% 1.66/1.49 inference(trivial_inequality_removal,[status(thm)],[f103])).
% 1.66/1.49 thf(f103,plain,(
% 1.66/1.49 ($false = $true) | (~spl0_1 | ~spl0_5)),
% 1.66/1.49 inference(superposition,[status(thm)],[f17,f34])).
% 1.66/1.49 thf(f34,plain,(
% 1.66/1.49 (a = $false) | ~spl0_5),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f32])).
% 1.66/1.49 thf(f32,definition,(
% 1.66/1.49 spl0_5 <=> (a = $false)),
% 1.66/1.49 introduced(definition,[new_symbols(naming,[spl0_5])],[avatar_definition])).
% 1.66/1.49 thf(f17,plain,(
% 1.66/1.49 (a = $true) | ~spl0_1),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f15])).
% 1.66/1.49 thf(f101,plain,(
% 1.66/1.49 ~spl0_6 | ~spl0_8),
% 1.66/1.49 inference(avatar_contradiction_clause,[status(thm)],[f100])).
% 1.66/1.49 thf(f100,plain,(
% 1.66/1.49 $false | (~spl0_6 | ~spl0_8)),
% 1.66/1.49 inference(trivial_inequality_removal,[status(thm)],[f93])).
% 1.66/1.49 thf(f93,plain,(
% 1.66/1.49 ($false = $true) | (~spl0_6 | ~spl0_8)),
% 1.66/1.49 inference(superposition,[status(thm)],[f42,f51])).
% 1.66/1.49 thf(f51,plain,(
% 1.66/1.49 (b = $false) | ~spl0_8),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f49])).
% 1.66/1.49 thf(f42,plain,(
% 1.66/1.49 (b = $true) | ~spl0_6),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f40])).
% 1.66/1.49 thf(f91,plain,(
% 1.66/1.49 ~spl0_2 | ~spl0_4),
% 1.66/1.49 inference(avatar_contradiction_clause,[status(thm)],[f90])).
% 1.66/1.49 thf(f90,plain,(
% 1.66/1.49 $false | (~spl0_2 | ~spl0_4)),
% 1.66/1.49 inference(trivial_inequality_removal,[status(thm)],[f85])).
% 1.66/1.49 thf(f85,plain,(
% 1.66/1.49 ($false = $true) | (~spl0_2 | ~spl0_4)),
% 1.66/1.49 inference(superposition,[status(thm)],[f30,f21])).
% 1.66/1.49 thf(f21,plain,(
% 1.66/1.49 (c = $true) | ~spl0_2),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f19])).
% 1.66/1.49 thf(f19,definition,(
% 1.66/1.49 spl0_2 <=> (c = $true)),
% 1.66/1.49 introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.66/1.49 thf(f30,plain,(
% 1.66/1.49 (c = $false) | ~spl0_4),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f28])).
% 1.66/1.49 thf(f82,plain,(
% 1.66/1.49 spl0_2 | spl0_6 | spl0_9),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f80,f57,f40,f19])).
% 1.66/1.49 thf(f80,plain,(
% 1.66/1.49 (c = $true) | (b = $true) | spl0_9),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f79])).
% 1.66/1.49 thf(f74,plain,(
% 1.66/1.49 spl0_5 | spl0_8 | spl0_7),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f73,f44,f49,f32])).
% 1.66/1.49 thf(f73,plain,(
% 1.66/1.49 (b = $false) | (a = $false) | spl0_7),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f71])).
% 1.66/1.49 thf(f66,plain,(
% 1.66/1.49 spl0_5 | spl0_4 | spl0_3),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f64,f23,f28,f32])).
% 1.66/1.49 thf(f23,definition,(
% 1.66/1.49 spl0_3 <=> ((f1 @ a) = (f1 @ c))),
% 1.66/1.49 introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition])).
% 1.66/1.49 thf(f64,plain,(
% 1.66/1.49 (a = $false) | (c = $false) | spl0_3),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f62])).
% 1.66/1.49 thf(f62,plain,(
% 1.66/1.49 (a != c) | spl0_3),
% 1.66/1.49 inference(equality_resolution,[status(thm)],[f25])).
% 1.66/1.49 thf(f25,plain,(
% 1.66/1.49 ((f1 @ a) != (f1 @ c)) | spl0_3),
% 1.66/1.49 inference(avatar_component_clause,[status(thm)],[f23])).
% 1.66/1.49 thf(f65,plain,(
% 1.66/1.49 spl0_2 | spl0_1 | spl0_3),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f63,f23,f15,f19])).
% 1.66/1.49 thf(f63,plain,(
% 1.66/1.49 (c = $true) | (a = $true) | spl0_3),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f62])).
% 1.66/1.49 thf(f61,plain,(
% 1.66/1.49 ~spl0_9 | spl0_4 | spl0_8),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f55,f49,f28,f57])).
% 1.66/1.49 thf(f55,plain,(
% 1.66/1.49 (b = $false) | ((f2 @ b) != (f2 @ c)) | (c = $false)),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f53])).
% 1.66/1.49 thf(f53,plain,(
% 1.66/1.49 (b != c) | ((f2 @ b) != (f2 @ c))),
% 1.66/1.49 inference(constrained_superposition,[status(thm)],[f6,f10])).
% 1.66/1.49 thf(f10,plain,(
% 1.66/1.49 ((f2 @ c) = (g2 @ b))),
% 1.66/1.49 inference(cnf_transformation,[status(thm)],[f4])).
% 1.66/1.49 thf(f4,plain,(
% 1.66/1.49 ((f2 @ c) = (g2 @ b)) & ((f @ b) = (g @ a)) & ((f1 @ a) != (g1 @ c)) & ((f1 @ c) = (g1 @ a)) & ((f2 @ b) != (g2 @ c)) & ((f @ a) != (g @ b))),
% 1.66/1.49 inference(ennf_transformation,[status(thm)],[f2])).
% 1.66/1.49 thf(f2,negated_conjecture,(
% 1.66/1.49 ~(((f @ a) = (g @ b)) | ((f2 @ b) = (g2 @ c)) | ((f @ b) != (g @ a)) | ((f1 @ a) = (g1 @ c)) | ((f2 @ c) != (g2 @ b)) | ((f1 @ c) != (g1 @ a)))),
% 1.66/1.49 inference(negated_conjecture,[status(cth)],[f1])).
% 1.66/1.49 thf(f1,conjecture,(
% 1.66/1.49 ((f @ a) = (g @ b)) | ((f2 @ b) = (g2 @ c)) | ((f @ b) != (g @ a)) | ((f1 @ a) = (g1 @ c)) | ((f2 @ c) != (g2 @ b)) | ((f1 @ c) != (g1 @ a))),
% 1.66/1.49 file('/export/starexec/sandbox/tmp/tmp.EhqIuTtR11/DTF2THF_30618.p',con)).
% 1.66/1.49 thf(f6,plain,(
% 1.66/1.49 ((f2 @ b) != (g2 @ c))),
% 1.66/1.49 inference(cnf_transformation,[status(thm)],[f4])).
% 1.66/1.49 thf(f60,plain,(
% 1.66/1.49 spl0_2 | spl0_6 | ~spl0_9),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f54,f57,f40,f19])).
% 1.66/1.49 thf(f54,plain,(
% 1.66/1.49 (b = $true) | (c = $true) | ((f2 @ b) != (f2 @ c))),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f53])).
% 1.66/1.49 thf(f52,plain,(
% 1.66/1.49 ~spl0_7 | spl0_5 | spl0_8),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f38,f49,f32,f44])).
% 1.66/1.49 thf(f38,plain,(
% 1.66/1.49 ((f @ a) != (f @ b)) | (a = $false) | (b = $false)),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f36])).
% 1.66/1.49 thf(f36,plain,(
% 1.66/1.49 ((f @ a) != (f @ b)) | (a != b)),
% 1.66/1.49 inference(constrained_superposition,[status(thm)],[f5,f9])).
% 1.66/1.49 thf(f9,plain,(
% 1.66/1.49 ((f @ b) = (g @ a))),
% 1.66/1.49 inference(cnf_transformation,[status(thm)],[f4])).
% 1.66/1.49 thf(f5,plain,(
% 1.66/1.49 ((f @ a) != (g @ b))),
% 1.66/1.49 inference(cnf_transformation,[status(thm)],[f4])).
% 1.66/1.49 thf(f47,plain,(
% 1.66/1.49 spl0_6 | ~spl0_7 | spl0_1),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f37,f15,f44,f40])).
% 1.66/1.49 thf(f37,plain,(
% 1.66/1.49 ((f @ a) != (f @ b)) | (a = $true) | (b = $true)),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f36])).
% 1.66/1.49 thf(f35,plain,(
% 1.66/1.49 spl0_4 | spl0_5 | ~spl0_3),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f13,f23,f32,f28])).
% 1.66/1.49 thf(f13,plain,(
% 1.66/1.49 (a = $false) | ((f1 @ a) != (f1 @ c)) | (c = $false)),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.66/1.49 thf(f11,plain,(
% 1.66/1.49 (a != c) | ((f1 @ a) != (f1 @ c))),
% 1.66/1.49 inference(constrained_superposition,[status(thm)],[f8,f7])).
% 1.66/1.49 thf(f7,plain,(
% 1.66/1.49 ((f1 @ c) = (g1 @ a))),
% 1.66/1.49 inference(cnf_transformation,[status(thm)],[f4])).
% 1.66/1.49 thf(f8,plain,(
% 1.66/1.49 ((f1 @ a) != (g1 @ c))),
% 1.66/1.49 inference(cnf_transformation,[status(thm)],[f4])).
% 1.66/1.49 thf(f26,plain,(
% 1.66/1.49 spl0_1 | spl0_2 | ~spl0_3),
% 1.66/1.49 inference(avatar_split_clause,[status(thm)],[f12,f23,f19,f15])).
% 1.66/1.49 thf(f12,plain,(
% 1.66/1.49 (a = $true) | ((f1 @ a) != (f1 @ c)) | (c = $true)),
% 1.66/1.49 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.66/1.49 % SZS output end Proof for DTF2THF_30618
% 1.66/1.49 % (30715)------------------------------
% 1.66/1.49 % (30715)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.66/1.49 % (30715)Termination reason: Refutation
% 1.66/1.49
% 1.66/1.49 % (30715)Memory used [KB]: 5500
% 1.66/1.49 % (30715)Time elapsed: 0.006 s
% 1.66/1.49 % (30715)Instructions burned: 5 (million)
% 1.66/1.49 % (30715)------------------------------
% 1.66/1.49 % (30715)------------------------------
% 1.66/1.49 % (30714)Success in time 0.023 s
%------------------------------------------------------------------------------