Average Error: 0.0 → 0.0
Time: 4.1s
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 r288236 = x;
        double r288237 = 2.0;
        double r288238 = r288236 * r288237;
        double r288239 = r288236 * r288236;
        double r288240 = r288238 + r288239;
        double r288241 = y;
        double r288242 = r288241 * r288241;
        double r288243 = r288240 + r288242;
        return r288243;
}
↓
double f(double x, double y) {
        double r288244 = y;
        double r288245 = r288244 * r288244;
        double r288246 = x;
        double r288247 = 2.0;
        double r288248 = r288247 + r288246;
        double r288249 = r288246 * r288248;
        double r288250 = r288245 + r288249;
        return r288250;
}

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