Average Error: 0.1 → 0.1
Time: 12.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 r65597 = 1.0;
        double r65598 = x;
        double r65599 = 0.253;
        double r65600 = 0.12;
        double r65601 = r65598 * r65600;
        double r65602 = r65599 + r65601;
        double r65603 = r65598 * r65602;
        double r65604 = r65597 - r65603;
        return r65604;
}

double f(double x) {
        double r65605 = 1.0;
        double r65606 = x;
        double r65607 = 0.253;
        double r65608 = 0.12;
        double r65609 = r65606 * r65608;
        double r65610 = r65607 + r65609;
        double r65611 = r65606 * r65610;
        double r65612 = r65605 - r65611;
        return r65612;
}

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 2019212 +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)))))