Average Error: 0.0 → 0.0
Time: 3.0s
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 r25536 = x;
        double r25537 = 1.0;
        double r25538 = 0.5;
        double r25539 = r25536 * r25538;
        double r25540 = r25537 - r25539;
        double r25541 = r25536 * r25540;
        return r25541;
}
↓
double f(double x) {
        double r25542 = x;
        double r25543 = 1.0;
        double r25544 = 0.5;
        double r25545 = r25542 * r25544;
        double r25546 = r25543 - r25545;
        double r25547 = r25542 * r25546;
        return r25547;
}

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