Average Error: 0.0 → 0.0
Time: 867.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 r7385450 = x;
        double r7385451 = y;
        double r7385452 = r7385451 + r7385451;
        double r7385453 = r7385450 * r7385452;
        return r7385453;
}
↓
double f(double x, double y) {
        double r7385454 = x;
        double r7385455 = y;
        double r7385456 = r7385455 + r7385455;
        double r7385457 = r7385454 * r7385456;
        return r7385457;
}

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