%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV429^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:39:57 AM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 46 unt; 0 typ; 0 def)
% Number of atoms : 195 ( 45 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 231 ( 21 ~; 13 |; 0 &; 174 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 77 ( 77 >; 0 *; 0 +; 0 <<)
% Number of symbols : 48 ( 44 usr; 5 con; 0-4 aty)
% ( 12 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 109 ( 105 ^; 4 !; 0 ?; 109 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
individuals: $tType ).
thf(func_def_1,type,
prop_a: $i > $o ).
thf(func_def_2,type,
prop_b: $i > $o ).
thf(func_def_3,type,
prop_c: $i > $o ).
thf(func_def_4,type,
mfalse: $i > $o ).
thf(func_def_5,type,
mtrue: $i > $o ).
thf(func_def_6,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
miff: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_12,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_13,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_14,type,
mall: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_15,type,
mexists: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_16,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_17,type,
msatisfiable: ( $i > $o ) > $o ).
thf(func_def_18,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_19,type,
minvalid: ( $i > $o ) > $o ).
thf(func_def_20,type,
rel: $i > $i > $o ).
thf(func_def_21,type,
icl_atom: ( $i > $o ) > $i > $o ).
thf(func_def_22,type,
icl_princ: ( $i > $o ) > $i > $o ).
thf(func_def_23,type,
icl_and: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_24,type,
icl_or: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_25,type,
icl_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_26,type,
icl_true: $i > $o ).
thf(func_def_27,type,
icl_false: $i > $o ).
thf(func_def_28,type,
icl_says: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_29,type,
iclval: ( $i > $o ) > $o ).
thf(func_def_30,type,
icl_impl_princ: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_31,type,
a: $i > $o ).
thf(func_def_32,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_33,type,
vNOT: $o > $o ).
thf(func_def_34,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_35,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_37,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_40,type,
vAND: $o > $o > $o ).
thf(func_def_41,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_42,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vOR: $o > $o > $o ).
thf(func_def_44,type,
vIMP: $o > $o > $o ).
thf(f3,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mnot) ).
thf(f4,axiom,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mor) ).
thf(f6,axiom,
( mimpl
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mimpl) ).
thf(f8,axiom,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(f12,axiom,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(f17,axiom,
( ( ^ [X0: $i > $o] : X0 )
= icl_princ ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_princ) ).
thf(f24,axiom,
( iclval
= ( ^ [X0: $i > $o] : ( mvalid @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_s4_valid) ).
thf(f25,axiom,
( icl_impl_princ
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mbox @ rel @ ( mimpl @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^2.ax',icl_impl_princ) ).
thf(f26,conjecture,
iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f27,negated_conjecture,
~ ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) ),
inference(negated_conjecture,[status(cth)],[f26]) ).
thf(f33,plain,
( icl_impl_princ
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mbox @ rel @ ( mimpl @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f25]) ).
thf(f37,plain,
( icl_princ
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(fool_elimination,[],[f17]) ).
thf(f38,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f39,plain,
~ ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) ),
inference(rectify,[],[f27]) ).
thf(f40,plain,
( ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) )
!= $true ),
inference(fool_elimination,[],[f39]) ).
thf(f46,plain,
( iclval
= ( ^ [Y0: $i > $o] : ( mvalid @ Y0 ) ) ),
inference(fool_elimination,[],[f24]) ).
thf(f54,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f55,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f54]) ).
thf(f58,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
inference(rectify,[],[f12]) ).
thf(f59,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f58]) ).
thf(f60,plain,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
inference(rectify,[],[f3]) ).
thf(f61,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f60]) ).
thf(f62,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f63,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f62]) ).
thf(f64,plain,
( ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) )
!= $true ),
inference(flattening,[],[f40]) ).
thf(f65,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f59]) ).
thf(f68,plain,
( icl_impl_princ
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mbox @ rel @ ( mimpl @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f33]) ).
thf(f72,plain,
( icl_princ
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f75,plain,
( iclval
= ( ^ [Y0: $i > $o] : ( mvalid @ Y0 ) ) ),
inference(cnf_transformation,[],[f46]) ).
thf(f83,plain,
( ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) )
!= $true ),
inference(cnf_transformation,[],[f64]) ).
thf(f85,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f63]) ).
thf(f86,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f55]) ).
thf(f88,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f61]) ).
thf(f90,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f38]) ).
thf(f93,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 ) ) ),
inference(definition_unfolding,[],[f90,f86,f88]) ).
thf(f102,plain,
( iclval
= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
@ Y0 ) ) ),
inference(definition_unfolding,[],[f75,f65]) ).
thf(f103,plain,
( icl_impl_princ
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ( Y2 @ Y4 @ Y5 )
=> ( Y3 @ Y5 ) ) )
@ rel
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y5 @ Y6 )
| ( Y4 @ Y6 ) )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y2 )
@ Y3 )
@ Y0
@ Y1 ) ) ) ),
inference(definition_unfolding,[],[f68,f85,f93]) ).
thf(f104,plain,
( ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
@ Y0 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ( Y2 @ Y4 @ Y5 )
=> ( Y3 @ Y5 ) ) )
@ rel
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y5 @ Y6 )
| ( Y4 @ Y6 ) )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y2 )
@ Y3 )
@ Y0
@ Y1 ) )
@ ( ^ [Y0: $i > $o] : Y0
@ a )
@ ( ^ [Y0: $i > $o] : Y0
@ a ) ) )
!= $true ),
inference(definition_unfolding,[],[f83,f102,f103,f72,f72]) ).
thf(f105,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel @ Y0 @ Y1 )
=> ( ( a @ Y1 )
| ~ ( a @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f104]) ).
thf(f106,plain,
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel @ Y0 @ Y1 )
=> ( ( a @ Y1 )
| ~ ( a @ Y1 ) ) ) )
@ sK0 )
= $false ),
inference(sigma_proxy_clausification,[],[f105]) ).
thf(f107,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( rel @ sK0 @ Y0 )
=> ( ( a @ Y0 )
| ~ ( a @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f106]) ).
thf(f108,plain,
( $false
= ( ^ [Y0: $i] :
( ( rel @ sK0 @ Y0 )
=> ( ( a @ Y0 )
| ~ ( a @ Y0 ) ) )
@ sK1 ) ),
inference(sigma_proxy_clausification,[],[f107]) ).
thf(f109,plain,
( $false
= ( ( rel @ sK0 @ sK1 )
=> ( ( a @ sK1 )
| ~ ( a @ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f108]) ).
thf(f110,plain,
( ( ( a @ sK1 )
| ~ ( a @ sK1 ) )
= $false ),
inference(imp_proxy_clausification,[],[f109]) ).
thf(f112,plain,
( $false
= ( ~ ( a @ sK1 ) ) ),
inference(or_proxy_clausification,[],[f110]) ).
thf(f113,plain,
( $false
= ( a @ sK1 ) ),
inference(or_proxy_clausification,[],[f110]) ).
thf(f114,plain,
( ( a @ sK1 )
= $true ),
inference(not_proxy_clausification,[],[f112]) ).
thf(f115,plain,
$false = $true,
inference(forward_demodulation,[],[f114,f113]) ).
thf(f116,plain,
$false,
inference(trivial_inequality_removal,[],[f115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV429^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.15 % Computer : n005.cluster.edu
% 0.10/0.15 % Model : x86_64 x86_64
% 0.10/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.15 % Memory : 8046.5625MB
% 0.10/0.15 % OS : Linux 6.8.0-71-generic
% 0.10/0.15 % CPULimit : 300
% 0.10/0.15 % WCLimit : 300
% 0.10/0.15 % DateTime : Tue Sep 29 16:02:38 UTC 2026
% 0.10/0.15 % CPUTime :
% 0.10/0.15 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 Running higher-order theorem proving
% 0.10/0.20 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.26 % (1848313)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.26 % (1848321)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=864243521: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.26 % (1848324)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.26 % (1848324)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.26 % (1848319)lrs+10_16_si=on:nwc=1.5:random_seed=2647693652:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.10/0.26 % (1848318)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=647881745:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.10/0.26 % (1848320)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1613150513:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.10/0.26 % (1848322)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3449047454:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.10/0.26 % (1848324)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=674429964:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.10/0.26 % (1848319) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1848313-1848319"...
% 0.10/0.26 % (1848320)Refutation not found, incomplete strategy
% 0.10/0.26 % (1848320)------------------------------
% 0.10/0.26 % (1848320)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26 % (1848320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26 % (1848320)CaDiCaL version: 2.1.3
% 0.10/0.26 % (1848320)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.26 % (1848320)Time elapsed: 0.002 s
% 0.10/0.26 % (1848320)Peak memory usage: 11 MB
% 0.10/0.26 % (1848320)Instructions burned: 4 (million)
% 0.10/0.26 % (1848318) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1848313-1848318"...
% 0.10/0.26 % (1848320)------------------------------
% 0.10/0.26 % (1848320)------------------------------
% 0.10/0.26 % (1848324) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1848313-1848324"...
% 0.10/0.26 % (1848319)...printing done.
% 0.10/0.26 % (1848318)...printing done.
% 0.10/0.26 % (1848319)Refutation found. Thanks to Tanya!
% 0.10/0.26 % SZS status Theorem for theBenchmark
% 0.10/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.26 % (1848319)------------------------------
% 0.10/0.26 % (1848319)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26 % (1848319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26 % (1848319)CaDiCaL version: 2.1.3
% 0.10/0.26 % (1848319)Termination reason: Refutation
% 0.10/0.26 % (1848319)Time elapsed: 0.004 s
% 0.10/0.26 % (1848319)Peak memory usage: 11 MB
% 0.10/0.26 % (1848319)Instructions burned: 6 (million)
% 0.10/0.26 % (1848313)Success in time 0.045 s
% 0.10/0.26 % Vampire exiting
%------------------------------------------------------------------------------