Average Error: 0.1 → 0.1
Time: 16.8s
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 r825197 = x;
        double r825198 = 3.0;
        double r825199 = 8.0;
        double r825200 = r825198 / r825199;
        double r825201 = y;
        double r825202 = r825200 * r825201;
        double r825203 = r825197 - r825202;
        return r825203;
}

double f(double x, double y) {
        double r825204 = x;
        double r825205 = 3.0;
        double r825206 = 8.0;
        double r825207 = r825205 / r825206;
        double r825208 = y;
        double r825209 = r825207 * r825208;
        double r825210 = r825204 - r825209;
        return r825210;
}

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