Average Error: 0.0 → 0.0
Time: 989.0ms
Precision: 64
\[x \cdot \left(1 - x \cdot 0.5\right)\]
↓
\[x \cdot 1 + x \cdot \left(-x \cdot 0.5\right)\]
x \cdot \left(1 - x \cdot 0.5\right)
↓
x \cdot 1 + x \cdot \left(-x \cdot 0.5\right)
double f(double x) {
        double r43406 = x;
        double r43407 = 1.0;
        double r43408 = 0.5;
        double r43409 = r43406 * r43408;
        double r43410 = r43407 - r43409;
        double r43411 = r43406 * r43410;
        return r43411;
}
↓
double f(double x) {
        double r43412 = x;
        double r43413 = 1.0;
        double r43414 = r43412 * r43413;
        double r43415 = 0.5;
        double r43416 = r43412 * r43415;
        double r43417 = -r43416;
        double r43418 = r43412 * r43417;
        double r43419 = r43414 + r43418;
        return r43419;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot \left(1 - x \cdot 0.5\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2020089 
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  :precision binary64
  (* x (- 1 (* x 0.5))))