Average Error: 0.0 → 0.0
Time: 21.2s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + \left(2 \cdot x + x \cdot x\right)\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
y \cdot y + \left(2 \cdot x + x \cdot x\right)
double f(double x, double y) {
        double r20605557 = x;
        double r20605558 = 2.0;
        double r20605559 = r20605557 * r20605558;
        double r20605560 = r20605557 * r20605557;
        double r20605561 = r20605559 + r20605560;
        double r20605562 = y;
        double r20605563 = r20605562 * r20605562;
        double r20605564 = r20605561 + r20605563;
        return r20605564;
}
↓
double f(double x, double y) {
        double r20605565 = y;
        double r20605566 = r20605565 * r20605565;
        double r20605567 = 2.0;
        double r20605568 = x;
        double r20605569 = r20605567 * r20605568;
        double r20605570 = r20605568 * r20605568;
        double r20605571 = r20605569 + r20605570;
        double r20605572 = r20605566 + r20605571;
        return r20605572;
}

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. Final simplification0.0

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

Reproduce

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