Average Error: 0.0 → 0.0
Time: 1.4s
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 r3946080 = x;
        double r3946081 = y;
        double r3946082 = r3946081 + r3946081;
        double r3946083 = r3946080 * r3946082;
        return r3946083;
}
↓
double f(double x, double y) {
        double r3946084 = x;
        double r3946085 = y;
        double r3946086 = r3946085 + r3946085;
        double r3946087 = r3946084 * r3946086;
        return r3946087;
}

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