Average Error: 0.0 → 0.0
Time: 1.1s
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 r82803 = x;
        double r82804 = y;
        double r82805 = r82804 + r82804;
        double r82806 = r82803 * r82805;
        return r82806;
}
↓
double f(double x, double y) {
        double r82807 = x;
        double r82808 = y;
        double r82809 = r82808 + r82808;
        double r82810 = r82807 * r82809;
        return r82810;
}

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