Average Error: 0.1 → 0.1
Time: 2.4s
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 r69056 = 1.0;
        double r69057 = x;
        double r69058 = 0.253;
        double r69059 = 0.12;
        double r69060 = r69057 * r69059;
        double r69061 = r69058 + r69060;
        double r69062 = r69057 * r69061;
        double r69063 = r69056 - r69062;
        return r69063;
}
↓
double f(double x) {
        double r69064 = 1.0;
        double r69065 = x;
        double r69066 = 0.253;
        double r69067 = r69065 * r69066;
        double r69068 = 0.12;
        double r69069 = r69065 * r69068;
        double r69070 = r69065 * r69069;
        double r69071 = r69067 + r69070;
        double r69072 = r69064 - r69071;
        return r69072;
}

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 2020036 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (- 1 (* x (+ 0.253 (* x 0.12)))))