Average Error: 0.0 → 0.0
Time: 2.7s
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 r83777 = x;
        double r83778 = 1.0;
        double r83779 = 0.5;
        double r83780 = r83777 * r83779;
        double r83781 = r83778 - r83780;
        double r83782 = r83777 * r83781;
        return r83782;
}
↓
double f(double x) {
        double r83783 = x;
        double r83784 = 1.0;
        double r83785 = 0.5;
        double r83786 = r83783 * r83785;
        double r83787 = r83784 - r83786;
        double r83788 = r83783 * r83787;
        return r83788;
}

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