Average Error: 0.1 → 0.1
Time: 5.6s
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 r234282 = x;
        double r234283 = 3.0;
        double r234284 = 8.0;
        double r234285 = r234283 / r234284;
        double r234286 = y;
        double r234287 = r234285 * r234286;
        double r234288 = r234282 - r234287;
        return r234288;
}
↓
double f(double x, double y) {
        double r234289 = x;
        double r234290 = 3.0;
        double r234291 = 8.0;
        double r234292 = r234290 / r234291;
        double r234293 = y;
        double r234294 = r234292 * r234293;
        double r234295 = r234289 - r234294;
        return r234295;
}

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