Average Error: 0.0 → 0.0
Time: 2.4s
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 r110713 = x;
        double r110714 = y;
        double r110715 = r110713 * r110714;
        double r110716 = z;
        double r110717 = t;
        double r110718 = r110716 * r110717;
        double r110719 = r110715 + r110718;
        return r110719;
}
↓
double f(double x, double y, double z, double t) {
        double r110720 = x;
        double r110721 = y;
        double r110722 = r110720 * r110721;
        double r110723 = z;
        double r110724 = t;
        double r110725 = r110723 * r110724;
        double r110726 = r110722 + r110725;
        return r110726;
}

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