Average Error: 0.0 → 0.0
Time: 1.9s
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 r5701831 = x;
        double r5701832 = y;
        double r5701833 = r5701832 + r5701832;
        double r5701834 = r5701831 * r5701833;
        return r5701834;
}
↓
double f(double x, double y) {
        double r5701835 = x;
        double r5701836 = y;
        double r5701837 = r5701836 + r5701836;
        double r5701838 = r5701835 * r5701837;
        return r5701838;
}

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)))