Average Error: 0.0 → 0.0
Time: 1.8s
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 r229975 = x;
        double r229976 = y;
        double r229977 = r229975 * r229976;
        double r229978 = 2.0;
        double r229979 = r229977 / r229978;
        double r229980 = z;
        double r229981 = 8.0;
        double r229982 = r229980 / r229981;
        double r229983 = r229979 - r229982;
        return r229983;
}
↓
double f(double x, double y, double z) {
        double r229984 = x;
        double r229985 = y;
        double r229986 = r229984 * r229985;
        double r229987 = 2.0;
        double r229988 = r229986 / r229987;
        double r229989 = z;
        double r229990 = 8.0;
        double r229991 = r229989 / r229990;
        double r229992 = r229988 - r229991;
        return r229992;
}

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 2020039 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, D"
  :precision binary64
  (- (/ (* x y) 2) (/ z 8)))