Average Error: 0.0 → 0.0
Time: 8.5s
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 r124155 = x;
        double r124156 = y;
        double r124157 = r124155 * r124156;
        double r124158 = z;
        double r124159 = t;
        double r124160 = r124158 * r124159;
        double r124161 = r124157 + r124160;
        double r124162 = a;
        double r124163 = b;
        double r124164 = r124162 * r124163;
        double r124165 = r124161 + r124164;
        return r124165;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r124166 = x;
        double r124167 = y;
        double r124168 = r124166 * r124167;
        double r124169 = z;
        double r124170 = t;
        double r124171 = r124169 * r124170;
        double r124172 = r124168 + r124171;
        double r124173 = a;
        double r124174 = b;
        double r124175 = r124173 * r124174;
        double r124176 = r124172 + r124175;
        return r124176;
}

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