Average Error: 0 → 0
Time: 453.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 r191321 = x;
        double r191322 = y;
        double r191323 = r191322 + r191322;
        double r191324 = r191321 * r191323;
        return r191324;
}
↓
double f(double x, double y) {
        double r191325 = x;
        double r191326 = y;
        double r191327 = r191326 + r191326;
        double r191328 = r191325 * r191327;
        return r191328;
}

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

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

  2. Final simplification0

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

Reproduce

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