Average Error: 0.0 → 0.0
Time: 945.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 r3286352 = x;
        double r3286353 = y;
        double r3286354 = r3286353 + r3286353;
        double r3286355 = r3286352 * r3286354;
        return r3286355;
}
↓
double f(double x, double y) {
        double r3286356 = x;
        double r3286357 = y;
        double r3286358 = r3286357 + r3286357;
        double r3286359 = r3286356 * r3286358;
        return r3286359;
}

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