TSTP Solution File: SWC322-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWC322-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/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 : 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:07 EDT 2023

% Result   : Unsatisfiable 17.03s 6.34s
% Output   : CNFRefutation 17.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   91
% Syntax   : Number of formulae    :  149 (  33 unt;  74 typ;   0 def)
%            Number of atoms       :  150 (  72 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  154 (  79   ~;  75   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 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    :   55 (  55 usr;   9 con; 0-2 aty)
%            Number of variables   :   27 (;  27   !;   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 > 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(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_1668,axiom,
    ( ssItem(sk5)
    | ( nil = sk2 ) ),
    file(unknown,unknown) ).

tff(f_56,axiom,
    ssList(nil),
    file(unknown,unknown) ).

tff(f_342,axiom,
    ! [U,V] :
      ( ~ ssItem(U)
      | ~ ssList(V)
      | ssList(cons(U,V)) ),
    file(unknown,unknown) ).

tff(f_1649,axiom,
    sk2 = sk4,
    file(unknown,unknown) ).

tff(f_1650,axiom,
    sk1 = sk3,
    file(unknown,unknown) ).

tff(f_1665,axiom,
    ( ( nil = sk3 )
    | ( nil != sk4 ) ),
    file(unknown,unknown) ).

tff(f_1682,axiom,
    ( ( app(cons(sk5,nil),sk6) != sk1 )
    | ( nil = sk2 ) ),
    file(unknown,unknown) ).

tff(f_1675,axiom,
    ( ssList(sk6)
    | ( nil = sk2 ) ),
    file(unknown,unknown) ).

tff(f_1678,axiom,
    ( ( app(sk6,cons(sk5,nil)) = sk2 )
    | ( nil = sk2 ) ),
    file(unknown,unknown) ).

tff(f_1661,axiom,
    ! [A,B] :
      ( ~ ssItem(A)
      | ~ ssList(B)
      | ( app(cons(A,nil),B) = sk3 )
      | ( app(B,cons(A,nil)) != sk4 ) ),
    file(unknown,unknown) ).

tff(f_1686,axiom,
    ( ssList(sk6)
    | ( nil != sk1 ) ),
    file(unknown,unknown) ).

tff(f_250,axiom,
    ! [U] :
      ( ~ ssList(U)
      | ( app(nil,U) = U ) ),
    file(unknown,unknown) ).

tff(f_975,axiom,
    ! [U,V,W] :
      ( ( app(U,V) != W )
      | ~ ssList(V)
      | ~ ssList(U)
      | ~ ssList(W)
      | frontsegP(W,U) ),
    file(unknown,unknown) ).

tff(f_784,axiom,
    ! [U,V] :
      ( ~ frontsegP(U,V)
      | ~ frontsegP(V,U)
      | ~ ssList(U)
      | ~ ssList(V)
      | ( V = U ) ),
    file(unknown,unknown) ).

tff(f_1690,axiom,
    ( ( app(sk6,cons(sk5,nil)) = sk2 )
    | ( nil != sk1 ) ),
    file(unknown,unknown) ).

tff(f_1695,axiom,
    ( ( app(cons(sk5,nil),sk6) != sk1 )
    | ( nil != sk1 ) ),
    file(unknown,unknown) ).

tff(f_1672,axiom,
    ( ssItem(sk5)
    | ( nil != sk1 ) ),
    file(unknown,unknown) ).

tff(c_388,plain,
    ( ( sk2 = nil )
    | ssItem(sk5) ),
    inference(cnfTransformation,[status(thm)],[f_1668]) ).

tff(c_455,plain,
    ssItem(sk5),
    inference(splitLeft,[status(thm)],[c_388]) ).

tff(c_16,plain,
    ssList(nil),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_172,plain,
    ! [U_82,V_83] :
      ( ssList(cons(U_82,V_83))
      | ~ ssList(V_83)
      | ~ ssItem(U_82) ),
    inference(cnfTransformation,[status(thm)],[f_342]) ).

tff(c_380,plain,
    sk4 = sk2,
    inference(cnfTransformation,[status(thm)],[f_1649]) ).

tff(c_382,plain,
    sk3 = sk1,
    inference(cnfTransformation,[status(thm)],[f_1650]) ).

tff(c_386,plain,
    ( ( sk4 != nil )
    | ( sk3 = nil ) ),
    inference(cnfTransformation,[status(thm)],[f_1665]) ).

tff(c_403,plain,
    ( ( sk4 != nil )
    | ( sk1 = nil ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_382,c_386]) ).

tff(c_405,plain,
    ( ( sk2 != nil )
    | ( sk1 = nil ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_380,c_403]) ).

tff(c_458,plain,
    sk2 != nil,
    inference(splitLeft,[status(thm)],[c_405]) ).

tff(c_396,plain,
    ( ( sk2 = nil )
    | ( app(cons(sk5,nil),sk6) != sk1 ) ),
    inference(cnfTransformation,[status(thm)],[f_1682]) ).

tff(c_1745,plain,
    app(cons(sk5,nil),sk6) != sk1,
    inference(negUnitSimplification,[status(thm)],[c_458,c_396]) ).

tff(c_392,plain,
    ( ( sk2 = nil )
    | ssList(sk6) ),
    inference(cnfTransformation,[status(thm)],[f_1675]) ).

tff(c_465,plain,
    ssList(sk6),
    inference(negUnitSimplification,[status(thm)],[c_458,c_392]) ).

tff(c_394,plain,
    ( ( sk2 = nil )
    | ( app(sk6,cons(sk5,nil)) = sk2 ) ),
    inference(cnfTransformation,[status(thm)],[f_1678]) ).

tff(c_1028,plain,
    app(sk6,cons(sk5,nil)) = sk2,
    inference(negUnitSimplification,[status(thm)],[c_458,c_394]) ).

tff(c_384,plain,
    ! [B_328,A_327] :
      ( ( app(B_328,cons(A_327,nil)) != sk4 )
      | ( app(cons(A_327,nil),B_328) = sk3 )
      | ~ ssList(B_328)
      | ~ ssItem(A_327) ),
    inference(cnfTransformation,[status(thm)],[f_1661]) ).

tff(c_404,plain,
    ! [B_328,A_327] :
      ( ( app(B_328,cons(A_327,nil)) != sk4 )
      | ( app(cons(A_327,nil),B_328) = sk1 )
      | ~ ssList(B_328)
      | ~ ssItem(A_327) ),
    inference(demodulation,[status(thm),theory(equality)],[c_382,c_384]) ).

tff(c_8108,plain,
    ! [B_831,A_832] :
      ( ( app(B_831,cons(A_832,nil)) != sk2 )
      | ( app(cons(A_832,nil),B_831) = sk1 )
      | ~ ssList(B_831)
      | ~ ssItem(A_832) ),
    inference(demodulation,[status(thm),theory(equality)],[c_380,c_404]) ).

tff(c_8124,plain,
    ( ( app(cons(sk5,nil),sk6) = sk1 )
    | ~ ssList(sk6)
    | ~ ssItem(sk5) ),
    inference(superposition,[status(thm),theory(equality)],[c_1028,c_8108]) ).

tff(c_8131,plain,
    app(cons(sk5,nil),sk6) = sk1,
    inference(demodulation,[status(thm),theory(equality)],[c_455,c_465,c_8124]) ).

tff(c_8133,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1745,c_8131]) ).

tff(c_8134,plain,
    sk1 = nil,
    inference(splitRight,[status(thm)],[c_405]) ).

tff(c_398,plain,
    ( ( sk1 != nil )
    | ssList(sk6) ),
    inference(cnfTransformation,[status(thm)],[f_1686]) ).

tff(c_8155,plain,
    ssList(sk6),
    inference(demodulation,[status(thm),theory(equality)],[c_8134,c_398]) ).

tff(c_8453,plain,
    ! [U_887] :
      ( ( app(nil,U_887) = U_887 )
      | ~ ssList(U_887) ),
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_8545,plain,
    app(nil,sk6) = sk6,
    inference(resolution,[status(thm)],[c_8155,c_8453]) ).

tff(c_11743,plain,
    ! [U_1185,V_1186] :
      ( frontsegP(app(U_1185,V_1186),U_1185)
      | ~ ssList(app(U_1185,V_1186))
      | ~ ssList(U_1185)
      | ~ ssList(V_1186) ),
    inference(cnfTransformation,[status(thm)],[f_975]) ).

tff(c_11883,plain,
    ( frontsegP(sk6,nil)
    | ~ ssList(app(nil,sk6))
    | ~ ssList(nil)
    | ~ ssList(sk6) ),
    inference(superposition,[status(thm),theory(equality)],[c_8545,c_11743]) ).

tff(c_11980,plain,
    frontsegP(sk6,nil),
    inference(demodulation,[status(thm),theory(equality)],[c_8155,c_16,c_8155,c_8545,c_11883]) ).

tff(c_258,plain,
    ! [V_157,U_156] :
      ( ( V_157 = U_156 )
      | ~ ssList(V_157)
      | ~ ssList(U_156)
      | ~ frontsegP(V_157,U_156)
      | ~ frontsegP(U_156,V_157) ),
    inference(cnfTransformation,[status(thm)],[f_784]) ).

tff(c_11999,plain,
    ( ( sk6 = nil )
    | ~ ssList(sk6)
    | ~ ssList(nil)
    | ~ frontsegP(nil,sk6) ),
    inference(resolution,[status(thm)],[c_11980,c_258]) ).

tff(c_12002,plain,
    ( ( sk6 = nil )
    | ~ frontsegP(nil,sk6) ),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_8155,c_11999]) ).

tff(c_14690,plain,
    ~ frontsegP(nil,sk6),
    inference(splitLeft,[status(thm)],[c_12002]) ).

tff(c_8135,plain,
    sk2 = nil,
    inference(splitRight,[status(thm)],[c_405]) ).

tff(c_400,plain,
    ( ( sk1 != nil )
    | ( app(sk6,cons(sk5,nil)) = sk2 ) ),
    inference(cnfTransformation,[status(thm)],[f_1690]) ).

tff(c_8844,plain,
    app(sk6,cons(sk5,nil)) = nil,
    inference(demodulation,[status(thm),theory(equality)],[c_8135,c_8134,c_400]) ).

tff(c_11814,plain,
    ( frontsegP(nil,sk6)
    | ~ ssList(app(sk6,cons(sk5,nil)))
    | ~ ssList(sk6)
    | ~ ssList(cons(sk5,nil)) ),
    inference(superposition,[status(thm),theory(equality)],[c_8844,c_11743]) ).

tff(c_11934,plain,
    ( frontsegP(nil,sk6)
    | ~ ssList(cons(sk5,nil)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_8155,c_16,c_8844,c_11814]) ).

tff(c_14789,plain,
    ~ ssList(cons(sk5,nil)),
    inference(negUnitSimplification,[status(thm)],[c_14690,c_11934]) ).

tff(c_14792,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sk5) ),
    inference(resolution,[status(thm)],[c_172,c_14789]) ).

tff(c_14796,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_455,c_16,c_14792]) ).

tff(c_14797,plain,
    sk6 = nil,
    inference(splitRight,[status(thm)],[c_12002]) ).

tff(c_402,plain,
    ( ( sk1 != nil )
    | ( app(cons(sk5,nil),sk6) != sk1 ) ),
    inference(cnfTransformation,[status(thm)],[f_1695]) ).

tff(c_8895,plain,
    app(cons(sk5,nil),sk6) != nil,
    inference(demodulation,[status(thm),theory(equality)],[c_8134,c_8134,c_402]) ).

tff(c_14843,plain,
    app(cons(sk5,nil),nil) != nil,
    inference(demodulation,[status(thm),theory(equality)],[c_14797,c_8895]) ).

tff(c_14844,plain,
    app(nil,cons(sk5,nil)) = nil,
    inference(demodulation,[status(thm),theory(equality)],[c_14797,c_8844]) ).

tff(c_406,plain,
    ! [B_328,A_327] :
      ( ( app(B_328,cons(A_327,nil)) != sk2 )
      | ( app(cons(A_327,nil),B_328) = sk1 )
      | ~ ssList(B_328)
      | ~ ssItem(A_327) ),
    inference(demodulation,[status(thm),theory(equality)],[c_380,c_404]) ).

tff(c_15640,plain,
    ! [B_1381,A_1382] :
      ( ( app(B_1381,cons(A_1382,nil)) != nil )
      | ( app(cons(A_1382,nil),B_1381) = nil )
      | ~ ssList(B_1381)
      | ~ ssItem(A_1382) ),
    inference(demodulation,[status(thm),theory(equality)],[c_8134,c_8135,c_406]) ).

tff(c_15645,plain,
    ( ( app(cons(sk5,nil),nil) = nil )
    | ~ ssList(nil)
    | ~ ssItem(sk5) ),
    inference(superposition,[status(thm),theory(equality)],[c_14844,c_15640]) ).

tff(c_15659,plain,
    app(cons(sk5,nil),nil) = nil,
    inference(demodulation,[status(thm),theory(equality)],[c_455,c_16,c_15645]) ).

tff(c_15661,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_14843,c_15659]) ).

tff(c_15663,plain,
    ~ ssItem(sk5),
    inference(splitRight,[status(thm)],[c_388]) ).

tff(c_15662,plain,
    sk2 = nil,
    inference(splitRight,[status(thm)],[c_388]) ).

tff(c_15679,plain,
    sk1 = nil,
    inference(demodulation,[status(thm),theory(equality)],[c_15662,c_405]) ).

tff(c_390,plain,
    ( ( sk1 != nil )
    | ssItem(sk5) ),
    inference(cnfTransformation,[status(thm)],[f_1672]) ).

tff(c_15697,plain,
    ssItem(sk5),
    inference(demodulation,[status(thm),theory(equality)],[c_15679,c_390]) ).

tff(c_15698,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_15663,c_15697]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWC322-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13  % 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 : 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:42:52 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 17.03/6.34  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.03/6.35  
% 17.03/6.35  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 17.37/6.39  
% 17.37/6.39  Inference rules
% 17.37/6.39  ----------------------
% 17.37/6.39  #Ref     : 0
% 17.37/6.39  #Sup     : 3314
% 17.37/6.39  #Fact    : 0
% 17.37/6.39  #Define  : 0
% 17.37/6.39  #Split   : 17
% 17.37/6.39  #Chain   : 0
% 17.37/6.39  #Close   : 0
% 17.37/6.39  
% 17.37/6.39  Ordering : KBO
% 17.37/6.39  
% 17.37/6.39  Simplification rules
% 17.37/6.39  ----------------------
% 17.37/6.39  #Subsume      : 290
% 17.37/6.39  #Demod        : 3490
% 17.37/6.39  #Tautology    : 964
% 17.37/6.39  #SimpNegUnit  : 15
% 17.37/6.39  #BackRed      : 58
% 17.37/6.39  
% 17.37/6.39  #Partial instantiations: 0
% 17.37/6.39  #Strategies tried      : 1
% 17.37/6.39  
% 17.37/6.39  Timing (in seconds)
% 17.37/6.39  ----------------------
% 17.37/6.39  Preprocessing        : 1.01
% 17.37/6.39  Parsing              : 0.48
% 17.37/6.39  CNF conversion       : 0.08
% 17.37/6.39  Main loop            : 4.30
% 17.37/6.39  Inferencing          : 1.25
% 17.37/6.39  Reduction            : 1.86
% 17.37/6.39  Demodulation         : 1.39
% 17.37/6.39  BG Simplification    : 0.11
% 17.37/6.39  Subsumption          : 0.83
% 17.37/6.39  Abstraction          : 0.08
% 17.37/6.39  MUC search           : 0.00
% 17.37/6.39  Cooper               : 0.00
% 17.37/6.39  Total                : 5.37
% 17.37/6.39  Index Insertion      : 0.00
% 17.37/6.39  Index Deletion       : 0.00
% 17.37/6.39  Index Matching       : 0.00
% 17.37/6.39  BG Taut test         : 0.00
%------------------------------------------------------------------------------