Average Error: 0.1 → 0.1
Time: 9.8s
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 r214309 = x;
        double r214310 = 3.0;
        double r214311 = 8.0;
        double r214312 = r214310 / r214311;
        double r214313 = y;
        double r214314 = r214312 * r214313;
        double r214315 = r214309 - r214314;
        return r214315;
}
↓
double f(double x, double y) {
        double r214316 = x;
        double r214317 = 3.0;
        double r214318 = 8.0;
        double r214319 = r214317 / r214318;
        double r214320 = y;
        double r214321 = r214319 * r214320;
        double r214322 = r214316 - r214321;
        return r214322;
}

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