Average Error: 0.0 → 0.0
Time: 11.3s
Precision: 64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + \left(2 + x\right) \cdot x\]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
y \cdot y + \left(2 + x\right) \cdot x
double f(double x, double y) {
        double r21561640 = x;
        double r21561641 = 2.0;
        double r21561642 = r21561640 * r21561641;
        double r21561643 = r21561640 * r21561640;
        double r21561644 = r21561642 + r21561643;
        double r21561645 = y;
        double r21561646 = r21561645 * r21561645;
        double r21561647 = r21561644 + r21561646;
        return r21561647;
}
↓
double f(double x, double y) {
        double r21561648 = y;
        double r21561649 = r21561648 * r21561648;
        double r21561650 = 2.0;
        double r21561651 = x;
        double r21561652 = r21561650 + r21561651;
        double r21561653 = r21561652 * r21561651;
        double r21561654 = r21561649 + r21561653;
        return r21561654;
}

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. Simplified0.0

    \[\leadsto \color{blue}{y \cdot y + x \cdot \left(2 + x\right)}\]

  3. Final simplification0.0

    \[\leadsto y \cdot y + \left(2 + x\right) \cdot x\]

Reproduce

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