Average Error: 0.0 → 0.0
Time: 7.1s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
double f(double x, double y) {
        double r594495 = x;
        double r594496 = 2.0;
        double r594497 = r594495 * r594496;
        double r594498 = r594495 * r594495;
        double r594499 = r594497 + r594498;
        double r594500 = y;
        double r594501 = r594500 * r594500;
        double r594502 = r594499 + r594501;
        return r594502;
}
↓
double f(double x, double y) {
        double r594503 = x;
        double r594504 = 2.0;
        double r594505 = r594503 * r594504;
        double r594506 = r594503 * r594503;
        double r594507 = r594505 + r594506;
        double r594508 = y;
        double r594509 = r594508 * r594508;
        double r594510 = r594507 + r594509;
        return r594510;
}

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
\[y \cdot y + \left(2 \cdot x + x \cdot x\right)\]

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020045 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

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

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