Average Error: 0.0 → 0.0
Time: 2.7s
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 r367548 = x;
        double r367549 = 2.0;
        double r367550 = r367548 * r367549;
        double r367551 = r367548 * r367548;
        double r367552 = r367550 + r367551;
        double r367553 = y;
        double r367554 = r367553 * r367553;
        double r367555 = r367552 + r367554;
        return r367555;
}
↓
double f(double x, double y) {
        double r367556 = x;
        double r367557 = 2.0;
        double r367558 = r367556 * r367557;
        double r367559 = r367556 * r367556;
        double r367560 = r367558 + r367559;
        double r367561 = y;
        double r367562 = r367561 * r367561;
        double r367563 = r367560 + r367562;
        return r367563;
}

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