Average Error: 0.1 → 0.1
Time: 5.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 r240508 = x;
        double r240509 = 3.0;
        double r240510 = 8.0;
        double r240511 = r240509 / r240510;
        double r240512 = y;
        double r240513 = r240511 * r240512;
        double r240514 = r240508 - r240513;
        return r240514;
}

double f(double x, double y) {
        double r240515 = x;
        double r240516 = 3.0;
        double r240517 = 8.0;
        double r240518 = r240516 / r240517;
        double r240519 = y;
        double r240520 = r240518 * r240519;
        double r240521 = r240515 - r240520;
        return r240521;
}

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