Average Error: 0.0 → 0.0
Time: 522.0ms
Precision: 64
\[x \cdot \left(y + y\right)\]
↓
\[x \cdot \left(y + y\right)\]
x \cdot \left(y + y\right)
↓
x \cdot \left(y + y\right)
double f(double x, double y) {
        double r100327 = x;
        double r100328 = y;
        double r100329 = r100328 + r100328;
        double r100330 = r100327 * r100329;
        return r100330;
}
↓
double f(double x, double y) {
        double r100331 = x;
        double r100332 = y;
        double r100333 = r100332 + r100332;
        double r100334 = r100331 * r100333;
        return r100334;
}

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

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020036 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))