Average Error: 0.0 → 0.0
Time: 6.3s
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 r575815 = x;
        double r575816 = 2.0;
        double r575817 = r575815 * r575816;
        double r575818 = r575815 * r575815;
        double r575819 = r575817 + r575818;
        double r575820 = y;
        double r575821 = r575820 * r575820;
        double r575822 = r575819 + r575821;
        return r575822;
}
↓
double f(double x, double y) {
        double r575823 = x;
        double r575824 = 2.0;
        double r575825 = r575823 * r575824;
        double r575826 = r575823 * r575823;
        double r575827 = r575825 + r575826;
        double r575828 = y;
        double r575829 = r575828 * r575828;
        double r575830 = r575827 + r575829;
        return r575830;
}

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