Average Error: 0.0 → 0.0
Time: 518.0ms
Precision: 64
\[0.0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[\mathsf{fma}\left(x, x, {x}^{3}\right)\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
\mathsf{fma}\left(x, x, {x}^{3}\right)
double f(double x) {
        double r104933 = x;
        double r104934 = r104933 * r104933;
        double r104935 = r104933 * r104934;
        double r104936 = r104935 + r104934;
        return r104936;
}
↓
double f(double x) {
        double r104937 = x;
        double r104938 = 3.0;
        double r104939 = pow(r104937, r104938);
        double r104940 = fma(r104937, r104937, r104939);
        return r104940;
}

Error

Bits error versus x

Target

Original0.0
Target0.0
Herbie0.0
\[\left(\left(1 + x\right) \cdot x\right) \cdot x\]

Derivation

  1. Initial program 0.0

    \[x \cdot \left(x \cdot x\right) + x \cdot x\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, {x}^{3}\right)}\]

  3. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(x, x, {x}^{3}\right)\]

Reproduce

herbie shell --seed 2020024 +o rules:numerics
(FPCore (x)
  :name "Expression 3, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

  :herbie-target
  (* (* (+ 1 x) x) x)

  (+ (* x (* x x)) (* x x)))