Average Error: 0.1 → 0.1
Time: 3.4s
Precision: 64
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[1 - x \cdot {\left(0.253 + x \cdot 0.12\right)}^{1}\]
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
1 - x \cdot {\left(0.253 + x \cdot 0.12\right)}^{1}
double f(double x) {
        double r63614 = 1.0;
        double r63615 = x;
        double r63616 = 0.253;
        double r63617 = 0.12;
        double r63618 = r63615 * r63617;
        double r63619 = r63616 + r63618;
        double r63620 = r63615 * r63619;
        double r63621 = r63614 - r63620;
        return r63621;
}
↓
double f(double x) {
        double r63622 = 1.0;
        double r63623 = x;
        double r63624 = 0.253;
        double r63625 = 0.12;
        double r63626 = r63623 * r63625;
        double r63627 = r63624 + r63626;
        double r63628 = 1.0;
        double r63629 = pow(r63627, r63628);
        double r63630 = r63623 * r63629;
        double r63631 = r63622 - r63630;
        return r63631;
}

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 pow10.1

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

  4. Final simplification0.1

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

Reproduce

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