%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO042^2 : TPTP v9.2.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n007.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:14 AM UTC 2026
% Result : Theorem 1.38s 1.28s
% Output : Refutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 85 ( 10 unt; 0 typ; 10 def)
% Number of atoms : 470 ( 92 equ; 8 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 330 ( 129 ~; 109 |; 20 &; 62 @)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 16 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
g: $o > $o ).
thf(func_def_1,type,
p: ( $o > $o ) > $o ).
thf(func_def_9,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f379,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f26,f35,f40,f45,f62,f71,f111,f122,f129,f161,f274,f321,f362,f378]) ).
thf(f378,plain,
( spl0_1
| ~ spl0_5
| spl0_9
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[status(thm)],[f377]) ).
thf(f377,plain,
( $false
| spl0_1
| ~ spl0_5
| spl0_9
| ~ spl0_10 ),
inference(subsumption_resolution,[status(thm)],[f376,f65]) ).
thf(f65,plain,
( ( $true != sK2 )
| spl0_9 ),
inference(avatar_component_clause,[status(thm)],[f64]) ).
thf(f64,definition,
( spl0_9
<=> ( $true = sK2 ) ),
introduced(definition,[new_symbols(naming,[spl0_9])],[avatar_definition]) ).
thf(f376,plain,
( ( $true = sK2 )
| spl0_1
| ~ spl0_5
| ~ spl0_10 ),
inference(subsumption_resolution,[status(thm)],[f353,f20]) ).
thf(f20,plain,
( ( y != $true )
| spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f19]) ).
thf(f19,definition,
( spl0_1
<=> ( y = $true ) ),
introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).
thf(f353,plain,
( ( y = $true )
| ( $true = sK2 )
| ~ spl0_5
| ~ spl0_10 ),
inference(binary_proxy_clausification,[status(thm)],[f352]) ).
thf(f352,plain,
( ( y != sK2 )
| ~ spl0_5
| ~ spl0_10 ),
inference(trivial_inequality_removal,[status(thm)],[f348]) ).
thf(f348,plain,
( ( $true = $false )
| ( y != sK2 )
| ~ spl0_5
| ~ spl0_10 ),
inference(constrained_superposition,[status(thm)],[f39,f70]) ).
thf(f70,plain,
( ( $false
= ( g @ sK2 ) )
| ~ spl0_10 ),
inference(avatar_component_clause,[status(thm)],[f68]) ).
thf(f68,definition,
( spl0_10
<=> ( $false
= ( g @ sK2 ) ) ),
introduced(definition,[new_symbols(naming,[spl0_10])],[avatar_definition]) ).
thf(f39,plain,
( ( ( g @ y )
= $true )
| ~ spl0_5 ),
inference(avatar_component_clause,[status(thm)],[f37]) ).
thf(f37,definition,
( spl0_5
<=> ( ( g @ y )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl0_5])],[avatar_definition]) ).
thf(f362,plain,
( ~ spl0_7
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[status(thm)],[f361]) ).
thf(f361,plain,
( $false
| ~ spl0_7
| ~ spl0_10 ),
inference(trivial_inequality_removal,[status(thm)],[f347]) ).
thf(f347,plain,
( ( $true = $false )
| ~ spl0_7
| ~ spl0_10 ),
inference(superposition,[status(thm)],[f70,f57]) ).
thf(f57,plain,
( ( $true
= ( g @ sK2 ) )
| ~ spl0_7 ),
inference(avatar_component_clause,[status(thm)],[f55]) ).
thf(f55,definition,
( spl0_7
<=> ( $true
= ( g @ sK2 ) ) ),
introduced(definition,[new_symbols(naming,[spl0_7])],[avatar_definition]) ).
thf(f321,plain,
( ~ spl0_1
| ~ spl0_6
| ~ spl0_7
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[status(thm)],[f320]) ).
thf(f320,plain,
( $false
| ~ spl0_1
| ~ spl0_6
| ~ spl0_7
| ~ spl0_9 ),
inference(subsumption_resolution,[status(thm)],[f307,f66]) ).
thf(f66,plain,
( ( $true = sK2 )
| ~ spl0_9 ),
inference(avatar_component_clause,[status(thm)],[f64]) ).
thf(f307,plain,
( ( $true != sK2 )
| ~ spl0_1
| ~ spl0_6
| ~ spl0_7 ),
inference(trivial_inequality_removal,[status(thm)],[f292]) ).
thf(f292,plain,
( ( $true != sK2 )
| ( $true = $false )
| ~ spl0_1
| ~ spl0_6
| ~ spl0_7 ),
inference(constrained_superposition,[status(thm)],[f57,f152]) ).
thf(f152,plain,
( ( ( g @ $true )
= $false )
| ~ spl0_1
| ~ spl0_6 ),
inference(superposition,[status(thm)],[f44,f21]) ).
thf(f21,plain,
( ( y = $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f19]) ).
thf(f44,plain,
( ( ( g @ y )
= $false )
| ~ spl0_6 ),
inference(avatar_component_clause,[status(thm)],[f42]) ).
thf(f42,definition,
( spl0_6
<=> ( ( g @ y )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl0_6])],[avatar_definition]) ).
thf(f274,plain,
( ~ spl0_3
| ~ spl0_6
| spl0_7
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[status(thm)],[f273]) ).
thf(f273,plain,
( $false
| ~ spl0_3
| ~ spl0_6
| spl0_7
| ~ spl0_8 ),
inference(subsumption_resolution,[status(thm)],[f232,f44]) ).
thf(f232,plain,
( ( ( g @ y )
!= $false )
| ~ spl0_3
| spl0_7
| ~ spl0_8 ),
inference(trivial_inequality_removal,[status(thm)],[f219]) ).
thf(f219,plain,
( ( ( g @ y )
!= $false )
| ( $true != $true )
| ~ spl0_3
| spl0_7
| ~ spl0_8 ),
inference(constrained_superposition,[status(thm)],[f136,f30]) ).
thf(f30,plain,
( ( $true
= ( g @ ( g @ y ) ) )
| ~ spl0_3 ),
inference(avatar_component_clause,[status(thm)],[f28]) ).
thf(f28,definition,
( spl0_3
<=> ( $true
= ( g @ ( g @ y ) ) ) ),
introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition]) ).
thf(f136,plain,
( ( $true
!= ( g @ $false ) )
| spl0_7
| ~ spl0_8 ),
inference(superposition,[status(thm)],[f56,f61]) ).
thf(f61,plain,
( ( $false = sK2 )
| ~ spl0_8 ),
inference(avatar_component_clause,[status(thm)],[f59]) ).
thf(f59,definition,
( spl0_8
<=> ( $false = sK2 ) ),
introduced(definition,[new_symbols(naming,[spl0_8])],[avatar_definition]) ).
thf(f56,plain,
( ( $true
!= ( g @ sK2 ) )
| spl0_7 ),
inference(avatar_component_clause,[status(thm)],[f55]) ).
thf(f161,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[status(thm)],[f160]) ).
thf(f160,plain,
( $false
| ~ spl0_5
| ~ spl0_6 ),
inference(trivial_inequality_removal,[status(thm)],[f155]) ).
thf(f155,plain,
( ( $true = $false )
| ~ spl0_5
| ~ spl0_6 ),
inference(superposition,[status(thm)],[f39,f44]) ).
thf(f129,plain,
( ~ spl0_8
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[status(thm)],[f128]) ).
thf(f128,plain,
( $false
| ~ spl0_8
| ~ spl0_9 ),
inference(trivial_inequality_removal,[status(thm)],[f125]) ).
thf(f125,plain,
( ( $true = $false )
| ~ spl0_8
| ~ spl0_9 ),
inference(superposition,[status(thm)],[f66,f61]) ).
thf(f122,plain,
( ~ spl0_1
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[status(thm)],[f121]) ).
thf(f121,plain,
( $false
| ~ spl0_1
| ~ spl0_4 ),
inference(trivial_inequality_removal,[status(thm)],[f118]) ).
thf(f118,plain,
( ( $true = $false )
| ~ spl0_1
| ~ spl0_4 ),
inference(superposition,[status(thm)],[f34,f21]) ).
thf(f34,plain,
( ( y = $false )
| ~ spl0_4 ),
inference(avatar_component_clause,[status(thm)],[f32]) ).
thf(f32,definition,
( spl0_4
<=> ( y = $false ) ),
introduced(definition,[new_symbols(naming,[spl0_4])],[avatar_definition]) ).
thf(f111,plain,
( spl0_8
| spl0_6
| ~ spl0_2
| ~ spl0_7 ),
inference(avatar_split_clause,[status(thm)],[f94,f55,f23,f42,f59]) ).
thf(f23,definition,
( spl0_2
<=> ( $false
= ( g @ ( g @ y ) ) ) ),
introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).
thf(f94,plain,
( ( $false = sK2 )
| ( ( g @ y )
= $false )
| ~ spl0_2
| ~ spl0_7 ),
inference(binary_proxy_clausification,[status(thm)],[f92]) ).
thf(f92,plain,
( ( ( g @ y )
!= sK2 )
| ~ spl0_2
| ~ spl0_7 ),
inference(trivial_inequality_removal,[status(thm)],[f84]) ).
thf(f84,plain,
( ( $true = $false )
| ( ( g @ y )
!= sK2 )
| ~ spl0_2
| ~ spl0_7 ),
inference(constrained_superposition,[status(thm)],[f57,f25]) ).
thf(f25,plain,
( ( $false
= ( g @ ( g @ y ) ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f23]) ).
thf(f71,plain,
( spl0_9
| spl0_10 ),
inference(avatar_split_clause,[status(thm)],[f52,f68,f64]) ).
thf(f52,plain,
( ( $false
= ( g @ sK2 ) )
| ( $true = sK2 ) ),
inference(not_proxy_clausification,[status(thm)],[f51]) ).
thf(f51,plain,
( ( $false
= ( g @ sK2 ) )
| ( ( ~ sK2 ) = $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f49]) ).
thf(f49,plain,
( ( ~ sK2 )
!= ( g @ sK2 ) ),
inference(negative_extensionality,[status(thm)],[f48]) ).
thf(f48,plain,
g != (~),
inference(trivial_inequality_removal,[status(thm)],[f47]) ).
thf(f47,plain,
( ( $true != $true )
| ( g != (~) ) ),
inference(constrained_superposition,[status(thm)],[f10,f7]) ).
thf(f7,plain,
( ( p @ g )
= $true ),
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
( ( x != y )
& ( ( p @ (~) )
!= $true )
& ( y
= ( g @ x ) )
& ( x
= ( g @ y ) )
& ( ( p @ g )
= $true ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
~ ~ ( ( y
= ( g @ x ) )
& ( ( p @ (~) )
!= $true )
& ( x
= ( g @ y ) )
& ( ( p @ g )
= $true )
& ( x != y ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ~ ( ( y
= ( g @ x ) )
& ~ ( p @ (~) )
& ( x
= ( g @ y ) )
& ( p @ g )
& ( x != y ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ~ ( ( y
= ( g @ x ) )
& ~ ( p @ (~) )
& ( x
= ( g @ y ) )
& ( p @ g )
& ( x != y ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
~ ( ( y
= ( g @ x ) )
& ~ ( p @ (~) )
& ( x
= ( g @ y ) )
& ( p @ g )
& ( x != y ) ),
file('/export/starexec/sandbox/tmp/tmp.OdM5MyNYJv/DTF2THF_1886.p',4) ).
thf(f10,plain,
( ( p @ (~) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f62,plain,
( spl0_7
| spl0_8 ),
inference(avatar_split_clause,[status(thm)],[f53,f59,f55]) ).
thf(f53,plain,
( ( $false = sK2 )
| ( $true
= ( g @ sK2 ) ) ),
inference(not_proxy_clausification,[status(thm)],[f50]) ).
thf(f50,plain,
( ( $true = ( ~ sK2 ) )
| ( $true
= ( g @ sK2 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f49]) ).
thf(f45,plain,
( spl0_4
| spl0_6 ),
inference(avatar_split_clause,[status(thm)],[f15,f42,f32]) ).
thf(f15,plain,
( ( ( g @ y )
= $false )
| ( y = $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f13]) ).
thf(f13,plain,
( y
!= ( g @ y ) ),
inference(definition_unfolding,[status(thm)],[f11,f8]) ).
thf(f8,plain,
( x
= ( g @ y ) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f11,plain,
x != y,
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f40,plain,
( spl0_1
| spl0_5 ),
inference(avatar_split_clause,[status(thm)],[f14,f37,f19]) ).
thf(f14,plain,
( ( ( g @ y )
= $true )
| ( y = $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f13]) ).
thf(f35,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[status(thm)],[f17,f32,f28]) ).
thf(f17,plain,
( ( y = $false )
| ( $true
= ( g @ ( g @ y ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f12]) ).
thf(f12,plain,
( y
= ( g @ ( g @ y ) ) ),
inference(definition_unfolding,[status(thm)],[f9,f8]) ).
thf(f9,plain,
( y
= ( g @ x ) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f26,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[status(thm)],[f16,f23,f19]) ).
thf(f16,plain,
( ( $false
= ( g @ ( g @ y ) ) )
| ( y = $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO042^2 : TPTP v9.2.1. Released v4.1.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 : n007.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.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue Feb 24 14:21:53 EST 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.29 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 : SYO042^2 : TPTP v9.2.1. Released v4.1.0.
% 0.16/0.39 % Domain : Syntactic
% 0.16/0.39 % Problem : Unsatisfiable basic formula 4
% 0.16/0.39 % Version : Especial.
% 0.16/0.39 % Theorem formulation : As a conjecture rather than UNS set.
% 0.16/0.39 % English : Negation is the unique function g such that g x = y and g y = x
% 0.16/0.39 % for x,y:o distinct.
% 0.16/0.39
% 0.16/0.39 % Refs : [BS09a] Brown E. & Smolka (2009), Terminating Tableaux for the
% 0.16/0.39 % : [BS09b] Brown E. & Smolka (2009), Extended First-Order Logic
% 0.16/0.39 % : [Bro09] Brown E. (2009), Email to Geoff Sutcliffe
% 0.16/0.39 % Source : [BS09a]
% 0.16/0.39 % Names : basic4 [Bro09]
% 0.16/0.39
% 0.16/0.39 % Status : Theorem
% 0.16/0.39 % Rating : 0.11 v9.1.0, 0.12 v9.0.0, 0.20 v8.2.0, 0.38 v8.1.0, 0.36 v7.5.0, 0.29 v7.4.0, 0.33 v7.2.0, 0.25 v7.0.0, 0.29 v6.4.0, 0.33 v6.3.0, 0.40 v6.2.0, 0.57 v6.1.0, 0.43 v5.5.0, 0.33 v5.4.0, 0.60 v5.1.0, 0.80 v5.0.0, 0.60 v4.1.0
% 0.16/0.39 % Syntax : Number of formulae : 5 ( 0 unt; 4 typ; 0 def)
% 0.16/0.39 % Number of atoms : 15 ( 3 equ; 1 cnn)
% 0.16/0.39 % Maximal formula atoms : 7 ( 15 avg)
% 0.16/0.39 % Number of connectives : 12 ( 4 ~; 0 |; 4 &; 4 @)
% 0.16/0.39 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.16/0.39 % Maximal formula depth : 8 ( 8 avg)
% 0.16/0.39 % Number of types : 1 ( 0 usr)
% 0.16/0.39 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.16/0.39 % Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% 0.16/0.39 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.16/0.39 % SPC : TH0_THM_EQU_NAR
% 0.16/0.39
% 0.16/0.39 % Comments : The fragment of simple type theory that restricts equations to
% 0.16/0.39 % base types and disallows lambda abstraction and quantification is
% 0.16/0.39 % decidable. This is an example.
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 thf(g,type,
% 0.16/0.39 g: $o > $o ).
% 0.16/0.39
% 0.16/0.39 thf(p,type,
% 0.16/0.39 p: ( $o > $o ) > $o ).
% 0.16/0.39
% 0.16/0.39 thf(x,type,
% 0.16/0.39 x: $o ).
% 0.16/0.39
% 0.16/0.39 thf(y,type,
% 0.16/0.39 y: $o ).
% 0.16/0.39
% 0.16/0.39 thf(4,conjecture,
% 0.16/0.39 ~ ( ( x != y )
% 0.16/0.39 & ( ( g @ x )
% 0.16/0.39 = y )
% 0.16/0.39 & ( ( g @ y )
% 0.16/0.39 = x )
% 0.16/0.39 & ( p @ g )
% 0.16/0.39 & ~ ( p @ (~) ) ) ).
% 0.16/0.39
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 ------------------------
% 1.38/1.24 ---- Embedded in THF ---
% 1.38/1.24 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.38/1.24 %%% Generated on Tue Feb 24 14:21:54 EST 2026
% 1.38/1.24 %%% using '$$dhol' embedding, version 1.3.0.
% 1.38/1.24 %%% Logic specification used:
% 1.38/1.24 %%% thf(spec, logic, $$dhol).
% 1.38/1.24
% 1.38/1.24 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.OdM5MyNYJv/DTF2DTF1886.p
% See solution above
% 1.38/1.24 ------------------------
% 1.38/1.25 ---- Cleaned THF ---
% 1.38/1.25 thf(g,type,
% 1.38/1.25 g: $o > $o ).
% 1.38/1.25
% 1.38/1.25 thf(p,type,
% 1.38/1.25 p: ( $o > $o ) > $o ).
% 1.38/1.25
% 1.38/1.25 thf(x,type,
% 1.38/1.25 x: $o ).
% 1.38/1.25
% 1.38/1.25 thf(y,type,
% 1.38/1.25 y: $o ).
% 1.38/1.25
% 1.38/1.25 thf(4,conjecture,
% 1.38/1.25 ~ ( ( x != y )
% 1.38/1.25 & ( ( g @ x )
% 1.38/1.25 = y )
% 1.38/1.25 & ( ( g @ y )
% 1.38/1.25 = x )
% 1.38/1.25 & ( p @ g )
% 1.38/1.25 & ~ ( p @ (~) ) ) ).
% 1.38/1.25 ------------------------
% 1.38/1.27 % (1994)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_1886 for (3000ds/275Mi)
% 1.38/1.27 % (1990)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_1886 for (3000ds/4Mi)
% 1.38/1.27 % (1989)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_1886 for (3000ds/183Mi)
% 1.38/1.27 % (1991)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_1886 for (3000ds/27Mi)
% 1.38/1.27 % (1995)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_1886 for (3000ds/18Mi)
% 1.38/1.27 % (1992)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_1886 for (3000ds/2Mi)
% 1.38/1.27 % (1993)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_1886 for (3000ds/2Mi)
% 1.38/1.27 % (1992)Instruction limit reached!
% 1.38/1.27 % (1992)------------------------------
% 1.38/1.27 % (1992)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.38/1.27 % (1992)Termination reason: Unknown
% 1.38/1.27 % (1992)Termination phase: Saturation
% 1.38/1.27 % (1993)Instruction limit reached!
% 1.38/1.27 % (1993)------------------------------
% 1.38/1.27 % (1993)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.38/1.27
% 1.38/1.27 % (1992)Memory used [KB]: 5500
% 1.38/1.27 % (1992)Time elapsed: 0.003 s
% 1.38/1.27 % (1992)Instructions burned: 2 (million)
% 1.38/1.27 % (1992)------------------------------
% 1.38/1.27 % (1992)------------------------------
% 1.38/1.27 % (1993)Termination reason: Unknown
% 1.38/1.27 % (1993)Termination phase: Saturation
% 1.38/1.27
% 1.38/1.27 % (1993)Memory used [KB]: 5500
% 1.38/1.27 % (1993)Time elapsed: 0.003 s
% 1.38/1.27 % (1994)Refutation not found, incomplete strategy
% 1.38/1.27 % (1994)------------------------------
% 1.38/1.27 % (1994)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.38/1.27 % (1994)Termination reason: Refutation not found, incomplete strategy
% 1.38/1.27
% 1.38/1.27
% 1.38/1.27 % (1994)Memory used [KB]: 5500
% 1.38/1.27 % (1994)Time elapsed: 0.003 s
% 1.38/1.27 % (1994)Instructions burned: 2 (million)
% 1.38/1.27 % (1994)------------------------------
% 1.38/1.27 % (1994)------------------------------
% 1.38/1.27 % (1993)Instructions burned: 2 (million)
% 1.38/1.27 % (1993)------------------------------
% 1.38/1.27 % (1993)------------------------------
% 1.38/1.27 % (1991)Refutation not found, incomplete strategy
% 1.38/1.27 % (1991)------------------------------
% 1.38/1.27 % (1991)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.38/1.27 % (1991)Termination reason: Refutation not found, incomplete strategy
% 1.38/1.27
% 1.38/1.27
% 1.38/1.27 % (1991)Memory used [KB]: 5500
% 1.38/1.27 % (1990)Refutation not found, incomplete strategy
% 1.38/1.27 % (1990)------------------------------
% 1.38/1.27 % (1990)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.38/1.27 % (1990)Termination reason: Refutation not found, incomplete strategy
% 1.38/1.27
% 1.38/1.27
% 1.38/1.27 % (1990)Memory used [KB]: 5500
% 1.38/1.27 % (1990)Time elapsed: 0.003 s
% 1.38/1.27 % (1990)Instructions burned: 2 (million)
% 1.38/1.27 % (1990)------------------------------
% 1.38/1.27 % (1990)------------------------------
% 1.38/1.27 % (1991)Time elapsed: 0.003 s
% 1.38/1.27 % (1991)Instructions burned: 2 (million)
% 1.38/1.27 % (1991)------------------------------
% 1.38/1.27 % (1991)------------------------------
% 1.38/1.27 % (1995)Refutation not found, incomplete strategy
% 1.38/1.27 % (1995)------------------------------
% 1.38/1.27 % (1995)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.38/1.27 % (1995)Termination reason: Refutation not found, incomplete strategy
% 1.38/1.27
% 1.38/1.27
% 1.38/1.27 % (1995)Memory used [KB]: 5500
% 1.38/1.27 % (1995)Time elapsed: 0.003 s
% 1.38/1.27 % (1995)Instructions burned: 2 (million)
% 1.38/1.27 % (1995)------------------------------
% 1.38/1.27 % (1995)------------------------------
% 1.38/1.28 % (1989)First to succeed.
% 1.38/1.28 % (1989)Refutation found. Thanks to Tanya!
% 1.38/1.28 % SZS status Theorem for DTF2THF_1886
% 1.38/1.28 % SZS output start Proof for DTF2THF_1886
% 1.38/1.28 thf(func_def_0, type, g: $o > $o).
% 1.38/1.28 thf(func_def_1, type, p: ($o > $o) > $o).
% 1.38/1.28 thf(func_def_9, type, ph1: !>[X0: $tType]:(X0)).
% 1.38/1.28 thf(f379,plain,(
% 1.38/1.28 $false),
% 1.38/1.28 inference(avatar_sat_refutation,[status(thm)],[f26,f35,f40,f45,f62,f71,f111,f122,f129,f161,f274,f321,f362,f378])).
% 1.38/1.28 thf(f378,plain,(
% 1.38/1.28 spl0_1 | ~spl0_5 | spl0_9 | ~spl0_10),
% 1.38/1.28 inference(avatar_contradiction_clause,[status(thm)],[f377])).
% 1.38/1.28 thf(f377,plain,(
% 1.38/1.28 $false | (spl0_1 | ~spl0_5 | spl0_9 | ~spl0_10)),
% 1.38/1.28 inference(subsumption_resolution,[status(thm)],[f376,f65])).
% 1.38/1.28 thf(f65,plain,(
% 1.38/1.28 ($true != sK2) | spl0_9),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f64])).
% 1.38/1.28 thf(f64,definition,(
% 1.38/1.28 spl0_9 <=> ($true = sK2)),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_9])],[avatar_definition])).
% 1.38/1.28 thf(f376,plain,(
% 1.38/1.28 ($true = sK2) | (spl0_1 | ~spl0_5 | ~spl0_10)),
% 1.38/1.28 inference(subsumption_resolution,[status(thm)],[f353,f20])).
% 1.38/1.28 thf(f20,plain,(
% 1.38/1.28 (y != $true) | spl0_1),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f19])).
% 1.38/1.28 thf(f19,definition,(
% 1.38/1.28 spl0_1 <=> (y = $true)),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.38/1.28 thf(f353,plain,(
% 1.38/1.28 (y = $true) | ($true = sK2) | (~spl0_5 | ~spl0_10)),
% 1.38/1.28 inference(binary_proxy_clausification,[status(thm)],[f352])).
% 1.38/1.28 thf(f352,plain,(
% 1.38/1.28 (y != sK2) | (~spl0_5 | ~spl0_10)),
% 1.38/1.28 inference(trivial_inequality_removal,[status(thm)],[f348])).
% 1.38/1.28 thf(f348,plain,(
% 1.38/1.28 ($true = $false) | (y != sK2) | (~spl0_5 | ~spl0_10)),
% 1.38/1.28 inference(constrained_superposition,[status(thm)],[f39,f70])).
% 1.38/1.28 thf(f70,plain,(
% 1.38/1.28 ($false = (g @ sK2)) | ~spl0_10),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f68])).
% 1.38/1.28 thf(f68,definition,(
% 1.38/1.28 spl0_10 <=> ($false = (g @ sK2))),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_10])],[avatar_definition])).
% 1.38/1.28 thf(f39,plain,(
% 1.38/1.28 ((g @ y) = $true) | ~spl0_5),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f37])).
% 1.38/1.28 thf(f37,definition,(
% 1.38/1.28 spl0_5 <=> ((g @ y) = $true)),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_5])],[avatar_definition])).
% 1.38/1.28 thf(f362,plain,(
% 1.38/1.28 ~spl0_7 | ~spl0_10),
% 1.38/1.28 inference(avatar_contradiction_clause,[status(thm)],[f361])).
% 1.38/1.28 thf(f361,plain,(
% 1.38/1.28 $false | (~spl0_7 | ~spl0_10)),
% 1.38/1.28 inference(trivial_inequality_removal,[status(thm)],[f347])).
% 1.38/1.28 thf(f347,plain,(
% 1.38/1.28 ($true = $false) | (~spl0_7 | ~spl0_10)),
% 1.38/1.28 inference(superposition,[status(thm)],[f70,f57])).
% 1.38/1.28 thf(f57,plain,(
% 1.38/1.28 ($true = (g @ sK2)) | ~spl0_7),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f55])).
% 1.38/1.28 thf(f55,definition,(
% 1.38/1.28 spl0_7 <=> ($true = (g @ sK2))),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_7])],[avatar_definition])).
% 1.38/1.28 thf(f321,plain,(
% 1.38/1.28 ~spl0_1 | ~spl0_6 | ~spl0_7 | ~spl0_9),
% 1.38/1.28 inference(avatar_contradiction_clause,[status(thm)],[f320])).
% 1.38/1.28 thf(f320,plain,(
% 1.38/1.28 $false | (~spl0_1 | ~spl0_6 | ~spl0_7 | ~spl0_9)),
% 1.38/1.28 inference(subsumption_resolution,[status(thm)],[f307,f66])).
% 1.38/1.28 thf(f66,plain,(
% 1.38/1.28 ($true = sK2) | ~spl0_9),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f64])).
% 1.38/1.28 thf(f307,plain,(
% 1.38/1.28 ($true != sK2) | (~spl0_1 | ~spl0_6 | ~spl0_7)),
% 1.38/1.28 inference(trivial_inequality_removal,[status(thm)],[f292])).
% 1.38/1.28 thf(f292,plain,(
% 1.38/1.28 ($true != sK2) | ($true = $false) | (~spl0_1 | ~spl0_6 | ~spl0_7)),
% 1.38/1.28 inference(constrained_superposition,[status(thm)],[f57,f152])).
% 1.38/1.28 thf(f152,plain,(
% 1.38/1.28 ((g @ $true) = $false) | (~spl0_1 | ~spl0_6)),
% 1.38/1.28 inference(superposition,[status(thm)],[f44,f21])).
% 1.38/1.28 thf(f21,plain,(
% 1.38/1.28 (y = $true) | ~spl0_1),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f19])).
% 1.38/1.28 thf(f44,plain,(
% 1.38/1.28 ((g @ y) = $false) | ~spl0_6),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f42])).
% 1.38/1.28 thf(f42,definition,(
% 1.38/1.28 spl0_6 <=> ((g @ y) = $false)),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_6])],[avatar_definition])).
% 1.38/1.28 thf(f274,plain,(
% 1.38/1.28 ~spl0_3 | ~spl0_6 | spl0_7 | ~spl0_8),
% 1.38/1.28 inference(avatar_contradiction_clause,[status(thm)],[f273])).
% 1.38/1.28 thf(f273,plain,(
% 1.38/1.28 $false | (~spl0_3 | ~spl0_6 | spl0_7 | ~spl0_8)),
% 1.38/1.28 inference(subsumption_resolution,[status(thm)],[f232,f44])).
% 1.38/1.28 thf(f232,plain,(
% 1.38/1.28 ((g @ y) != $false) | (~spl0_3 | spl0_7 | ~spl0_8)),
% 1.38/1.28 inference(trivial_inequality_removal,[status(thm)],[f219])).
% 1.38/1.28 thf(f219,plain,(
% 1.38/1.28 ((g @ y) != $false) | ($true != $true) | (~spl0_3 | spl0_7 | ~spl0_8)),
% 1.38/1.28 inference(constrained_superposition,[status(thm)],[f136,f30])).
% 1.38/1.28 thf(f30,plain,(
% 1.38/1.28 ($true = (g @ (g @ y))) | ~spl0_3),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f28])).
% 1.38/1.28 thf(f28,definition,(
% 1.38/1.28 spl0_3 <=> ($true = (g @ (g @ y)))),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition])).
% 1.38/1.28 thf(f136,plain,(
% 1.38/1.28 ($true != (g @ $false)) | (spl0_7 | ~spl0_8)),
% 1.38/1.28 inference(superposition,[status(thm)],[f56,f61])).
% 1.38/1.28 thf(f61,plain,(
% 1.38/1.28 ($false = sK2) | ~spl0_8),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f59])).
% 1.38/1.28 thf(f59,definition,(
% 1.38/1.28 spl0_8 <=> ($false = sK2)),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_8])],[avatar_definition])).
% 1.38/1.28 thf(f56,plain,(
% 1.38/1.28 ($true != (g @ sK2)) | spl0_7),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f55])).
% 1.38/1.28 thf(f161,plain,(
% 1.38/1.28 ~spl0_5 | ~spl0_6),
% 1.38/1.28 inference(avatar_contradiction_clause,[status(thm)],[f160])).
% 1.38/1.28 thf(f160,plain,(
% 1.38/1.28 $false | (~spl0_5 | ~spl0_6)),
% 1.38/1.28 inference(trivial_inequality_removal,[status(thm)],[f155])).
% 1.38/1.28 thf(f155,plain,(
% 1.38/1.28 ($true = $false) | (~spl0_5 | ~spl0_6)),
% 1.38/1.28 inference(superposition,[status(thm)],[f39,f44])).
% 1.38/1.28 thf(f129,plain,(
% 1.38/1.28 ~spl0_8 | ~spl0_9),
% 1.38/1.28 inference(avatar_contradiction_clause,[status(thm)],[f128])).
% 1.38/1.28 thf(f128,plain,(
% 1.38/1.28 $false | (~spl0_8 | ~spl0_9)),
% 1.38/1.28 inference(trivial_inequality_removal,[status(thm)],[f125])).
% 1.38/1.28 thf(f125,plain,(
% 1.38/1.28 ($true = $false) | (~spl0_8 | ~spl0_9)),
% 1.38/1.28 inference(superposition,[status(thm)],[f66,f61])).
% 1.38/1.28 thf(f122,plain,(
% 1.38/1.28 ~spl0_1 | ~spl0_4),
% 1.38/1.28 inference(avatar_contradiction_clause,[status(thm)],[f121])).
% 1.38/1.28 thf(f121,plain,(
% 1.38/1.28 $false | (~spl0_1 | ~spl0_4)),
% 1.38/1.28 inference(trivial_inequality_removal,[status(thm)],[f118])).
% 1.38/1.28 thf(f118,plain,(
% 1.38/1.28 ($true = $false) | (~spl0_1 | ~spl0_4)),
% 1.38/1.28 inference(superposition,[status(thm)],[f34,f21])).
% 1.38/1.28 thf(f34,plain,(
% 1.38/1.28 (y = $false) | ~spl0_4),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f32])).
% 1.38/1.28 thf(f32,definition,(
% 1.38/1.28 spl0_4 <=> (y = $false)),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_4])],[avatar_definition])).
% 1.38/1.28 thf(f111,plain,(
% 1.38/1.28 spl0_8 | spl0_6 | ~spl0_2 | ~spl0_7),
% 1.38/1.28 inference(avatar_split_clause,[status(thm)],[f94,f55,f23,f42,f59])).
% 1.38/1.28 thf(f23,definition,(
% 1.38/1.28 spl0_2 <=> ($false = (g @ (g @ y)))),
% 1.38/1.28 introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.38/1.28 thf(f94,plain,(
% 1.38/1.28 ($false = sK2) | ((g @ y) = $false) | (~spl0_2 | ~spl0_7)),
% 1.38/1.28 inference(binary_proxy_clausification,[status(thm)],[f92])).
% 1.38/1.28 thf(f92,plain,(
% 1.38/1.28 ((g @ y) != sK2) | (~spl0_2 | ~spl0_7)),
% 1.38/1.28 inference(trivial_inequality_removal,[status(thm)],[f84])).
% 1.38/1.28 thf(f84,plain,(
% 1.38/1.28 ($true = $false) | ((g @ y) != sK2) | (~spl0_2 | ~spl0_7)),
% 1.38/1.28 inference(constrained_superposition,[status(thm)],[f57,f25])).
% 1.38/1.28 thf(f25,plain,(
% 1.38/1.28 ($false = (g @ (g @ y))) | ~spl0_2),
% 1.38/1.28 inference(avatar_component_clause,[status(thm)],[f23])).
% 1.38/1.28 thf(f71,plain,(
% 1.38/1.28 spl0_9 | spl0_10),
% 1.38/1.28 inference(avatar_split_clause,[status(thm)],[f52,f68,f64])).
% 1.38/1.28 thf(f52,plain,(
% 1.38/1.28 ($false = (g @ sK2)) | ($true = sK2)),
% 1.38/1.28 inference(not_proxy_clausification,[status(thm)],[f51])).
% 1.38/1.28 thf(f51,plain,(
% 1.38/1.28 ($false = (g @ sK2)) | ((~ sK2) = $false)),
% 1.38/1.28 inference(binary_proxy_clausification,[status(thm)],[f49])).
% 1.38/1.28 thf(f49,plain,(
% 1.38/1.28 ((~ sK2) != (g @ sK2))),
% 1.38/1.28 inference(negative_extensionality,[status(thm)],[f48])).
% 1.38/1.28 thf(f48,plain,(
% 1.38/1.28 (g != ~)),
% 1.38/1.28 inference(trivial_inequality_removal,[status(thm)],[f47])).
% 1.38/1.28 thf(f47,plain,(
% 1.38/1.28 ($true != $true) | (g != ~)),
% 1.38/1.28 inference(constrained_superposition,[status(thm)],[f10,f7])).
% 1.38/1.28 thf(f7,plain,(
% 1.38/1.28 ((p @ g) = $true)),
% 1.38/1.28 inference(cnf_transformation,[status(thm)],[f6])).
% 1.38/1.28 thf(f6,plain,(
% 1.38/1.28 (x != y) & ((p @ ~) != $true) & (y = (g @ x)) & (x = (g @ y)) & ((p @ g) = $true)),
% 1.38/1.28 inference(flattening,[status(thm)],[f5])).
% 1.38/1.28 thf(f5,plain,(
% 1.38/1.28 ~~((y = (g @ x)) & ~((p @ ~) = $true) & (x = (g @ y)) & ((p @ g) = $true) & (x != y))),
% 1.38/1.28 inference(fool_elimination,[status(thm)],[f4])).
% 1.38/1.28 thf(f4,plain,(
% 1.38/1.28 ~~((y = (g @ x)) & ~(p @ ~) & (x = (g @ y)) & (p @ g) & (x != y))),
% 1.38/1.28 inference(rectify,[status(thm)],[f2])).
% 1.38/1.28 thf(f2,negated_conjecture,(
% 1.38/1.28 ~~((y = (g @ x)) & ~(p @ ~) & (x = (g @ y)) & (p @ g) & (x != y))),
% 1.38/1.28 inference(negated_conjecture,[status(cth)],[f1])).
% 1.38/1.28 thf(f1,conjecture,(
% 1.38/1.28 ~((y = (g @ x)) & ~(p @ ~) & (x = (g @ y)) & (p @ g) & (x != y))),
% 1.38/1.28 file('/export/starexec/sandbox/tmp/tmp.OdM5MyNYJv/DTF2THF_1886.p',4)).
% 1.38/1.28 thf(f10,plain,(
% 1.38/1.28 ((p @ ~) != $true)),
% 1.38/1.28 inference(cnf_transformation,[status(thm)],[f6])).
% 1.38/1.28 thf(f62,plain,(
% 1.38/1.28 spl0_7 | spl0_8),
% 1.38/1.28 inference(avatar_split_clause,[status(thm)],[f53,f59,f55])).
% 1.38/1.28 thf(f53,plain,(
% 1.38/1.28 ($false = sK2) | ($true = (g @ sK2))),
% 1.38/1.28 inference(not_proxy_clausification,[status(thm)],[f50])).
% 1.38/1.28 thf(f50,plain,(
% 1.38/1.28 ($true = (~ sK2)) | ($true = (g @ sK2))),
% 1.38/1.28 inference(binary_proxy_clausification,[status(thm)],[f49])).
% 1.38/1.28 thf(f45,plain,(
% 1.38/1.28 spl0_4 | spl0_6),
% 1.38/1.28 inference(avatar_split_clause,[status(thm)],[f15,f42,f32])).
% 1.38/1.28 thf(f15,plain,(
% 1.38/1.28 ((g @ y) = $false) | (y = $false)),
% 1.38/1.28 inference(binary_proxy_clausification,[status(thm)],[f13])).
% 1.38/1.28 thf(f13,plain,(
% 1.38/1.28 (y != (g @ y))),
% 1.38/1.28 inference(definition_unfolding,[status(thm)],[f11,f8])).
% 1.38/1.28 thf(f8,plain,(
% 1.38/1.28 (x = (g @ y))),
% 1.38/1.28 inference(cnf_transformation,[status(thm)],[f6])).
% 1.38/1.28 thf(f11,plain,(
% 1.38/1.28 (x != y)),
% 1.38/1.28 inference(cnf_transformation,[status(thm)],[f6])).
% 1.38/1.28 thf(f40,plain,(
% 1.38/1.28 spl0_1 | spl0_5),
% 1.38/1.28 inference(avatar_split_clause,[status(thm)],[f14,f37,f19])).
% 1.38/1.28 thf(f14,plain,(
% 1.38/1.28 ((g @ y) = $true) | (y = $true)),
% 1.38/1.28 inference(binary_proxy_clausification,[status(thm)],[f13])).
% 1.38/1.28 thf(f35,plain,(
% 1.38/1.28 spl0_3 | spl0_4),
% 1.38/1.28 inference(avatar_split_clause,[status(thm)],[f17,f32,f28])).
% 1.38/1.28 thf(f17,plain,(
% 1.38/1.28 (y = $false) | ($true = (g @ (g @ y)))),
% 1.38/1.28 inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.38/1.28 thf(f12,plain,(
% 1.38/1.28 (y = (g @ (g @ y)))),
% 1.38/1.28 inference(definition_unfolding,[status(thm)],[f9,f8])).
% 1.38/1.28 thf(f9,plain,(
% 1.38/1.28 (y = (g @ x))),
% 1.38/1.28 inference(cnf_transformation,[status(thm)],[f6])).
% 1.38/1.28 thf(f26,plain,(
% 1.38/1.28 spl0_1 | spl0_2),
% 1.38/1.28 inference(avatar_split_clause,[status(thm)],[f16,f23,f19])).
% 1.38/1.28 thf(f16,plain,(
% 1.38/1.28 ($false = (g @ (g @ y))) | (y = $true)),
% 1.38/1.28 inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.38/1.28 % SZS output end Proof for DTF2THF_1886
% 1.38/1.28 % (1989)------------------------------
% 1.38/1.28 % (1989)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.38/1.28 % (1989)Termination reason: Refutation
% 1.38/1.28
% 1.38/1.28 % (1989)Memory used [KB]: 5628
% 1.38/1.28 % (1989)Time elapsed: 0.011 s
% 1.38/1.28 % (1989)Instructions burned: 14 (million)
% 1.38/1.28 % (1989)------------------------------
% 1.38/1.28 % (1989)------------------------------
% 1.38/1.28 % (1988)Success in time 0.024 s
%------------------------------------------------------------------------------