Average Error: 0.1 → 0.1
Time: 9.8s
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 r99381 = x;
        double r99382 = 3.0;
        double r99383 = 8.0;
        double r99384 = r99382 / r99383;
        double r99385 = y;
        double r99386 = r99384 * r99385;
        double r99387 = r99381 - r99386;
        return r99387;
}

double f(double x, double y) {
        double r99388 = x;
        double r99389 = 3.0;
        double r99390 = 8.0;
        double r99391 = r99389 / r99390;
        double r99392 = y;
        double r99393 = r99391 * r99392;
        double r99394 = r99388 - r99393;
        return r99394;
}

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