Average Error: 0 → 0
Time: 357.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 r119791 = x;
        double r119792 = y;
        double r119793 = r119792 + r119792;
        double r119794 = r119791 * r119793;
        return r119794;
}
↓
double f(double x, double y) {
        double r119795 = x;
        double r119796 = y;
        double r119797 = r119796 + r119796;
        double r119798 = r119795 * r119797;
        return r119798;
}

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