Average Error: 0.0 → 0.0
Time: 2.0s
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 r1376706 = x;
        double r1376707 = 1.0;
        double r1376708 = 0.5;
        double r1376709 = r1376706 * r1376708;
        double r1376710 = r1376707 - r1376709;
        double r1376711 = r1376706 * r1376710;
        return r1376711;
}
↓
double f(double x) {
        double r1376712 = 1.0;
        double r1376713 = x;
        double r1376714 = r1376712 * r1376713;
        double r1376715 = 0.5;
        double r1376716 = r1376715 * r1376713;
        double r1376717 = -r1376713;
        double r1376718 = r1376716 * r1376717;
        double r1376719 = r1376714 + r1376718;
        return r1376719;
}

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