Average Error: 0.0 → 0.0
Time: 7.9s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + x \cdot \left(2 + x\right)\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
y \cdot y + x \cdot \left(2 + x\right)
double f(double x, double y) {
        double r1624299 = x;
        double r1624300 = 2.0;
        double r1624301 = r1624299 * r1624300;
        double r1624302 = r1624299 * r1624299;
        double r1624303 = r1624301 + r1624302;
        double r1624304 = y;
        double r1624305 = r1624304 * r1624304;
        double r1624306 = r1624303 + r1624305;
        return r1624306;
}
↓
double f(double x, double y) {
        double r1624307 = y;
        double r1624308 = r1624307 * r1624307;
        double r1624309 = x;
        double r1624310 = 2.0;
        double r1624311 = r1624310 + r1624309;
        double r1624312 = r1624309 * r1624311;
        double r1624313 = r1624308 + r1624312;
        return r1624313;
}

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. Simplified0.0

    \[\leadsto \color{blue}{y \cdot y + x \cdot \left(2 + x\right)}\]

  3. Final simplification0.0

    \[\leadsto y \cdot y + x \cdot \left(2 + x\right)\]

Reproduce

herbie shell --seed 2019235 
(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)))