Average Error: 0.0 → 0.0
Time: 9.8s
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 r5794083 = x;
        double r5794084 = y;
        double r5794085 = r5794083 * r5794084;
        double r5794086 = z;
        double r5794087 = t;
        double r5794088 = r5794086 * r5794087;
        double r5794089 = r5794085 + r5794088;
        return r5794089;
}
↓
double f(double x, double y, double z, double t) {
        double r5794090 = z;
        double r5794091 = t;
        double r5794092 = r5794090 * r5794091;
        double r5794093 = x;
        double r5794094 = y;
        double r5794095 = r5794093 * r5794094;
        double r5794096 = r5794092 + r5794095;
        return r5794096;
}

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