Average Error: 0.0 → 0.0
Time: 15.9s
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 r42350 = x;
        double r42351 = 1.0;
        double r42352 = 0.5;
        double r42353 = r42350 * r42352;
        double r42354 = r42351 - r42353;
        double r42355 = r42350 * r42354;
        return r42355;
}
↓
double f(double x) {
        double r42356 = x;
        double r42357 = 1.0;
        double r42358 = r42356 * r42357;
        double r42359 = 0.5;
        double r42360 = r42356 * r42359;
        double r42361 = -r42360;
        double r42362 = r42356 * r42361;
        double r42363 = r42358 + r42362;
        return r42363;
}

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