Average Error: 0.0 → 0.0
Time: 1.4s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[x \cdot y + z \cdot t\]
x \cdot y + z \cdot t
↓
x \cdot y + z \cdot t
double f(double x, double y, double z, double t) {
        double r101708 = x;
        double r101709 = y;
        double r101710 = r101708 * r101709;
        double r101711 = z;
        double r101712 = t;
        double r101713 = r101711 * r101712;
        double r101714 = r101710 + r101713;
        return r101714;
}
↓
double f(double x, double y, double z, double t) {
        double r101715 = x;
        double r101716 = y;
        double r101717 = r101715 * r101716;
        double r101718 = z;
        double r101719 = t;
        double r101720 = r101718 * r101719;
        double r101721 = r101717 + r101720;
        return r101721;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + z \cdot t\]

  2. Final simplification0.0

    \[\leadsto x \cdot y + z \cdot t\]

Reproduce

herbie shell --seed 2020062 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))