Average Error: 0.0 → 0.0
Time: 5.3s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + \left(2 + x\right) \cdot x\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
y \cdot y + \left(2 + x\right) \cdot x
double f(double x, double y) {
        double r18749603 = x;
        double r18749604 = 2.0;
        double r18749605 = r18749603 * r18749604;
        double r18749606 = r18749603 * r18749603;
        double r18749607 = r18749605 + r18749606;
        double r18749608 = y;
        double r18749609 = r18749608 * r18749608;
        double r18749610 = r18749607 + r18749609;
        return r18749610;
}
↓
double f(double x, double y) {
        double r18749611 = y;
        double r18749612 = r18749611 * r18749611;
        double r18749613 = 2.0;
        double r18749614 = x;
        double r18749615 = r18749613 + r18749614;
        double r18749616 = r18749615 * r18749614;
        double r18749617 = r18749612 + r18749616;
        return r18749617;
}

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 + \left(2 + x\right) \cdot x\]

Reproduce

herbie shell --seed 2019169 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"

  :herbie-target
  (+ (* y y) (+ (* 2.0 x) (* x x)))

  (+ (+ (* x 2.0) (* x x)) (* y y)))