Average Error: 0.0 → 0.0
Time: 333.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 r127014 = x;
        double r127015 = y;
        double r127016 = r127015 + r127015;
        double r127017 = r127014 * r127016;
        return r127017;
}
↓
double f(double x, double y) {
        double r127018 = x;
        double r127019 = y;
        double r127020 = r127019 + r127019;
        double r127021 = r127018 * r127020;
        return r127021;
}

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