Average Error: 0.1 → 0.1
Time: 13.0s
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 r170280 = x;
        double r170281 = 3.0;
        double r170282 = 8.0;
        double r170283 = r170281 / r170282;
        double r170284 = y;
        double r170285 = r170283 * r170284;
        double r170286 = r170280 - r170285;
        return r170286;
}
↓
double f(double x, double y) {
        double r170287 = x;
        double r170288 = 3.0;
        double r170289 = 8.0;
        double r170290 = r170288 / r170289;
        double r170291 = y;
        double r170292 = r170290 * r170291;
        double r170293 = r170287 - r170292;
        return r170293;
}

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