Average Error: 0.0 → 0.0
Time: 1.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 r45542 = x;
        double r45543 = 1.0;
        double r45544 = 0.5;
        double r45545 = r45542 * r45544;
        double r45546 = r45543 - r45545;
        double r45547 = r45542 * r45546;
        return r45547;
}
↓
double f(double x) {
        double r45548 = x;
        double r45549 = 1.0;
        double r45550 = 0.5;
        double r45551 = r45548 * r45550;
        double r45552 = r45549 - r45551;
        double r45553 = r45548 * r45552;
        return r45553;
}

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