Average Error: 0.0 → 0.0
Time: 4.1s
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 r115818 = x;
        double r115819 = y;
        double r115820 = r115818 * r115819;
        double r115821 = z;
        double r115822 = t;
        double r115823 = r115821 * r115822;
        double r115824 = r115820 + r115823;
        double r115825 = a;
        double r115826 = b;
        double r115827 = r115825 * r115826;
        double r115828 = r115824 + r115827;
        return r115828;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r115829 = x;
        double r115830 = y;
        double r115831 = r115829 * r115830;
        double r115832 = z;
        double r115833 = t;
        double r115834 = r115832 * r115833;
        double r115835 = r115831 + r115834;
        double r115836 = a;
        double r115837 = b;
        double r115838 = r115836 * r115837;
        double r115839 = r115835 + r115838;
        return r115839;
}

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