Average Error: 0.0 → 0.0
Time: 5.4s
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 r38643090 = x;
        double r38643091 = r38643090 * r38643090;
        double r38643092 = y;
        double r38643093 = r38643091 + r38643092;
        double r38643094 = r38643093 + r38643092;
        return r38643094;
}
↓
double f(double x, double y) {
        double r38643095 = x;
        double r38643096 = r38643095 * r38643095;
        double r38643097 = y;
        double r38643098 = r38643097 + r38643097;
        double r38643099 = r38643096 + r38643098;
        return r38643099;
}

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 2019172 
(FPCore (x y)
  :name "Data.Random.Distribution.Normal:normalTail from random-fu-0.2.6.2"

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

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