Average Error: 0 → 0
Time: 605.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 r1481561 = x;
        double r1481562 = y;
        double r1481563 = r1481562 + r1481562;
        double r1481564 = r1481561 * r1481563;
        return r1481564;
}
↓
double f(double x, double y) {
        double r1481565 = x;
        double r1481566 = y;
        double r1481567 = r1481566 + r1481566;
        double r1481568 = r1481565 * r1481567;
        return r1481568;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2019156 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  (* x (+ y y)))