Average Error: 0.0 → 0.0
Time: 3.6s
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 r128049 = x;
        double r128050 = y;
        double r128051 = r128049 * r128050;
        double r128052 = z;
        double r128053 = t;
        double r128054 = r128052 * r128053;
        double r128055 = r128051 + r128054;
        double r128056 = a;
        double r128057 = b;
        double r128058 = r128056 * r128057;
        double r128059 = r128055 + r128058;
        return r128059;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r128060 = x;
        double r128061 = y;
        double r128062 = r128060 * r128061;
        double r128063 = z;
        double r128064 = t;
        double r128065 = r128063 * r128064;
        double r128066 = r128062 + r128065;
        double r128067 = a;
        double r128068 = b;
        double r128069 = r128067 * r128068;
        double r128070 = r128066 + r128069;
        return r128070;
}

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