Average Error: 0.0 → 0.0
Time: 350.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 r119294 = x;
        double r119295 = y;
        double r119296 = r119295 + r119295;
        double r119297 = r119294 * r119296;
        return r119297;
}
↓
double f(double x, double y) {
        double r119298 = x;
        double r119299 = y;
        double r119300 = r119299 + r119299;
        double r119301 = r119298 * r119300;
        return r119301;
}

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