Average Error: 0.0 → 0.0
Time: 10.3s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + x \cdot \left(2 + x\right)\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
y \cdot y + x \cdot \left(2 + x\right)
double f(double x, double y) {
        double r279995 = x;
        double r279996 = 2.0;
        double r279997 = r279995 * r279996;
        double r279998 = r279995 * r279995;
        double r279999 = r279997 + r279998;
        double r280000 = y;
        double r280001 = r280000 * r280000;
        double r280002 = r279999 + r280001;
        return r280002;
}
↓
double f(double x, double y) {
        double r280003 = y;
        double r280004 = r280003 * r280003;
        double r280005 = x;
        double r280006 = 2.0;
        double r280007 = r280006 + r280005;
        double r280008 = r280005 * r280007;
        double r280009 = r280004 + r280008;
        return r280009;
}

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 + x \cdot \left(2 + x\right)\]

Reproduce

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