Average Error: 0 → 0
Time: 898.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 r102309 = x;
        double r102310 = y;
        double r102311 = r102310 + r102310;
        double r102312 = r102309 * r102311;
        return r102312;
}
↓
double f(double x, double y) {
        double r102313 = x;
        double r102314 = y;
        double r102315 = r102314 + r102314;
        double r102316 = r102313 * r102315;
        return r102316;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2019194 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  (* x (+ y y)))