Average Error: 0.0 → 0.0
Time: 2.3s
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 r160940 = x;
        double r160941 = y;
        double r160942 = r160940 * r160941;
        double r160943 = z;
        double r160944 = t;
        double r160945 = r160943 * r160944;
        double r160946 = r160942 + r160945;
        return r160946;
}
↓
double f(double x, double y, double z, double t) {
        double r160947 = x;
        double r160948 = y;
        double r160949 = r160947 * r160948;
        double r160950 = z;
        double r160951 = t;
        double r160952 = r160950 * r160951;
        double r160953 = r160949 + r160952;
        return r160953;
}

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