Average Error: 0.0 → 0.0
Time: 5.2s
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 r94905 = x;
        double r94906 = y;
        double r94907 = r94905 * r94906;
        double r94908 = z;
        double r94909 = t;
        double r94910 = r94908 * r94909;
        double r94911 = r94907 + r94910;
        double r94912 = a;
        double r94913 = b;
        double r94914 = r94912 * r94913;
        double r94915 = r94911 + r94914;
        return r94915;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r94916 = x;
        double r94917 = y;
        double r94918 = r94916 * r94917;
        double r94919 = z;
        double r94920 = t;
        double r94921 = r94919 * r94920;
        double r94922 = r94918 + r94921;
        double r94923 = a;
        double r94924 = b;
        double r94925 = r94923 * r94924;
        double r94926 = r94922 + r94925;
        return r94926;
}

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 2019325 
(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)))