Average Error: 0.0 → 0.0
Time: 7.9s
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 r102336 = x;
        double r102337 = y;
        double r102338 = r102336 * r102337;
        double r102339 = z;
        double r102340 = t;
        double r102341 = r102339 * r102340;
        double r102342 = r102338 + r102341;
        double r102343 = a;
        double r102344 = b;
        double r102345 = r102343 * r102344;
        double r102346 = r102342 + r102345;
        return r102346;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r102347 = x;
        double r102348 = y;
        double r102349 = r102347 * r102348;
        double r102350 = z;
        double r102351 = t;
        double r102352 = r102350 * r102351;
        double r102353 = r102349 + r102352;
        double r102354 = a;
        double r102355 = b;
        double r102356 = r102354 * r102355;
        double r102357 = r102353 + r102356;
        return r102357;
}

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