Average Error: 0.0 → 0.0
Time: 5.8s
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 r3524710 = x;
        double r3524711 = 1.0;
        double r3524712 = 0.5;
        double r3524713 = r3524710 * r3524712;
        double r3524714 = r3524711 - r3524713;
        double r3524715 = r3524710 * r3524714;
        return r3524715;
}
↓
double f(double x) {
        double r3524716 = 1.0;
        double r3524717 = x;
        double r3524718 = r3524716 * r3524717;
        double r3524719 = 0.5;
        double r3524720 = r3524719 * r3524717;
        double r3524721 = -r3524717;
        double r3524722 = r3524720 * r3524721;
        double r3524723 = r3524718 + r3524722;
        return r3524723;
}

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 2019162 
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  (* x (- 1.0 (* x 0.5))))