TSTP Solution File: SWW677_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW677_1 : TPTP v8.1.2. Released v6.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 : n016.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:07:56 EDT 2023
% Result : Theorem 3.89s 2.10s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW677_1 : TPTP v8.1.2. Released v6.4.0.
% 0.00/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.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 19:42:23 EDT 2023
% 0.15/0.35 % CPUTime :
% 3.89/2.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.89/2.11
% 3.89/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.12/2.13 %$ sorted > store:(Array[Int,Int]*Int*Int)>Array[Int,Int] > select:(Array[Int,Int]*Int)>Int > #nlpp > length > div2 > const:(Int)>Array[Int,Int] > #skF_1 > #skF_3 > #skF_2 > #skF_6
% 4.12/2.13
% 4.12/2.13 %Foreground sorts:
% 4.12/2.13 tff(Array[Int,Int], type, Array[Int,Int]: $tType ).
% 4.12/2.13
% 4.12/2.13 %Background operators:
% 4.12/2.13 tff('#skE_2', type, '#skE_2': $int).
% 4.12/2.13 tff('#skE_1', type, '#skE_1': $int).
% 4.12/2.13 tff('#skE_4', type, '#skE_4': $int).
% 4.12/2.13 tff('#skF_5', type, '#skF_5': $int).
% 4.12/2.13 tff('#skF_4', type, '#skF_4': $int).
% 4.12/2.13 tff('#skE_3', type, '#skE_3': $int).
% 4.12/2.13 tff('#skF_7', type, '#skF_7': $int).
% 4.12/2.13
% 4.12/2.13 %Foreground operators:
% 4.12/2.13 tff(sorted, type, sorted: (Array[Int,Int] * $int * $int) > $o).
% 4.12/2.13 tff('#skF_1', type, '#skF_1': (Array[Int,Int] * Array[Int,Int]) > $int).
% 4.12/2.13 tff(select:(Array[Int,Int]*Int)>Int, type, select:(Array[Int,Int]*Int)>Int: (Array[Int,Int] * $int) > $int).
% 4.12/2.13 tff(div2, type, div2: $int > $int).
% 4.12/2.13 tff('#skF_3', type, '#skF_3': (Array[Int,Int] * $int * $int) > $int).
% 4.12/2.13 tff(store:(Array[Int,Int]*Int*Int)>Array[Int,Int], type, store:(Array[Int,Int]*Int*Int)>Array[Int,Int]: (Array[Int,Int] * $int * $int) > Array[Int,Int]).
% 4.12/2.13 tff('#skF_2', type, '#skF_2': (Array[Int,Int] * $int * $int) > $int).
% 4.12/2.13 tff(const:(Int)>Array[Int,Int], type, const:(Int)>Array[Int,Int]: $int > Array[Int,Int]).
% 4.12/2.13 tff(length, type, length: Array[Int,Int] > $int).
% 4.12/2.13 tff('#skF_6', type, '#skF_6': Array[Int,Int]).
% 4.12/2.13
% 4.12/2.15 tff(f_127, negated_conjecture, ~(![La:$int, Ua:$int, A:Array[Int,Int], Ea:$int]: ((($lesseq(0, La) & $less(Ua, length(A))) & sorted(A, 0, $difference(length(A), 1))) => (($greater(La, Ua) => $true) & (~$greater(La, Ua) => (?[M_1a:$int]: (((M_1a = div2($sum(La, Ua))) & ((select(A, M_1a) = Ea) => $true)) & (~(select(A, M_1a) = Ea) => (($less(select(A, M_1a), Ea) => (?[L_2a:$int]: ((((L_2a = $sum(M_1a, 1)) & $lesseq(0, L_2a)) & $less(Ua, length(A))) & sorted(A, 0, $difference(length(A), 1))))) & (~$less(select(A, M_1a), Ea) => (?[U_3a:$int]: ((((U_3a = $difference(M_1a, 1)) & $lesseq(0, La)) & $less(U_3a, length(A))) & sorted(A, 0, $difference(length(A), 1))))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', formula_007)).
% 4.12/2.15 tff(f_56, axiom, (![Aa:$int, Resa:$int]: (($lesseq($product(2, Resa), Aa) & $greater($product(2, $sum(Resa, 1)), Aa)) <=> (div2(Aa) = Resa))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', formula_004)).
% 4.12/2.15 tff(c_75, plain, (select('#skF_6', div2($sum('#skF_5', '#skF_4')))!='#skF_7'), inference(cnfTransformation, [status(thm)], [f_127])).
% 4.12/2.15 tff(c_192, plain, (div2($sum('#skF_5', '#skF_4'))='#skE_2'), inference(define, [status(thm), theory('equality')], [c_75])).
% 4.12/2.15 tff(c_99, plain, (select('#skF_6', div2($sum('#skF_5', '#skF_4')))!='#skF_7'), inference(cnfTransformation, [status(thm)], [f_127])).
% 4.12/2.15 tff(c_203, plain, (select('#skF_6', '#skE_2')!='#skF_7'), inference(demodulation, [status(thm), theory('equality')], [c_192, c_99])).
% 4.12/2.15 tff(c_215, plain, (select('#skF_6', '#skE_2')='#skE_3'), inference(define, [status(thm), theory('equality')], [c_203])).
% 4.12/2.15 tff(c_35, plain, (sorted('#skF_6', 0, $difference(length('#skF_6'), 1))), inference(cnfTransformation, [status(thm)], [f_127])).
% 4.12/2.15 tff(c_81, plain, (sorted('#skF_6', 0, $sum($uminus(1), length('#skF_6')))), inference(backgroundSimplification, [status(thm), theory('LRFIA')], [c_35])).
% 4.12/2.15 tff(c_100, plain, ($less('#skF_5', length('#skF_6'))), inference(cnfTransformation, [status(thm)], [f_127])).
% 4.12/2.15 tff(f_1470, plain, (![L_2_33a:$int, M_1_30a:$int]: (((((~sorted('#skF_6', 0, $difference(length('#skF_6'), 1)) | ~$less('#skF_5', length('#skF_6'))) | ~$lesseq(0, L_2_33a)) | ~(L_2_33a = $sum(M_1_30a, 1))) | ~$less(select('#skF_6', M_1_30a), '#skF_7')) | ~(M_1_30a = div2($sum('#skF_5', '#skF_4'))))), inference(cnfTransformation, [status(thm)], [f_127])).
% 4.12/2.15 tff(f_1473, plain, (![L_2_33a:$int, M_1_30a:$int]: ((![L_2_33a:$int]: (~$lesseq(0, L_2_33a) | ~(L_2_33a = $sum(M_1_30a, 1)))) <=> (0 < $sum($uminus(1), $uminus(M_1_30a))))), inference(theorem, [status(thm), theory('LIA')], [])).
% 4.12/2.15 tff(f_1474, plain, (![M_1_30a:$int]: (((((0 < $sum($uminus(1), $uminus(M_1_30a))) | ~sorted('#skF_6', 0, $difference(length('#skF_6'), 1))) | ~$less('#skF_5', length('#skF_6'))) | ~$less(select('#skF_6', M_1_30a), '#skF_7')) | ~(M_1_30a = div2($sum('#skF_5', '#skF_4'))))), inference(equivalence, [status(thm)], [f_1470, f_1473])).
% 4.12/2.15 tff(c_50, plain, (~sorted('#skF_6', 0, $difference(length('#skF_6'), 1)) | ~$less('#skF_5', length('#skF_6')) | ~$less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | ~$lesseq(0, $sum(1, div2($sum('#skF_5', '#skF_4'))))), inference(cnfTransformation, [status(thm)], [f_1474])).
% 4.12/2.15 tff(c_58, plain, (~sorted('#skF_6', 0, $sum($uminus(1), length('#skF_6'))) | ~$less('#skF_5', length('#skF_6')) | ~$less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | $less(div2($sum('#skF_4', '#skF_5')), $uminus(1))), inference(backgroundSimplification, [status(thm), theory('LRFIA')], [c_50])).
% 4.12/2.15 tff(c_61, plain, (~sorted('#skF_6', 0, $sum($uminus(1), length('#skF_6'))) | ~$less('#skF_5', length('#skF_6')) | ~$less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | $less(div2($sum('#skF_5', '#skF_4')), $uminus(1))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_58])).
% 4.12/2.15 tff(c_123, plain, (~sorted('#skF_6', 0, $sum($uminus(1), length('#skF_6'))) | ~$less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | $less(div2($sum('#skF_5', '#skF_4')), $uminus(1))), inference(demodulation, [status(thm), theory('equality')], [c_100, c_61])).
% 4.12/2.15 tff(c_126, plain, (~sorted('#skF_6', 0, $sum($uminus(1), length('#skF_6'))) | ~$less(select('#skF_6', div2($sum('#skF_4', '#skF_5'))), '#skF_7') | $less(div2($sum('#skF_4', '#skF_5')), $uminus(1))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_123])).
% 4.12/2.15 tff(c_148, plain, (~$less(select('#skF_6', div2($sum('#skF_4', '#skF_5'))), '#skF_7') | $less(div2($sum('#skF_4', '#skF_5')), $uminus(1))), inference(demodulation, [status(thm), theory('equality')], [c_81, c_126])).
% 4.12/2.15 tff(c_151, plain, (~$less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | $less(div2($sum('#skF_5', '#skF_4')), $uminus(1))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_148])).
% 4.12/2.15 tff(c_378, plain, (div2($sum('#skF_5', '#skF_4'))='#skE_2'), inference(define, [status(thm), theory('equality')], [c_151])).
% 4.12/2.15 tff(c_162, plain, (~$less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | $less(div2($sum('#skF_5', '#skF_4')), $uminus(1))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_148])).
% 4.12/2.15 tff(c_381, plain, (~$less(select('#skF_6', '#skE_2'), '#skF_7') | $less('#skE_2', $uminus(1))), inference(demodulation, [status(thm), theory('equality')], [c_378, c_378, c_162])).
% 4.12/2.15 tff(c_389, plain, (~$less('#skE_3', '#skF_7') | $less('#skE_2', $uminus(1))), inference(demodulation, [status(thm), theory('equality')], [c_215, c_381])).
% 4.12/2.15 tff(c_393, plain, (~$less('#skE_3', '#skF_7')), inference(splitLeft, [status(thm)], [c_389])).
% 4.12/2.15 tff(c_80, plain, ($less('#skF_5', length('#skF_6'))), inference(cnfTransformation, [status(thm)], [f_127])).
% 4.12/2.15 tff(c_180, plain, (length('#skF_6')='#skE_1'), inference(define, [status(thm), theory('equality')], [c_80])).
% 4.12/2.15 tff(c_39, plain, ($lesseq(0, '#skF_4')), inference(cnfTransformation, [status(thm)], [f_127])).
% 4.12/2.15 tff(c_76, plain, (~$less('#skF_4', 0)), inference(backgroundSimplification, [status(thm), theory('LRFIA')], [c_39])).
% 4.12/2.15 tff(c_47, plain, ($less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | ~sorted('#skF_6', 0, $difference(length('#skF_6'), 1)) | ~$less($difference(div2($sum('#skF_5', '#skF_4')), 1), length('#skF_6')) | ~$lesseq(0, '#skF_4')), inference(cnfTransformation, [status(thm)], [f_127])).
% 4.12/2.15 tff(c_63, plain, ($less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | ~sorted('#skF_6', 0, $sum($uminus(1), length('#skF_6'))) | ~$less(div2($sum('#skF_4', '#skF_5')), $sum(1, length('#skF_6'))) | $less('#skF_4', 0)), inference(backgroundSimplification, [status(thm), theory('LRFIA')], [c_47])).
% 4.12/2.15 tff(c_66, plain, ($less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | ~sorted('#skF_6', 0, $sum($uminus(1), length('#skF_6'))) | ~$less(div2($sum('#skF_5', '#skF_4')), $sum(1, length('#skF_6'))) | $less('#skF_4', 0)), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_63])).
% 4.12/2.15 tff(c_106, plain, ($less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | ~sorted('#skF_6', 0, $sum($uminus(1), length('#skF_6'))) | ~$less(div2($sum('#skF_5', '#skF_4')), $sum(1, length('#skF_6')))), inference(negUnitSimplification, [status(thm)], [c_76, c_66])).
% 4.12/2.15 tff(c_109, plain, ($less(select('#skF_6', div2($sum('#skF_4', '#skF_5'))), '#skF_7') | ~sorted('#skF_6', 0, $sum($uminus(1), length('#skF_6'))) | ~$less(div2($sum('#skF_4', '#skF_5')), $sum(1, length('#skF_6')))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_106])).
% 4.12/2.15 tff(c_141, plain, ($less(select('#skF_6', div2($sum('#skF_4', '#skF_5'))), '#skF_7') | ~$less(div2($sum('#skF_4', '#skF_5')), $sum(1, length('#skF_6')))), inference(demodulation, [status(thm), theory('equality')], [c_81, c_109])).
% 4.12/2.15 tff(c_144, plain, ($less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | ~$less(div2($sum('#skF_5', '#skF_4')), $sum(1, length('#skF_6')))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_141])).
% 4.12/2.15 tff(c_278, plain, ($less(select('#skF_6', div2($sum('#skF_5', '#skF_4'))), '#skF_7') | ~$less(div2($sum('#skF_5', '#skF_4')), $sum(1, '#skE_1'))), inference(demodulation, [status(thm), theory('equality')], [c_180, c_144])).
% 4.12/2.15 tff(c_281, plain, ($less(select('#skF_6', div2($sum('#skF_4', '#skF_5'))), '#skF_7') | ~$less(div2($sum('#skF_4', '#skF_5')), $sum(1, '#skE_1'))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_278])).
% 4.12/2.15 tff(c_288, plain, (div2($sum('#skF_4', '#skF_5'))='#skE_4'), inference(define, [status(thm), theory('equality')], [c_281])).
% 4.12/2.15 tff(c_297, plain, (div2($sum('#skF_5', '#skF_4'))='#skE_4'), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_288])).
% 4.12/2.15 tff(c_197, plain, (div2($sum('#skF_5', '#skF_4'))='#skE_2'), inference(define, [status(thm), theory('equality')], [c_75])).
% 4.12/2.15 tff(c_200, plain, (div2($sum('#skF_4', '#skF_5'))='#skE_2'), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_197])).
% 4.12/2.15 tff(c_322, plain, ('#skE_4'='#skE_2' | $sum('#skF_5', '#skF_4')!=$sum('#skF_4', '#skF_5')), inference(superposition, [status(thm), theory('equality')], [c_297, c_200])).
% 4.12/2.15 tff(c_324, plain, ('#skE_4'='#skE_2'), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_322])).
% 4.12/2.15 tff(c_283, plain, (div2($sum('#skF_4', '#skF_5'))='#skE_4'), inference(define, [status(thm), theory('equality')], [c_281])).
% 4.12/2.15 tff(c_282, plain, ($less(select('#skF_6', div2($sum('#skF_4', '#skF_5'))), '#skF_7') | ~$less(div2($sum('#skF_4', '#skF_5')), $sum(1, '#skE_1'))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_278])).
% 4.12/2.15 tff(c_294, plain, ($less(select('#skF_6', '#skE_4'), '#skF_7') | ~$less('#skE_4', $sum(1, '#skE_1'))), inference(demodulation, [status(thm), theory('equality')], [c_283, c_283, c_282])).
% 4.12/2.15 tff(c_396, plain, ($less('#skE_3', '#skF_7') | ~$less('#skE_2', $sum(1, '#skE_1'))), inference(demodulation, [status(thm), theory('equality')], [c_324, c_215, c_324, c_294])).
% 4.12/2.15 tff(c_398, plain, (~$less('#skE_2', $sum(1, '#skE_1'))), inference(negUnitSimplification, [status(thm)], [c_393, c_396])).
% 4.12/2.15 tff(c_242, plain, (div2($sum('#skF_4', '#skF_5'))='#skE_2'), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_197])).
% 4.12/2.15 tff(c_14, plain, (![A_13a:$int]: ($lesseq($product(2, div2(A_13a)), A_13a))), inference(cnfTransformation, [status(thm)], [f_56])).
% 4.12/2.15 tff(c_89, plain, (![A_13a:$int]: (~$less(A_13a, $product(2, div2(A_13a))))), inference(backgroundSimplification, [status(thm), theory('LRFIA')], [c_14])).
% 4.12/2.15 tff(c_255, plain, (~$less($sum('#skF_4', '#skF_5'), $product(2, '#skE_2'))), inference(superposition, [status(thm), theory('equality')], [c_242, c_89])).
% 4.12/2.15 tff(c_257, plain, (~$less($sum('#skF_5', '#skF_4'), $product(2, '#skE_2'))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_255])).
% 4.12/2.15 tff(c_177, plain, (length('#skF_6')='#skE_1'), inference(define, [status(thm), theory('equality')], [c_80])).
% 4.12/2.15 tff(c_181, plain, ($less('#skF_5', '#skE_1')), inference(demodulation, [status(thm), theory('equality')], [c_177, c_100])).
% 4.12/2.15 tff(c_32, plain, (~$greater('#skF_4', '#skF_5')), inference(cnfTransformation, [status(thm)], [f_127])).
% 4.12/2.15 tff(c_82, plain, (~$less('#skF_5', '#skF_4')), inference(backgroundSimplification, [status(thm), theory('LRFIA')], [c_32])).
% 4.12/2.15 tff(c_399, plain, $false, inference(close, [status(thm), theory('LIA')], [c_398, c_257, c_181, c_82])).
% 4.12/2.15 tff(c_402, plain, ($less('#skE_2', $uminus(1))), inference(splitRight, [status(thm)], [c_389])).
% 4.12/2.15 tff(c_11, plain, (![A_13a:$int]: ($greater($product(2, $sum(1, div2(A_13a))), A_13a))), inference(cnfTransformation, [status(thm)], [f_56])).
% 4.12/2.15 tff(c_261, plain, (![A_110a:$int]: ($less(A_110a, $sum(2, $product(2, div2(A_110a)))))), inference(backgroundSimplification, [status(thm), theory('LRFIA')], [c_11])).
% 4.12/2.15 tff(c_265, plain, ($less($sum('#skF_4', '#skF_5'), $sum(2, $product(2, '#skE_2')))), inference(superposition, [status(thm), theory('equality')], [c_200, c_261])).
% 4.12/2.15 tff(c_267, plain, ($less($sum('#skF_5', '#skF_4'), $sum(2, $product(2, '#skE_2')))), inference(backgroundSimplification, [status(thm), theory('LIA')], [c_265])).
% 4.12/2.15 tff(c_404, plain, $false, inference(close, [status(thm), theory('LIA')], [c_402, c_267, c_82, c_76])).
% 4.12/2.15 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.12/2.15
% 4.12/2.15 Inference rules
% 4.12/2.15 ----------------------
% 4.12/2.15 #Ref : 1
% 4.12/2.15 #Sup : 23
% 4.12/2.15 #Fact : 0
% 4.12/2.15 #Define : 5
% 4.12/2.15 #Split : 1
% 4.12/2.15 #Chain : 0
% 4.12/2.15 #Close : 2
% 4.12/2.15
% 4.12/2.15 Ordering : LPO
% 4.12/2.15
% 4.12/2.15 Simplification rules
% 4.12/2.15 ----------------------
% 4.12/2.15 #Subsume : 2
% 4.12/2.15 #Demod : 24
% 4.12/2.15 #Tautology : 21
% 4.12/2.15 #SimpNegUnit : 3
% 4.12/2.15 #BackRed : 1
% 4.12/2.15
% 4.12/2.15 #Partial instantiations: 0
% 4.12/2.15 #Strategies tried : 1
% 4.12/2.15
% 4.12/2.15 Timing (in seconds)
% 4.12/2.15 ----------------------
% 4.12/2.15 Preprocessing : 0.65
% 4.12/2.15 Parsing : 0.32
% 4.12/2.15 CNF conversion : 0.04
% 4.12/2.15 Main loop : 0.35
% 4.12/2.15 Inferencing : 0.06
% 4.12/2.15 Reduction : 0.09
% 4.12/2.15 Demodulation : 0.07
% 4.12/2.15 BG Simplification : 0.06
% 4.12/2.15 Subsumption : 0.07
% 4.12/2.15 Abstraction : 0.02
% 4.12/2.15 MUC search : 0.02
% 4.12/2.15 Cooper : 0.08
% 4.12/2.15 Total : 1.06
% 4.12/2.15 Index Insertion : 0.00
% 4.12/2.15 Index Deletion : 0.00
% 4.12/2.15 Index Matching : 0.00
% 4.12/2.15 BG Taut test : 0.00
%------------------------------------------------------------------------------