Average Error: 0.0 → 0.0
Time: 3.2s
Precision: 64
\[\left(x \cdot x + y\right) + y\]
↓
\[\left(x \cdot x + y\right) + y\]
\left(x \cdot x + y\right) + y
↓
\left(x \cdot x + y\right) + y
double f(double x, double y) {
        double r751971 = x;
        double r751972 = r751971 * r751971;
        double r751973 = y;
        double r751974 = r751972 + r751973;
        double r751975 = r751974 + r751973;
        return r751975;
}
↓
double f(double x, double y) {
        double r751976 = x;
        double r751977 = r751976 * r751976;
        double r751978 = y;
        double r751979 = r751977 + r751978;
        double r751980 = r751979 + r751978;
        return r751980;
}

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. Final simplification0.0

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

Reproduce

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