%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU896^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:34:22 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 8
% Syntax : Number of formulae : 80 ( 11 unt; 0 typ; 7 def)
% Number of atoms : 355 ( 226 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 404 ( 84 ~; 146 |; 22 &; 137 @)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 20 usr; 14 con; 0-4 aty)
% ( 0 !!; 8 ??; 0 @@+; 0 @@-)
% Number of variables : 56 ( 0 sgn 21 !; 2 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
y: b ).
thf(func_def_1,type,
g: b > a ).
thf(func_def_2,type,
x: b ).
thf(func_def_4,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_5,type,
vAND: $o > $o > $o ).
thf(func_def_6,type,
vOR: $o > $o > $o ).
thf(func_def_7,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_13,type,
sK0: a ).
thf(func_def_14,type,
sK1: b ).
thf(f1,conjecture,
( ( ^ [X0: a] :
? [X1: b] :
( ( X0
= ( g @ X1 ) )
& ( ( X1 = y )
| ( X1 = x ) ) ) )
= ( ^ [X2: a] :
( ( X2
= ( g @ y ) )
| ( X2
= ( g @ x ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM500_pme) ).
thf(f2,negated_conjecture,
( ( ^ [X0: a] :
? [X1: b] :
( ( X0
= ( g @ X1 ) )
& ( ( X1 = y )
| ( X1 = x ) ) ) )
!= ( ^ [X2: a] :
( ( X2
= ( g @ y ) )
| ( X2
= ( g @ x ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( ( g @ Y1 )
= Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( g @ x )
= Y0 )
| ( ( g @ y )
= Y0 ) ) ) ),
inference(fool_elimination,[],[f2]) ).
thf(f4,plain,
( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( ( g @ Y1 )
= Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( g @ x )
= Y0 )
| ( ( g @ y )
= Y0 ) ) ) ),
inference(flattening,[],[f3]) ).
thf(f5,plain,
( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( ( g @ Y1 )
= Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( g @ x )
= Y0 )
| ( ( g @ y )
= Y0 ) ) ) ),
inference(cnf_transformation,[],[f4]) ).
thf(f15,plain,
( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( ( g @ Y1 )
= Y0 ) ) )
@ sK0 )
!= ( ^ [Y0: a] :
( ( ( g @ x )
= Y0 )
| ( ( g @ y )
= Y0 ) )
@ sK0 ) ),
inference(negative_extensionality,[],[f5]) ).
thf(f16,plain,
( ( $true
= ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( ( g @ Y1 )
= Y0 ) ) )
@ sK0 ) )
| ( $true
= ( ^ [Y0: a] :
( ( ( g @ x )
= Y0 )
| ( ( g @ y )
= Y0 ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f15]) ).
thf(f17,plain,
( ( $false
= ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( ( x = Y1 )
| ( y = Y1 ) )
& ( ( g @ Y1 )
= Y0 ) ) )
@ sK0 ) )
| ( $false
= ( ^ [Y0: a] :
( ( ( g @ x )
= Y0 )
| ( ( g @ y )
= Y0 ) )
@ sK0 ) ) ),
inference(xor_proxy_clausification,[],[f15]) ).
thf(f18,plain,
( ( $false
= ( ?? @ b
@ ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) ) ) )
| ( $false
= ( ( ( g @ x )
= sK0 )
| ( ( g @ y )
= sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f17]) ).
thf(f19,plain,
! [X1: b] :
( ( $false
= ( ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) )
@ X1 ) )
| ( $false
= ( ( ( g @ x )
= sK0 )
| ( ( g @ y )
= sK0 ) ) ) ),
inference(pi_proxy_clausification,[],[f18]) ).
thf(f20,plain,
! [X1: b] :
( ( $false
= ( ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) )
@ X1 ) )
| ( $false
= ( ( g @ y )
= sK0 ) ) ),
inference(or_proxy_clausification,[],[f19]) ).
thf(f21,plain,
! [X1: b] :
( ( $false
= ( ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) )
@ X1 ) )
| ( $false
= ( ( g @ x )
= sK0 ) ) ),
inference(or_proxy_clausification,[],[f19]) ).
thf(f22,plain,
! [X1: b] :
( ( $false
= ( ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) )
@ X1 ) )
| ( ( g @ x )
!= sK0 ) ),
inference(equality_proxy_clausification,[],[f21]) ).
thf(f23,plain,
! [X1: b] :
( ( $false
= ( ( ( x = X1 )
| ( y = X1 ) )
& ( ( g @ X1 )
= sK0 ) ) )
| ( ( g @ x )
!= sK0 ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f24,plain,
! [X1: b] :
( ( $false
= ( ( g @ X1 )
= sK0 ) )
| ( ( g @ x )
!= sK0 )
| ( $false
= ( ( x = X1 )
| ( y = X1 ) ) ) ),
inference(and_proxy_clausification,[],[f23]) ).
thf(f25,plain,
! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( ( g @ x )
!= sK0 )
| ( $false
= ( ( x = X1 )
| ( y = X1 ) ) ) ),
inference(equality_proxy_clausification,[],[f24]) ).
thf(f27,plain,
! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( ( g @ x )
!= sK0 )
| ( $false
= ( x = X1 ) ) ),
inference(or_proxy_clausification,[],[f25]) ).
thf(f28,plain,
! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( ( g @ x )
!= sK0 )
| ( x != X1 ) ),
inference(equality_proxy_clausification,[],[f27]) ).
thf(f30,plain,
! [X1: b] :
( ( $false
= ( ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) )
@ X1 ) )
| ( ( g @ y )
!= sK0 ) ),
inference(equality_proxy_clausification,[],[f20]) ).
thf(f31,plain,
! [X1: b] :
( ( $false
= ( ( ( x = X1 )
| ( y = X1 ) )
& ( ( g @ X1 )
= sK0 ) ) )
| ( ( g @ y )
!= sK0 ) ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f32,plain,
! [X1: b] :
( ( $false
= ( ( g @ X1 )
= sK0 ) )
| ( ( g @ y )
!= sK0 )
| ( $false
= ( ( x = X1 )
| ( y = X1 ) ) ) ),
inference(and_proxy_clausification,[],[f31]) ).
thf(f33,plain,
! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( ( g @ y )
!= sK0 )
| ( $false
= ( ( x = X1 )
| ( y = X1 ) ) ) ),
inference(equality_proxy_clausification,[],[f32]) ).
thf(f34,plain,
! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( ( g @ y )
!= sK0 )
| ( $false
= ( y = X1 ) ) ),
inference(or_proxy_clausification,[],[f33]) ).
thf(f37,plain,
! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( ( g @ y )
!= sK0 )
| ( y != X1 ) ),
inference(equality_proxy_clausification,[],[f34]) ).
thf(f38,plain,
( ( $true
= ( ?? @ b
@ ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) ) ) )
| ( $true
= ( ( ( g @ x )
= sK0 )
| ( ( g @ y )
= sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f16]) ).
thf(f39,plain,
( ( $true
= ( ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) )
@ sK1 ) )
| ( $true
= ( ( ( g @ x )
= sK0 )
| ( ( g @ y )
= sK0 ) ) ) ),
inference(sigma_proxy_clausification,[],[f38]) ).
thf(f40,plain,
( ( $true
= ( ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) )
@ sK1 ) )
| ( $true
= ( ( g @ y )
= sK0 ) )
| ( $true
= ( ( g @ x )
= sK0 ) ) ),
inference(or_proxy_clausification,[],[f39]) ).
thf(f41,plain,
( ( $true
= ( ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) )
@ sK1 ) )
| ( ( g @ y )
= sK0 )
| ( $true
= ( ( g @ x )
= sK0 ) ) ),
inference(equality_proxy_clausification,[],[f40]) ).
thf(f42,plain,
( ( $true
= ( ^ [Y0: b] :
( ( ( x = Y0 )
| ( y = Y0 ) )
& ( ( g @ Y0 )
= sK0 ) )
@ sK1 ) )
| ( ( g @ y )
= sK0 )
| ( ( g @ x )
= sK0 ) ),
inference(equality_proxy_clausification,[],[f41]) ).
thf(f43,plain,
( ( $true
= ( ( ( x = sK1 )
| ( y = sK1 ) )
& ( ( g @ sK1 )
= sK0 ) ) )
| ( ( g @ y )
= sK0 )
| ( ( g @ x )
= sK0 ) ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f44,plain,
( ( $true
= ( ( g @ sK1 )
= sK0 ) )
| ( ( g @ y )
= sK0 )
| ( ( g @ x )
= sK0 ) ),
inference(and_proxy_clausification,[],[f43]) ).
thf(f45,plain,
( ( $true
= ( ( x = sK1 )
| ( y = sK1 ) ) )
| ( ( g @ y )
= sK0 )
| ( ( g @ x )
= sK0 ) ),
inference(and_proxy_clausification,[],[f43]) ).
thf(f46,plain,
( ( $true
= ( y = sK1 ) )
| ( ( g @ y )
= sK0 )
| ( ( g @ x )
= sK0 )
| ( $true
= ( x = sK1 ) ) ),
inference(or_proxy_clausification,[],[f45]) ).
thf(f47,plain,
( ( y = sK1 )
| ( ( g @ y )
= sK0 )
| ( ( g @ x )
= sK0 )
| ( $true
= ( x = sK1 ) ) ),
inference(equality_proxy_clausification,[],[f46]) ).
thf(f48,plain,
( ( y = sK1 )
| ( ( g @ y )
= sK0 )
| ( ( g @ x )
= sK0 )
| ( x = sK1 ) ),
inference(equality_proxy_clausification,[],[f47]) ).
thf(f49,plain,
( ( sK0
= ( g @ sK1 ) )
| ( ( g @ y )
= sK0 )
| ( ( g @ x )
= sK0 ) ),
inference(equality_proxy_clausification,[],[f44]) ).
thf(f51,definition,
( spl2_1
<=> ( ( g @ x )
= sK0 ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f52,plain,
( ( ( g @ x )
= sK0 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f51]) ).
thf(f55,definition,
( spl2_2
<=> ! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( x != X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f56,plain,
( ! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( x != X1 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f57,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f28,f55,f51]) ).
thf(f59,definition,
( spl2_3
<=> ! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( y != X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f60,plain,
( ! [X1: b] :
( ( ( g @ X1 )
!= sK0 )
| ( y != X1 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f63,definition,
( spl2_4
<=> ( ( g @ y )
= sK0 ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f64,plain,
( ( ( g @ y )
= sK0 )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f63]) ).
thf(f67,plain,
( ~ spl2_4
| spl2_3 ),
inference(avatar_split_clause,[],[f37,f59,f63]) ).
thf(f69,definition,
( spl2_5
<=> ( x = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
thf(f71,plain,
( ( x = sK1 )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f73,definition,
( spl2_6
<=> ( y = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
thf(f75,plain,
( ( y = sK1 )
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f73]) ).
thf(f76,plain,
( spl2_5
| spl2_1
| spl2_4
| spl2_6 ),
inference(avatar_split_clause,[],[f48,f73,f63,f51,f69]) ).
thf(f78,definition,
( spl2_7
<=> ( sK0
= ( g @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).
thf(f80,plain,
( ( sK0
= ( g @ sK1 ) )
| ~ spl2_7 ),
inference(avatar_component_clause,[],[f78]) ).
thf(f81,plain,
( spl2_1
| spl2_4
| spl2_7 ),
inference(avatar_split_clause,[],[f49,f78,f63,f51]) ).
thf(f84,plain,
( ! [X0: b] :
( ( ( g @ y )
!= ( g @ X0 ) )
| ( y != X0 ) )
| ~ spl2_3
| ~ spl2_4 ),
inference(constrained_superposition,[],[f60,f64]) ).
thf(f86,plain,
( ( y != y )
| ~ spl2_3
| ~ spl2_4 ),
inference(equality_resolution,[],[f84]) ).
thf(f87,plain,
( $false
| ~ spl2_3
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f88,plain,
( ~ spl2_3
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f87]) ).
thf(f90,plain,
( ( ( g @ y )
= sK0 )
| ~ spl2_6
| ~ spl2_7 ),
inference(constrained_superposition,[],[f80,f75]) ).
thf(f96,plain,
( spl2_4
| ~ spl2_6
| ~ spl2_7 ),
inference(avatar_split_clause,[],[f90,f78,f73,f63]) ).
thf(f98,plain,
( ! [X0: b] :
( ( ( g @ x )
!= ( g @ X0 ) )
| ( x != X0 ) )
| ~ spl2_1
| ~ spl2_2 ),
inference(constrained_superposition,[],[f56,f52]) ).
thf(f103,plain,
( ( x != x )
| ~ spl2_1
| ~ spl2_2 ),
inference(equality_resolution,[],[f98]) ).
thf(f104,plain,
( $false
| ~ spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f103]) ).
thf(f105,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f104]) ).
thf(f108,plain,
( ( ( g @ x )
= sK0 )
| ~ spl2_5
| ~ spl2_7 ),
inference(constrained_superposition,[],[f80,f71]) ).
thf(f109,plain,
( spl2_1
| ~ spl2_5
| ~ spl2_7 ),
inference(avatar_split_clause,[],[f108,f78,f69,f51]) ).
cnf(s1,plain,
( ~ spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f57]) ).
cnf(s4,plain,
( spl2_3
| ~ spl2_4 ),
inference(sat_conversion,[],[f67]) ).
cnf(s5,plain,
( spl2_1
| spl2_4
| spl2_5
| spl2_6 ),
inference(sat_conversion,[],[f76]) ).
cnf(s6,plain,
( spl2_1
| spl2_4
| spl2_7 ),
inference(sat_conversion,[],[f81]) ).
cnf(s7,plain,
( ~ spl2_3
| ~ spl2_4 ),
inference(sat_conversion,[],[f88]) ).
cnf(s9,plain,
( spl2_4
| ~ spl2_6
| ~ spl2_7 ),
inference(sat_conversion,[],[f96]) ).
cnf(s10,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f105]) ).
cnf(s12,plain,
( spl2_1
| ~ spl2_5
| ~ spl2_7 ),
inference(sat_conversion,[],[f109]) ).
cnf(s13,plain,
( spl2_4
| spl2_1 ),
inference(rat,[],[s5,s12,s9,s6]) ).
cnf(s14,plain,
~ spl2_4,
inference(rat,[],[s4,s7]) ).
cnf(s15,plain,
spl2_1,
inference(rat,[],[s13,s14]) ).
cnf(s16,plain,
~ spl2_2,
inference(rat,[],[s10,s15]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s1,s16,s15]) ).
thf(f110,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU896^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n010.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 14:45:04 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.25 % (2956093)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (2956104)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=587896778:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.09/0.25 % (2956104) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2956093-2956104"...
% 0.09/0.25 % (2956099)% WARNING: option uhcvi not known.
% 0.09/0.25 % (2956104)...printing done.
% 0.09/0.25 % (2956104)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (2956104)------------------------------
% 0.09/0.25 % (2956104)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (2956104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (2956104)CaDiCaL version: 2.1.3
% 0.09/0.25 % (2956104)Termination reason: Refutation
% 0.09/0.25 % (2956104)Time elapsed: 0.003 s
% 0.09/0.25 % (2956104)Peak memory usage: 13 MB
% 0.09/0.25 % (2956104)Instructions burned: 7 (million)
% 0.09/0.25 % (2956093)Success in time 0.019 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------