Average Error: 0.0 → 0.0
Time: 21.6s
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 r34524069 = x;
        double r34524070 = 2.0;
        double r34524071 = r34524069 * r34524070;
        double r34524072 = r34524069 * r34524069;
        double r34524073 = r34524071 + r34524072;
        double r34524074 = y;
        double r34524075 = r34524074 * r34524074;
        double r34524076 = r34524073 + r34524075;
        return r34524076;
}
↓
double f(double x, double y) {
        double r34524077 = y;
        double r34524078 = r34524077 * r34524077;
        double r34524079 = x;
        double r34524080 = r34524079 * r34524079;
        double r34524081 = 2.0;
        double r34524082 = r34524079 * r34524081;
        double r34524083 = r34524080 + r34524082;
        double r34524084 = r34524078 + r34524083;
        return r34524084;
}

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