Average Error: 0.1 → 0.1
Time: 46.8s
Precision: 64
\[1.0 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[1.0 - \left(0.253 + 0.12 \cdot x\right) \cdot x\]
1.0 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
1.0 - \left(0.253 + 0.12 \cdot x\right) \cdot x
double f(double x) {
        double r4217831 = 1.0;
        double r4217832 = x;
        double r4217833 = 0.253;
        double r4217834 = 0.12;
        double r4217835 = r4217832 * r4217834;
        double r4217836 = r4217833 + r4217835;
        double r4217837 = r4217832 * r4217836;
        double r4217838 = r4217831 - r4217837;
        return r4217838;
}
↓
double f(double x) {
        double r4217839 = 1.0;
        double r4217840 = 0.253;
        double r4217841 = 0.12;
        double r4217842 = x;
        double r4217843 = r4217841 * r4217842;
        double r4217844 = r4217840 + r4217843;
        double r4217845 = r4217844 * r4217842;
        double r4217846 = r4217839 - r4217845;
        return r4217846;
}

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.0 - x \cdot \left(0.253 + x \cdot 0.12\right)\]

  2. Final simplification0.1

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

Reproduce

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