Average Error: 0.1 → 0.1
Time: 20.1s
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 r197411 = x;
        double r197412 = 3.0;
        double r197413 = 8.0;
        double r197414 = r197412 / r197413;
        double r197415 = y;
        double r197416 = r197414 * r197415;
        double r197417 = r197411 - r197416;
        return r197417;
}
↓
double f(double x, double y) {
        double r197418 = x;
        double r197419 = 3.0;
        double r197420 = 8.0;
        double r197421 = r197419 / r197420;
        double r197422 = y;
        double r197423 = r197421 * r197422;
        double r197424 = r197418 - r197423;
        return r197424;
}

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