Average Error: 0.0 → 0.0
Time: 642.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 r14282 = x;
        double r14283 = 1.0;
        double r14284 = 0.5;
        double r14285 = r14282 * r14284;
        double r14286 = r14283 - r14285;
        double r14287 = r14282 * r14286;
        return r14287;
}
↓
double f(double x) {
        double r14288 = x;
        double r14289 = 1.0;
        double r14290 = 0.5;
        double r14291 = r14288 * r14290;
        double r14292 = r14289 - r14291;
        double r14293 = r14288 * r14292;
        return r14293;
}

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