Average Error: 0.0 → 0.0
Time: 876.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 r8306581 = x;
        double r8306582 = y;
        double r8306583 = r8306582 + r8306582;
        double r8306584 = r8306581 * r8306583;
        return r8306584;
}
↓
double f(double x, double y) {
        double r8306585 = x;
        double r8306586 = y;
        double r8306587 = r8306586 + r8306586;
        double r8306588 = r8306585 * r8306587;
        return r8306588;
}

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