Average Error: 0.0 → 0.0
Time: 6.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 r127237 = x;
        double r127238 = y;
        double r127239 = r127237 * r127238;
        double r127240 = z;
        double r127241 = t;
        double r127242 = r127240 * r127241;
        double r127243 = r127239 + r127242;
        double r127244 = a;
        double r127245 = b;
        double r127246 = r127244 * r127245;
        double r127247 = r127243 + r127246;
        return r127247;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r127248 = x;
        double r127249 = y;
        double r127250 = r127248 * r127249;
        double r127251 = z;
        double r127252 = t;
        double r127253 = r127251 * r127252;
        double r127254 = r127250 + r127253;
        double r127255 = a;
        double r127256 = b;
        double r127257 = r127255 * r127256;
        double r127258 = r127254 + r127257;
        return r127258;
}

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