Average Error: 0.0 → 0.0
Time: 3.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 r53503 = x;
        double r53504 = 1.0;
        double r53505 = 0.5;
        double r53506 = r53503 * r53505;
        double r53507 = r53504 - r53506;
        double r53508 = r53503 * r53507;
        return r53508;
}
↓
double f(double x) {
        double r53509 = x;
        double r53510 = 1.0;
        double r53511 = 0.5;
        double r53512 = r53509 * r53511;
        double r53513 = r53510 - r53512;
        double r53514 = r53509 * r53513;
        return r53514;
}

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