Average Error: 0.1 → 0.1
Time: 10.2s
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 r241287 = x;
        double r241288 = 3.0;
        double r241289 = 8.0;
        double r241290 = r241288 / r241289;
        double r241291 = y;
        double r241292 = r241290 * r241291;
        double r241293 = r241287 - r241292;
        return r241293;
}

double f(double x, double y) {
        double r241294 = x;
        double r241295 = 3.0;
        double r241296 = 8.0;
        double r241297 = r241295 / r241296;
        double r241298 = y;
        double r241299 = r241297 * r241298;
        double r241300 = r241294 - r241299;
        return r241300;
}

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)))