Average Error: 0.0 → 0.0
Time: 1.5s
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 r4185989 = x;
        double r4185990 = y;
        double r4185991 = r4185990 + r4185990;
        double r4185992 = r4185989 * r4185991;
        return r4185992;
}
↓
double f(double x, double y) {
        double r4185993 = x;
        double r4185994 = y;
        double r4185995 = r4185994 + r4185994;
        double r4185996 = r4185993 * r4185995;
        return r4185996;
}

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