Average Error: 0.0 → 0.0
Time: 15.8s
Precision: 64
\[x \cdot \left(1 - x \cdot 0.5\right)\]
↓
\[x \cdot \left(1 - x \cdot \frac{1}{2}\right)\]
x \cdot \left(1 - x \cdot 0.5\right)
↓
x \cdot \left(1 - x \cdot \frac{1}{2}\right)
double f(double x) {
        double r45888 = x;
        double r45889 = 1.0;
        double r45890 = 0.5;
        double r45891 = r45888 * r45890;
        double r45892 = r45889 - r45891;
        double r45893 = r45888 * r45892;
        return r45893;
}
↓
double f(double x) {
        double r45894 = x;
        double r45895 = 1.0;
        double r45896 = 2.0;
        double r45897 = r45895 / r45896;
        double r45898 = r45894 * r45897;
        double r45899 = r45895 - r45898;
        double r45900 = r45894 * r45899;
        return r45900;
}

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 \frac{1}{2}\right)\]

Reproduce

herbie shell --seed 2019303 
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  :precision binary64
  (* x (- 1 (* x 0.5))))