Average Error: 0.0 → 0.0
Time: 467.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 r119940 = x;
        double r119941 = y;
        double r119942 = r119941 + r119941;
        double r119943 = r119940 * r119942;
        return r119943;
}
↓
double f(double x, double y) {
        double r119944 = x;
        double r119945 = y;
        double r119946 = r119945 + r119945;
        double r119947 = r119944 * r119946;
        return r119947;
}

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