Average Error: 0.0 → 0.0
Time: 15.3s
Precision: 64
\[\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + \left(x \cdot x + x \cdot 2.0\right)\]
\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y
↓
y \cdot y + \left(x \cdot x + x \cdot 2.0\right)
double f(double x, double y) {
        double r22925529 = x;
        double r22925530 = 2.0;
        double r22925531 = r22925529 * r22925530;
        double r22925532 = r22925529 * r22925529;
        double r22925533 = r22925531 + r22925532;
        double r22925534 = y;
        double r22925535 = r22925534 * r22925534;
        double r22925536 = r22925533 + r22925535;
        return r22925536;
}
↓
double f(double x, double y) {
        double r22925537 = y;
        double r22925538 = r22925537 * r22925537;
        double r22925539 = x;
        double r22925540 = r22925539 * r22925539;
        double r22925541 = 2.0;
        double r22925542 = r22925539 * r22925541;
        double r22925543 = r22925540 + r22925542;
        double r22925544 = r22925538 + r22925543;
        return r22925544;
}

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

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

Reproduce

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