Average Error: 0.0 → 0.0
Time: 19.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 r120790 = x;
        double r120791 = y;
        double r120792 = r120790 * r120791;
        double r120793 = z;
        double r120794 = t;
        double r120795 = r120793 * r120794;
        double r120796 = r120792 + r120795;
        double r120797 = a;
        double r120798 = b;
        double r120799 = r120797 * r120798;
        double r120800 = r120796 + r120799;
        return r120800;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r120801 = x;
        double r120802 = y;
        double r120803 = r120801 * r120802;
        double r120804 = z;
        double r120805 = t;
        double r120806 = r120804 * r120805;
        double r120807 = r120803 + r120806;
        double r120808 = a;
        double r120809 = b;
        double r120810 = r120808 * r120809;
        double r120811 = r120807 + r120810;
        return r120811;
}

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