Average Error: 0.0 → 0.0
Time: 817.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 r52335 = x;
        double r52336 = 1.0;
        double r52337 = 0.5;
        double r52338 = r52335 * r52337;
        double r52339 = r52336 - r52338;
        double r52340 = r52335 * r52339;
        return r52340;
}
↓
double f(double x) {
        double r52341 = x;
        double r52342 = 1.0;
        double r52343 = r52341 * r52342;
        double r52344 = 0.5;
        double r52345 = r52341 * r52344;
        double r52346 = -r52345;
        double r52347 = r52341 * r52346;
        double r52348 = r52343 + r52347;
        return r52348;
}

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