Average Error: 0.0 → 0.0
Time: 9.6s
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 r8059102 = x;
        double r8059103 = 2.0;
        double r8059104 = r8059102 * r8059103;
        double r8059105 = r8059102 * r8059102;
        double r8059106 = r8059104 + r8059105;
        double r8059107 = y;
        double r8059108 = r8059107 * r8059107;
        double r8059109 = r8059106 + r8059108;
        return r8059109;
}

double f(double x, double y) {
        double r8059110 = y;
        double r8059111 = r8059110 * r8059110;
        double r8059112 = 2.0;
        double r8059113 = x;
        double r8059114 = r8059112 + r8059113;
        double r8059115 = r8059114 * r8059113;
        double r8059116 = r8059111 + r8059115;
        return r8059116;
}

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