Average Error: 0.0 → 0.0
Time: 1.2s
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 r149976 = x;
        double r149977 = y;
        double r149978 = r149977 + r149977;
        double r149979 = r149976 * r149978;
        return r149979;
}
↓
double f(double x, double y) {
        double r149980 = x;
        double r149981 = y;
        double r149982 = r149981 + r149981;
        double r149983 = r149980 * r149982;
        return r149983;
}

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