Average Error: 0.0 → 0.0
Time: 779.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 r93329 = x;
        double r93330 = y;
        double r93331 = r93330 + r93330;
        double r93332 = r93329 * r93331;
        return r93332;
}
↓
double f(double x, double y) {
        double r93333 = x;
        double r93334 = y;
        double r93335 = r93334 + r93334;
        double r93336 = r93333 * r93335;
        return r93336;
}

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