Average Error: 0.0 → 0.0
Time: 951.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 r5014278 = x;
        double r5014279 = y;
        double r5014280 = r5014279 + r5014279;
        double r5014281 = r5014278 * r5014280;
        return r5014281;
}
↓
double f(double x, double y) {
        double r5014282 = x;
        double r5014283 = y;
        double r5014284 = r5014283 + r5014283;
        double r5014285 = r5014282 * r5014284;
        return r5014285;
}

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