TSTP Solution File: NUN051^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUN051^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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 : Tue May 21 02:17:02 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of formulae : 39 ( 12 unt; 14 typ; 0 def)
% Number of atoms : 90 ( 34 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 325 ( 13 ~; 3 |; 4 &; 297 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 60 ( 13 ^ 38 !; 6 ?; 60 :)
% ( 3 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
'type/nums/num': $tType ).
thf(func_def_0,type,
'type/nums/num': $tType ).
thf(func_def_1,type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_2,type,
'const/nums/_0': 'type/nums/num' ).
thf(func_def_3,type,
'const/iterate/nsum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/nums/num' ) > 'type/nums/num' ) ).
thf(func_def_4,type,
'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_5,type,
'const/arith/+': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).
thf(func_def_6,type,
'const/arith/-': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).
thf(func_def_7,type,
'const/arith/<=': 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_9,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_14,type,
sK0: 'type/nums/num' > 'type/nums/num' ).
thf(func_def_15,type,
sK1: 'type/nums/num' ).
thf(func_def_16,type,
sK2: 'type/nums/num' ).
thf(func_def_18,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f29,plain,
$false,
inference(trivial_inequality_removal,[],[f28]) ).
thf(f28,plain,
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) ),
inference(forward_demodulation,[],[f27,f18]) ).
thf(f18,plain,
! [X0: 'type/nums/num'] :
( ( 'const/arith/+' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ X0 )
= X0 ),
inference(cnf_transformation,[],[f2]) ).
thf(f2,axiom,
! [X0: 'type/nums/num'] :
( ( 'const/arith/+' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ X0 )
= X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/arith/ADD_CLAUSES_0') ).
thf(f27,plain,
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ sK1 ) @ sK2 ) @ sK0 )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) ),
inference(superposition,[],[f17,f24]) ).
thf(f24,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/nums/num'] :
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ ( 'const/arith/-' @ sK2 @ sK1 ) )
@ ^ [Y0: 'type/nums/num'] : ( X1 @ ( 'const/arith/+' @ Y0 @ sK1 ) ) )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ X0 @ sK1 ) @ sK2 ) @ X1 ) ),
inference(superposition,[],[f19,f22]) ).
thf(f22,plain,
( sK2
= ( 'const/arith/+' @ ( 'const/arith/-' @ sK2 @ sK1 ) @ sK1 ) ),
inference(trivial_inequality_removal,[],[f21]) ).
thf(f21,plain,
( ( sK2
= ( 'const/arith/+' @ ( 'const/arith/-' @ sK2 @ sK1 ) @ sK1 ) )
| ( $true != $true ) ),
inference(superposition,[],[f20,f16]) ).
thf(f16,plain,
( $true
= ( 'const/arith/<=' @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ sK2 @ sK1 ) )
@ ^ [Y0: 'type/nums/num'] : ( sK0 @ ( 'const/arith/+' @ Y0 @ sK1 ) ) )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
& ( $true
= ( 'const/arith/<=' @ sK1 @ sK2 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f13,f14]) ).
thf(f14,plain,
( ? [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X1 ) )
@ ^ [Y0: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ Y0 @ X1 ) ) ) )
& ( ( 'const/arith/<=' @ X1 @ X2 )
= $true ) )
=> ( ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ sK2 @ sK1 ) )
@ ^ [Y0: 'type/nums/num'] : ( sK0 @ ( 'const/arith/+' @ Y0 @ sK1 ) ) )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
& ( $true
= ( 'const/arith/<=' @ sK1 @ sK2 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
? [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X1 ) )
@ ^ [Y0: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ Y0 @ X1 ) ) ) )
& ( ( 'const/arith/<=' @ X1 @ X2 )
= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X1 @ X2 )
= $true )
=> ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X1 ) )
@ ^ [Y0: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ Y0 @ X1 ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/arith/<=' @ X1 @ X2 )
=> ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X1 ) )
@ ^ [X3: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ X3 @ X1 ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/arith/<=' @ X1 @ X2 )
=> ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X1 ) )
@ ^ [X3: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ X3 @ X1 ) ) ) ) ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/arith/<=' @ X1 @ X2 )
=> ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X1 ) )
@ ^ [X3: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ X3 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/NSUM_OFFSET_0_') ).
thf(f20,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X1 @ X0 )
!= $true )
| ( ( 'const/arith/+' @ ( 'const/arith/-' @ X0 @ X1 ) @ X1 )
= X0 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X1 @ X0 )
!= $true )
| ( ( 'const/arith/+' @ ( 'const/arith/-' @ X0 @ X1 ) @ X1 )
= X0 ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X1 @ X0 )
= $true )
=> ( ( 'const/arith/+' @ ( 'const/arith/-' @ X0 @ X1 ) @ X1 )
= X0 ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/arith/<=' @ X1 @ X0 )
=> ( ( 'const/arith/+' @ ( 'const/arith/-' @ X0 @ X1 ) @ X1 )
= X0 ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/arith/<=' @ X1 @ X0 )
=> ( ( 'const/arith/+' @ ( 'const/arith/-' @ X0 @ X1 ) @ X1 )
= X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/arith/SUB_ADD_') ).
thf(f19,plain,
! [X2: 'type/nums/num',X3: 'type/nums/num',X0: 'type/nums/num',X1: 'type/nums/num' > 'type/nums/num'] :
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ X2 @ X0 ) @ ( 'const/arith/+' @ X3 @ X0 ) ) @ X1 )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [Y0: 'type/nums/num'] : ( X1 @ ( 'const/arith/+' @ Y0 @ X0 ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num'] :
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ X2 @ X0 ) @ ( 'const/arith/+' @ X3 @ X0 ) ) @ X1 )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [Y0: 'type/nums/num'] : ( X1 @ ( 'const/arith/+' @ Y0 @ X0 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f3,axiom,
! [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num'] :
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ X2 @ X0 ) @ ( 'const/arith/+' @ X3 @ X0 ) ) @ X1 )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [X4: 'type/nums/num'] : ( X1 @ ( 'const/arith/+' @ X4 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/NSUM_OFFSET_') ).
thf(f17,plain,
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ sK2 @ sK1 ) )
@ ^ [Y0: 'type/nums/num'] : ( sK0 @ ( 'const/arith/+' @ Y0 @ sK1 ) ) )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN051^1 : TPTP v8.2.0. Released v7.0.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 15:07:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH1_THM_EQU_NAR problem
% 0.13/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 % (15850)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.38 % (15851)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.38 % (15849)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 theBenchmark for (2999ds/27Mi)
% 0.21/0.38 % (15848)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 theBenchmark for (2999ds/4Mi)
% 0.21/0.38 % (15852)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.21/0.38 % (15853)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.38 % (15847)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.21/0.38 % (15854)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.38 % (15850)Instruction limit reached!
% 0.21/0.38 % (15850)------------------------------
% 0.21/0.38 % (15850)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (15850)Termination reason: Unknown
% 0.21/0.38 % (15850)Termination phase: Property scanning
% 0.21/0.38 % (15851)Instruction limit reached!
% 0.21/0.38 % (15851)------------------------------
% 0.21/0.38 % (15851)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (15851)Termination reason: Unknown
% 0.21/0.38 % (15851)Termination phase: Property scanning
% 0.21/0.38
% 0.21/0.38 % (15851)Memory used [KB]: 895
% 0.21/0.38 % (15851)Time elapsed: 0.003 s
% 0.21/0.38 % (15851)Instructions burned: 2 (million)
% 0.21/0.38 % (15851)------------------------------
% 0.21/0.38 % (15851)------------------------------
% 0.21/0.38
% 0.21/0.38 % (15850)Memory used [KB]: 895
% 0.21/0.38 % (15850)Time elapsed: 0.003 s
% 0.21/0.38 % (15850)Instructions burned: 2 (million)
% 0.21/0.38 % (15850)------------------------------
% 0.21/0.38 % (15850)------------------------------
% 0.21/0.38 % (15852)Refutation not found, incomplete strategy
% 0.21/0.38 % (15852)------------------------------
% 0.21/0.38 % (15852)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (15852)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38
% 0.21/0.38 % (15848)Instruction limit reached!
% 0.21/0.38 % (15848)------------------------------
% 0.21/0.38 % (15848)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (15848)Termination reason: Unknown
% 0.21/0.38 % (15848)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (15848)Memory used [KB]: 5500
% 0.21/0.38 % (15848)Time elapsed: 0.004 s
% 0.21/0.38 % (15848)Instructions burned: 4 (million)
% 0.21/0.38 % (15848)------------------------------
% 0.21/0.38 % (15848)------------------------------
% 0.21/0.38
% 0.21/0.38 % (15852)Memory used [KB]: 5500
% 0.21/0.38 % (15852)Time elapsed: 0.004 s
% 0.21/0.38 % (15852)Instructions burned: 3 (million)
% 0.21/0.38 % (15852)------------------------------
% 0.21/0.38 % (15852)------------------------------
% 0.21/0.38 % (15854)Instruction limit reached!
% 0.21/0.38 % (15854)------------------------------
% 0.21/0.38 % (15854)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (15854)Termination reason: Unknown
% 0.21/0.38 % (15854)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (15854)Memory used [KB]: 5500
% 0.21/0.38 % (15854)Time elapsed: 0.005 s
% 0.21/0.38 % (15854)Instructions burned: 4 (million)
% 0.21/0.38 % (15854)------------------------------
% 0.21/0.38 % (15854)------------------------------
% 0.21/0.38 % (15849)First to succeed.
% 0.21/0.38 % (15849)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (15849)------------------------------
% 0.21/0.38 % (15849)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (15849)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (15849)Memory used [KB]: 5500
% 0.21/0.38 % (15849)Time elapsed: 0.008 s
% 0.21/0.38 % (15849)Instructions burned: 6 (million)
% 0.21/0.38 % (15849)------------------------------
% 0.21/0.38 % (15849)------------------------------
% 0.21/0.38 % (15846)Success in time 0.01 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------