Average Error: 0.0 → 0.0
Time: 2.0s
Precision: 64
\[\left(x \cdot x + y\right) + y\]
↓
\[x \cdot x + \left(y + y\right)\]
\left(x \cdot x + y\right) + y
↓
x \cdot x + \left(y + y\right)
double f(double x, double y) {
        double r781758 = x;
        double r781759 = r781758 * r781758;
        double r781760 = y;
        double r781761 = r781759 + r781760;
        double r781762 = r781761 + r781760;
        return r781762;
}
↓
double f(double x, double y) {
        double r781763 = x;
        double r781764 = r781763 * r781763;
        double r781765 = y;
        double r781766 = r781765 + r781765;
        double r781767 = r781764 + r781766;
        return r781767;
}

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. Using strategy rm

  3. Applied associate-+l+0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2020081 
(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))