Average Error: 0.0 → 0.0
Time: 17.1s
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[\left(x \cdot y + x\right) + y\]
\left(x \cdot y + x\right) + y
↓
\left(x \cdot y + x\right) + y
double f(double x, double y) {
        double r13578823 = x;
        double r13578824 = y;
        double r13578825 = r13578823 * r13578824;
        double r13578826 = r13578825 + r13578823;
        double r13578827 = r13578826 + r13578824;
        return r13578827;
}
↓
double f(double x, double y) {
        double r13578828 = x;
        double r13578829 = y;
        double r13578830 = r13578828 * r13578829;
        double r13578831 = r13578830 + r13578828;
        double r13578832 = r13578831 + r13578829;
        return r13578832;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019173 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  (+ (+ (* x y) x) y))