Average Error: 0.0 → 0.0
Time: 13.1s
Precision: 64
\[x \cdot \left(1.0 - x \cdot 0.5\right)\]
↓
\[1.0 \cdot x + \left(0.5 \cdot x\right) \cdot \left(-x\right)\]
x \cdot \left(1.0 - x \cdot 0.5\right)
↓
1.0 \cdot x + \left(0.5 \cdot x\right) \cdot \left(-x\right)
double f(double x) {
        double r2837709 = x;
        double r2837710 = 1.0;
        double r2837711 = 0.5;
        double r2837712 = r2837709 * r2837711;
        double r2837713 = r2837710 - r2837712;
        double r2837714 = r2837709 * r2837713;
        return r2837714;
}
↓
double f(double x) {
        double r2837715 = 1.0;
        double r2837716 = x;
        double r2837717 = r2837715 * r2837716;
        double r2837718 = 0.5;
        double r2837719 = r2837718 * r2837716;
        double r2837720 = -r2837716;
        double r2837721 = r2837719 * r2837720;
        double r2837722 = r2837717 + r2837721;
        return r2837722;
}

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

  3. Applied sub-neg0.0

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

  4. Applied distribute-rgt-in0.0

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

  5. Final simplification0.0

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

Reproduce

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