Average Error: 0.0 → 0.0
Time: 507.0ms
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 r279328 = x;
        double r279329 = y;
        double r279330 = r279328 * r279329;
        double r279331 = 2.0;
        double r279332 = r279330 / r279331;
        double r279333 = z;
        double r279334 = 8.0;
        double r279335 = r279333 / r279334;
        double r279336 = r279332 - r279335;
        return r279336;
}
↓
double f(double x, double y, double z) {
        double r279337 = x;
        double r279338 = y;
        double r279339 = r279337 * r279338;
        double r279340 = 2.0;
        double r279341 = r279339 / r279340;
        double r279342 = z;
        double r279343 = 8.0;
        double r279344 = r279342 / r279343;
        double r279345 = r279341 - r279344;
        return r279345;
}

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