Average Error: 0.0 → 0.0
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 r145007 = x;
        double r145008 = y;
        double r145009 = r145007 * r145008;
        double r145010 = 2.0;
        double r145011 = r145009 / r145010;
        double r145012 = z;
        double r145013 = 8.0;
        double r145014 = r145012 / r145013;
        double r145015 = r145011 - r145014;
        return r145015;
}
↓
double f(double x, double y, double z) {
        double r145016 = x;
        double r145017 = y;
        double r145018 = r145016 * r145017;
        double r145019 = 2.0;
        double r145020 = r145018 / r145019;
        double r145021 = z;
        double r145022 = 8.0;
        double r145023 = r145021 / r145022;
        double r145024 = r145020 - r145023;
        return r145024;
}

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