Average Error: 0.0 → 0.0
Time: 686.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 r91716 = x;
        double r91717 = y;
        double r91718 = r91717 + r91717;
        double r91719 = r91716 * r91718;
        return r91719;
}
↓
double f(double x, double y) {
        double r91720 = x;
        double r91721 = y;
        double r91722 = r91721 + r91721;
        double r91723 = r91720 * r91722;
        return r91723;
}

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