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 r144095 = x;
        double r144096 = y;
        double r144097 = r144095 * r144096;
        double r144098 = z;
        double r144099 = t;
        double r144100 = r144098 * r144099;
        double r144101 = r144097 + r144100;
        double r144102 = a;
        double r144103 = b;
        double r144104 = r144102 * r144103;
        double r144105 = r144101 + r144104;
        return r144105;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r144106 = x;
        double r144107 = y;
        double r144108 = r144106 * r144107;
        double r144109 = z;
        double r144110 = t;
        double r144111 = r144109 * r144110;
        double r144112 = r144108 + r144111;
        double r144113 = a;
        double r144114 = b;
        double r144115 = r144113 * r144114;
        double r144116 = r144112 + r144115;
        return r144116;
}

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