Average Error: 0.1 → 0.1
Time: 5.5s
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 r302708 = x;
        double r302709 = 3.0;
        double r302710 = 8.0;
        double r302711 = r302709 / r302710;
        double r302712 = y;
        double r302713 = r302711 * r302712;
        double r302714 = r302708 - r302713;
        return r302714;
}

double f(double x, double y) {
        double r302715 = x;
        double r302716 = 3.0;
        double r302717 = 8.0;
        double r302718 = r302716 / r302717;
        double r302719 = y;
        double r302720 = r302718 * r302719;
        double r302721 = r302715 - r302720;
        return r302721;
}

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