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 r229451 = x;
        double r229452 = 3.0;
        double r229453 = 8.0;
        double r229454 = r229452 / r229453;
        double r229455 = y;
        double r229456 = r229454 * r229455;
        double r229457 = r229451 - r229456;
        return r229457;
}
↓
double f(double x, double y) {
        double r229458 = x;
        double r229459 = 3.0;
        double r229460 = 8.0;
        double r229461 = r229459 / r229460;
        double r229462 = y;
        double r229463 = r229461 * r229462;
        double r229464 = r229458 - r229463;
        return r229464;
}

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