Average Error: 0 → 0
Time: 4.6s
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 r5525307 = x;
        double r5525308 = y;
        double r5525309 = r5525308 + r5525308;
        double r5525310 = r5525307 * r5525309;
        return r5525310;
}
↓
double f(double x, double y) {
        double r5525311 = x;
        double r5525312 = y;
        double r5525313 = r5525312 + r5525312;
        double r5525314 = r5525311 * r5525313;
        return r5525314;
}

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