Average Error: 0.0 → 0.0
Time: 2.8s
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 r20090931 = x;
        double r20090932 = 2.0;
        double r20090933 = r20090931 * r20090932;
        double r20090934 = r20090931 * r20090931;
        double r20090935 = r20090933 + r20090934;
        double r20090936 = y;
        double r20090937 = r20090936 * r20090936;
        double r20090938 = r20090935 + r20090937;
        return r20090938;
}

double f(double x, double y) {
        double r20090939 = y;
        double r20090940 = r20090939 * r20090939;
        double r20090941 = 2.0;
        double r20090942 = x;
        double r20090943 = r20090941 + r20090942;
        double r20090944 = r20090943 * r20090942;
        double r20090945 = r20090940 + r20090944;
        return r20090945;
}

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