Average Error: 0.0 → 0.0
Time: 363.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 r124081 = x;
        double r124082 = y;
        double r124083 = r124082 + r124082;
        double r124084 = r124081 * r124083;
        return r124084;
}
↓
double f(double x, double y) {
        double r124085 = x;
        double r124086 = y;
        double r124087 = r124086 + r124086;
        double r124088 = r124085 * r124087;
        return r124088;
}

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