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 r238286 = x;
        double r238287 = 3.0;
        double r238288 = 8.0;
        double r238289 = r238287 / r238288;
        double r238290 = y;
        double r238291 = r238289 * r238290;
        double r238292 = r238286 - r238291;
        return r238292;
}
↓
double f(double x, double y) {
        double r238293 = x;
        double r238294 = 3.0;
        double r238295 = 8.0;
        double r238296 = r238294 / r238295;
        double r238297 = y;
        double r238298 = r238296 * r238297;
        double r238299 = r238293 - r238298;
        return r238299;
}

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