TSTP Solution File: SWC039+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC039+1 : TPTP v8.1.2. Released v2.4.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 : n018.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:00:53 EDT 2023
% Result : Theorem 9.99s 3.38s
% Output : CNFRefutation 9.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 83
% Syntax : Number of formulae : 141 ( 28 unt; 78 typ; 0 def)
% Number of atoms : 142 ( 72 equ)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 132 ( 53 ~; 57 |; 7 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 85 ( 68 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 59 ( 59 usr; 10 con; 0-2 aty)
% Number of variables : 34 (; 31 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > cons > app > #nlpp > tl > hd > nil > #skF_36 > #skF_25 > #skF_5 > #skF_52 > #skF_44 > #skF_21 > #skF_16 > #skF_6 > #skF_49 > #skF_18 > #skF_24 > #skF_35 > #skF_19 > #skF_31 > #skF_22 > #skF_37 > #skF_54 > #skF_40 > #skF_48 > #skF_3 > #skF_34 > #skF_29 > #skF_15 > #skF_32 > #skF_53 > #skF_51 > #skF_28 > #skF_10 > #skF_41 > #skF_2 > #skF_38 > #skF_43 > #skF_1 > #skF_8 > #skF_39 > #skF_23 > #skF_33 > #skF_26 > #skF_50 > #skF_13 > #skF_17 > #skF_11 > #skF_14 > #skF_27 > #skF_12 > #skF_7 > #skF_46 > #skF_42 > #skF_45 > #skF_9 > #skF_30 > #skF_4 > #skF_20 > #skF_47
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_36',type,
'#skF_36': $i > $i ).
tff(segmentP,type,
segmentP: ( $i * $i ) > $o ).
tff('#skF_25',type,
'#skF_25': $i > $i ).
tff(totalorderedP,type,
totalorderedP: $i > $o ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(equalelemsP,type,
equalelemsP: $i > $o ).
tff('#skF_52',type,
'#skF_52': $i ).
tff('#skF_44',type,
'#skF_44': $i > $i ).
tff('#skF_21',type,
'#skF_21': $i > $i ).
tff('#skF_16',type,
'#skF_16': $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_49',type,
'#skF_49': $i ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff('#skF_24',type,
'#skF_24': $i > $i ).
tff('#skF_35',type,
'#skF_35': $i > $i ).
tff(singletonP,type,
singletonP: $i > $o ).
tff('#skF_19',type,
'#skF_19': $i > $i ).
tff('#skF_31',type,
'#skF_31': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i > $i ).
tff(frontsegP,type,
frontsegP: ( $i * $i ) > $o ).
tff('#skF_37',type,
'#skF_37': $i > $i ).
tff(totalorderP,type,
totalorderP: $i > $o ).
tff(ssItem,type,
ssItem: $i > $o ).
tff('#skF_54',type,
'#skF_54': $i ).
tff('#skF_40',type,
'#skF_40': $i > $i ).
tff('#skF_48',type,
'#skF_48': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i > $i ).
tff('#skF_29',type,
'#skF_29': $i > $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff('#skF_32',type,
'#skF_32': $i > $i ).
tff('#skF_53',type,
'#skF_53': $i ).
tff('#skF_51',type,
'#skF_51': $i ).
tff('#skF_28',type,
'#skF_28': $i > $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff('#skF_41',type,
'#skF_41': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_38',type,
'#skF_38': $i > $i ).
tff('#skF_43',type,
'#skF_43': $i > $i ).
tff(hd,type,
hd: $i > $i ).
tff(app,type,
app: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(duplicatefreeP,type,
duplicatefreeP: $i > $o ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff('#skF_39',type,
'#skF_39': $i > $i ).
tff('#skF_23',type,
'#skF_23': $i > $i ).
tff(rearsegP,type,
rearsegP: ( $i * $i ) > $o ).
tff('#skF_33',type,
'#skF_33': $i > $i ).
tff(memberP,type,
memberP: ( $i * $i ) > $o ).
tff('#skF_26',type,
'#skF_26': $i > $i ).
tff('#skF_50',type,
'#skF_50': $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff(ssList,type,
ssList: $i > $o ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(strictorderP,type,
strictorderP: $i > $o ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(tl,type,
tl: $i > $i ).
tff(neq,type,
neq: ( $i * $i ) > $o ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_46',type,
'#skF_46': $i > $i ).
tff(nil,type,
nil: $i ).
tff('#skF_42',type,
'#skF_42': $i > $i ).
tff('#skF_45',type,
'#skF_45': $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(strictorderedP,type,
strictorderedP: $i > $o ).
tff('#skF_30',type,
'#skF_30': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff(cyclefreeP,type,
cyclefreeP: $i > $o ).
tff('#skF_47',type,
'#skF_47': $i > $i ).
tff(f_1034,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( nil != V )
| ( V != X )
| ( U != W )
| ( nil = U )
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ! [X1] :
( ssList(X1)
=> ( ( cons(Y,nil) != W )
| ( app(app(Z,W),X1) != X )
| ? [X2] :
( ssItem(X2)
& memberP(Z,X2)
& lt(Y,X2) )
| ? [X3] :
( ssItem(X3)
& memberP(X1,X3)
& lt(X3,Y) ) ) ) ) )
& ( ( nil != X )
| ( nil != W ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_399,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ssList(app(U,V)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
tff(f_413,axiom,
! [U] :
( ssList(U)
=> ( app(nil,U) = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
tff(f_779,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ? [V] :
( ssList(V)
& ( tl(U) = V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax76) ).
tff(f_855,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( ( nil = app(U,V) )
<=> ( ( nil = V )
& ( nil = U ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
tff(c_386,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1034]) ).
tff(c_388,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1034]) ).
tff(c_390,plain,
nil = '#skF_49',
inference(cnfTransformation,[status(thm)],[f_1034]) ).
tff(c_442,plain,
nil = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_388,c_390]) ).
tff(c_384,plain,
nil != '#skF_48',
inference(cnfTransformation,[status(thm)],[f_1034]) ).
tff(c_460,plain,
'#skF_51' != '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_386,c_442,c_384]) ).
tff(c_410,plain,
( ssList('#skF_53')
| ( nil = '#skF_50' ) ),
inference(cnfTransformation,[status(thm)],[f_1034]) ).
tff(c_440,plain,
( ssList('#skF_53')
| ( '#skF_49' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_410]) ).
tff(c_456,plain,
( ssList('#skF_53')
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_440]) ).
tff(c_466,plain,
ssList('#skF_53'),
inference(negUnitSimplification,[status(thm)],[c_460,c_456]) ).
tff(c_394,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1034]) ).
tff(c_192,plain,
! [U_896,V_898] :
( ssList(app(U_896,V_898))
| ~ ssList(V_898)
| ~ ssList(U_896) ),
inference(cnfTransformation,[status(thm)],[f_399]) ).
tff(c_408,plain,
( ssList('#skF_54')
| ( nil = '#skF_50' ) ),
inference(cnfTransformation,[status(thm)],[f_1034]) ).
tff(c_428,plain,
( ssList('#skF_54')
| ( '#skF_49' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_408]) ).
tff(c_444,plain,
( ssList('#skF_54')
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_428]) ).
tff(c_461,plain,
ssList('#skF_54'),
inference(negUnitSimplification,[status(thm)],[c_460,c_444]) ).
tff(c_196,plain,
! [U_906] :
( ( app(nil,U_906) = U_906 )
| ~ ssList(U_906) ),
inference(cnfTransformation,[status(thm)],[f_413]) ).
tff(c_640,plain,
! [U_1520] :
( ( app('#skF_51',U_1520) = U_1520 )
| ~ ssList(U_1520) ),
inference(demodulation,[status(thm),theory(equality)],[c_442,c_196]) ).
tff(c_657,plain,
app('#skF_51','#skF_50') = '#skF_50',
inference(resolution,[status(thm)],[c_394,c_640]) ).
tff(c_334,plain,
! [U_1047] :
( ( tl(U_1047) = '#skF_47'(U_1047) )
| ( nil = U_1047 )
| ~ ssList(U_1047) ),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_1214,plain,
! [U_1569] :
( ( tl(U_1569) = '#skF_47'(U_1569) )
| ( U_1569 = '#skF_51' )
| ~ ssList(U_1569) ),
inference(demodulation,[status(thm),theory(equality)],[c_442,c_334]) ).
tff(c_1323,plain,
( ( tl('#skF_53') = '#skF_47'('#skF_53') )
| ( '#skF_53' = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_466,c_1214]) ).
tff(c_1361,plain,
'#skF_53' = '#skF_51',
inference(splitLeft,[status(thm)],[c_1323]) ).
tff(c_404,plain,
( ( app(app('#skF_53','#skF_50'),'#skF_54') = '#skF_51' )
| ( nil = '#skF_50' ) ),
inference(cnfTransformation,[status(thm)],[f_1034]) ).
tff(c_429,plain,
( ( app(app('#skF_53','#skF_50'),'#skF_54') = '#skF_51' )
| ( '#skF_49' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_404]) ).
tff(c_454,plain,
( ( app(app('#skF_53','#skF_50'),'#skF_54') = '#skF_51' )
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_429]) ).
tff(c_464,plain,
app(app('#skF_53','#skF_50'),'#skF_54') = '#skF_51',
inference(negUnitSimplification,[status(thm)],[c_460,c_454]) ).
tff(c_1367,plain,
app(app('#skF_51','#skF_50'),'#skF_54') = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_1361,c_464]) ).
tff(c_1372,plain,
app('#skF_50','#skF_54') = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_657,c_1367]) ).
tff(c_352,plain,
! [U_1077,V_1079] :
( ( nil = U_1077 )
| ( app(U_1077,V_1079) != nil )
| ~ ssList(V_1079)
| ~ ssList(U_1077) ),
inference(cnfTransformation,[status(thm)],[f_855]) ).
tff(c_3029,plain,
! [U_1632,V_1633] :
( ( U_1632 = '#skF_51' )
| ( app(U_1632,V_1633) != '#skF_51' )
| ~ ssList(V_1633)
| ~ ssList(U_1632) ),
inference(demodulation,[status(thm),theory(equality)],[c_442,c_442,c_352]) ).
tff(c_3039,plain,
( ( '#skF_51' = '#skF_50' )
| ~ ssList('#skF_54')
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_1372,c_3029]) ).
tff(c_3062,plain,
'#skF_51' = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_394,c_461,c_3039]) ).
tff(c_3064,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_460,c_3062]) ).
tff(c_3066,plain,
'#skF_53' != '#skF_51',
inference(splitRight,[status(thm)],[c_1323]) ).
tff(c_392,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1034]) ).
tff(c_1324,plain,
( ( tl('#skF_54') = '#skF_47'('#skF_54') )
| ( '#skF_54' = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_461,c_1214]) ).
tff(c_3067,plain,
'#skF_54' = '#skF_51',
inference(splitLeft,[status(thm)],[c_1324]) ).
tff(c_3073,plain,
app(app('#skF_53','#skF_50'),'#skF_51') = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_3067,c_464]) ).
tff(c_4378,plain,
! [U_1696,V_1697] :
( ( U_1696 = '#skF_51' )
| ( app(U_1696,V_1697) != '#skF_51' )
| ~ ssList(V_1697)
| ~ ssList(U_1696) ),
inference(demodulation,[status(thm),theory(equality)],[c_442,c_442,c_352]) ).
tff(c_4380,plain,
( ( app('#skF_53','#skF_50') = '#skF_51' )
| ~ ssList('#skF_51')
| ~ ssList(app('#skF_53','#skF_50')) ),
inference(superposition,[status(thm),theory(equality)],[c_3073,c_4378]) ).
tff(c_4393,plain,
( ( app('#skF_53','#skF_50') = '#skF_51' )
| ~ ssList(app('#skF_53','#skF_50')) ),
inference(demodulation,[status(thm),theory(equality)],[c_392,c_4380]) ).
tff(c_4408,plain,
~ ssList(app('#skF_53','#skF_50')),
inference(splitLeft,[status(thm)],[c_4393]) ).
tff(c_4437,plain,
( ~ ssList('#skF_50')
| ~ ssList('#skF_53') ),
inference(resolution,[status(thm)],[c_192,c_4408]) ).
tff(c_4441,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_466,c_394,c_4437]) ).
tff(c_4442,plain,
app('#skF_53','#skF_50') = '#skF_51',
inference(splitRight,[status(thm)],[c_4393]) ).
tff(c_472,plain,
! [U_1077,V_1079] :
( ( U_1077 = '#skF_51' )
| ( app(U_1077,V_1079) != '#skF_51' )
| ~ ssList(V_1079)
| ~ ssList(U_1077) ),
inference(demodulation,[status(thm),theory(equality)],[c_442,c_442,c_352]) ).
tff(c_4491,plain,
( ( '#skF_53' = '#skF_51' )
| ~ ssList('#skF_50')
| ~ ssList('#skF_53') ),
inference(superposition,[status(thm),theory(equality)],[c_4442,c_472]) ).
tff(c_4501,plain,
'#skF_53' = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_466,c_394,c_4491]) ).
tff(c_4503,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3066,c_4501]) ).
tff(c_4505,plain,
'#skF_54' != '#skF_51',
inference(splitRight,[status(thm)],[c_1324]) ).
tff(c_354,plain,
! [V_1079,U_1077] :
( ( nil = V_1079 )
| ( app(U_1077,V_1079) != nil )
| ~ ssList(V_1079)
| ~ ssList(U_1077) ),
inference(cnfTransformation,[status(thm)],[f_855]) ).
tff(c_5491,plain,
! [V_1744,U_1745] :
( ( V_1744 = '#skF_51' )
| ( app(U_1745,V_1744) != '#skF_51' )
| ~ ssList(V_1744)
| ~ ssList(U_1745) ),
inference(demodulation,[status(thm),theory(equality)],[c_442,c_442,c_354]) ).
tff(c_5513,plain,
( ( '#skF_54' = '#skF_51' )
| ~ ssList('#skF_54')
| ~ ssList(app('#skF_53','#skF_50')) ),
inference(superposition,[status(thm),theory(equality)],[c_464,c_5491]) ).
tff(c_5543,plain,
( ( '#skF_54' = '#skF_51' )
| ~ ssList(app('#skF_53','#skF_50')) ),
inference(demodulation,[status(thm),theory(equality)],[c_461,c_5513]) ).
tff(c_5544,plain,
~ ssList(app('#skF_53','#skF_50')),
inference(negUnitSimplification,[status(thm)],[c_4505,c_5543]) ).
tff(c_5551,plain,
( ~ ssList('#skF_50')
| ~ ssList('#skF_53') ),
inference(resolution,[status(thm)],[c_192,c_5544]) ).
tff(c_5555,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_466,c_394,c_5551]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC039+1 : TPTP v8.1.2. Released v2.4.0.
% 0.15/0.15 % 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.16/0.37 % Computer : n018.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 21:47:50 EDT 2023
% 0.16/0.37 % CPUTime :
% 9.99/3.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.99/3.39
% 9.99/3.39 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.99/3.42
% 9.99/3.42 Inference rules
% 9.99/3.42 ----------------------
% 9.99/3.42 #Ref : 0
% 9.99/3.42 #Sup : 1178
% 9.99/3.42 #Fact : 0
% 9.99/3.42 #Define : 0
% 9.99/3.42 #Split : 29
% 9.99/3.42 #Chain : 0
% 9.99/3.42 #Close : 0
% 9.99/3.42
% 9.99/3.42 Ordering : KBO
% 9.99/3.42
% 9.99/3.42 Simplification rules
% 9.99/3.42 ----------------------
% 9.99/3.42 #Subsume : 108
% 9.99/3.42 #Demod : 690
% 9.99/3.42 #Tautology : 369
% 9.99/3.42 #SimpNegUnit : 78
% 9.99/3.42 #BackRed : 64
% 9.99/3.42
% 9.99/3.42 #Partial instantiations: 0
% 9.99/3.42 #Strategies tried : 1
% 9.99/3.42
% 9.99/3.42 Timing (in seconds)
% 9.99/3.42 ----------------------
% 9.99/3.43 Preprocessing : 0.91
% 9.99/3.43 Parsing : 0.42
% 9.99/3.43 CNF conversion : 0.11
% 9.99/3.43 Main loop : 1.33
% 9.99/3.43 Inferencing : 0.40
% 9.99/3.43 Reduction : 0.46
% 9.99/3.43 Demodulation : 0.33
% 9.99/3.43 BG Simplification : 0.08
% 9.99/3.43 Subsumption : 0.28
% 9.99/3.43 Abstraction : 0.04
% 9.99/3.43 MUC search : 0.00
% 9.99/3.43 Cooper : 0.00
% 9.99/3.43 Total : 2.31
% 9.99/3.43 Index Insertion : 0.00
% 9.99/3.43 Index Deletion : 0.00
% 9.99/3.43 Index Matching : 0.00
% 9.99/3.43 BG Taut test : 0.00
%------------------------------------------------------------------------------