Average Error: 0.0 → 0.0
Time: 592.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 r87233 = x;
        double r87234 = y;
        double r87235 = r87234 + r87234;
        double r87236 = r87233 * r87235;
        return r87236;
}
↓
double f(double x, double y) {
        double r87237 = x;
        double r87238 = y;
        double r87239 = r87238 + r87238;
        double r87240 = r87237 * r87239;
        return r87240;
}

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 2019352 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))