Average Error: 0.0 → 0.0
Time: 11.7s
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 r449080 = x;
        double r449081 = 2.0;
        double r449082 = r449080 * r449081;
        double r449083 = r449080 * r449080;
        double r449084 = r449082 + r449083;
        double r449085 = y;
        double r449086 = r449085 * r449085;
        double r449087 = r449084 + r449086;
        return r449087;
}
↓
double f(double x, double y) {
        double r449088 = y;
        double r449089 = r449088 * r449088;
        double r449090 = 2.0;
        double r449091 = x;
        double r449092 = r449090 + r449091;
        double r449093 = r449092 * r449091;
        double r449094 = r449089 + r449093;
        return r449094;
}

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