Average Error: 0.0 → 0.0
Time: 4.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 r143961 = x;
        double r143962 = y;
        double r143963 = r143961 * r143962;
        double r143964 = z;
        double r143965 = t;
        double r143966 = r143964 * r143965;
        double r143967 = r143963 + r143966;
        return r143967;
}
↓
double f(double x, double y, double z, double t) {
        double r143968 = x;
        double r143969 = y;
        double r143970 = r143968 * r143969;
        double r143971 = z;
        double r143972 = t;
        double r143973 = r143971 * r143972;
        double r143974 = r143970 + r143973;
        return r143974;
}

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