Average Error: 0.0 → 0.0
Time: 3.7s
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 r124982 = x;
        double r124983 = y;
        double r124984 = r124982 * r124983;
        double r124985 = z;
        double r124986 = t;
        double r124987 = r124985 * r124986;
        double r124988 = r124984 + r124987;
        double r124989 = a;
        double r124990 = b;
        double r124991 = r124989 * r124990;
        double r124992 = r124988 + r124991;
        return r124992;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r124993 = x;
        double r124994 = y;
        double r124995 = r124993 * r124994;
        double r124996 = z;
        double r124997 = t;
        double r124998 = r124996 * r124997;
        double r124999 = r124995 + r124998;
        double r125000 = a;
        double r125001 = b;
        double r125002 = r125000 * r125001;
        double r125003 = r124999 + r125002;
        return r125003;
}

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