Average Error: 0.0 → 0.0
Time: 3.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 r85208 = x;
        double r85209 = y;
        double r85210 = r85208 * r85209;
        double r85211 = z;
        double r85212 = t;
        double r85213 = r85211 * r85212;
        double r85214 = r85210 + r85213;
        double r85215 = a;
        double r85216 = b;
        double r85217 = r85215 * r85216;
        double r85218 = r85214 + r85217;
        return r85218;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r85219 = x;
        double r85220 = y;
        double r85221 = r85219 * r85220;
        double r85222 = z;
        double r85223 = t;
        double r85224 = r85222 * r85223;
        double r85225 = r85221 + r85224;
        double r85226 = a;
        double r85227 = b;
        double r85228 = r85226 * r85227;
        double r85229 = r85225 + r85228;
        return r85229;
}

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