Average Error: 0.0 → 0.0
Time: 3.5s
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 r693740 = x;
        double r693741 = r693740 * r693740;
        double r693742 = y;
        double r693743 = r693741 + r693742;
        double r693744 = r693743 + r693742;
        return r693744;
}
↓
double f(double x, double y) {
        double r693745 = x;
        double r693746 = r693745 * r693745;
        double r693747 = y;
        double r693748 = r693747 + r693747;
        double r693749 = r693746 + r693748;
        return r693749;
}

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