Average Error: 0.0 → 0.0
Time: 829.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 r93075 = x;
        double r93076 = y;
        double r93077 = r93076 + r93076;
        double r93078 = r93075 * r93077;
        return r93078;
}
↓
double f(double x, double y) {
        double r93079 = x;
        double r93080 = y;
        double r93081 = r93080 + r93080;
        double r93082 = r93079 * r93081;
        return r93082;
}

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