Average Error: 0.0 → 0.0
Time: 356.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 r105261 = x;
        double r105262 = y;
        double r105263 = r105262 + r105262;
        double r105264 = r105261 * r105263;
        return r105264;
}
↓
double f(double x, double y) {
        double r105265 = x;
        double r105266 = y;
        double r105267 = r105266 + r105266;
        double r105268 = r105265 * r105267;
        return r105268;
}

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