Average Error: 0.0 → 0.0
Time: 6.1s
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 r32789 = x;
        double r32790 = 1.0;
        double r32791 = 0.5;
        double r32792 = r32789 * r32791;
        double r32793 = r32790 - r32792;
        double r32794 = r32789 * r32793;
        return r32794;
}
↓
double f(double x) {
        double r32795 = x;
        double r32796 = 1.0;
        double r32797 = 0.5;
        double r32798 = r32795 * r32797;
        double r32799 = r32796 - r32798;
        double r32800 = r32795 * r32799;
        return r32800;
}

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))))