Average Error: 0.0 → 0.0
Time: 886.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 r4840752 = x;
        double r4840753 = y;
        double r4840754 = r4840753 + r4840753;
        double r4840755 = r4840752 * r4840754;
        return r4840755;
}
↓
double f(double x, double y) {
        double r4840756 = x;
        double r4840757 = y;
        double r4840758 = r4840757 + r4840757;
        double r4840759 = r4840756 * r4840758;
        return r4840759;
}

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