Average Error: 0.0 → 0.0
Time: 354.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 r145990 = x;
        double r145991 = y;
        double r145992 = r145991 + r145991;
        double r145993 = r145990 * r145992;
        return r145993;
}
↓
double f(double x, double y) {
        double r145994 = x;
        double r145995 = y;
        double r145996 = r145995 + r145995;
        double r145997 = r145994 * r145996;
        return r145997;
}

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