Average Error: 0.1 → 0.1
Time: 5.3s
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 r312491 = x;
        double r312492 = 3.0;
        double r312493 = 8.0;
        double r312494 = r312492 / r312493;
        double r312495 = y;
        double r312496 = r312494 * r312495;
        double r312497 = r312491 - r312496;
        return r312497;
}
↓
double f(double x, double y) {
        double r312498 = x;
        double r312499 = 3.0;
        double r312500 = 8.0;
        double r312501 = r312499 / r312500;
        double r312502 = y;
        double r312503 = r312501 * r312502;
        double r312504 = r312498 - r312503;
        return r312504;
}

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