Average Error: 0.0 → 0.0
Time: 6.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 r3207790 = x;
        double r3207791 = y;
        double r3207792 = r3207790 * r3207791;
        double r3207793 = r3207792 + r3207790;
        double r3207794 = r3207793 + r3207791;
        return r3207794;
}
↓
double f(double x, double y) {
        double r3207795 = y;
        double r3207796 = x;
        double r3207797 = r3207796 * r3207795;
        double r3207798 = r3207796 + r3207797;
        double r3207799 = r3207795 + r3207798;
        return r3207799;
}

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