TSTP Solution File: SWV453+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV453+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -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 Aug 22 11:04:15 EDT 2023
% Result : Theorem 30.13s 17.38s
% Output : CNFRefutation 30.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 50
% Syntax : Number of formulae : 111 ( 34 unt; 48 typ; 0 def)
% Number of atoms : 175 ( 97 equ)
% Maximal formula atoms : 50 ( 2 avg)
% Number of connectives : 200 ( 88 ~; 66 |; 27 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 26 >; 9 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 43 ( 43 usr; 22 con; 0-2 aty)
% Number of variables : 64 (; 64 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ setIn > leq > elem > pidElem > ordered > snoc > m_Ack > index > cons > #nlpp > tail > s > queue > pidMsg > m_NotNorm > m_NormQ > m_Ldr > m_Halt > m_Down > last > init > host > head > zero > wait > status > setEmpty > q_nil > pids > norm > nil > nbr_proc > ldr > elid > elec_2 > elec_1 > alive > #skF_2 > #skF_11 > #skF_1 > #skF_7 > #skF_3 > #skF_10 > #skF_5 > #skF_6 > #skF_9 > #skF_8 > #skF_12 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m_NormQ,type,
m_NormQ: $i > $i ).
tff(nbr_proc,type,
nbr_proc: $i ).
tff(pids,type,
pids: $i ).
tff(elec_1,type,
elec_1: $i ).
tff(ordered,type,
ordered: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(status,type,
status: $i ).
tff(snoc,type,
snoc: ( $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(s,type,
s: $i > $i ).
tff(host,type,
host: $i > $i ).
tff(m_Halt,type,
m_Halt: $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(pidMsg,type,
pidMsg: $i > $i ).
tff(pidElem,type,
pidElem: $i > $o ).
tff(elem,type,
elem: ( $i * $i ) > $o ).
tff(alive,type,
alive: $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(setIn,type,
setIn: ( $i * $i ) > $o ).
tff(init,type,
init: $i > $i ).
tff(m_Ack,type,
m_Ack: ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(m_Ldr,type,
m_Ldr: $i > $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(last,type,
last: $i > $i ).
tff(setEmpty,type,
setEmpty: $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(index,type,
index: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(ldr,type,
ldr: $i ).
tff(wait,type,
wait: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(tail,type,
tail: $i > $i ).
tff(m_Down,type,
m_Down: $i > $i ).
tff(m_NotNorm,type,
m_NotNorm: $i > $i ).
tff(q_nil,type,
q_nil: $i ).
tff(queue,type,
queue: $i > $i ).
tff(head,type,
head: $i > $i ).
tff(elid,type,
elid: $i ).
tff(nil,type,
nil: $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(norm,type,
norm: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(zero,type,
zero: $i ).
tff(elec_2,type,
elec_2: $i ).
tff(f_464,negated_conjecture,
~ ! [V,W,X,Y] :
( ( ! [Z,Pid0] :
( setIn(Pid0,alive)
=> ~ elem(m_Down(Pid0),queue(host(Z))) )
& ! [Z,Pid0] :
( elem(m_Down(Pid0),queue(host(Z)))
=> ~ setIn(Pid0,alive) )
& ! [Z,Pid0] :
( elem(m_Down(Pid0),queue(host(Z)))
=> ( host(Pid0) != host(Z) ) )
& ! [Z,Pid0] :
( elem(m_Halt(Pid0),queue(host(Z)))
=> ~ leq(host(Z),host(Pid0)) )
& ! [Z,Pid20,Pid0] :
( elem(m_Ack(Pid0,Z),queue(host(Pid20)))
=> ~ leq(host(Z),host(Pid0)) )
& ! [Z,Pid0] :
( ( ~ setIn(Z,alive)
& leq(Pid0,Z)
& ( host(Pid0) = host(Z) ) )
=> ~ setIn(Pid0,alive) )
& ! [Z,Pid0] :
( ( ( Pid0 != Z )
& ( host(Pid0) = host(Z) ) )
=> ( ~ setIn(Z,alive)
| ~ setIn(Pid0,alive) ) )
& ! [Z,Pid30,Pid20,Pid0] :
( ( ( host(Pid20) != host(Z) )
& setIn(Z,alive)
& setIn(Pid20,alive)
& ( host(Pid30) = host(Z) )
& ( host(Pid0) = host(Pid20) ) )
=> ~ ( elem(m_Down(Pid0),queue(host(Z)))
& elem(m_Down(Pid30),queue(host(Pid20))) ) )
& ( queue(host(X)) = cons(m_Down(Y),V) ) )
=> ( setIn(X,alive)
=> ( ~ leq(host(X),host(Y))
=> ( ( ( ( index(ldr,host(X)) = host(Y) )
& ( index(status,host(X)) = norm ) )
| ( ( index(status,host(X)) = wait )
& ( host(Y) = host(index(elid,host(X))) ) ) )
=> ( ( ! [Z] :
( ( host(X) = host(Z) )
=> leq(Z,W) )
& ~ setIn(W,pids)
& ( host(X) = host(W) ) )
=> ( ( host(W) != s(zero) )
=> ! [Z] :
( ( host(X) != host(Z) )
=> ! [X0,Y0] :
( ( host(X) = host(Y0) )
=> ! [Z0] :
( ( ( ( ( Z != X )
& setIn(Z,alive) )
| ( Z = W ) )
& ( ( ( Y0 != X )
& setIn(Y0,alive) )
| ( Y0 = W ) )
& ( host(Y0) != host(Z) )
& ( host(X0) = host(Z) )
& ( host(Z0) = host(Y0) ) )
=> ~ ( elem(m_Down(X0),V)
& elem(m_Down(Z0),queue(host(Z))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(f_224,axiom,
! [X,Y,Q] :
( elem(X,cons(Y,Q))
<=> ( ( X = Y )
| elem(X,Q) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
tff(c_206,plain,
host('#skF_10') = host('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_202,plain,
elem(m_Down('#skF_10'),'#skF_5'),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_204,plain,
host('#skF_11') = host('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_216,plain,
host('#skF_7') = host('#skF_6'),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_210,plain,
host('#skF_11') = host('#skF_7'),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_267,plain,
host('#skF_11') = host('#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_210]) ).
tff(c_269,plain,
host('#skF_6') = host('#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_204,c_267]) ).
tff(c_226,plain,
cons(m_Down('#skF_8'),'#skF_5') = queue(host('#skF_7')),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_259,plain,
cons(m_Down('#skF_8'),'#skF_5') = queue(host('#skF_6')),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_226]) ).
tff(c_275,plain,
cons(m_Down('#skF_8'),'#skF_5') = queue(host('#skF_12')),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_259]) ).
tff(c_44594,plain,
! [X_1295,Q_1296,Y_1297] :
( ~ elem(X_1295,Q_1296)
| elem(X_1295,cons(Y_1297,Q_1296)) ),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_44600,plain,
! [X_1295] :
( ~ elem(X_1295,'#skF_5')
| elem(X_1295,queue(host('#skF_12'))) ),
inference(superposition,[status(thm),theory(equality)],[c_275,c_44594]) ).
tff(c_212,plain,
host('#skF_7') != host('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_266,plain,
host('#skF_6') != host('#skF_9'),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_212]) ).
tff(c_279,plain,
host('#skF_9') != host('#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_266]) ).
tff(c_246,plain,
( ( '#skF_11' != '#skF_7' )
| ( '#skF_11' = '#skF_6' ) ),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_323,plain,
'#skF_11' != '#skF_7',
inference(splitLeft,[status(thm)],[c_246]) ).
tff(c_244,plain,
( setIn('#skF_11',alive)
| ( '#skF_11' = '#skF_6' ) ),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_353,plain,
'#skF_11' = '#skF_6',
inference(splitLeft,[status(thm)],[c_244]) ).
tff(c_354,plain,
'#skF_7' != '#skF_6',
inference(demodulation,[status(thm),theory(equality)],[c_353,c_323]) ).
tff(c_270,plain,
host('#skF_7') = host('#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_216]) ).
tff(c_220,plain,
! [Z_174] :
( leq(Z_174,'#skF_6')
| ( host(Z_174) != host('#skF_7') ) ),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_264,plain,
! [Z_174] :
( leq(Z_174,'#skF_6')
| ( host(Z_174) != host('#skF_6') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_220]) ).
tff(c_273,plain,
! [Z_174] :
( leq(Z_174,'#skF_6')
| ( host(Z_174) != host('#skF_12') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_264]) ).
tff(c_224,plain,
setIn('#skF_7',alive),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_896,plain,
! [Pid0_304,Z_305] :
( ~ setIn(Pid0_304,alive)
| ( host(Z_305) != host(Pid0_304) )
| ~ leq(Pid0_304,Z_305)
| setIn(Z_305,alive) ),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_900,plain,
! [Z_305] :
( ( host(Z_305) != host('#skF_7') )
| ~ leq('#skF_7',Z_305)
| setIn(Z_305,alive) ),
inference(resolution,[status(thm)],[c_224,c_896]) ).
tff(c_12949,plain,
! [Z_636] :
( ( host(Z_636) != host('#skF_12') )
| ~ leq('#skF_7',Z_636)
| setIn(Z_636,alive) ),
inference(demodulation,[status(thm),theory(equality)],[c_270,c_900]) ).
tff(c_230,plain,
! [Pid0_169,Z_168] :
( ~ setIn(Pid0_169,alive)
| ~ setIn(Z_168,alive)
| ( host(Z_168) != host(Pid0_169) )
| ( Z_168 = Pid0_169 ) ),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_13019,plain,
! [Z_637,Z_638] :
( ~ setIn(Z_637,alive)
| ( host(Z_638) != host(Z_637) )
| ( Z_638 = Z_637 )
| ( host(Z_638) != host('#skF_12') )
| ~ leq('#skF_7',Z_638) ),
inference(resolution,[status(thm)],[c_12949,c_230]) ).
tff(c_13027,plain,
! [Z_638] :
( ( host(Z_638) != host('#skF_7') )
| ( Z_638 = '#skF_7' )
| ( host(Z_638) != host('#skF_12') )
| ~ leq('#skF_7',Z_638) ),
inference(resolution,[status(thm)],[c_224,c_13019]) ).
tff(c_37656,plain,
! [Z_888] :
( ( host(Z_888) != host('#skF_12') )
| ( Z_888 = '#skF_7' )
| ( host(Z_888) != host('#skF_12') )
| ~ leq('#skF_7',Z_888) ),
inference(demodulation,[status(thm),theory(equality)],[c_270,c_13027]) ).
tff(c_38022,plain,
( ( '#skF_7' = '#skF_6' )
| ( host('#skF_6') != host('#skF_12') )
| ( host('#skF_7') != host('#skF_12') ) ),
inference(resolution,[status(thm)],[c_273,c_37656]) ).
tff(c_38186,plain,
'#skF_7' = '#skF_6',
inference(demodulation,[status(thm),theory(equality)],[c_270,c_269,c_38022]) ).
tff(c_38188,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_354,c_38186]) ).
tff(c_38189,plain,
setIn('#skF_11',alive),
inference(splitRight,[status(thm)],[c_244]) ).
tff(c_38536,plain,
! [Pid0_953,Z_954] :
( ~ setIn(Pid0_953,alive)
| ~ setIn(Z_954,alive)
| ( host(Z_954) != host(Pid0_953) )
| ( Z_954 = Pid0_953 ) ),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_38542,plain,
! [Z_954] :
( ~ setIn(Z_954,alive)
| ( host(Z_954) != host('#skF_7') )
| ( Z_954 = '#skF_7' ) ),
inference(resolution,[status(thm)],[c_224,c_38536]) ).
tff(c_44028,plain,
! [Z_1184] :
( ~ setIn(Z_1184,alive)
| ( host(Z_1184) != host('#skF_12') )
| ( Z_1184 = '#skF_7' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_270,c_38542]) ).
tff(c_44037,plain,
( ( host('#skF_11') != host('#skF_12') )
| ( '#skF_11' = '#skF_7' ) ),
inference(resolution,[status(thm)],[c_38189,c_44028]) ).
tff(c_44046,plain,
'#skF_11' = '#skF_7',
inference(demodulation,[status(thm),theory(equality)],[c_204,c_44037]) ).
tff(c_44048,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_323,c_44046]) ).
tff(c_44049,plain,
'#skF_11' = '#skF_6',
inference(splitRight,[status(thm)],[c_246]) ).
tff(c_44050,plain,
'#skF_11' = '#skF_7',
inference(splitRight,[status(thm)],[c_246]) ).
tff(c_44057,plain,
'#skF_7' = '#skF_6',
inference(demodulation,[status(thm),theory(equality)],[c_44049,c_44050]) ).
tff(c_44059,plain,
setIn('#skF_6',alive),
inference(demodulation,[status(thm),theory(equality)],[c_44057,c_224]) ).
tff(c_248,plain,
( setIn('#skF_9',alive)
| ( '#skF_6' = '#skF_9' ) ),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_44089,plain,
'#skF_6' = '#skF_9',
inference(splitLeft,[status(thm)],[c_248]) ).
tff(c_44093,plain,
host('#skF_9') = host('#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_44089,c_269]) ).
tff(c_44096,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_279,c_44093]) ).
tff(c_44097,plain,
setIn('#skF_9',alive),
inference(splitRight,[status(thm)],[c_248]) ).
tff(c_200,plain,
elem(m_Down('#skF_12'),queue(host('#skF_9'))),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_44724,plain,
! [Pid30_1312,Pid20_1313,Pid0_1314,Z_1315] :
( ~ elem(m_Down(Pid30_1312),queue(host(Pid20_1313)))
| ~ elem(m_Down(Pid0_1314),queue(host(Z_1315)))
| ( host(Pid20_1313) != host(Pid0_1314) )
| ( host(Z_1315) != host(Pid30_1312) )
| ~ setIn(Pid20_1313,alive)
| ~ setIn(Z_1315,alive)
| ( host(Z_1315) = host(Pid20_1313) ) ),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_44728,plain,
! [Pid0_1314,Z_1315] :
( ~ elem(m_Down(Pid0_1314),queue(host(Z_1315)))
| ( host(Pid0_1314) != host('#skF_9') )
| ( host(Z_1315) != host('#skF_12') )
| ~ setIn('#skF_9',alive)
| ~ setIn(Z_1315,alive)
| ( host(Z_1315) = host('#skF_9') ) ),
inference(resolution,[status(thm)],[c_200,c_44724]) ).
tff(c_91054,plain,
! [Pid0_1929,Z_1930] :
( ~ elem(m_Down(Pid0_1929),queue(host(Z_1930)))
| ( host(Pid0_1929) != host('#skF_9') )
| ( host(Z_1930) != host('#skF_12') )
| ~ setIn(Z_1930,alive)
| ( host(Z_1930) = host('#skF_9') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_44097,c_44728]) ).
tff(c_91082,plain,
! [Pid0_1929] :
( ~ elem(m_Down(Pid0_1929),queue(host('#skF_12')))
| ( host(Pid0_1929) != host('#skF_9') )
| ( host('#skF_6') != host('#skF_12') )
| ~ setIn('#skF_6',alive)
| ( host('#skF_6') = host('#skF_9') ) ),
inference(superposition,[status(thm),theory(equality)],[c_269,c_91054]) ).
tff(c_91091,plain,
! [Pid0_1929] :
( ~ elem(m_Down(Pid0_1929),queue(host('#skF_12')))
| ( host(Pid0_1929) != host('#skF_9') )
| ( host('#skF_9') = host('#skF_12') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_44059,c_269,c_91082]) ).
tff(c_106769,plain,
! [Pid0_2079] :
( ~ elem(m_Down(Pid0_2079),queue(host('#skF_12')))
| ( host(Pid0_2079) != host('#skF_9') ) ),
inference(negUnitSimplification,[status(thm)],[c_279,c_91091]) ).
tff(c_108671,plain,
! [Pid0_2101] :
( ( host(Pid0_2101) != host('#skF_9') )
| ~ elem(m_Down(Pid0_2101),'#skF_5') ),
inference(resolution,[status(thm)],[c_44600,c_106769]) ).
tff(c_108680,plain,
host('#skF_10') != host('#skF_9'),
inference(resolution,[status(thm)],[c_202,c_108671]) ).
tff(c_108684,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_206,c_108680]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV453+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 23:13:13 EDT 2023
% 0.15/0.36 % CPUTime :
% 30.13/17.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.13/17.39
% 30.13/17.39 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 30.13/17.43
% 30.13/17.43 Inference rules
% 30.13/17.43 ----------------------
% 30.13/17.43 #Ref : 55
% 30.13/17.43 #Sup : 23792
% 30.13/17.43 #Fact : 38
% 30.13/17.43 #Define : 0
% 30.13/17.43 #Split : 100
% 30.13/17.43 #Chain : 0
% 30.13/17.43 #Close : 0
% 30.13/17.43
% 30.13/17.43 Ordering : KBO
% 30.13/17.43
% 30.13/17.43 Simplification rules
% 30.13/17.43 ----------------------
% 30.13/17.43 #Subsume : 7320
% 30.13/17.43 #Demod : 10731
% 30.13/17.43 #Tautology : 6284
% 30.13/17.43 #SimpNegUnit : 550
% 30.13/17.43 #BackRed : 123
% 30.13/17.43
% 30.13/17.43 #Partial instantiations: 0
% 30.13/17.43 #Strategies tried : 1
% 30.13/17.43
% 30.13/17.43 Timing (in seconds)
% 30.13/17.43 ----------------------
% 30.13/17.44 Preprocessing : 0.69
% 30.13/17.44 Parsing : 0.32
% 30.13/17.44 CNF conversion : 0.06
% 30.13/17.44 Main loop : 15.59
% 30.13/17.44 Inferencing : 2.72
% 30.13/17.44 Reduction : 7.02
% 30.13/17.44 Demodulation : 4.89
% 30.13/17.44 BG Simplification : 0.14
% 30.13/17.44 Subsumption : 4.70
% 30.13/17.44 Abstraction : 0.19
% 30.13/17.44 MUC search : 0.00
% 30.13/17.44 Cooper : 0.00
% 30.13/17.44 Total : 16.34
% 30.13/17.44 Index Insertion : 0.00
% 30.13/17.44 Index Deletion : 0.00
% 30.13/17.44 Index Matching : 0.00
% 30.13/17.44 BG Taut test : 0.00
%------------------------------------------------------------------------------