Average Error: 0.0 → 0.0
Time: 4.2s
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 r69748 = x;
        double r69749 = y;
        double r69750 = r69748 * r69749;
        double r69751 = z;
        double r69752 = t;
        double r69753 = r69751 * r69752;
        double r69754 = r69750 + r69753;
        return r69754;
}
↓
double f(double x, double y, double z, double t) {
        double r69755 = x;
        double r69756 = y;
        double r69757 = r69755 * r69756;
        double r69758 = z;
        double r69759 = t;
        double r69760 = r69758 * r69759;
        double r69761 = r69757 + r69760;
        return r69761;
}

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 x \cdot y + z \cdot t\]

Reproduce

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