Average Error: 0.0 → 0.0
Time: 861.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 r73625 = x;
        double r73626 = 1.0;
        double r73627 = 0.5;
        double r73628 = r73625 * r73627;
        double r73629 = r73626 - r73628;
        double r73630 = r73625 * r73629;
        return r73630;
}
↓
double f(double x) {
        double r73631 = x;
        double r73632 = 1.0;
        double r73633 = r73631 * r73632;
        double r73634 = 0.5;
        double r73635 = r73631 * r73634;
        double r73636 = -r73635;
        double r73637 = r73631 * r73636;
        double r73638 = r73633 + r73637;
        return r73638;
}

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 2019346 +o rules:numerics
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  :precision binary64
  (* x (- 1 (* x 0.5))))