TSTP Solution File: SEU131+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU131+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 : n029.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:41 EDT 2023
% Result : Theorem 29.65s 16.86s
% Output : CNFRefutation 29.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 37
% Syntax : Number of formulae : 105 ( 29 unt; 26 typ; 0 def)
% Number of atoms : 143 ( 34 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 118 ( 54 ~; 45 |; 10 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 42 ( 19 >; 23 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 7 con; 0-3 aty)
% Number of variables : 120 (; 117 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_union2 > set_intersection2 > set_difference > #nlpp > empty_set > #skF_11 > #skF_6 > #skF_1 > #skF_17 > #skF_10 > #skF_14 > #skF_18 > #skF_13 > #skF_5 > #skF_2 > #skF_9 > #skF_7 > #skF_3 > #skF_8 > #skF_16 > #skF_15 > #skF_12 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_109,negated_conjecture,
~ ! [A,B] :
( ( set_difference(A,B) = empty_set )
<=> subset(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
tff(f_63,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_111,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_203,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
tff(f_47,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_82,axiom,
! [A,B,C] :
( ( C = set_difference(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& ~ in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
tff(f_140,lemma,
! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
tff(f_148,lemma,
! [A,B] :
( subset(A,B)
=> ( set_intersection2(A,B) = A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
tff(f_179,lemma,
! [A,B] :
( ~ ( ~ disjoint(A,B)
& ! [C] :
~ ( in(C,A)
& in(C,B) ) )
& ~ ( ? [C] :
( in(C,A)
& in(C,B) )
& disjoint(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).
tff(f_35,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_199,lemma,
! [A,B] :
( ~ ( ~ disjoint(A,B)
& ! [C] : ~ in(C,set_intersection2(A,B)) )
& ~ ( ? [C] : in(C,set_intersection2(A,B))
& disjoint(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
tff(c_102,plain,
( subset('#skF_9','#skF_10')
| ~ subset('#skF_11','#skF_12') ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_200,plain,
~ subset('#skF_11','#skF_12'),
inference(splitLeft,[status(thm)],[c_102]) ).
tff(c_40,plain,
! [A_19,B_20] :
( in('#skF_4'(A_19,B_20),A_19)
| subset(A_19,B_20) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_108,plain,
empty('#skF_13'),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_190,plain,
! [A_99] :
( ( empty_set = A_99 )
| ~ empty(A_99) ),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_197,plain,
empty_set = '#skF_13',
inference(resolution,[status(thm)],[c_108,c_190]) ).
tff(c_14,plain,
! [B_12] : ~ in(B_12,empty_set),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_204,plain,
! [B_12] : ~ in(B_12,'#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_197,c_14]) ).
tff(c_106,plain,
( subset('#skF_9','#skF_10')
| ( set_difference('#skF_11','#skF_12') = empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_287,plain,
( subset('#skF_9','#skF_10')
| ( set_difference('#skF_11','#skF_12') = '#skF_13' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_197,c_106]) ).
tff(c_288,plain,
set_difference('#skF_11','#skF_12') = '#skF_13',
inference(splitLeft,[status(thm)],[c_287]) ).
tff(c_2973,plain,
! [D_273,A_274,B_275] :
( in(D_273,set_difference(A_274,B_275))
| in(D_273,B_275)
| ~ in(D_273,A_274) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_2996,plain,
! [D_273] :
( in(D_273,'#skF_13')
| in(D_273,'#skF_12')
| ~ in(D_273,'#skF_11') ),
inference(superposition,[status(thm),theory(equality)],[c_288,c_2973]) ).
tff(c_3013,plain,
! [D_276] :
( in(D_276,'#skF_12')
| ~ in(D_276,'#skF_11') ),
inference(negUnitSimplification,[status(thm)],[c_204,c_2996]) ).
tff(c_5840,plain,
! [B_419] :
( in('#skF_4'('#skF_11',B_419),'#skF_12')
| subset('#skF_11',B_419) ),
inference(resolution,[status(thm)],[c_40,c_3013]) ).
tff(c_38,plain,
! [A_19,B_20] :
( ~ in('#skF_4'(A_19,B_20),B_20)
| subset(A_19,B_20) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_5846,plain,
subset('#skF_11','#skF_12'),
inference(resolution,[status(thm)],[c_5840,c_38]) ).
tff(c_5859,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_200,c_200,c_5846]) ).
tff(c_5861,plain,
set_difference('#skF_11','#skF_12') != '#skF_13',
inference(splitRight,[status(thm)],[c_287]) ).
tff(c_104,plain,
( ( set_difference('#skF_9','#skF_10') != empty_set )
| ( set_difference('#skF_11','#skF_12') = empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_6111,plain,
( ( set_difference('#skF_9','#skF_10') != '#skF_13' )
| ( set_difference('#skF_11','#skF_12') = '#skF_13' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_197,c_197,c_104]) ).
tff(c_6112,plain,
set_difference('#skF_9','#skF_10') != '#skF_13',
inference(negUnitSimplification,[status(thm)],[c_5861,c_6111]) ).
tff(c_7493,plain,
! [A_528,B_529] :
( in('#skF_4'(A_528,B_529),A_528)
| subset(A_528,B_529) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_64,plain,
! [D_35,A_30,B_31] :
( in(D_35,A_30)
| ~ in(D_35,set_difference(A_30,B_31)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_66159,plain,
! [A_1430,B_1431,B_1432] :
( in('#skF_4'(set_difference(A_1430,B_1431),B_1432),A_1430)
| subset(set_difference(A_1430,B_1431),B_1432) ),
inference(resolution,[status(thm)],[c_7493,c_64]) ).
tff(c_66282,plain,
! [A_1433,B_1434] : subset(set_difference(A_1433,B_1434),A_1433),
inference(resolution,[status(thm)],[c_66159,c_38]) ).
tff(c_5860,plain,
subset('#skF_9','#skF_10'),
inference(splitRight,[status(thm)],[c_287]) ).
tff(c_9190,plain,
! [A_617,C_618,B_619] :
( subset(A_617,C_618)
| ~ subset(B_619,C_618)
| ~ subset(A_617,B_619) ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_9218,plain,
! [A_620] :
( subset(A_620,'#skF_10')
| ~ subset(A_620,'#skF_9') ),
inference(resolution,[status(thm)],[c_5860,c_9190]) ).
tff(c_128,plain,
! [A_64,B_65] :
( ( set_intersection2(A_64,B_65) = A_64 )
| ~ subset(A_64,B_65) ),
inference(cnfTransformation,[status(thm)],[f_148]) ).
tff(c_9240,plain,
! [A_620] :
( ( set_intersection2(A_620,'#skF_10') = A_620 )
| ~ subset(A_620,'#skF_9') ),
inference(resolution,[status(thm)],[c_9218,c_128]) ).
tff(c_71331,plain,
! [B_1486] : ( set_intersection2(set_difference('#skF_9',B_1486),'#skF_10') = set_difference('#skF_9',B_1486) ),
inference(resolution,[status(thm)],[c_66282,c_9240]) ).
tff(c_148,plain,
! [A_72,B_73] :
( in('#skF_17'(A_72,B_73),A_72)
| disjoint(A_72,B_73) ),
inference(cnfTransformation,[status(thm)],[f_179]) ).
tff(c_146,plain,
! [A_72,B_73] :
( in('#skF_17'(A_72,B_73),B_73)
| disjoint(A_72,B_73) ),
inference(cnfTransformation,[status(thm)],[f_179]) ).
tff(c_8280,plain,
! [D_556,B_557,A_558] :
( ~ in(D_556,B_557)
| ~ in(D_556,set_difference(A_558,B_557)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_70488,plain,
! [A_1477,A_1478,B_1479] :
( ~ in('#skF_17'(A_1477,set_difference(A_1478,B_1479)),B_1479)
| disjoint(A_1477,set_difference(A_1478,B_1479)) ),
inference(resolution,[status(thm)],[c_146,c_8280]) ).
tff(c_70548,plain,
! [A_1480,A_1481] : disjoint(A_1480,set_difference(A_1481,A_1480)),
inference(resolution,[status(thm)],[c_148,c_70488]) ).
tff(c_16,plain,
! [A_9] :
( ( empty_set = A_9 )
| in('#skF_1'(A_9),A_9) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_5935,plain,
! [A_9] :
( ( A_9 = '#skF_13' )
| in('#skF_1'(A_9),A_9) ),
inference(demodulation,[status(thm),theory(equality)],[c_197,c_16]) ).
tff(c_6,plain,
! [B_6,A_5] : ( set_intersection2(B_6,A_5) = set_intersection2(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_6992,plain,
! [A_484,B_485,C_486] :
( ~ disjoint(A_484,B_485)
| ~ in(C_486,set_intersection2(A_484,B_485)) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_14479,plain,
! [B_771,A_772,C_773] :
( ~ disjoint(B_771,A_772)
| ~ in(C_773,set_intersection2(A_772,B_771)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_6992]) ).
tff(c_14587,plain,
! [B_771,A_772] :
( ~ disjoint(B_771,A_772)
| ( set_intersection2(A_772,B_771) = '#skF_13' ) ),
inference(resolution,[status(thm)],[c_5935,c_14479]) ).
tff(c_70571,plain,
! [A_1481,A_1480] : ( set_intersection2(set_difference(A_1481,A_1480),A_1480) = '#skF_13' ),
inference(resolution,[status(thm)],[c_70548,c_14587]) ).
tff(c_71338,plain,
set_difference('#skF_9','#skF_10') = '#skF_13',
inference(superposition,[status(thm),theory(equality)],[c_71331,c_70571]) ).
tff(c_71790,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6112,c_71338]) ).
tff(c_71792,plain,
subset('#skF_11','#skF_12'),
inference(splitRight,[status(thm)],[c_102]) ).
tff(c_100,plain,
( ( set_difference('#skF_9','#skF_10') != empty_set )
| ~ subset('#skF_11','#skF_12') ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_71956,plain,
set_difference('#skF_9','#skF_10') != '#skF_13',
inference(demodulation,[status(thm),theory(equality)],[c_71792,c_197,c_100]) ).
tff(c_74259,plain,
! [D_1614,A_1615,B_1616] :
( in(D_1614,A_1615)
| ~ in(D_1614,set_difference(A_1615,B_1616)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_148749,plain,
! [A_2661,B_2662,B_2663] :
( in('#skF_4'(set_difference(A_2661,B_2662),B_2663),A_2661)
| subset(set_difference(A_2661,B_2662),B_2663) ),
inference(resolution,[status(thm)],[c_40,c_74259]) ).
tff(c_148901,plain,
! [A_2664,B_2665] : subset(set_difference(A_2664,B_2665),A_2664),
inference(resolution,[status(thm)],[c_148749,c_38]) ).
tff(c_71791,plain,
subset('#skF_9','#skF_10'),
inference(splitRight,[status(thm)],[c_102]) ).
tff(c_75277,plain,
! [A_1689,C_1690,B_1691] :
( subset(A_1689,C_1690)
| ~ subset(B_1691,C_1690)
| ~ subset(A_1689,B_1691) ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_75305,plain,
! [A_1692] :
( subset(A_1692,'#skF_10')
| ~ subset(A_1692,'#skF_9') ),
inference(resolution,[status(thm)],[c_71791,c_75277]) ).
tff(c_75326,plain,
! [A_1692] :
( ( set_intersection2(A_1692,'#skF_10') = A_1692 )
| ~ subset(A_1692,'#skF_9') ),
inference(resolution,[status(thm)],[c_75305,c_128]) ).
tff(c_151960,plain,
! [B_2691] : ( set_intersection2(set_difference('#skF_9',B_2691),'#skF_10') = set_difference('#skF_9',B_2691) ),
inference(resolution,[status(thm)],[c_148901,c_75326]) ).
tff(c_74332,plain,
! [A_1623,B_1624] :
( in('#skF_17'(A_1623,B_1624),B_1624)
| disjoint(A_1623,B_1624) ),
inference(cnfTransformation,[status(thm)],[f_179]) ).
tff(c_62,plain,
! [D_35,B_31,A_30] :
( ~ in(D_35,B_31)
| ~ in(D_35,set_difference(A_30,B_31)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_130327,plain,
! [A_2461,A_2462,B_2463] :
( ~ in('#skF_17'(A_2461,set_difference(A_2462,B_2463)),B_2463)
| disjoint(A_2461,set_difference(A_2462,B_2463)) ),
inference(resolution,[status(thm)],[c_74332,c_62]) ).
tff(c_130379,plain,
! [A_2464,A_2465] : disjoint(A_2464,set_difference(A_2465,A_2464)),
inference(resolution,[status(thm)],[c_148,c_130327]) ).
tff(c_71957,plain,
! [A_9] :
( ( A_9 = '#skF_13' )
| in('#skF_1'(A_9),A_9) ),
inference(demodulation,[status(thm),theory(equality)],[c_197,c_16]) ).
tff(c_73197,plain,
! [A_1564,B_1565,C_1566] :
( ~ disjoint(A_1564,B_1565)
| ~ in(C_1566,set_intersection2(A_1564,B_1565)) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_79844,plain,
! [A_1845,B_1846,C_1847] :
( ~ disjoint(A_1845,B_1846)
| ~ in(C_1847,set_intersection2(B_1846,A_1845)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_73197]) ).
tff(c_79943,plain,
! [A_1845,B_1846] :
( ~ disjoint(A_1845,B_1846)
| ( set_intersection2(B_1846,A_1845) = '#skF_13' ) ),
inference(resolution,[status(thm)],[c_71957,c_79844]) ).
tff(c_130399,plain,
! [A_2465,A_2464] : ( set_intersection2(set_difference(A_2465,A_2464),A_2464) = '#skF_13' ),
inference(resolution,[status(thm)],[c_130379,c_79943]) ).
tff(c_152015,plain,
set_difference('#skF_9','#skF_10') = '#skF_13',
inference(superposition,[status(thm),theory(equality)],[c_151960,c_130399]) ).
tff(c_152461,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_71956,c_152015]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU131+2 : TPTP v8.1.2. Released v3.3.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.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 11:46:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 29.65/16.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.65/16.87
% 29.65/16.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 29.78/16.90
% 29.78/16.90 Inference rules
% 29.78/16.90 ----------------------
% 29.78/16.90 #Ref : 6
% 29.78/16.90 #Sup : 41889
% 29.78/16.90 #Fact : 12
% 29.78/16.90 #Define : 0
% 29.78/16.90 #Split : 25
% 29.78/16.90 #Chain : 0
% 29.78/16.90 #Close : 0
% 29.78/16.90
% 29.78/16.90 Ordering : KBO
% 29.78/16.90
% 29.78/16.90 Simplification rules
% 29.78/16.90 ----------------------
% 29.78/16.90 #Subsume : 19081
% 29.78/16.90 #Demod : 15594
% 29.78/16.90 #Tautology : 12147
% 29.78/16.90 #SimpNegUnit : 598
% 29.78/16.90 #BackRed : 25
% 29.78/16.90
% 29.78/16.90 #Partial instantiations: 0
% 29.78/16.90 #Strategies tried : 1
% 29.78/16.90
% 29.78/16.90 Timing (in seconds)
% 29.78/16.90 ----------------------
% 29.78/16.90 Preprocessing : 0.58
% 29.78/16.90 Parsing : 0.29
% 29.78/16.91 CNF conversion : 0.05
% 29.78/16.91 Main loop : 15.26
% 29.78/16.91 Inferencing : 2.29
% 29.78/16.91 Reduction : 7.27
% 29.78/16.91 Demodulation : 5.70
% 29.78/16.91 BG Simplification : 0.14
% 29.78/16.91 Subsumption : 4.82
% 29.78/16.91 Abstraction : 0.21
% 29.78/16.91 MUC search : 0.00
% 29.78/16.91 Cooper : 0.00
% 29.78/16.91 Total : 15.91
% 29.78/16.91 Index Insertion : 0.00
% 29.78/16.91 Index Deletion : 0.00
% 29.78/16.91 Index Matching : 0.00
% 29.78/16.91 BG Taut test : 0.00
%------------------------------------------------------------------------------