Average Error: 0.0 → 0.0
Time: 1.9s
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 r4243028 = x;
        double r4243029 = y;
        double r4243030 = r4243029 + r4243029;
        double r4243031 = r4243028 * r4243030;
        return r4243031;
}
↓
double f(double x, double y) {
        double r4243032 = x;
        double r4243033 = y;
        double r4243034 = r4243033 + r4243033;
        double r4243035 = r4243032 * r4243034;
        return r4243035;
}

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