Average Error: 0.0 → 0.0
Time: 366.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 r92261 = x;
        double r92262 = y;
        double r92263 = r92262 + r92262;
        double r92264 = r92261 * r92263;
        return r92264;
}
↓
double f(double x, double y) {
        double r92265 = x;
        double r92266 = y;
        double r92267 = r92266 + r92266;
        double r92268 = r92265 * r92267;
        return r92268;
}

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