Average Error: 0.0 → 0.0
Time: 741.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 r18731 = x;
        double r18732 = y;
        double r18733 = r18732 + r18732;
        double r18734 = r18731 * r18733;
        return r18734;
}
↓
double f(double x, double y) {
        double r18735 = x;
        double r18736 = y;
        double r18737 = r18736 + r18736;
        double r18738 = r18735 * r18737;
        return r18738;
}

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