Average Error: 0.1 → 0.1
Time: 10.9s
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 r295776 = x;
        double r295777 = 3.0;
        double r295778 = 8.0;
        double r295779 = r295777 / r295778;
        double r295780 = y;
        double r295781 = r295779 * r295780;
        double r295782 = r295776 - r295781;
        return r295782;
}

double f(double x, double y) {
        double r295783 = x;
        double r295784 = 3.0;
        double r295785 = 8.0;
        double r295786 = r295784 / r295785;
        double r295787 = y;
        double r295788 = r295786 * r295787;
        double r295789 = r295783 - r295788;
        return r295789;
}

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