Average Error: 0.0 → 0.0
Time: 939.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 r5264806 = x;
        double r5264807 = y;
        double r5264808 = r5264807 + r5264807;
        double r5264809 = r5264806 * r5264808;
        return r5264809;
}
↓
double f(double x, double y) {
        double r5264810 = x;
        double r5264811 = y;
        double r5264812 = r5264811 + r5264811;
        double r5264813 = r5264810 * r5264812;
        return r5264813;
}

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