Average Error: 0.1 → 0.1
Time: 3.3s
Precision: 64
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[1 - x \cdot \left(1 \cdot \left(0.253 + x \cdot 0.12\right)\right)\]
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
1 - x \cdot \left(1 \cdot \left(0.253 + x \cdot 0.12\right)\right)
double f(double x) {
        double r122471 = 1.0;
        double r122472 = x;
        double r122473 = 0.253;
        double r122474 = 0.12;
        double r122475 = r122472 * r122474;
        double r122476 = r122473 + r122475;
        double r122477 = r122472 * r122476;
        double r122478 = r122471 - r122477;
        return r122478;
}
↓
double f(double x) {
        double r122479 = 1.0;
        double r122480 = x;
        double r122481 = 1.0;
        double r122482 = 0.253;
        double r122483 = 0.12;
        double r122484 = r122480 * r122483;
        double r122485 = r122482 + r122484;
        double r122486 = r122481 * r122485;
        double r122487 = r122480 * r122486;
        double r122488 = r122479 - r122487;
        return r122488;
}

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 *-un-lft-identity0.1

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

  4. Final simplification0.1

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

Reproduce

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