Average Error: 0.0 → 0.0
Time: 6.5s
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 r499451 = x;
        double r499452 = 2.0;
        double r499453 = r499451 * r499452;
        double r499454 = r499451 * r499451;
        double r499455 = r499453 + r499454;
        double r499456 = y;
        double r499457 = r499456 * r499456;
        double r499458 = r499455 + r499457;
        return r499458;
}
↓
double f(double x, double y) {
        double r499459 = x;
        double r499460 = 2.0;
        double r499461 = r499459 * r499460;
        double r499462 = r499459 * r499459;
        double r499463 = r499461 + r499462;
        double r499464 = y;
        double r499465 = r499464 * r499464;
        double r499466 = r499463 + r499465;
        return r499466;
}

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