Average Error: 0.0 → 0.0
Time: 7.4s
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[y + \left(x + x \cdot y\right)\]
\left(x \cdot y + x\right) + y
↓
y + \left(x + x \cdot y\right)
double f(double x, double y) {
        double r96069 = x;
        double r96070 = y;
        double r96071 = r96069 * r96070;
        double r96072 = r96071 + r96069;
        double r96073 = r96072 + r96070;
        return r96073;
}
↓
double f(double x, double y) {
        double r96074 = y;
        double r96075 = x;
        double r96076 = r96075 * r96074;
        double r96077 = r96075 + r96076;
        double r96078 = r96074 + r96077;
        return r96078;
}

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 y + \left(x + x \cdot y\right)\]

Reproduce

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