Average Error: 0.0 → 0.0
Time: 847.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 r88791 = x;
        double r88792 = y;
        double r88793 = r88792 + r88792;
        double r88794 = r88791 * r88793;
        return r88794;
}
↓
double f(double x, double y) {
        double r88795 = x;
        double r88796 = y;
        double r88797 = r88796 + r88796;
        double r88798 = r88795 * r88797;
        return r88798;
}

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