Average Error: 0.0 → 0.0
Time: 13.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 r8056014 = x;
        double r8056015 = y;
        double r8056016 = r8056014 * r8056015;
        double r8056017 = z;
        double r8056018 = t;
        double r8056019 = r8056017 * r8056018;
        double r8056020 = r8056016 + r8056019;
        return r8056020;
}
↓
double f(double x, double y, double z, double t) {
        double r8056021 = z;
        double r8056022 = t;
        double r8056023 = r8056021 * r8056022;
        double r8056024 = x;
        double r8056025 = y;
        double r8056026 = r8056024 * r8056025;
        double r8056027 = r8056023 + r8056026;
        return r8056027;
}

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