Average Error: 0.0 → 0.0
Time: 8.6s
Precision: 64
\[\left(x \cdot x + y\right) + y\]
↓
\[x \cdot x + 2 \cdot y\]
\left(x \cdot x + y\right) + y
↓
x \cdot x + 2 \cdot y
double f(double x, double y) {
        double r631304 = x;
        double r631305 = r631304 * r631304;
        double r631306 = y;
        double r631307 = r631305 + r631306;
        double r631308 = r631307 + r631306;
        return r631308;
}
↓
double f(double x, double y) {
        double r631309 = x;
        double r631310 = r631309 * r631309;
        double r631311 = 2.0;
        double r631312 = y;
        double r631313 = r631311 * r631312;
        double r631314 = r631310 + r631313;
        return r631314;
}

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. Simplified0.0

    \[\leadsto x \cdot x + \color{blue}{2 \cdot y}\]

  5. Final simplification0.0

    \[\leadsto x \cdot x + 2 \cdot y\]

Reproduce

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