Average Error: 0.0 → 0.0
Time: 8.9s
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 r63777 = x;
        double r63778 = y;
        double r63779 = r63777 * r63778;
        double r63780 = r63779 + r63777;
        double r63781 = r63780 + r63778;
        return r63781;
}
↓
double f(double x, double y) {
        double r63782 = x;
        double r63783 = y;
        double r63784 = r63782 * r63783;
        double r63785 = r63784 + r63782;
        double r63786 = r63785 + r63783;
        return r63786;
}

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 2019298 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  :precision binary64
  (+ (+ (* x y) x) y))