Average Error: 0.0 → 0.0
Time: 3.1s
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 r395320 = x;
        double r395321 = 2.0;
        double r395322 = r395320 * r395321;
        double r395323 = r395320 * r395320;
        double r395324 = r395322 + r395323;
        double r395325 = y;
        double r395326 = r395325 * r395325;
        double r395327 = r395324 + r395326;
        return r395327;
}
↓
double f(double x, double y) {
        double r395328 = y;
        double r395329 = r395328 * r395328;
        double r395330 = x;
        double r395331 = 2.0;
        double r395332 = r395331 + r395330;
        double r395333 = r395330 * r395332;
        double r395334 = r395329 + r395333;
        return r395334;
}

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