Average Error: 0.0 → 0.0
Time: 859.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 r50060 = x;
        double r50061 = 1.0;
        double r50062 = 0.5;
        double r50063 = r50060 * r50062;
        double r50064 = r50061 - r50063;
        double r50065 = r50060 * r50064;
        return r50065;
}
↓
double f(double x) {
        double r50066 = x;
        double r50067 = 1.0;
        double r50068 = r50066 * r50067;
        double r50069 = 0.5;
        double r50070 = r50066 * r50069;
        double r50071 = -r50070;
        double r50072 = r50066 * r50071;
        double r50073 = r50068 + r50072;
        return r50073;
}

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