Average Error: 0.1 → 0.1
Time: 772.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 r140459 = x;
        double r140460 = 3.0;
        double r140461 = 8.0;
        double r140462 = r140460 / r140461;
        double r140463 = y;
        double r140464 = r140462 * r140463;
        double r140465 = r140459 - r140464;
        return r140465;
}
↓
double f(double x, double y) {
        double r140466 = x;
        double r140467 = 3.0;
        double r140468 = 8.0;
        double r140469 = r140467 / r140468;
        double r140470 = y;
        double r140471 = r140469 * r140470;
        double r140472 = r140466 - r140471;
        return r140472;
}

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)))