Average Error: 0.0 → 0.0
Time: 863.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 r30208 = x;
        double r30209 = 1.0;
        double r30210 = 0.5;
        double r30211 = r30208 * r30210;
        double r30212 = r30209 - r30211;
        double r30213 = r30208 * r30212;
        return r30213;
}
↓
double f(double x) {
        double r30214 = x;
        double r30215 = 1.0;
        double r30216 = 0.5;
        double r30217 = r30214 * r30216;
        double r30218 = r30215 - r30217;
        double r30219 = r30214 * r30218;
        return r30219;
}

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