Average Error: 0.0 → 0.0
Time: 348.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 r135600 = x;
        double r135601 = y;
        double r135602 = r135601 + r135601;
        double r135603 = r135600 * r135602;
        return r135603;
}
↓
double f(double x, double y) {
        double r135604 = x;
        double r135605 = y;
        double r135606 = r135605 + r135605;
        double r135607 = r135604 * r135606;
        return r135607;
}

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