Average Error: 0.0 → 0.0
Time: 1.2s
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 r46556 = x;
        double r46557 = 1.0;
        double r46558 = 0.5;
        double r46559 = r46556 * r46558;
        double r46560 = r46557 - r46559;
        double r46561 = r46556 * r46560;
        return r46561;
}
↓
double f(double x) {
        double r46562 = x;
        double r46563 = 1.0;
        double r46564 = 0.5;
        double r46565 = r46562 * r46564;
        double r46566 = r46563 - r46565;
        double r46567 = r46562 * r46566;
        return r46567;
}

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