Average Error: 0.1 → 0.1
Time: 6.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 r267384 = x;
        double r267385 = 3.0;
        double r267386 = 8.0;
        double r267387 = r267385 / r267386;
        double r267388 = y;
        double r267389 = r267387 * r267388;
        double r267390 = r267384 - r267389;
        return r267390;
}
↓
double f(double x, double y) {
        double r267391 = x;
        double r267392 = 3.0;
        double r267393 = 8.0;
        double r267394 = r267392 / r267393;
        double r267395 = y;
        double r267396 = r267394 * r267395;
        double r267397 = r267391 - r267396;
        return r267397;
}

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