Average Error: 0.0 → 0.0
Time: 629.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 r85789 = x;
        double r85790 = y;
        double r85791 = r85790 + r85790;
        double r85792 = r85789 * r85791;
        return r85792;
}
↓
double f(double x, double y) {
        double r85793 = x;
        double r85794 = y;
        double r85795 = r85794 + r85794;
        double r85796 = r85793 * r85795;
        return r85796;
}

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