Average Error: 0.0 → 0.0
Time: 1.4s
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 r59786 = x;
        double r59787 = 1.0;
        double r59788 = 0.5;
        double r59789 = r59786 * r59788;
        double r59790 = r59787 - r59789;
        double r59791 = r59786 * r59790;
        return r59791;
}
↓
double f(double x) {
        double r59792 = x;
        double r59793 = 1.0;
        double r59794 = 0.5;
        double r59795 = r59792 * r59794;
        double r59796 = r59793 - r59795;
        double r59797 = r59792 * r59796;
        return r59797;
}

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