Average Error: 0.0 → 0.0
Time: 29.0s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + \left(x \cdot x + x \cdot 2\right)\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
y \cdot y + \left(x \cdot x + x \cdot 2\right)
double f(double x, double y) {
        double r24062188 = x;
        double r24062189 = 2.0;
        double r24062190 = r24062188 * r24062189;
        double r24062191 = r24062188 * r24062188;
        double r24062192 = r24062190 + r24062191;
        double r24062193 = y;
        double r24062194 = r24062193 * r24062193;
        double r24062195 = r24062192 + r24062194;
        return r24062195;
}
↓
double f(double x, double y) {
        double r24062196 = y;
        double r24062197 = r24062196 * r24062196;
        double r24062198 = x;
        double r24062199 = r24062198 * r24062198;
        double r24062200 = 2.0;
        double r24062201 = r24062198 * r24062200;
        double r24062202 = r24062199 + r24062201;
        double r24062203 = r24062197 + r24062202;
        return r24062203;
}

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

Reproduce

herbie shell --seed 2019168 
(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)))