Average Error: 0.0 → 0.0
Time: 784.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 r105665 = x;
        double r105666 = y;
        double r105667 = r105666 + r105666;
        double r105668 = r105665 * r105667;
        return r105668;
}
↓
double f(double x, double y) {
        double r105669 = x;
        double r105670 = y;
        double r105671 = r105670 + r105670;
        double r105672 = r105669 * r105671;
        return r105672;
}

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