Average Error: 0.0 → 0.0
Time: 11.4s
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 r304883 = x;
        double r304884 = 2.0;
        double r304885 = r304883 * r304884;
        double r304886 = r304883 * r304883;
        double r304887 = r304885 + r304886;
        double r304888 = y;
        double r304889 = r304888 * r304888;
        double r304890 = r304887 + r304889;
        return r304890;
}
↓
double f(double x, double y) {
        double r304891 = y;
        double r304892 = r304891 * r304891;
        double r304893 = 2.0;
        double r304894 = x;
        double r304895 = r304893 + r304894;
        double r304896 = r304895 * r304894;
        double r304897 = r304892 + r304896;
        return r304897;
}

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