Average Error: 0.0 → 0.0
Time: 679.0ms
Precision: 64
\[\left(x \cdot x + y\right) + y\]
↓
\[\mathsf{fma}\left(y, 2, {x}^{2}\right)\]
\left(x \cdot x + y\right) + y
↓
\mathsf{fma}\left(y, 2, {x}^{2}\right)
double code(double x, double y) {
	return (((x * x) + y) + y);
}
↓
double code(double x, double y) {
	return fma(y, 2.0, pow(x, 2.0));
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

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

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

    \[\leadsto \color{blue}{y + \mathsf{fma}\left(x, x, y\right)}\]
  3. Using strategy rm

  4. Applied *-un-lft-identity0.0

    \[\leadsto y + \color{blue}{1 \cdot \mathsf{fma}\left(x, x, y\right)}\]

  5. Applied *-un-lft-identity0.0

    \[\leadsto \color{blue}{1 \cdot y} + 1 \cdot \mathsf{fma}\left(x, x, y\right)\]

  6. Applied distribute-lft-out0.0

    \[\leadsto \color{blue}{1 \cdot \left(y + \mathsf{fma}\left(x, x, y\right)\right)}\]

  7. Simplified0.0

    \[\leadsto 1 \cdot \color{blue}{\mathsf{fma}\left(y, 2, {x}^{2}\right)}\]

  8. Final simplification0.0

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

Reproduce

herbie shell --seed 2020056 +o rules:numerics
(FPCore (x y)
  :name "Data.Random.Distribution.Normal:normalTail from random-fu-0.2.6.2"
  :precision binary64

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

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