Average Error: 0.1 → 0.1
Time: 5.4s
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 r282958 = x;
        double r282959 = 3.0;
        double r282960 = 8.0;
        double r282961 = r282959 / r282960;
        double r282962 = y;
        double r282963 = r282961 * r282962;
        double r282964 = r282958 - r282963;
        return r282964;
}

double f(double x, double y) {
        double r282965 = x;
        double r282966 = 3.0;
        double r282967 = 8.0;
        double r282968 = r282966 / r282967;
        double r282969 = y;
        double r282970 = r282968 * r282969;
        double r282971 = r282965 - r282970;
        return r282971;
}

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