Average Error: 0.0 → 0.0
Time: 8.8s
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 r8140200 = x;
        double r8140201 = 2.0;
        double r8140202 = r8140200 * r8140201;
        double r8140203 = r8140200 * r8140200;
        double r8140204 = r8140202 + r8140203;
        double r8140205 = y;
        double r8140206 = r8140205 * r8140205;
        double r8140207 = r8140204 + r8140206;
        return r8140207;
}
↓
double f(double x, double y) {
        double r8140208 = y;
        double r8140209 = r8140208 * r8140208;
        double r8140210 = x;
        double r8140211 = r8140210 * r8140210;
        double r8140212 = 2.0;
        double r8140213 = r8140210 * r8140212;
        double r8140214 = r8140211 + r8140213;
        double r8140215 = r8140209 + r8140214;
        return r8140215;
}

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