%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU454^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:29:42 AM UTC 2026
% Result : Theorem 0.10s 0.28s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of formulae : 45 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 415 ( 136 equ; 0 cnn)
% Maximal formula atoms : 5 ( 9 avg)
% Number of connectives : 242 ( 17 ~; 83 |; 0 &; 138 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 50 ( 50 >; 0 *; 0 +; 0 <<)
% Number of symbols : 50 ( 46 usr; 5 con; 0-4 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 53 ( 52 ^; 1 !; 0 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_2,type,
inv: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_3,type,
idem: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_4,type,
infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_5,type,
mono: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_6,type,
refl: ( $i > $i > $o ) > $o ).
thf(func_def_7,type,
irrefl: ( $i > $i > $o ) > $o ).
thf(func_def_8,type,
rc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_9,type,
symm: ( $i > $i > $o ) > $o ).
thf(func_def_10,type,
antisymm: ( $i > $i > $o ) > $o ).
thf(func_def_11,type,
asymm: ( $i > $i > $o ) > $o ).
thf(func_def_12,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_13,type,
trans: ( $i > $i > $o ) > $o ).
thf(func_def_14,type,
tc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_15,type,
trc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_16,type,
trsc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_17,type,
po: ( $i > $i > $o ) > $o ).
thf(func_def_18,type,
so: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
total: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
term: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
ind: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
innf: ( $i > $i > $o ) > $i > $o ).
thf(func_def_23,type,
nfof: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_24,type,
norm: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
join: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_26,type,
lconfl: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
sconfl: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
confl: ( $i > $i > $o ) > $o ).
thf(func_def_29,type,
cr: ( $i > $i > $o ) > $o ).
thf(func_def_30,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_31,type,
vIMP: $o > $o > $o ).
thf(func_def_32,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_33,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_35,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_36,type,
vAND: $o > $o > $o ).
thf(func_def_37,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_38,type,
vNOT: $o > $o ).
thf(func_def_39,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_40,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_43,type,
vOR: $o > $o > $o ).
thf(func_def_44,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
sK0: $i > $i > $o ).
thf(f3,axiom,
( ( ^ [X0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o] :
( ( X0 @ ( X0 @ X1 ) )
= ( X0 @ X1 ) ) )
= idem ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',idempotent) ).
thf(f8,axiom,
( rc
= ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X1 = X2 )
| ( X0 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',reflexive_closure) ).
thf(f30,conjecture,
idem @ rc,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexive_closure_op_is_idempotent) ).
thf(f31,negated_conjecture,
~ ( idem @ rc ),
inference(negated_conjecture,[status(cth)],[f30]) ).
thf(f55,plain,
~ ( idem @ rc ),
inference(rectify,[],[f31]) ).
thf(f56,plain,
( ( idem @ rc )
!= $true ),
inference(fool_elimination,[],[f55]) ).
thf(f73,plain,
( idem
= ( ^ [Y0: ( $i > $i > $o ) > $i > $i > $o] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ( Y0 @ Y1 )
= ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f80,plain,
( rc
= ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X1 = X2 )
| ( X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f81,plain,
( rc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 ) ) ) ),
inference(fool_elimination,[],[f80]) ).
thf(f88,plain,
( ( idem @ rc )
!= $true ),
inference(flattening,[],[f56]) ).
thf(f95,plain,
( ( idem @ rc )
!= $true ),
inference(cnf_transformation,[],[f88]) ).
thf(f100,plain,
( rc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 ) ) ) ),
inference(cnf_transformation,[],[f81]) ).
thf(f114,plain,
( idem
= ( ^ [Y0: ( $i > $i > $o ) > $i > $i > $o] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ( Y0 @ Y1 )
= ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f73]) ).
thf(f136,plain,
( $true
!= ( ^ [Y0: ( $i > $i > $o ) > $i > $i > $o] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ( Y0 @ Y1 )
= ( Y0 @ ( Y0 @ Y1 ) ) ) )
@ ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 ) ) ) ),
inference(definition_unfolding,[],[f95,f114,f100]) ).
thf(f137,plain,
( $true
!= ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] :
( ( ^ [Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 ) ) )
= ( ^ [Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 )
| ( Y1 = Y2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f136]) ).
thf(f138,plain,
( $false
= ( ^ [Y0: $i > $i > $o] :
( ( ^ [Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 ) ) )
= ( ^ [Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 )
| ( Y1 = Y2 ) ) ) )
@ sK0 ) ),
inference(sigma_proxy_clausification,[],[f137]) ).
thf(f139,plain,
( $false
= ( ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( Y0 = Y1 ) ) )
= ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( Y0 = Y1 )
| ( Y0 = Y1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f138]) ).
thf(f140,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( Y0 = Y1 ) ) )
!= ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( Y0 = Y1 )
| ( Y0 = Y1 ) ) ) ),
inference(equality_proxy_clausification,[],[f139]) ).
thf(f141,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( Y0 = Y1 )
| ( Y0 = Y1 ) )
@ sK1 )
!= ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( Y0 = Y1 ) )
@ sK1 ) ),
inference(negative_extensionality,[],[f140]) ).
thf(f142,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 ) ) )
!= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 )
| ( sK1 = Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f141]) ).
thf(f143,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 )
| ( sK1 = Y0 ) )
@ sK2 )
!= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f142]) ).
thf(f144,plain,
( ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 ) )
@ sK2 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 )
| ( sK1 = Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f143]) ).
thf(f145,plain,
( ( ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 )
| ( sK1 = Y0 ) )
@ sK2 )
= $false )
| ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f143]) ).
thf(f146,plain,
( ( $false
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) ) )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK1 = sK2 ) )
= $false ) ),
inference(beta-eta_normalization,[],[f145]) ).
thf(f147,plain,
( ( $false
= ( sK1 = sK2 ) )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK1 = sK2 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f146]) ).
thf(f148,plain,
( ( ( sK0 @ sK1 @ sK2 )
= $false )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK1 = sK2 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f146]) ).
thf(f150,plain,
( ( ( sK0 @ sK1 @ sK2 )
= $false )
| ( $false
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f148]) ).
thf(f152,plain,
( ( ( sK0 @ sK1 @ sK2 )
= $false )
| ( ( sK0 @ sK1 @ sK2 )
= $false ) ),
inference(or_proxy_clausification,[],[f150]) ).
thf(f153,plain,
( ( sK0 @ sK1 @ sK2 )
= $false ),
inference(duplicate_literal_removal,[],[f152]) ).
thf(f156,plain,
( ( sK1 != sK2 )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK1 = sK2 ) )
= $false ) ),
inference(equality_proxy_clausification,[],[f147]) ).
thf(f158,plain,
( ( sK1 != sK2 )
| ( $false
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f156]) ).
thf(f159,plain,
( ( $false
= ( sK1 = sK2 ) )
| ( sK1 != sK2 ) ),
inference(or_proxy_clausification,[],[f158]) ).
thf(f161,plain,
( ( sK1 != sK2 )
| ( sK1 != sK2 ) ),
inference(equality_proxy_clausification,[],[f159]) ).
thf(f162,plain,
sK1 != sK2,
inference(duplicate_literal_removal,[],[f161]) ).
thf(f165,plain,
( ( $true
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) ) )
| ( $true
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK1 = sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f144]) ).
thf(f166,plain,
( ( $true
= ( sK1 = sK2 ) )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK1 = sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f165]) ).
thf(f167,plain,
( ( $true
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK1 = sK2 ) ) )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) ) ),
inference(equality_proxy_clausification,[],[f166]) ).
thf(f168,plain,
( ( $true
= ( sK1 = sK2 ) )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) ) )
| ( sK1 = sK2 ) ),
inference(or_proxy_clausification,[],[f167]) ).
thf(f169,plain,
( ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) ) )
| ( sK1 = sK2 ) ),
inference(equality_proxy_clausification,[],[f168]) ).
thf(f170,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK1 = sK2 ) )
| ( sK1 = sK2 ) ),
inference(or_proxy_clausification,[],[f169]) ).
thf(f171,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( sK1 = sK2 )
| ( sK1 = sK2 ) ),
inference(equality_proxy_clausification,[],[f170]) ).
thf(f172,plain,
( ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) ) ),
inference(duplicate_literal_removal,[],[f171]) ).
thf(f173,plain,
( $true
= ( sK0 @ sK1 @ sK2 ) ),
inference(forward_subsumption_resolution,[],[f172,f162]) ).
thf(f174,plain,
$true = $false,
inference(forward_demodulation,[],[f173,f153]) ).
thf(f175,plain,
$false,
inference(trivial_inequality_removal,[],[f174]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU454^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n005.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 13:41:16 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.23 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.10/0.28 % (1683146)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.28 % (1683161)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.10/0.28 % (1683161)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.10/0.28 % (1683156)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1672118973:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.10/0.28 % (1683158)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3420529199:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.10/0.28 % (1683155)lrs+10_16_si=on:nwc=1.5:random_seed=3507872380:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.10/0.28 % (1683161)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2550018041:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.10/0.28 % (1683156)Instruction limit reached!
% 0.10/0.28 % (1683156)------------------------------
% 0.10/0.28 % (1683156)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.28 % (1683156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.28 % (1683156)CaDiCaL version: 2.1.3
% 0.10/0.28 % (1683156)Termination reason: Instruction limit
% 0.10/0.28 % (1683156)Termination phase: Property scanning
% 0.10/0.28 % (1683156)Time elapsed: 0.002 s
% 0.10/0.28 % (1683156)Peak memory usage: 10 MB
% 0.10/0.28 % (1683156)Instructions burned: 4 (million)
% 0.10/0.28 % (1683159)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1487334785:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.10/0.28 % (1683157)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=977950162: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.10/0.28 % (1683155) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1683146-1683155"...
% 0.10/0.28 % (1683161) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1683146-1683161"...
% 0.10/0.28 % (1683159) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1683146-1683159"...
% 0.10/0.28 % (1683155)...printing done.
% 0.10/0.28 % (1683161)...printing done.
% 0.10/0.28 % (1683159)...printing done.
% 0.10/0.28 % (1683155)Refutation found. Thanks to Tanya!
% 0.10/0.28 % SZS status Theorem for theBenchmark
% 0.10/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.29 % (1683155)------------------------------
% 0.10/0.29 % (1683155)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.29 % (1683155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.29 % (1683155)CaDiCaL version: 2.1.3
% 0.10/0.29 % (1683155)Termination reason: Refutation
% 0.10/0.29 % (1683155)Time elapsed: 0.008 s
% 0.10/0.29 % (1683155)Peak memory usage: 12 MB
% 0.10/0.29 % (1683155)Instructions burned: 12 (million)
% 0.10/0.29 % (1683146)Success in time 0.048 s
% 0.10/0.29 % Vampire exiting
%------------------------------------------------------------------------------