Average Error: 0.0 → 0.0
Time: 385.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 r119498 = x;
        double r119499 = y;
        double r119500 = r119499 + r119499;
        double r119501 = r119498 * r119500;
        return r119501;
}
↓
double f(double x, double y) {
        double r119502 = x;
        double r119503 = y;
        double r119504 = r119503 + r119503;
        double r119505 = r119502 * r119504;
        return r119505;
}

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