Average Error: 0.0 → 0.0
Time: 14.2s
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 r440446 = x;
        double r440447 = 2.0;
        double r440448 = r440446 * r440447;
        double r440449 = r440446 * r440446;
        double r440450 = r440448 + r440449;
        double r440451 = y;
        double r440452 = r440451 * r440451;
        double r440453 = r440450 + r440452;
        return r440453;
}
↓
double f(double x, double y) {
        double r440454 = x;
        double r440455 = 2.0;
        double r440456 = r440454 * r440455;
        double r440457 = r440454 * r440454;
        double r440458 = r440456 + r440457;
        double r440459 = y;
        double r440460 = r440459 * r440459;
        double r440461 = r440458 + r440460;
        return r440461;
}

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