Average Error: 0.0 → 0.0
Time: 382.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 r93070 = x;
        double r93071 = y;
        double r93072 = r93071 + r93071;
        double r93073 = r93070 * r93072;
        return r93073;
}
↓
double f(double x, double y) {
        double r93074 = x;
        double r93075 = y;
        double r93076 = r93075 + r93075;
        double r93077 = r93074 * r93076;
        return r93077;
}

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