Average Error: 0.1 → 0.1
Time: 5.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 r216311 = x;
        double r216312 = 3.0;
        double r216313 = 8.0;
        double r216314 = r216312 / r216313;
        double r216315 = y;
        double r216316 = r216314 * r216315;
        double r216317 = r216311 - r216316;
        return r216317;
}

double f(double x, double y) {
        double r216318 = x;
        double r216319 = 3.0;
        double r216320 = 8.0;
        double r216321 = r216319 / r216320;
        double r216322 = y;
        double r216323 = r216321 * r216322;
        double r216324 = r216318 - r216323;
        return r216324;
}

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