Average Error: 0.0 → 0.0
Time: 6.1s
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 r590024 = x;
        double r590025 = r590024 * r590024;
        double r590026 = y;
        double r590027 = r590025 + r590026;
        double r590028 = r590027 + r590026;
        return r590028;
}
↓
double f(double x, double y) {
        double r590029 = x;
        double r590030 = r590029 * r590029;
        double r590031 = 2.0;
        double r590032 = y;
        double r590033 = r590031 * r590032;
        double r590034 = r590030 + r590033;
        return r590034;
}

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