Average Error: 0.0 → 0.0
Time: 14.0s
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 r6156009 = x;
        double r6156010 = y;
        double r6156011 = r6156009 * r6156010;
        double r6156012 = z;
        double r6156013 = t;
        double r6156014 = r6156012 * r6156013;
        double r6156015 = r6156011 + r6156014;
        return r6156015;
}
↓
double f(double x, double y, double z, double t) {
        double r6156016 = z;
        double r6156017 = t;
        double r6156018 = r6156016 * r6156017;
        double r6156019 = x;
        double r6156020 = y;
        double r6156021 = r6156019 * r6156020;
        double r6156022 = r6156018 + r6156021;
        return r6156022;
}

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