Average Error: 0.0 → 0.0
Time: 787.0ms
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
double f(double x, double y) {
        double r450422 = x;
        double r450423 = 2.0;
        double r450424 = r450422 * r450423;
        double r450425 = r450422 * r450422;
        double r450426 = r450424 + r450425;
        double r450427 = y;
        double r450428 = r450427 * r450427;
        double r450429 = r450426 + r450428;
        return r450429;
}
↓
double f(double x, double y) {
        double r450430 = x;
        double r450431 = 2.0;
        double r450432 = r450430 * r450431;
        double r450433 = r450430 * r450430;
        double r450434 = r450432 + r450433;
        double r450435 = y;
        double r450436 = r450435 * r450435;
        double r450437 = r450434 + r450436;
        return r450437;
}

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

Reproduce

herbie shell --seed 2020056 +o rules:numerics
(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)))