Average Error: 0.1 → 0.1
Time: 7.6s
Precision: 64
\[x - \frac{3}{8} \cdot y\]
↓
\[x - \frac{3}{8} \cdot y\]
x - \frac{3}{8} \cdot y
↓
x - \frac{3}{8} \cdot y
double f(double x, double y) {
        double r218361 = x;
        double r218362 = 3.0;
        double r218363 = 8.0;
        double r218364 = r218362 / r218363;
        double r218365 = y;
        double r218366 = r218364 * r218365;
        double r218367 = r218361 - r218366;
        return r218367;
}
↓
double f(double x, double y) {
        double r218368 = x;
        double r218369 = 3.0;
        double r218370 = 8.0;
        double r218371 = r218369 / r218370;
        double r218372 = y;
        double r218373 = r218371 * r218372;
        double r218374 = r218368 - r218373;
        return r218374;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[x - \frac{3}{8} \cdot y\]

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2019304 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (/ 3 8) y)))