Average Error: 0.0 → 0.0
Time: 3.3s
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 r70599 = x;
        double r70600 = y;
        double r70601 = r70599 * r70600;
        double r70602 = z;
        double r70603 = t;
        double r70604 = r70602 * r70603;
        double r70605 = r70601 + r70604;
        double r70606 = a;
        double r70607 = b;
        double r70608 = r70606 * r70607;
        double r70609 = r70605 + r70608;
        return r70609;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r70610 = x;
        double r70611 = y;
        double r70612 = r70610 * r70611;
        double r70613 = z;
        double r70614 = t;
        double r70615 = r70613 * r70614;
        double r70616 = r70612 + r70615;
        double r70617 = a;
        double r70618 = b;
        double r70619 = r70617 * r70618;
        double r70620 = r70616 + r70619;
        return r70620;
}

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