Average Error: 0.0 → 0.0
Time: 391.0ms
Precision: 64
\[x \cdot \left(1 - x \cdot 0.5\right)\]
↓
\[x \cdot \left(1 - x \cdot 0.5\right)\]
x \cdot \left(1 - x \cdot 0.5\right)
↓
x \cdot \left(1 - x \cdot 0.5\right)
double f(double x) {
        double r58453 = x;
        double r58454 = 1.0;
        double r58455 = 0.5;
        double r58456 = r58453 * r58455;
        double r58457 = r58454 - r58456;
        double r58458 = r58453 * r58457;
        return r58458;
}
↓
double f(double x) {
        double r58459 = x;
        double r58460 = 1.0;
        double r58461 = 0.5;
        double r58462 = r58459 * r58461;
        double r58463 = r58460 - r58462;
        double r58464 = r58459 * r58463;
        return r58464;
}

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. Final simplification0.0

    \[\leadsto x \cdot \left(1 - x \cdot 0.5\right)\]

Reproduce

herbie shell --seed 2019353 +o rules:numerics
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  :precision binary64
  (* x (- 1 (* x 0.5))))