Average Error: 0.0 → 0.0
Time: 2.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 r714266 = x;
        double r714267 = 2.0;
        double r714268 = r714266 * r714267;
        double r714269 = r714266 * r714266;
        double r714270 = r714268 + r714269;
        double r714271 = y;
        double r714272 = r714271 * r714271;
        double r714273 = r714270 + r714272;
        return r714273;
}
↓
double f(double x, double y) {
        double r714274 = x;
        double r714275 = 2.0;
        double r714276 = r714274 * r714275;
        double r714277 = r714274 * r714274;
        double r714278 = r714276 + r714277;
        double r714279 = y;
        double r714280 = r714279 * r714279;
        double r714281 = r714278 + r714280;
        return r714281;
}

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