Average Error: 0.0 → 0.0
Time: 7.3s
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 r111710 = x;
        double r111711 = y;
        double r111712 = r111710 * r111711;
        double r111713 = z;
        double r111714 = t;
        double r111715 = r111713 * r111714;
        double r111716 = r111712 + r111715;
        return r111716;
}
↓
double f(double x, double y, double z, double t) {
        double r111717 = x;
        double r111718 = y;
        double r111719 = r111717 * r111718;
        double r111720 = z;
        double r111721 = t;
        double r111722 = r111720 * r111721;
        double r111723 = r111719 + r111722;
        return r111723;
}

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. Simplified0.0

    \[\leadsto \color{blue}{z \cdot t + x \cdot y}\]

  3. Final simplification0.0

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

Reproduce

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