Average Error: 0.0 → 0.0
Time: 1.7s
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 r407092 = x;
        double r407093 = 2.0;
        double r407094 = r407092 * r407093;
        double r407095 = r407092 * r407092;
        double r407096 = r407094 + r407095;
        double r407097 = y;
        double r407098 = r407097 * r407097;
        double r407099 = r407096 + r407098;
        return r407099;
}
↓
double f(double x, double y) {
        double r407100 = x;
        double r407101 = 2.0;
        double r407102 = r407100 * r407101;
        double r407103 = r407100 * r407100;
        double r407104 = r407102 + r407103;
        double r407105 = y;
        double r407106 = r407105 * r407105;
        double r407107 = r407104 + r407106;
        return r407107;
}

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 2020039 +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)))