Average Error: 0.0 → 0.0
Time: 915.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 r54248 = x;
        double r54249 = 1.0;
        double r54250 = 0.5;
        double r54251 = r54248 * r54250;
        double r54252 = r54249 - r54251;
        double r54253 = r54248 * r54252;
        return r54253;
}
↓
double f(double x) {
        double r54254 = x;
        double r54255 = 1.0;
        double r54256 = 0.5;
        double r54257 = r54254 * r54256;
        double r54258 = r54255 - r54257;
        double r54259 = r54254 * r54258;
        return r54259;
}

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