Average Error: 0.0 → 0.0
Time: 6.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 r56535 = x;
        double r56536 = 1.0;
        double r56537 = 0.5;
        double r56538 = r56535 * r56537;
        double r56539 = r56536 - r56538;
        double r56540 = r56535 * r56539;
        return r56540;
}
↓
double f(double x) {
        double r56541 = x;
        double r56542 = 1.0;
        double r56543 = 0.5;
        double r56544 = r56541 * r56543;
        double r56545 = r56542 - r56544;
        double r56546 = r56541 * r56545;
        return r56546;
}

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