Average Error: 0.0 → 0.0
Time: 6.7m
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 r23019931 = x;
        double r23019932 = y;
        double r23019933 = r23019931 * r23019932;
        double r23019934 = z;
        double r23019935 = t;
        double r23019936 = r23019934 * r23019935;
        double r23019937 = r23019933 + r23019936;
        return r23019937;
}
↓
double f(double x, double y, double z, double t) {
        double r23019938 = z;
        double r23019939 = t;
        double r23019940 = r23019938 * r23019939;
        double r23019941 = x;
        double r23019942 = y;
        double r23019943 = r23019941 * r23019942;
        double r23019944 = r23019940 + r23019943;
        return r23019944;
}

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