Average Error: 0.0 → 0.0
Time: 1.1s
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 r554179 = x;
        double r554180 = 2.0;
        double r554181 = r554179 * r554180;
        double r554182 = r554179 * r554179;
        double r554183 = r554181 + r554182;
        double r554184 = y;
        double r554185 = r554184 * r554184;
        double r554186 = r554183 + r554185;
        return r554186;
}
↓
double f(double x, double y) {
        double r554187 = x;
        double r554188 = 2.0;
        double r554189 = r554187 * r554188;
        double r554190 = r554187 * r554187;
        double r554191 = r554189 + r554190;
        double r554192 = y;
        double r554193 = r554192 * r554192;
        double r554194 = r554191 + r554193;
        return r554194;
}

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 2020027 
(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)))