Average Error: 0.0 → 0.0
Time: 8.6s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[x \cdot \left(2 + x\right) + y \cdot y\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
x \cdot \left(2 + x\right) + y \cdot y
double f(double x, double y) {
        double r638910 = x;
        double r638911 = 2.0;
        double r638912 = r638910 * r638911;
        double r638913 = r638910 * r638910;
        double r638914 = r638912 + r638913;
        double r638915 = y;
        double r638916 = r638915 * r638915;
        double r638917 = r638914 + r638916;
        return r638917;
}
↓
double f(double x, double y) {
        double r638918 = x;
        double r638919 = 2.0;
        double r638920 = r638919 + r638918;
        double r638921 = r638918 * r638920;
        double r638922 = y;
        double r638923 = r638922 * r638922;
        double r638924 = r638921 + r638923;
        return r638924;
}

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. Using strategy rm

  3. Applied distribute-lft-out0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2020047 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

  :herbie-target
  (+ (* y y) (+ (* 2 x) (* x x)))

  (+ (+ (* x 2) (* x x)) (* y y)))