Average Error: 0.1 → 0.1
Time: 17.9s
Precision: 64
\[\left(\left(x \cdot x + y \cdot y\right) + y \cdot y\right) + y \cdot y\]
↓
\[x \cdot x + \left(3 \cdot y\right) \cdot y\]
\left(\left(x \cdot x + y \cdot y\right) + y \cdot y\right) + y \cdot y
↓
x \cdot x + \left(3 \cdot y\right) \cdot y
double f(double x, double y) {
        double r350302 = x;
        double r350303 = r350302 * r350302;
        double r350304 = y;
        double r350305 = r350304 * r350304;
        double r350306 = r350303 + r350305;
        double r350307 = r350306 + r350305;
        double r350308 = r350307 + r350305;
        return r350308;
}
↓
double f(double x, double y) {
        double r350309 = x;
        double r350310 = r350309 * r350309;
        double r350311 = 3.0;
        double r350312 = y;
        double r350313 = r350311 * r350312;
        double r350314 = r350313 * r350312;
        double r350315 = r350310 + r350314;
        return r350315;
}

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.1
Target0.1
Herbie0.1
\[x \cdot x + y \cdot \left(y + \left(y + y\right)\right)\]

Derivation

  1. Initial program 0.1

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

  2. Simplified0.1

    \[\leadsto \color{blue}{x \cdot x + 3 \cdot \left(y \cdot y\right)}\]
  3. Using strategy rm

  4. Applied associate-*r*0.1

    \[\leadsto x \cdot x + \color{blue}{\left(3 \cdot y\right) \cdot y}\]

  5. Final simplification0.1

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

Reproduce

herbie shell --seed 2019303 
(FPCore (x y)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, E"
  :precision binary64

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

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