Average Error: 0.0 → 0.0
Time: 1.0s
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 r93474 = x;
        double r93475 = y;
        double r93476 = r93475 + r93475;
        double r93477 = r93474 * r93476;
        return r93477;
}
↓
double f(double x, double y) {
        double r93478 = x;
        double r93479 = y;
        double r93480 = r93479 + r93479;
        double r93481 = r93478 * r93480;
        return r93481;
}

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