Average Error: 0.0 → 0.0
Time: 1.3s
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 r172150 = x;
        double r172151 = y;
        double r172152 = r172150 * r172151;
        double r172153 = z;
        double r172154 = t;
        double r172155 = r172153 * r172154;
        double r172156 = r172152 + r172155;
        double r172157 = a;
        double r172158 = b;
        double r172159 = r172157 * r172158;
        double r172160 = r172156 + r172159;
        return r172160;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r172161 = x;
        double r172162 = y;
        double r172163 = r172161 * r172162;
        double r172164 = z;
        double r172165 = t;
        double r172166 = r172164 * r172165;
        double r172167 = r172163 + r172166;
        double r172168 = a;
        double r172169 = b;
        double r172170 = r172168 * r172169;
        double r172171 = r172167 + r172170;
        return r172171;
}

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