Average Error: 0.1 → 0.1
Time: 4.5s
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 r224475 = x;
        double r224476 = 3.0;
        double r224477 = 8.0;
        double r224478 = r224476 / r224477;
        double r224479 = y;
        double r224480 = r224478 * r224479;
        double r224481 = r224475 - r224480;
        return r224481;
}
↓
double f(double x, double y) {
        double r224482 = x;
        double r224483 = 3.0;
        double r224484 = 8.0;
        double r224485 = r224483 / r224484;
        double r224486 = y;
        double r224487 = r224485 * r224486;
        double r224488 = r224482 - r224487;
        return r224488;
}

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