Average Error: 0.0 → 0.0
Time: 21.5s
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 r8468235 = x;
        double r8468236 = y;
        double r8468237 = r8468235 * r8468236;
        double r8468238 = z;
        double r8468239 = t;
        double r8468240 = r8468238 * r8468239;
        double r8468241 = r8468237 + r8468240;
        return r8468241;
}
↓
double f(double x, double y, double z, double t) {
        double r8468242 = z;
        double r8468243 = t;
        double r8468244 = r8468242 * r8468243;
        double r8468245 = x;
        double r8468246 = y;
        double r8468247 = r8468245 * r8468246;
        double r8468248 = r8468244 + r8468247;
        return r8468248;
}

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)))