Average Error: 0.0 → 0.0
Time: 10.3s
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 r562647 = x;
        double r562648 = r562647 * r562647;
        double r562649 = y;
        double r562650 = r562648 + r562649;
        double r562651 = r562650 + r562649;
        return r562651;
}
↓
double f(double x, double y) {
        double r562652 = x;
        double r562653 = r562652 * r562652;
        double r562654 = 2.0;
        double r562655 = y;
        double r562656 = r562654 * r562655;
        double r562657 = r562653 + r562656;
        return r562657;
}

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