Average Error: 0.0 → 0.0
Time: 988.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 r3645824 = x;
        double r3645825 = y;
        double r3645826 = r3645825 + r3645825;
        double r3645827 = r3645824 * r3645826;
        return r3645827;
}
↓
double f(double x, double y) {
        double r3645828 = x;
        double r3645829 = y;
        double r3645830 = r3645829 + r3645829;
        double r3645831 = r3645828 * r3645830;
        return r3645831;
}

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