Average Error: 0.0 → 0.0
Time: 1.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 r109102 = x;
        double r109103 = y;
        double r109104 = r109102 * r109103;
        double r109105 = z;
        double r109106 = t;
        double r109107 = r109105 * r109106;
        double r109108 = r109104 + r109107;
        double r109109 = a;
        double r109110 = b;
        double r109111 = r109109 * r109110;
        double r109112 = r109108 + r109111;
        return r109112;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r109113 = x;
        double r109114 = y;
        double r109115 = r109113 * r109114;
        double r109116 = z;
        double r109117 = t;
        double r109118 = r109116 * r109117;
        double r109119 = r109115 + r109118;
        double r109120 = a;
        double r109121 = b;
        double r109122 = r109120 * r109121;
        double r109123 = r109119 + r109122;
        return r109123;
}

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