Average Error: 0.0 → 0.0
Time: 3.7s
Precision: 64
\[\frac{x \cdot y}{2} - \frac{z}{8}\]
↓
\[\frac{x \cdot y}{2} - \frac{z}{8}\]
\frac{x \cdot y}{2} - \frac{z}{8}
↓
\frac{x \cdot y}{2} - \frac{z}{8}
double f(double x, double y, double z) {
        double r148881 = x;
        double r148882 = y;
        double r148883 = r148881 * r148882;
        double r148884 = 2.0;
        double r148885 = r148883 / r148884;
        double r148886 = z;
        double r148887 = 8.0;
        double r148888 = r148886 / r148887;
        double r148889 = r148885 - r148888;
        return r148889;
}
↓
double f(double x, double y, double z) {
        double r148890 = x;
        double r148891 = y;
        double r148892 = r148890 * r148891;
        double r148893 = 2.0;
        double r148894 = r148892 / r148893;
        double r148895 = z;
        double r148896 = 8.0;
        double r148897 = r148895 / r148896;
        double r148898 = r148894 - r148897;
        return r148898;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{x \cdot y}{2} - \frac{z}{8}\]

  2. Final simplification0.0

    \[\leadsto \frac{x \cdot y}{2} - \frac{z}{8}\]

Reproduce

herbie shell --seed 2019323 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, D"
  :precision binary64
  (- (/ (* x y) 2) (/ z 8)))