Average Error: 0.0 → 0.0
Time: 7.3s
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[\left(x + y \cdot x\right) + y\]
\left(x \cdot y + x\right) + y
↓
\left(x + y \cdot x\right) + y
double f(double x, double y) {
        double r80748 = x;
        double r80749 = y;
        double r80750 = r80748 * r80749;
        double r80751 = r80750 + r80748;
        double r80752 = r80751 + r80749;
        return r80752;
}
↓
double f(double x, double y) {
        double r80753 = x;
        double r80754 = y;
        double r80755 = r80754 * r80753;
        double r80756 = r80753 + r80755;
        double r80757 = r80756 + r80754;
        return r80757;
}

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. Simplified0.0

    \[\leadsto \color{blue}{y + \left(x + x \cdot y\right)}\]

  3. Final simplification0.0

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

Reproduce

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