Average Error: 0.0 → 0.0
Time: 24.1s
Precision: 64
\[\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + \left(2.0 + x\right) \cdot x\]
\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y
↓
y \cdot y + \left(2.0 + x\right) \cdot x
double f(double x, double y) {
        double r22440987 = x;
        double r22440988 = 2.0;
        double r22440989 = r22440987 * r22440988;
        double r22440990 = r22440987 * r22440987;
        double r22440991 = r22440989 + r22440990;
        double r22440992 = y;
        double r22440993 = r22440992 * r22440992;
        double r22440994 = r22440991 + r22440993;
        return r22440994;
}
↓
double f(double x, double y) {
        double r22440995 = y;
        double r22440996 = r22440995 * r22440995;
        double r22440997 = 2.0;
        double r22440998 = x;
        double r22440999 = r22440997 + r22440998;
        double r22441000 = r22440999 * r22440998;
        double r22441001 = r22440996 + r22441000;
        return r22441001;
}

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.0 \cdot x + x \cdot x\right)\]

Derivation

  1. Initial program 0.0

    \[\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y\]

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

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