Average Error: 0.0 → 0.0
Time: 355.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 r138313 = x;
        double r138314 = y;
        double r138315 = r138314 + r138314;
        double r138316 = r138313 * r138315;
        return r138316;
}
↓
double f(double x, double y) {
        double r138317 = x;
        double r138318 = y;
        double r138319 = r138318 + r138318;
        double r138320 = r138317 * r138319;
        return r138320;
}

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