TSTP Solution File: SWC346-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC346-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 : n012.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:02:13 EDT 2023
% Result : Unsatisfiable 15.33s 5.27s
% Output : CNFRefutation 15.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 95
% Syntax : Number of formulae : 171 ( 54 unt; 75 typ; 0 def)
% Number of atoms : 148 ( 60 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 93 ( 41 ~; 52 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 82 ( 65 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 56 ( 56 usr; 10 con; 0-2 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > skaf48 > skaf47 > skaf46 > skaf45 > skaf43 > skaf42 > cons > app > #nlpp > tl > skaf83 > skaf82 > skaf81 > skaf80 > skaf79 > skaf78 > skaf77 > skaf76 > skaf75 > skaf74 > skaf73 > skaf72 > skaf71 > skaf70 > skaf69 > skaf68 > skaf67 > skaf66 > skaf65 > skaf64 > skaf63 > skaf62 > skaf61 > skaf60 > skaf59 > skaf58 > skaf57 > skaf56 > skaf55 > skaf54 > skaf53 > skaf52 > skaf51 > skaf50 > skaf49 > skaf44 > hd > skac3 > skac2 > sk7 > sk6 > sk5 > sk4 > sk3 > sk2 > sk1 > nil
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(skaf56,type,
skaf56: $i > $i ).
tff(segmentP,type,
segmentP: ( $i * $i ) > $o ).
tff(totalorderedP,type,
totalorderedP: $i > $o ).
tff(equalelemsP,type,
equalelemsP: $i > $o ).
tff(skaf74,type,
skaf74: $i > $i ).
tff(skaf61,type,
skaf61: $i > $i ).
tff(skaf51,type,
skaf51: $i > $i ).
tff(skaf83,type,
skaf83: $i > $i ).
tff(skac2,type,
skac2: $i ).
tff(skaf63,type,
skaf63: $i > $i ).
tff(skaf62,type,
skaf62: $i > $i ).
tff(sk2,type,
sk2: $i ).
tff(skaf52,type,
skaf52: $i > $i ).
tff(skaf50,type,
skaf50: $i > $i ).
tff(skaf42,type,
skaf42: ( $i * $i ) > $i ).
tff(skaf44,type,
skaf44: $i > $i ).
tff(singletonP,type,
singletonP: $i > $o ).
tff(skaf67,type,
skaf67: $i > $i ).
tff(skaf75,type,
skaf75: $i > $i ).
tff(sk1,type,
sk1: $i ).
tff(skaf58,type,
skaf58: $i > $i ).
tff(skaf46,type,
skaf46: ( $i * $i ) > $i ).
tff(frontsegP,type,
frontsegP: ( $i * $i ) > $o ).
tff(skaf70,type,
skaf70: $i > $i ).
tff(totalorderP,type,
totalorderP: $i > $o ).
tff(ssItem,type,
ssItem: $i > $o ).
tff(sk6,type,
sk6: $i ).
tff(skaf82,type,
skaf82: $i > $i ).
tff(skaf47,type,
skaf47: ( $i * $i ) > $i ).
tff(skaf76,type,
skaf76: $i > $i ).
tff(skac3,type,
skac3: $i ).
tff(skaf80,type,
skaf80: $i > $i ).
tff(skaf59,type,
skaf59: $i > $i ).
tff(skaf53,type,
skaf53: $i > $i ).
tff(skaf45,type,
skaf45: ( $i * $i ) > $i ).
tff(hd,type,
hd: $i > $i ).
tff(app,type,
app: ( $i * $i ) > $i ).
tff(skaf72,type,
skaf72: $i > $i ).
tff(duplicatefreeP,type,
duplicatefreeP: $i > $o ).
tff(skaf64,type,
skaf64: $i > $i ).
tff(sk4,type,
sk4: $i ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff(skaf71,type,
skaf71: $i > $i ).
tff(skaf78,type,
skaf78: $i > $i ).
tff(sk5,type,
sk5: $i ).
tff(skaf79,type,
skaf79: $i > $i ).
tff(rearsegP,type,
rearsegP: ( $i * $i ) > $o ).
tff(memberP,type,
memberP: ( $i * $i ) > $o ).
tff(skaf73,type,
skaf73: $i > $i ).
tff(ssList,type,
ssList: $i > $o ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(skaf54,type,
skaf54: $i > $i ).
tff(skaf77,type,
skaf77: $i > $i ).
tff(sk3,type,
sk3: $i ).
tff(skaf66,type,
skaf66: $i > $i ).
tff(strictorderP,type,
strictorderP: $i > $o ).
tff(skaf81,type,
skaf81: $i > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff(skaf60,type,
skaf60: $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(skaf69,type,
skaf69: $i > $i ).
tff(tl,type,
tl: $i > $i ).
tff(neq,type,
neq: ( $i * $i ) > $o ).
tff(skaf43,type,
skaf43: ( $i * $i ) > $i ).
tff(skaf48,type,
skaf48: ( $i * $i ) > $i ).
tff(skaf65,type,
skaf65: $i > $i ).
tff(skaf57,type,
skaf57: $i > $i ).
tff(sk7,type,
sk7: $i ).
tff(nil,type,
nil: $i ).
tff(skaf49,type,
skaf49: $i > $i ).
tff(skaf55,type,
skaf55: $i > $i ).
tff(skaf68,type,
skaf68: $i > $i ).
tff(strictorderedP,type,
strictorderedP: $i > $o ).
tff(cyclefreeP,type,
cyclefreeP: $i > $o ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_161,axiom,
! [U] :
( ~ ssList(U)
| segmentP(U,U) ),
file(unknown,unknown) ).
tff(f_51,axiom,
strictorderedP(nil),
file(unknown,unknown) ).
tff(f_156,axiom,
! [U] :
( ~ ssList(U)
| segmentP(U,nil) ),
file(unknown,unknown) ).
tff(f_1729,axiom,
( ~ segmentP(sk2,sk1)
| ~ strictorderedP(sk1) ),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1696,axiom,
( ssList(sk7)
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1659,axiom,
( ssList(sk6)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_1668,axiom,
( ( app(app(sk6,sk3),sk7) = sk4 )
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1371,axiom,
! [U,V,W,X] :
( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X)
| segmentP(X,V) ),
file(unknown,unknown) ).
tff(f_1702,axiom,
( ( app(app(sk6,sk3),sk7) = sk4 )
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_1656,axiom,
( ssItem(sk5)
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_1699,axiom,
( ( cons(sk5,nil) = sk3 )
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_207,axiom,
! [U] :
( ~ ssItem(U)
| strictorderedP(cons(U,nil)) ),
file(unknown,unknown) ).
tff(f_1693,axiom,
( ssList(sk6)
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_1662,axiom,
( ssList(sk7)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1653,axiom,
( ssItem(sk5)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_114,plain,
! [U_51] :
( segmentP(U_51,U_51)
| ~ ssList(U_51) ),
inference(cnfTransformation,[status(thm)],[f_161]) ).
tff(c_6,plain,
strictorderedP(nil),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_112,plain,
! [U_50] :
( segmentP(U_50,nil)
| ~ ssList(U_50) ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_412,plain,
( ~ strictorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(cnfTransformation,[status(thm)],[f_1729]) ).
tff(c_501,plain,
~ segmentP(sk2,sk1),
inference(splitLeft,[status(thm)],[c_412]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_402,plain,
( ( sk3 = nil )
| ssList(sk7) ),
inference(cnfTransformation,[status(thm)],[f_1696]) ).
tff(c_413,plain,
( ( sk1 = nil )
| ssList(sk7) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_402]) ).
tff(c_486,plain,
ssList(sk7),
inference(splitLeft,[status(thm)],[c_413]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_388,plain,
( ( sk4 = nil )
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1659]) ).
tff(c_422,plain,
( ( sk2 = nil )
| ssList(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_388]) ).
tff(c_487,plain,
ssList(sk6),
inference(splitLeft,[status(thm)],[c_422]) ).
tff(c_376,plain,
ssList(sk3),
inference(cnfTransformation,[status(thm)],[f_1647]) ).
tff(c_431,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_430,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_394,plain,
( ( sk4 = nil )
| ( app(app(sk6,sk3),sk7) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1668]) ).
tff(c_419,plain,
( ( sk4 = nil )
| ( app(app(sk6,sk1),sk7) = sk4 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_394]) ).
tff(c_428,plain,
( ( sk2 = nil )
| ( app(app(sk6,sk1),sk7) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_419]) ).
tff(c_1069,plain,
app(app(sk6,sk1),sk7) = sk2,
inference(splitLeft,[status(thm)],[c_428]) ).
tff(c_9858,plain,
! [U_903,V_904,W_905] :
( segmentP(app(app(U_903,V_904),W_905),V_904)
| ~ ssList(app(app(U_903,V_904),W_905))
| ~ ssList(V_904)
| ~ ssList(U_903)
| ~ ssList(W_905) ),
inference(cnfTransformation,[status(thm)],[f_1371]) ).
tff(c_10043,plain,
( segmentP(sk2,sk1)
| ~ ssList(app(app(sk6,sk1),sk7))
| ~ ssList(sk1)
| ~ ssList(sk6)
| ~ ssList(sk7) ),
inference(superposition,[status(thm),theory(equality)],[c_1069,c_9858]) ).
tff(c_10180,plain,
segmentP(sk2,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_486,c_487,c_431,c_430,c_1069,c_10043]) ).
tff(c_10182,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_501,c_10180]) ).
tff(c_10183,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_428]) ).
tff(c_10184,plain,
app(app(sk6,sk1),sk7) != sk2,
inference(splitRight,[status(thm)],[c_428]) ).
tff(c_10204,plain,
app(app(sk6,sk1),sk7) != nil,
inference(demodulation,[status(thm),theory(equality)],[c_10183,c_10184]) ).
tff(c_406,plain,
( ( sk3 = nil )
| ( app(app(sk6,sk3),sk7) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1702]) ).
tff(c_420,plain,
( ( sk1 = nil )
| ( app(app(sk6,sk1),sk7) = sk4 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_382,c_406]) ).
tff(c_429,plain,
( ( sk1 = nil )
| ( app(app(sk6,sk1),sk7) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_420]) ).
tff(c_10831,plain,
( ( sk1 = nil )
| ( app(app(sk6,sk1),sk7) = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_10183,c_429]) ).
tff(c_10832,plain,
sk1 = nil,
inference(negUnitSimplification,[status(thm)],[c_10204,c_10831]) ).
tff(c_10188,plain,
~ segmentP(nil,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_10183,c_501]) ).
tff(c_10849,plain,
~ segmentP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_10832,c_10188]) ).
tff(c_10883,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_112,c_10849]) ).
tff(c_10890,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_10883]) ).
tff(c_10891,plain,
~ strictorderedP(sk1),
inference(splitRight,[status(thm)],[c_412]) ).
tff(c_386,plain,
( ( sk3 = nil )
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1656]) ).
tff(c_418,plain,
( ( sk1 = nil )
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_386]) ).
tff(c_482,plain,
ssItem(sk5),
inference(splitLeft,[status(thm)],[c_418]) ).
tff(c_404,plain,
( ( sk3 = nil )
| ( cons(sk5,nil) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1699]) ).
tff(c_414,plain,
( ( sk1 = nil )
| ( cons(sk5,nil) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_382,c_404]) ).
tff(c_10895,plain,
cons(sk5,nil) = sk1,
inference(splitLeft,[status(thm)],[c_414]) ).
tff(c_132,plain,
! [U_60] :
( strictorderedP(cons(U_60,nil))
| ~ ssItem(U_60) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_10899,plain,
( strictorderedP(sk1)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_10895,c_132]) ).
tff(c_10903,plain,
strictorderedP(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_482,c_10899]) ).
tff(c_10905,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10891,c_10903]) ).
tff(c_10906,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_414]) ).
tff(c_10909,plain,
~ strictorderedP(nil),
inference(demodulation,[status(thm),theory(equality)],[c_10906,c_10891]) ).
tff(c_10914,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_10909]) ).
tff(c_10916,plain,
~ ssList(sk6),
inference(splitRight,[status(thm)],[c_422]) ).
tff(c_400,plain,
( ( sk3 = nil )
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1693]) ).
tff(c_415,plain,
( ( sk1 = nil )
| ssList(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_400]) ).
tff(c_10928,plain,
sk1 = nil,
inference(negUnitSimplification,[status(thm)],[c_10916,c_415]) ).
tff(c_10915,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_422]) ).
tff(c_10949,plain,
~ segmentP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_10928,c_10915,c_6,c_10928,c_412]) ).
tff(c_10952,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_114,c_10949]) ).
tff(c_10956,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_10952]) ).
tff(c_10958,plain,
~ ssList(sk7),
inference(splitRight,[status(thm)],[c_413]) ).
tff(c_390,plain,
( ( sk4 = nil )
| ssList(sk7) ),
inference(cnfTransformation,[status(thm)],[f_1662]) ).
tff(c_423,plain,
( ( sk2 = nil )
| ssList(sk7) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_390]) ).
tff(c_10973,plain,
sk2 = nil,
inference(negUnitSimplification,[status(thm)],[c_10958,c_423]) ).
tff(c_10957,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_413]) ).
tff(c_10991,plain,
~ segmentP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_10973,c_10957,c_6,c_10957,c_412]) ).
tff(c_10994,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_114,c_10991]) ).
tff(c_10998,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_10994]) ).
tff(c_11000,plain,
~ ssItem(sk5),
inference(splitRight,[status(thm)],[c_418]) ).
tff(c_384,plain,
( ( sk4 = nil )
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1653]) ).
tff(c_424,plain,
( ( sk2 = nil )
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_384]) ).
tff(c_11017,plain,
sk2 = nil,
inference(negUnitSimplification,[status(thm)],[c_11000,c_424]) ).
tff(c_10999,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_418]) ).
tff(c_11037,plain,
~ segmentP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_11017,c_10999,c_6,c_10999,c_412]) ).
tff(c_11040,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_114,c_11037]) ).
tff(c_11044,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_11040]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC346-1 : TPTP v8.1.2. Released v2.4.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.13/0.35 % Computer : n012.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 21:18:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 15.33/5.27 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.33/5.28
% 15.33/5.28 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.33/5.32
% 15.33/5.32 Inference rules
% 15.33/5.32 ----------------------
% 15.33/5.32 #Ref : 0
% 15.33/5.32 #Sup : 2328
% 15.33/5.32 #Fact : 0
% 15.33/5.32 #Define : 0
% 15.33/5.32 #Split : 25
% 15.33/5.32 #Chain : 0
% 15.33/5.32 #Close : 0
% 15.33/5.32
% 15.33/5.32 Ordering : KBO
% 15.33/5.32
% 15.33/5.32 Simplification rules
% 15.33/5.32 ----------------------
% 15.33/5.32 #Subsume : 163
% 15.33/5.32 #Demod : 2499
% 15.33/5.32 #Tautology : 685
% 15.33/5.32 #SimpNegUnit : 16
% 15.33/5.32 #BackRed : 51
% 15.33/5.32
% 15.33/5.32 #Partial instantiations: 0
% 15.33/5.32 #Strategies tried : 1
% 15.33/5.32
% 15.33/5.32 Timing (in seconds)
% 15.33/5.32 ----------------------
% 15.33/5.32 Preprocessing : 0.92
% 15.33/5.32 Parsing : 0.46
% 15.33/5.32 CNF conversion : 0.07
% 15.33/5.32 Main loop : 3.31
% 15.33/5.32 Inferencing : 0.86
% 15.33/5.32 Reduction : 1.50
% 15.33/5.32 Demodulation : 1.15
% 15.33/5.32 BG Simplification : 0.11
% 15.33/5.32 Subsumption : 0.66
% 15.33/5.32 Abstraction : 0.07
% 15.33/5.32 MUC search : 0.00
% 15.33/5.32 Cooper : 0.00
% 15.33/5.32 Total : 4.29
% 15.33/5.32 Index Insertion : 0.00
% 15.33/5.32 Index Deletion : 0.00
% 15.33/5.32 Index Matching : 0.00
% 15.33/5.32 BG Taut test : 0.00
%------------------------------------------------------------------------------