Average Error: 0.1 → 0.1
Time: 2.2s
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 r230388 = x;
        double r230389 = y;
        double r230390 = r230388 * r230389;
        double r230391 = 2.0;
        double r230392 = r230390 / r230391;
        double r230393 = z;
        double r230394 = 8.0;
        double r230395 = r230393 / r230394;
        double r230396 = r230392 - r230395;
        return r230396;
}
↓
double f(double x, double y, double z) {
        double r230397 = x;
        double r230398 = y;
        double r230399 = r230397 * r230398;
        double r230400 = 2.0;
        double r230401 = r230399 / r230400;
        double r230402 = z;
        double r230403 = 8.0;
        double r230404 = r230402 / r230403;
        double r230405 = r230401 - r230404;
        return r230405;
}

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.1

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

  2. Final simplification0.1

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

Reproduce

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