Average Error: 0.0 → 0.0
Time: 6.8s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[x \cdot y + z \cdot t\]
x \cdot y + z \cdot t
↓
x \cdot y + z \cdot t
double f(double x, double y, double z, double t) {
        double r102374 = x;
        double r102375 = y;
        double r102376 = r102374 * r102375;
        double r102377 = z;
        double r102378 = t;
        double r102379 = r102377 * r102378;
        double r102380 = r102376 + r102379;
        return r102380;
}
↓
double f(double x, double y, double z, double t) {
        double r102381 = x;
        double r102382 = y;
        double r102383 = r102381 * r102382;
        double r102384 = z;
        double r102385 = t;
        double r102386 = r102384 * r102385;
        double r102387 = r102383 + r102386;
        return r102387;
}

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. Simplified0.0

    \[\leadsto \color{blue}{z \cdot t + x \cdot y}\]

  3. Final simplification0.0

    \[\leadsto x \cdot y + z \cdot t\]

Reproduce

herbie shell --seed 2019195 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  (+ (* x y) (* z t)))