Average Error: 0.0 → 0.0
Time: 5.5s
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 r41686 = x;
        double r41687 = 1.0;
        double r41688 = 0.5;
        double r41689 = r41686 * r41688;
        double r41690 = r41687 - r41689;
        double r41691 = r41686 * r41690;
        return r41691;
}
↓
double f(double x) {
        double r41692 = x;
        double r41693 = 1.0;
        double r41694 = 0.5;
        double r41695 = r41692 * r41694;
        double r41696 = r41693 - r41695;
        double r41697 = r41692 * r41696;
        return r41697;
}

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