Average Error: 0.0 → 0.0
Time: 4.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 r55707 = x;
        double r55708 = 1.0;
        double r55709 = 0.5;
        double r55710 = r55707 * r55709;
        double r55711 = r55708 - r55710;
        double r55712 = r55707 * r55711;
        return r55712;
}
↓
double f(double x) {
        double r55713 = x;
        double r55714 = 1.0;
        double r55715 = 0.5;
        double r55716 = r55713 * r55715;
        double r55717 = r55714 - r55716;
        double r55718 = r55713 * r55717;
        return r55718;
}

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