Average Error: 0.0 → 0.0
Time: 5.7s
Precision: 64
\[x \cdot \left(1 - x \cdot 0.5\right)\]
↓
\[x \cdot 1 + \left(-0.5 \cdot x\right) \cdot x\]
x \cdot \left(1 - x \cdot 0.5\right)
↓
x \cdot 1 + \left(-0.5 \cdot x\right) \cdot x
double f(double x) {
        double r2313282 = x;
        double r2313283 = 1.0;
        double r2313284 = 0.5;
        double r2313285 = r2313282 * r2313284;
        double r2313286 = r2313283 - r2313285;
        double r2313287 = r2313282 * r2313286;
        return r2313287;
}
↓
double f(double x) {
        double r2313288 = x;
        double r2313289 = 1.0;
        double r2313290 = r2313288 * r2313289;
        double r2313291 = 0.5;
        double r2313292 = r2313291 * r2313288;
        double r2313293 = -r2313292;
        double r2313294 = r2313293 * r2313288;
        double r2313295 = r2313290 + r2313294;
        return r2313295;
}

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. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto x \cdot \color{blue}{\left(1 + \left(-x \cdot 0.5\right)\right)}\]

  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{x \cdot 1 + x \cdot \left(-x \cdot 0.5\right)}\]

  5. Final simplification0.0

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

Reproduce

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