Average Error: 0.0 → 0.0
Time: 9.6s
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 r6891011 = x;
        double r6891012 = y;
        double r6891013 = r6891011 * r6891012;
        double r6891014 = z;
        double r6891015 = t;
        double r6891016 = r6891014 * r6891015;
        double r6891017 = r6891013 + r6891016;
        return r6891017;
}
↓
double f(double x, double y, double z, double t) {
        double r6891018 = z;
        double r6891019 = t;
        double r6891020 = r6891018 * r6891019;
        double r6891021 = x;
        double r6891022 = y;
        double r6891023 = r6891021 * r6891022;
        double r6891024 = r6891020 + r6891023;
        return r6891024;
}

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