Average Error: 0.0 → 0.0
Time: 2.1s
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 r127137 = x;
        double r127138 = y;
        double r127139 = r127137 * r127138;
        double r127140 = r127139 + r127137;
        double r127141 = r127140 + r127138;
        return r127141;
}
↓
double f(double x, double y) {
        double r127142 = x;
        double r127143 = y;
        double r127144 = r127142 * r127143;
        double r127145 = r127144 + r127142;
        double r127146 = r127145 + r127143;
        return r127146;
}

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