Average Error: 0 → 0
Time: 350.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 r108151 = x;
        double r108152 = y;
        double r108153 = r108152 + r108152;
        double r108154 = r108151 * r108153;
        return r108154;
}
↓
double f(double x, double y) {
        double r108155 = x;
        double r108156 = y;
        double r108157 = r108156 + r108156;
        double r108158 = r108155 * r108157;
        return r108158;
}

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