Average Error: 0.0 → 0.0
Time: 419.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 r107176 = x;
        double r107177 = y;
        double r107178 = r107177 + r107177;
        double r107179 = r107176 * r107178;
        return r107179;
}
↓
double f(double x, double y) {
        double r107180 = x;
        double r107181 = y;
        double r107182 = r107181 + r107181;
        double r107183 = r107180 * r107182;
        return r107183;
}

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