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 r7127728 = x;
        double r7127729 = y;
        double r7127730 = r7127729 + r7127729;
        double r7127731 = r7127728 * r7127730;
        return r7127731;
}
↓
double f(double x, double y) {
        double r7127732 = x;
        double r7127733 = y;
        double r7127734 = r7127733 + r7127733;
        double r7127735 = r7127732 * r7127734;
        return r7127735;
}

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