Average Error: 0.0 → 0.0
Time: 852.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 r5113853 = x;
        double r5113854 = y;
        double r5113855 = r5113854 + r5113854;
        double r5113856 = r5113853 * r5113855;
        return r5113856;
}
↓
double f(double x, double y) {
        double r5113857 = x;
        double r5113858 = y;
        double r5113859 = r5113858 + r5113858;
        double r5113860 = r5113857 * r5113859;
        return r5113860;
}

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