Average Error: 0.0 → 0.0
Time: 6.8s
Precision: 64
\[\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + \left(2.0 + x\right) \cdot x\]
\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y
↓
y \cdot y + \left(2.0 + x\right) \cdot x
double f(double x, double y) {
        double r25959346 = x;
        double r25959347 = 2.0;
        double r25959348 = r25959346 * r25959347;
        double r25959349 = r25959346 * r25959346;
        double r25959350 = r25959348 + r25959349;
        double r25959351 = y;
        double r25959352 = r25959351 * r25959351;
        double r25959353 = r25959350 + r25959352;
        return r25959353;
}
↓
double f(double x, double y) {
        double r25959354 = y;
        double r25959355 = r25959354 * r25959354;
        double r25959356 = 2.0;
        double r25959357 = x;
        double r25959358 = r25959356 + r25959357;
        double r25959359 = r25959358 * r25959357;
        double r25959360 = r25959355 + r25959359;
        return r25959360;
}

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.0 \cdot x + x \cdot x\right)\]

Derivation

  1. Initial program 0.0

    \[\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y\]

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

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