%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU702^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:30:51 AM UTC 2026
% Result : Theorem 0.27s 0.37s
% Output : Refutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 63 ( 18 unt; 0 typ; 6 def)
% Number of atoms : 514 ( 148 equ; 5 cnn)
% Maximal formula atoms : 8 ( 8 avg)
% Number of connectives : 506 ( 88 ~; 86 |; 51 &; 250 @)
% ( 9 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 23 usr; 16 con; 0-4 aty)
% Number of variables : 98 ( 0 sgn 52 !; 18 ?; 98 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_2,type,
dsetconstrI: $o ).
thf(func_def_6,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_8,type,
vOR: $o > $o > $o ).
thf(func_def_9,type,
vAND: $o > $o > $o ).
thf(func_def_10,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_11,type,
vNOT: $o > $o ).
thf(func_def_13,type,
sK1: $o ).
thf(func_def_18,type,
sK6: $i > $o ).
thf(f1,axiom,
! [X0: $i,X2: $i,X1: $i > $o] :
( ( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) )
= dsetconstrI ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrI) ).
thf(f2,conjecture,
( dsetconstrI
=> ! [X1: $o,X0: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( X1
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X4: $i] :
( ( X1
& ( X4 = X2 ) )
| ( ~ X1
& ( X4 = X3 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iftrueProp1) ).
thf(f3,negated_conjecture,
~ ( dsetconstrI
=> ! [X1: $o,X0: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( X1
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X4: $i] :
( ( X1
& ( X4 = X2 ) )
| ( ~ X1
& ( X4 = X3 ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
! [X0: $i,X1: $i,X2: $i > $o] :
( ( ( in @ X1 @ X0 )
=> ( ( X2 @ X1 )
=> ( in @ X1
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X2 @ X3 ) ) ) ) )
= dsetconstrI ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( ! [X0: $i,X2: $i > $o,X1: $i] :
( ( ( in @ X1 @ X0 )
= $true )
=> ( ( ( X2 @ X1 )
= $true )
=> ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
= $true ) ) )
<=> ( dsetconstrI = $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( dsetconstrI
=> ! [X0: $o,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( X0
=> ( in @ X2
@ ( dsetconstr @ X1
@ ^ [X4: $i] :
( ( X0
& ( X4 = X2 ) )
| ( ~ X0
& ( X4 = X3 ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( dsetconstrI = $true )
=> ! [X0: $o,X1: $i,X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
=> ( ( $true = X0 )
=> ( ( in @ X2
@ ( dsetconstr @ X1
@ ^ [Y0: $i] :
( ( ( X3 = Y0 )
& ~ X0 )
| ( ( X2 = Y0 )
& X0 ) ) ) )
= $true ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ! [X0: $i,X2: $i > $o,X1: $i] :
( ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
= $true )
| ( ( X2 @ X1 )
!= $true )
| ( ( in @ X1 @ X0 )
!= $true ) )
<=> ( dsetconstrI = $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f9,plain,
( ! [X1: $i,X0: $i,X2: $i > $o] :
( ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
= $true )
| ( ( in @ X1 @ X0 )
!= $true )
| ( ( X2 @ X1 )
!= $true ) )
<=> ( dsetconstrI = $true ) ),
inference(flattening,[],[f8]) ).
thf(f10,plain,
( ? [X0: $o,X1: $i,X2: $i] :
( ? [X3: $i] :
( ( ( in @ X2
@ ( dsetconstr @ X1
@ ^ [Y0: $i] :
( ( ( X3 = Y0 )
& ~ X0 )
| ( ( X2 = Y0 )
& X0 ) ) ) )
!= $true )
& ( $true = X0 )
& ( ( in @ X3 @ X1 )
= $true ) )
& ( ( in @ X2 @ X1 )
= $true ) )
& ( dsetconstrI = $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f11,plain,
( ? [X1: $i,X0: $o,X2: $i] :
( ? [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
& ( ( in @ X2
@ ( dsetconstr @ X1
@ ^ [Y0: $i] :
( ( ( X3 = Y0 )
& ~ X0 )
| ( ( X2 = Y0 )
& X0 ) ) ) )
!= $true )
& ( $true = X0 ) )
& ( ( in @ X2 @ X1 )
= $true ) )
& ( dsetconstrI = $true ) ),
inference(flattening,[],[f10]) ).
thf(f12,plain,
( ? [X0: $i,X1: $o,X2: $i] :
( ? [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
& ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] :
( ( ( X3 = Y0 )
& ~ X1 )
| ( ( X2 = Y0 )
& X1 ) ) ) )
!= $true )
& ( $true = X1 ) )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( dsetconstrI = $true ) ),
inference(rectify,[],[f11]) ).
thf(f13,plain,
( ( ( in @ sK3 @ sK0 )
= $true )
& ( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] :
( ( ( sK3 = Y0 )
& ~ sK1 )
| ( ( sK2 = Y0 )
& sK1 ) ) ) )
!= $true )
& ( sK1 = $true )
& ( $true
= ( in @ sK2 @ sK0 ) )
& ( dsetconstrI = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f12]) ).
thf(f14,plain,
( ( ! [X1: $i,X0: $i,X2: $i > $o] :
( ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
= $true )
| ( ( in @ X1 @ X0 )
!= $true )
| ( ( X2 @ X1 )
!= $true ) )
| ( dsetconstrI != $true ) )
& ( ( dsetconstrI = $true )
| ? [X1: $i,X0: $i,X2: $i > $o] :
( ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
!= $true )
& ( ( in @ X1 @ X0 )
= $true )
& ( ( X2 @ X1 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f9]) ).
thf(f15,plain,
( ( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( ( in @ X0
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
= $true )
| ( ( in @ X0 @ X1 )
!= $true )
| ( ( X2 @ X0 )
!= $true ) )
| ( dsetconstrI != $true ) )
& ( ( dsetconstrI = $true )
| ? [X3: $i,X4: $i,X5: $i > $o] :
( ( ( in @ X3
@ ( dsetconstr @ X4
@ ^ [Y0: $i] : ( X5 @ Y0 ) ) )
!= $true )
& ( ( in @ X3 @ X4 )
= $true )
& ( ( X5 @ X3 )
= $true ) ) ) ),
inference(rectify,[],[f14]) ).
thf(f16,plain,
( ( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( ( in @ X0
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
= $true )
| ( ( in @ X0 @ X1 )
!= $true )
| ( ( X2 @ X0 )
!= $true ) )
| ( dsetconstrI != $true ) )
& ( ( dsetconstrI = $true )
| ( ( ( in @ sK4
@ ( dsetconstr @ sK5
@ ^ [Y0: $i] : ( sK6 @ Y0 ) ) )
!= $true )
& ( ( in @ sK4 @ sK5 )
= $true )
& ( ( sK6 @ sK4 )
= $true ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X3,sK4),skolemize(X4,sK5),skolemize(X5,sK6)],[f15]) ).
thf(f17,plain,
dsetconstrI = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
( $true
= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f19,plain,
sK1 = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f20,plain,
( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] :
( ( ( sK3 = Y0 )
& ~ sK1 )
| ( ( sK2 = Y0 )
& sK1 ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f25,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ X0
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
= $true )
| ( dsetconstrI != $true )
| ( ( in @ X0 @ X1 )
!= $true )
| ( ( X2 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f27,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ X0 @ X1 )
!= $true )
| ( ( in @ X0 @ ( dsetconstr @ X1 @ X2 ) )
= $true )
| ( ( X2 @ X0 )
!= $true )
| ( dsetconstrI != $true ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f30,definition,
( spl7_1
<=> ( dsetconstrI = $true ) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
thf(f34,definition,
( spl7_2
<=> ! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ X0 @ X1 )
!= $true )
| ( ( X2 @ X0 )
!= $true )
| ( ( in @ X0 @ ( dsetconstr @ X1 @ X2 ) )
= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
thf(f35,plain,
( ! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ X0 @ ( dsetconstr @ X1 @ X2 ) )
= $true )
| ( ( X2 @ X0 )
!= $true )
| ( ( in @ X0 @ X1 )
!= $true ) )
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f36,plain,
( ~ spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f27,f34,f30]) ).
thf(f38,definition,
( spl7_3
<=> ( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] :
( ( ( sK3 = Y0 )
& ~ sK1 )
| ( ( sK2 = Y0 )
& sK1 ) ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
thf(f40,plain,
( ( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] :
( ( ( sK3 = Y0 )
& ~ sK1 )
| ( ( sK2 = Y0 )
& sK1 ) ) ) )
!= $true )
| spl7_3 ),
inference(avatar_component_clause,[],[f38]) ).
thf(f41,plain,
~ spl7_3,
inference(avatar_split_clause,[],[f20,f38]) ).
thf(f43,definition,
( spl7_4
<=> ( $true
= ( in @ sK2 @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
thf(f45,plain,
( ( $true
= ( in @ sK2 @ sK0 ) )
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f43]) ).
thf(f46,plain,
spl7_4,
inference(avatar_split_clause,[],[f18,f43]) ).
thf(f47,plain,
spl7_1,
inference(avatar_split_clause,[],[f17,f30]) ).
thf(f54,definition,
( spl7_6
<=> ( sK1 = $true ) ),
introduced(definition,[new_symbols(definition,[spl7_6])],[avatar_definition]) ).
thf(f56,plain,
( ( sK1 = $true )
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f57,plain,
spl7_6,
inference(avatar_split_clause,[],[f19,f54]) ).
thf(f74,plain,
( ( $false = sK1 )
| ( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] :
( ( ( sK3 = Y0 )
& ~ $true )
| ( ( sK2 = Y0 )
& $true ) ) ) )
!= $true )
| spl7_3 ),
inference(fool_paramodulation,[],[f40]) ).
thf(f75,plain,
( ( $false = sK1 )
| ( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] :
( ( ( sK3 = Y0 )
& ~ $true )
| ( sK2 = Y0 ) ) ) )
!= $true )
| spl7_3 ),
inference(boolean_simplification,[],[f74]) ).
thf(f76,plain,
( ( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] :
( ( ( sK3 = Y0 )
& $false )
| ( sK2 = Y0 ) ) ) )
!= $true )
| ( $false = sK1 )
| spl7_3 ),
inference(boolean_simplification,[],[f75]) ).
thf(f77,plain,
( ( $false = sK1 )
| ( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] :
( $false
| ( sK2 = Y0 ) ) ) )
!= $true )
| spl7_3 ),
inference(boolean_simplification,[],[f76]) ).
thf(f78,plain,
( ( ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK2 = Y0 ) ) )
!= $true )
| ( $false = sK1 )
| spl7_3 ),
inference(boolean_simplification,[],[f77]) ).
thf(f79,plain,
( ( $false = sK1 )
| ( ( in @ sK2 @ ( dsetconstr @ sK0 @ ( (=) @ sK2 ) ) )
!= $true )
| spl7_3 ),
inference(beta-eta_normalization,[],[f78]) ).
thf(f80,plain,
( ( ( in @ sK2 @ ( dsetconstr @ sK0 @ ( (=) @ sK2 ) ) )
!= $true )
| ( $false = $true )
| spl7_3
| ~ spl7_6 ),
inference(forward_demodulation,[],[f79,f56]) ).
thf(f81,plain,
( ( ( in @ sK2 @ ( dsetconstr @ sK0 @ ( (=) @ sK2 ) ) )
!= $true )
| spl7_3
| ~ spl7_6 ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f83,definition,
( spl7_10
<=> ( ( in @ sK2 @ ( dsetconstr @ sK0 @ ( (=) @ sK2 ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl7_10])],[avatar_definition]) ).
thf(f85,plain,
( ( ( in @ sK2 @ ( dsetconstr @ sK0 @ ( (=) @ sK2 ) ) )
!= $true )
| spl7_10 ),
inference(avatar_component_clause,[],[f83]) ).
thf(f86,plain,
( ~ spl7_10
| spl7_3
| ~ spl7_6 ),
inference(avatar_split_clause,[],[f81,f54,f38,f83]) ).
thf(f89,plain,
( ( ( sK2 = sK2 )
!= $true )
| ( $true
!= ( in @ sK2 @ sK0 ) )
| ( $true != $true )
| ~ spl7_2
| spl7_10 ),
inference(superposition,[],[f85,f35]) ).
thf(f90,plain,
( ( $true
!= ( in @ sK2 @ sK0 ) )
| ( $true != $true )
| ( sK2 != sK2 )
| ~ spl7_2
| spl7_10 ),
inference(equality_proxy_clausification,[],[f89]) ).
thf(f91,plain,
( ( $true
!= ( in @ sK2 @ sK0 ) )
| ~ spl7_2
| spl7_10 ),
inference(trivial_inequality_removal,[],[f90]) ).
thf(f102,plain,
( $false
| ~ spl7_2
| ~ spl7_4
| spl7_10 ),
inference(forward_subsumption_resolution,[],[f91,f45]) ).
thf(f103,plain,
( ~ spl7_2
| ~ spl7_4
| spl7_10 ),
inference(avatar_contradiction_clause,[],[f102]) ).
cnf(s1,plain,
( ~ spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f36]) ).
cnf(s2,plain,
~ spl7_3,
inference(sat_conversion,[],[f41]) ).
cnf(s3,plain,
spl7_4,
inference(sat_conversion,[],[f46]) ).
cnf(s4,plain,
spl7_1,
inference(sat_conversion,[],[f47]) ).
cnf(s6,plain,
spl7_6,
inference(sat_conversion,[],[f57]) ).
cnf(s10,plain,
( spl7_3
| ~ spl7_6
| ~ spl7_10 ),
inference(sat_conversion,[],[f86]) ).
cnf(s11,plain,
( ~ spl7_2
| ~ spl7_4
| spl7_10 ),
inference(sat_conversion,[],[f103]) ).
cnf(s13,plain,
~ spl7_10,
inference(rat,[],[s10,s6,s2]) ).
cnf(s14,plain,
~ spl7_2,
inference(rat,[],[s11,s3,s13]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s1,s14,s4]) ).
thf(f110,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU702^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.26 % Computer : n009.cluster.edu
% 0.10/0.26 % Model : x86_64 x86_64
% 0.10/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26 % Memory : 8046.5625MB
% 0.10/0.26 % OS : Linux 6.8.0-71-generic
% 0.10/0.26 % CPULimit : 300
% 0.10/0.26 % WCLimit : 300
% 0.10/0.26 % DateTime : Tue Sep 29 14:12:00 UTC 2026
% 0.10/0.27 % CPUTime :
% 0.10/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.32 Running higher-order theorem proving
% 0.27/0.33 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.27/0.37 % (4062128)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.27/0.37 % (4062136)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3627999794:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.27/0.37 % (4062136) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4062128-4062136"...
% 0.27/0.37 % (4062136)...printing done.
% 0.27/0.37 % (4062136)Refutation found. Thanks to Tanya!
% 0.27/0.37 % SZS status Theorem for theBenchmark
% 0.27/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.37 % (4062136)------------------------------
% 0.27/0.37 % (4062136)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.37 % (4062136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.37 % (4062136)CaDiCaL version: 2.1.3
% 0.27/0.37 % (4062136)Termination reason: Refutation
% 0.27/0.37 % (4062136)Time elapsed: 0.005 s
% 0.27/0.37 % (4062136)Peak memory usage: 13 MB
% 0.27/0.37 % (4062136)Instructions burned: 7 (million)
% 0.27/0.37 % (4062128)Success in time 0.027 s
% 0.27/0.37 % Vampire exiting
%------------------------------------------------------------------------------