Average Error: 0.0 → 0.0
Time: 996.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 r44293 = x;
        double r44294 = 1.0;
        double r44295 = 0.5;
        double r44296 = r44293 * r44295;
        double r44297 = r44294 - r44296;
        double r44298 = r44293 * r44297;
        return r44298;
}
↓
double f(double x) {
        double r44299 = x;
        double r44300 = 1.0;
        double r44301 = r44299 * r44300;
        double r44302 = 0.5;
        double r44303 = r44299 * r44302;
        double r44304 = -r44303;
        double r44305 = r44299 * r44304;
        double r44306 = r44301 + r44305;
        return r44306;
}

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