Average Error: 0.0 → 0.0
Time: 756.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 r5809677 = x;
        double r5809678 = y;
        double r5809679 = r5809678 + r5809678;
        double r5809680 = r5809677 * r5809679;
        return r5809680;
}
↓
double f(double x, double y) {
        double r5809681 = x;
        double r5809682 = y;
        double r5809683 = r5809682 + r5809682;
        double r5809684 = r5809681 * r5809683;
        return r5809684;
}

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