Average Error: 0.0 → 0.0
Time: 14.2s
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 r222143 = x;
        double r222144 = y;
        double r222145 = r222143 * r222144;
        double r222146 = z;
        double r222147 = t;
        double r222148 = r222146 * r222147;
        double r222149 = r222145 + r222148;
        double r222150 = a;
        double r222151 = b;
        double r222152 = r222150 * r222151;
        double r222153 = r222149 + r222152;
        return r222153;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r222154 = x;
        double r222155 = y;
        double r222156 = r222154 * r222155;
        double r222157 = z;
        double r222158 = t;
        double r222159 = r222157 * r222158;
        double r222160 = r222156 + r222159;
        double r222161 = a;
        double r222162 = b;
        double r222163 = r222161 * r222162;
        double r222164 = r222160 + r222163;
        return r222164;
}

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