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 r333497 = x;
        double r333498 = 2.0;
        double r333499 = r333497 * r333498;
        double r333500 = r333497 * r333497;
        double r333501 = r333499 + r333500;
        double r333502 = y;
        double r333503 = r333502 * r333502;
        double r333504 = r333501 + r333503;
        return r333504;
}
↓
double f(double x, double y) {
        double r333505 = x;
        double r333506 = 2.0;
        double r333507 = r333505 * r333506;
        double r333508 = r333505 * r333505;
        double r333509 = r333507 + r333508;
        double r333510 = y;
        double r333511 = r333510 * r333510;
        double r333512 = r333509 + r333511;
        return r333512;
}

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