Average Error: 0.0 → 0.0
Time: 550.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 r130972 = x;
        double r130973 = y;
        double r130974 = r130973 + r130973;
        double r130975 = r130972 * r130974;
        return r130975;
}
↓
double f(double x, double y) {
        double r130976 = x;
        double r130977 = y;
        double r130978 = r130977 + r130977;
        double r130979 = r130976 * r130978;
        return r130979;
}

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