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 r117625 = x;
        double r117626 = y;
        double r117627 = r117626 + r117626;
        double r117628 = r117625 * r117627;
        return r117628;
}
↓
double f(double x, double y) {
        double r117629 = x;
        double r117630 = y;
        double r117631 = r117630 + r117630;
        double r117632 = r117629 * r117631;
        return r117632;
}

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