Average Error: 0.1 → 0.1
Time: 1.9s
Precision: 64
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[1 - \left(x \cdot 0.253 + x \cdot \left(x \cdot 0.12\right)\right)\]
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
1 - \left(x \cdot 0.253 + x \cdot \left(x \cdot 0.12\right)\right)
double f(double x) {
        double r84810 = 1.0;
        double r84811 = x;
        double r84812 = 0.253;
        double r84813 = 0.12;
        double r84814 = r84811 * r84813;
        double r84815 = r84812 + r84814;
        double r84816 = r84811 * r84815;
        double r84817 = r84810 - r84816;
        return r84817;
}
↓
double f(double x) {
        double r84818 = 1.0;
        double r84819 = x;
        double r84820 = 0.253;
        double r84821 = r84819 * r84820;
        double r84822 = 0.12;
        double r84823 = r84819 * r84822;
        double r84824 = r84819 * r84823;
        double r84825 = r84821 + r84824;
        double r84826 = r84818 - r84825;
        return r84826;
}

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.253 + x \cdot 0.12\right)\]
  2. Using strategy rm

  3. Applied distribute-lft-in0.1

    \[\leadsto 1 - \color{blue}{\left(x \cdot 0.253 + x \cdot \left(x \cdot 0.12\right)\right)}\]

  4. Final simplification0.1

    \[\leadsto 1 - \left(x \cdot 0.253 + x \cdot \left(x \cdot 0.12\right)\right)\]

Reproduce

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