Average Error: 0.0 → 0.0
Time: 4.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 r146076 = x;
        double r146077 = y;
        double r146078 = r146076 * r146077;
        double r146079 = z;
        double r146080 = t;
        double r146081 = r146079 * r146080;
        double r146082 = r146078 + r146081;
        double r146083 = a;
        double r146084 = b;
        double r146085 = r146083 * r146084;
        double r146086 = r146082 + r146085;
        return r146086;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r146087 = x;
        double r146088 = y;
        double r146089 = r146087 * r146088;
        double r146090 = z;
        double r146091 = t;
        double r146092 = r146090 * r146091;
        double r146093 = r146089 + r146092;
        double r146094 = a;
        double r146095 = b;
        double r146096 = r146094 * r146095;
        double r146097 = r146093 + r146096;
        return r146097;
}

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