Average Error: 0.0 → 0.0
Time: 7.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 r11112080 = x;
        double r11112081 = y;
        double r11112082 = r11112080 * r11112081;
        double r11112083 = z;
        double r11112084 = t;
        double r11112085 = r11112083 * r11112084;
        double r11112086 = r11112082 + r11112085;
        return r11112086;
}
↓
double f(double x, double y, double z, double t) {
        double r11112087 = x;
        double r11112088 = y;
        double r11112089 = r11112087 * r11112088;
        double r11112090 = z;
        double r11112091 = t;
        double r11112092 = r11112090 * r11112091;
        double r11112093 = r11112089 + r11112092;
        return r11112093;
}

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