Average Error: 0.0 → 0.0
Time: 3.1s
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 r134693 = x;
        double r134694 = y;
        double r134695 = r134693 * r134694;
        double r134696 = 2.0;
        double r134697 = r134695 / r134696;
        double r134698 = z;
        double r134699 = 8.0;
        double r134700 = r134698 / r134699;
        double r134701 = r134697 - r134700;
        return r134701;
}
↓
double f(double x, double y, double z) {
        double r134702 = x;
        double r134703 = y;
        double r134704 = r134702 * r134703;
        double r134705 = 2.0;
        double r134706 = r134704 / r134705;
        double r134707 = z;
        double r134708 = 8.0;
        double r134709 = r134707 / r134708;
        double r134710 = r134706 - r134709;
        return r134710;
}

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