Average Error: 0.1 → 0.1
Time: 861.0ms
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 r135357 = x;
        double r135358 = 3.0;
        double r135359 = 8.0;
        double r135360 = r135358 / r135359;
        double r135361 = y;
        double r135362 = r135360 * r135361;
        double r135363 = r135357 - r135362;
        return r135363;
}
↓
double f(double x, double y) {
        double r135364 = x;
        double r135365 = 3.0;
        double r135366 = 8.0;
        double r135367 = r135365 / r135366;
        double r135368 = y;
        double r135369 = r135367 * r135368;
        double r135370 = r135364 - r135369;
        return r135370;
}

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