Average Error: 0.1 → 0.1
Time: 2.5s
Precision: 64
\[1 - x \cdot \left(0.2530000000000000026645352591003756970167 + x \cdot 0.1199999999999999955591079014993738383055\right)\]
↓
\[1 - x \cdot \left(0.2530000000000000026645352591003756970167 + x \cdot 0.1199999999999999955591079014993738383055\right)\]
1 - x \cdot \left(0.2530000000000000026645352591003756970167 + x \cdot 0.1199999999999999955591079014993738383055\right)
↓
1 - x \cdot \left(0.2530000000000000026645352591003756970167 + x \cdot 0.1199999999999999955591079014993738383055\right)
double f(double x) {
        double r57053 = 1.0;
        double r57054 = x;
        double r57055 = 0.253;
        double r57056 = 0.12;
        double r57057 = r57054 * r57056;
        double r57058 = r57055 + r57057;
        double r57059 = r57054 * r57058;
        double r57060 = r57053 - r57059;
        return r57060;
}
↓
double f(double x) {
        double r57061 = 1.0;
        double r57062 = x;
        double r57063 = 0.253;
        double r57064 = 0.12;
        double r57065 = r57062 * r57064;
        double r57066 = r57063 + r57065;
        double r57067 = r57062 * r57066;
        double r57068 = r57061 - r57067;
        return r57068;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[1 - x \cdot \left(0.2530000000000000026645352591003756970167 + x \cdot 0.1199999999999999955591079014993738383055\right)\]

  2. Final simplification0.1

    \[\leadsto 1 - x \cdot \left(0.2530000000000000026645352591003756970167 + x \cdot 0.1199999999999999955591079014993738383055\right)\]

Reproduce

herbie shell --seed 2019347 +o rules:numerics
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (- 1 (* x (+ 0.253 (* x 0.12)))))