Average Error: 0.0 → 0.0
Time: 8.8s
Precision: 64
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
↓
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
\left(x \cdot y + z \cdot t\right) + a \cdot b
↓
\left(x \cdot y + z \cdot t\right) + a \cdot b
double f(double x, double y, double z, double t, double a, double b) {
        double r65902 = x;
        double r65903 = y;
        double r65904 = r65902 * r65903;
        double r65905 = z;
        double r65906 = t;
        double r65907 = r65905 * r65906;
        double r65908 = r65904 + r65907;
        double r65909 = a;
        double r65910 = b;
        double r65911 = r65909 * r65910;
        double r65912 = r65908 + r65911;
        return r65912;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r65913 = x;
        double r65914 = y;
        double r65915 = r65913 * r65914;
        double r65916 = z;
        double r65917 = t;
        double r65918 = r65916 * r65917;
        double r65919 = r65915 + r65918;
        double r65920 = a;
        double r65921 = b;
        double r65922 = r65920 * r65921;
        double r65923 = r65919 + r65922;
        return r65923;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot y + z \cdot t\right) + a \cdot b\]

  2. Final simplification0.0

    \[\leadsto \left(x \cdot y + z \cdot t\right) + a \cdot b\]

Reproduce

herbie shell --seed 2019326 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  :precision binary64
  (+ (+ (* x y) (* z t)) (* a b)))