Average Error: 0.0 → 0.0
Time: 8.1s
Precision: 64
\[x \cdot \left(1.0 - x \cdot 0.5\right)\]
↓
\[\left(1.0 - x \cdot 0.5\right) \cdot x\]
x \cdot \left(1.0 - x \cdot 0.5\right)
↓
\left(1.0 - x \cdot 0.5\right) \cdot x
double f(double x) {
        double r2005503 = x;
        double r2005504 = 1.0;
        double r2005505 = 0.5;
        double r2005506 = r2005503 * r2005505;
        double r2005507 = r2005504 - r2005506;
        double r2005508 = r2005503 * r2005507;
        return r2005508;
}
↓
double f(double x) {
        double r2005509 = 1.0;
        double r2005510 = x;
        double r2005511 = 0.5;
        double r2005512 = r2005510 * r2005511;
        double r2005513 = r2005509 - r2005512;
        double r2005514 = r2005513 * r2005510;
        return r2005514;
}

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.0 - x \cdot 0.5\right)\]

  2. Final simplification0.0

    \[\leadsto \left(1.0 - x \cdot 0.5\right) \cdot x\]

Reproduce

herbie shell --seed 2019163 +o rules:numerics
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  (* x (- 1.0 (* x 0.5))))