Average Error: 0.0 → 0.0
Time: 578.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 r3572599 = x;
        double r3572600 = y;
        double r3572601 = r3572600 + r3572600;
        double r3572602 = r3572599 * r3572601;
        return r3572602;
}
↓
double f(double x, double y) {
        double r3572603 = x;
        double r3572604 = y;
        double r3572605 = r3572604 + r3572604;
        double r3572606 = r3572603 * r3572605;
        return r3572606;
}

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)))