TSTP Solution File: SEU159+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU159+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n020.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 10:57:50 EDT 2023
% Result : Theorem 242.92s 218.86s
% Output : CNFRefutation 242.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 57
% Syntax : Number of formulae : 123 ( 41 unt; 51 typ; 0 def)
% Number of atoms : 116 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 75 ( 31 ~; 34 |; 2 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 96 ( 42 >; 54 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 46 ( 46 usr; 9 con; 0-4 aty)
% Number of variables : 52 (; 52 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > proper_subset > in > disjoint > empty > unordered_pair > set_union2 > set_intersection2 > set_difference > ordered_pair > cartesian_product2 > #nlpp > union > singleton > powerset > empty_set > #skF_13 > #skF_33 > #skF_24 > #skF_35 > #skF_17 > #skF_6 > #skF_31 > #skF_25 > #skF_18 > #skF_20 > #skF_22 > #skF_12 > #skF_15 > #skF_26 > #skF_23 > #skF_19 > #skF_11 > #skF_36 > #skF_32 > #skF_7 > #skF_9 > #skF_28 > #skF_30 > #skF_3 > #skF_29 > #skF_2 > #skF_8 > #skF_27 > #skF_14 > #skF_1 > #skF_16 > #skF_21 > #skF_5 > #skF_4 > #skF_10 > #skF_34
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff('#skF_33',type,
'#skF_33': $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i * $i ) > $i ).
tff('#skF_35',type,
'#skF_35': ( $i * $i ) > $i ).
tff(union,type,
union: $i > $i ).
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_31',type,
'#skF_31': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i * $i ) > $i ).
tff('#skF_26',type,
'#skF_26': $i ).
tff(proper_subset,type,
proper_subset: ( $i * $i ) > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i ) > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff('#skF_36',type,
'#skF_36': ( $i * $i ) > $i ).
tff('#skF_32',type,
'#skF_32': $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_28',type,
'#skF_28': ( $i * $i ) > $i ).
tff('#skF_30',type,
'#skF_30': $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_29',type,
'#skF_29': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i ).
tff(f_305,negated_conjecture,
~ ! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(A,C)
& in(B,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
tff(f_77,axiom,
! [A,B,C] :
( ( C = unordered_pair(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( ( D = A )
| ( D = B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
tff(f_267,lemma,
! [A,B] :
( subset(A,B)
=> ( set_intersection2(A,B) = A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
tff(f_42,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_114,axiom,
! [A,B,C] :
( ( C = set_intersection2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
tff(f_105,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(c_302,plain,
( in('#skF_29','#skF_31')
| ~ in('#skF_33','#skF_34')
| ~ in('#skF_32','#skF_34') ),
inference(cnfTransformation,[status(thm)],[f_305]) ).
tff(c_509,plain,
~ in('#skF_32','#skF_34'),
inference(splitLeft,[status(thm)],[c_302]) ).
tff(c_50,plain,
! [D_32,B_28] : in(D_32,unordered_pair(D_32,B_28)),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_308,plain,
( in('#skF_29','#skF_31')
| subset(unordered_pair('#skF_32','#skF_33'),'#skF_34') ),
inference(cnfTransformation,[status(thm)],[f_305]) ).
tff(c_429,plain,
subset(unordered_pair('#skF_32','#skF_33'),'#skF_34'),
inference(splitLeft,[status(thm)],[c_308]) ).
tff(c_1297,plain,
! [A_345,B_346] :
( ( set_intersection2(A_345,B_346) = A_345 )
| ~ subset(A_345,B_346) ),
inference(cnfTransformation,[status(thm)],[f_267]) ).
tff(c_1336,plain,
set_intersection2(unordered_pair('#skF_32','#skF_33'),'#skF_34') = unordered_pair('#skF_32','#skF_33'),
inference(resolution,[status(thm)],[c_429,c_1297]) ).
tff(c_10,plain,
! [B_10,A_9] : ( set_intersection2(B_10,A_9) = set_intersection2(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_1409,plain,
set_intersection2('#skF_34',unordered_pair('#skF_32','#skF_33')) = unordered_pair('#skF_32','#skF_33'),
inference(superposition,[status(thm),theory(equality)],[c_1336,c_10]) ).
tff(c_5040,plain,
! [D_528,A_529,B_530] :
( in(D_528,A_529)
| ~ in(D_528,set_intersection2(A_529,B_530)) ),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_5395,plain,
! [D_545] :
( in(D_545,'#skF_34')
| ~ in(D_545,unordered_pair('#skF_32','#skF_33')) ),
inference(superposition,[status(thm),theory(equality)],[c_1409,c_5040]) ).
tff(c_5411,plain,
in('#skF_32','#skF_34'),
inference(resolution,[status(thm)],[c_50,c_5395]) ).
tff(c_5424,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_509,c_5411]) ).
tff(c_5426,plain,
in('#skF_32','#skF_34'),
inference(splitRight,[status(thm)],[c_302]) ).
tff(c_300,plain,
( in('#skF_30','#skF_31')
| ~ in('#skF_33','#skF_34')
| ~ in('#skF_32','#skF_34') ),
inference(cnfTransformation,[status(thm)],[f_305]) ).
tff(c_5505,plain,
( in('#skF_30','#skF_31')
| ~ in('#skF_33','#skF_34') ),
inference(demodulation,[status(thm),theory(equality)],[c_5426,c_300]) ).
tff(c_5506,plain,
~ in('#skF_33','#skF_34'),
inference(splitLeft,[status(thm)],[c_5505]) ).
tff(c_48,plain,
! [D_32,A_27] : in(D_32,unordered_pair(A_27,D_32)),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_6658,plain,
! [A_655,B_656] :
( ( set_intersection2(A_655,B_656) = A_655 )
| ~ subset(A_655,B_656) ),
inference(cnfTransformation,[status(thm)],[f_267]) ).
tff(c_6701,plain,
set_intersection2(unordered_pair('#skF_32','#skF_33'),'#skF_34') = unordered_pair('#skF_32','#skF_33'),
inference(resolution,[status(thm)],[c_429,c_6658]) ).
tff(c_9495,plain,
! [D_801,B_802,A_803] :
( in(D_801,B_802)
| ~ in(D_801,set_intersection2(A_803,B_802)) ),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_10136,plain,
! [D_827] :
( in(D_827,'#skF_34')
| ~ in(D_827,unordered_pair('#skF_32','#skF_33')) ),
inference(superposition,[status(thm),theory(equality)],[c_6701,c_9495]) ).
tff(c_10152,plain,
in('#skF_33','#skF_34'),
inference(resolution,[status(thm)],[c_48,c_10136]) ).
tff(c_10160,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_5506,c_10152]) ).
tff(c_10162,plain,
in('#skF_33','#skF_34'),
inference(splitRight,[status(thm)],[c_5505]) ).
tff(c_298,plain,
( ~ subset(unordered_pair('#skF_29','#skF_30'),'#skF_31')
| ~ in('#skF_33','#skF_34')
| ~ in('#skF_32','#skF_34') ),
inference(cnfTransformation,[status(thm)],[f_305]) ).
tff(c_10261,plain,
~ subset(unordered_pair('#skF_29','#skF_30'),'#skF_31'),
inference(demodulation,[status(thm),theory(equality)],[c_5426,c_10162,c_298]) ).
tff(c_10161,plain,
in('#skF_30','#skF_31'),
inference(splitRight,[status(thm)],[c_5505]) ).
tff(c_5425,plain,
( ~ in('#skF_33','#skF_34')
| in('#skF_29','#skF_31') ),
inference(splitRight,[status(thm)],[c_302]) ).
tff(c_10355,plain,
in('#skF_29','#skF_31'),
inference(demodulation,[status(thm),theory(equality)],[c_10162,c_5425]) ).
tff(c_110,plain,
! [A_73,B_74] :
( in('#skF_16'(A_73,B_74),A_73)
| subset(A_73,B_74) ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_18164,plain,
! [D_1247,B_1248,A_1249] :
( ( D_1247 = B_1248 )
| ( D_1247 = A_1249 )
| ~ in(D_1247,unordered_pair(A_1249,B_1248)) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_415608,plain,
! [A_687812,B_687813,B_687814] :
( ( '#skF_16'(unordered_pair(A_687812,B_687813),B_687814) = B_687813 )
| ( '#skF_16'(unordered_pair(A_687812,B_687813),B_687814) = A_687812 )
| subset(unordered_pair(A_687812,B_687813),B_687814) ),
inference(resolution,[status(thm)],[c_110,c_18164]) ).
tff(c_416384,plain,
( ( '#skF_16'(unordered_pair('#skF_29','#skF_30'),'#skF_31') = '#skF_30' )
| ( '#skF_16'(unordered_pair('#skF_29','#skF_30'),'#skF_31') = '#skF_29' ) ),
inference(resolution,[status(thm)],[c_415608,c_10261]) ).
tff(c_416614,plain,
'#skF_16'(unordered_pair('#skF_29','#skF_30'),'#skF_31') = '#skF_29',
inference(splitLeft,[status(thm)],[c_416384]) ).
tff(c_108,plain,
! [A_73,B_74] :
( ~ in('#skF_16'(A_73,B_74),B_74)
| subset(A_73,B_74) ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_416629,plain,
( ~ in('#skF_29','#skF_31')
| subset(unordered_pair('#skF_29','#skF_30'),'#skF_31') ),
inference(superposition,[status(thm),theory(equality)],[c_416614,c_108]) ).
tff(c_416882,plain,
subset(unordered_pair('#skF_29','#skF_30'),'#skF_31'),
inference(demodulation,[status(thm),theory(equality)],[c_10355,c_416629]) ).
tff(c_416884,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10261,c_416882]) ).
tff(c_416885,plain,
'#skF_16'(unordered_pair('#skF_29','#skF_30'),'#skF_31') = '#skF_30',
inference(splitRight,[status(thm)],[c_416384]) ).
tff(c_416901,plain,
( ~ in('#skF_30','#skF_31')
| subset(unordered_pair('#skF_29','#skF_30'),'#skF_31') ),
inference(superposition,[status(thm),theory(equality)],[c_416885,c_108]) ).
tff(c_417154,plain,
subset(unordered_pair('#skF_29','#skF_30'),'#skF_31'),
inference(demodulation,[status(thm),theory(equality)],[c_10161,c_416901]) ).
tff(c_417156,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10261,c_417154]) ).
tff(c_417158,plain,
~ subset(unordered_pair('#skF_32','#skF_33'),'#skF_34'),
inference(splitRight,[status(thm)],[c_308]) ).
tff(c_306,plain,
( in('#skF_30','#skF_31')
| subset(unordered_pair('#skF_32','#skF_33'),'#skF_34') ),
inference(cnfTransformation,[status(thm)],[f_305]) ).
tff(c_375,plain,
subset(unordered_pair('#skF_32','#skF_33'),'#skF_34'),
inference(splitLeft,[status(thm)],[c_306]) ).
tff(c_417374,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_417158,c_375]) ).
tff(c_417376,plain,
~ subset(unordered_pair('#skF_32','#skF_33'),'#skF_34'),
inference(splitRight,[status(thm)],[c_306]) ).
tff(c_417408,plain,
subset(unordered_pair('#skF_32','#skF_33'),'#skF_34'),
inference(splitLeft,[status(thm)],[c_308]) ).
tff(c_417634,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_417376,c_417408]) ).
tff(c_417636,plain,
~ subset(unordered_pair('#skF_32','#skF_33'),'#skF_34'),
inference(splitRight,[status(thm)],[c_308]) ).
tff(c_304,plain,
( ~ subset(unordered_pair('#skF_29','#skF_30'),'#skF_31')
| subset(unordered_pair('#skF_32','#skF_33'),'#skF_34') ),
inference(cnfTransformation,[status(thm)],[f_305]) ).
tff(c_417799,plain,
~ subset(unordered_pair('#skF_29','#skF_30'),'#skF_31'),
inference(negUnitSimplification,[status(thm)],[c_417636,c_304]) ).
tff(c_417375,plain,
in('#skF_30','#skF_31'),
inference(splitRight,[status(thm)],[c_306]) ).
tff(c_417635,plain,
in('#skF_29','#skF_31'),
inference(splitRight,[status(thm)],[c_308]) ).
tff(c_422925,plain,
! [D_689508,B_689509,A_689510] :
( ( D_689508 = B_689509 )
| ( D_689508 = A_689510 )
| ~ in(D_689508,unordered_pair(A_689510,B_689509)) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_722922,plain,
! [A_1300983,B_1300984,B_1300985] :
( ( '#skF_16'(unordered_pair(A_1300983,B_1300984),B_1300985) = B_1300984 )
| ( '#skF_16'(unordered_pair(A_1300983,B_1300984),B_1300985) = A_1300983 )
| subset(unordered_pair(A_1300983,B_1300984),B_1300985) ),
inference(resolution,[status(thm)],[c_110,c_422925]) ).
tff(c_723663,plain,
( ( '#skF_16'(unordered_pair('#skF_29','#skF_30'),'#skF_31') = '#skF_30' )
| ( '#skF_16'(unordered_pair('#skF_29','#skF_30'),'#skF_31') = '#skF_29' ) ),
inference(resolution,[status(thm)],[c_722922,c_417799]) ).
tff(c_723947,plain,
'#skF_16'(unordered_pair('#skF_29','#skF_30'),'#skF_31') = '#skF_29',
inference(splitLeft,[status(thm)],[c_723663]) ).
tff(c_723959,plain,
( ~ in('#skF_29','#skF_31')
| subset(unordered_pair('#skF_29','#skF_30'),'#skF_31') ),
inference(superposition,[status(thm),theory(equality)],[c_723947,c_108]) ).
tff(c_724213,plain,
subset(unordered_pair('#skF_29','#skF_30'),'#skF_31'),
inference(demodulation,[status(thm),theory(equality)],[c_417635,c_723959]) ).
tff(c_724215,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_417799,c_724213]) ).
tff(c_724216,plain,
'#skF_16'(unordered_pair('#skF_29','#skF_30'),'#skF_31') = '#skF_30',
inference(splitRight,[status(thm)],[c_723663]) ).
tff(c_724229,plain,
( ~ in('#skF_30','#skF_31')
| subset(unordered_pair('#skF_29','#skF_30'),'#skF_31') ),
inference(superposition,[status(thm),theory(equality)],[c_724216,c_108]) ).
tff(c_724483,plain,
subset(unordered_pair('#skF_29','#skF_30'),'#skF_31'),
inference(demodulation,[status(thm),theory(equality)],[c_417375,c_724229]) ).
tff(c_724485,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_417799,c_724483]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU159+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n020.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 : Thu Aug 3 12:05:07 EDT 2023
% 0.13/0.36 % CPUTime :
% 242.92/218.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 242.92/218.87
% 242.92/218.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 242.92/218.90
% 242.92/218.90 Inference rules
% 242.92/218.90 ----------------------
% 242.92/218.90 #Ref : 26
% 242.92/218.90 #Sup : 165336
% 242.92/218.90 #Fact : 49
% 242.92/218.90 #Define : 0
% 242.92/218.90 #Split : 129
% 242.92/218.90 #Chain : 0
% 242.92/218.90 #Close : 0
% 242.92/218.90
% 242.92/218.90 Ordering : KBO
% 242.92/218.90
% 242.92/218.90 Simplification rules
% 242.92/218.90 ----------------------
% 242.92/218.90 #Subsume : 69494
% 242.92/218.90 #Demod : 44250
% 242.92/218.90 #Tautology : 25602
% 242.92/218.90 #SimpNegUnit : 4887
% 242.92/218.90 #BackRed : 410
% 242.92/218.90
% 242.92/218.90 #Partial instantiations: 683836
% 242.92/218.90 #Strategies tried : 1
% 242.92/218.90
% 242.92/218.90 Timing (in seconds)
% 242.92/218.90 ----------------------
% 242.92/218.91 Preprocessing : 0.80
% 242.92/218.91 Parsing : 0.37
% 242.92/218.91 CNF conversion : 0.08
% 242.92/218.91 Main loop : 216.98
% 242.92/218.91 Inferencing : 20.40
% 242.92/218.91 Reduction : 97.51
% 242.92/218.91 Demodulation : 61.74
% 242.92/218.91 BG Simplification : 0.68
% 242.92/218.91 Subsumption : 74.14
% 242.92/218.91 Abstraction : 1.15
% 242.92/218.91 MUC search : 0.00
% 242.92/218.91 Cooper : 0.00
% 242.92/218.91 Total : 217.85
% 242.92/218.91 Index Insertion : 0.00
% 242.92/218.91 Index Deletion : 0.00
% 242.92/218.91 Index Matching : 0.00
% 242.92/218.91 BG Taut test : 0.00
%------------------------------------------------------------------------------