Average Error: 0.0 → 0.0
Time: 16.4s
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 r7993949 = x;
        double r7993950 = y;
        double r7993951 = r7993949 * r7993950;
        double r7993952 = z;
        double r7993953 = t;
        double r7993954 = r7993952 * r7993953;
        double r7993955 = r7993951 + r7993954;
        return r7993955;
}
↓
double f(double x, double y, double z, double t) {
        double r7993956 = z;
        double r7993957 = t;
        double r7993958 = r7993956 * r7993957;
        double r7993959 = x;
        double r7993960 = y;
        double r7993961 = r7993959 * r7993960;
        double r7993962 = r7993958 + r7993961;
        return r7993962;
}

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 2019171 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  (+ (* x y) (* z t)))