Average Error: 0.0 → 0.0
Time: 2.4s
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 r72966 = x;
        double r72967 = y;
        double r72968 = r72966 * r72967;
        double r72969 = r72968 + r72966;
        double r72970 = r72969 + r72967;
        return r72970;
}
↓
double f(double x, double y) {
        double r72971 = x;
        double r72972 = y;
        double r72973 = r72971 * r72972;
        double r72974 = r72973 + r72971;
        double r72975 = r72974 + r72972;
        return r72975;
}

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