Average Error: 0.0 → 0.0
Time: 828.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 r65988 = x;
        double r65989 = y;
        double r65990 = r65989 + r65989;
        double r65991 = r65988 * r65990;
        return r65991;
}
↓
double f(double x, double y) {
        double r65992 = x;
        double r65993 = y;
        double r65994 = r65993 + r65993;
        double r65995 = r65992 * r65994;
        return r65995;
}

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