Average Error: 0.0 → 0.0
Time: 4.5s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[z \cdot t + x \cdot y\]
x \cdot y + z \cdot t
↓
z \cdot t + x \cdot y
double f(double x, double y, double z, double t) {
        double r3500892 = x;
        double r3500893 = y;
        double r3500894 = r3500892 * r3500893;
        double r3500895 = z;
        double r3500896 = t;
        double r3500897 = r3500895 * r3500896;
        double r3500898 = r3500894 + r3500897;
        return r3500898;
}
↓
double f(double x, double y, double z, double t) {
        double r3500899 = z;
        double r3500900 = t;
        double r3500901 = r3500899 * r3500900;
        double r3500902 = x;
        double r3500903 = y;
        double r3500904 = r3500902 * r3500903;
        double r3500905 = r3500901 + r3500904;
        return r3500905;
}

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 z \cdot t + x \cdot y\]

Reproduce

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