Average Error: 0.0 → 0.0
Time: 796.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 r5594696 = x;
        double r5594697 = y;
        double r5594698 = r5594697 + r5594697;
        double r5594699 = r5594696 * r5594698;
        return r5594699;
}
↓
double f(double x, double y) {
        double r5594700 = x;
        double r5594701 = y;
        double r5594702 = r5594701 + r5594701;
        double r5594703 = r5594700 * r5594702;
        return r5594703;
}

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