Average Error: 0.0 → 0.0
Time: 5.5s
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 r2981111 = x;
        double r2981112 = 1.0;
        double r2981113 = 0.5;
        double r2981114 = r2981111 * r2981113;
        double r2981115 = r2981112 - r2981114;
        double r2981116 = r2981111 * r2981115;
        return r2981116;
}
↓
double f(double x) {
        double r2981117 = 1.0;
        double r2981118 = x;
        double r2981119 = r2981117 * r2981118;
        double r2981120 = 0.5;
        double r2981121 = r2981120 * r2981118;
        double r2981122 = -r2981118;
        double r2981123 = r2981121 * r2981122;
        double r2981124 = r2981119 + r2981123;
        return r2981124;
}

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))))