Average Error: 0.1 → 0.1
Time: 10.9s
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 r282030 = x;
        double r282031 = 3.0;
        double r282032 = 8.0;
        double r282033 = r282031 / r282032;
        double r282034 = y;
        double r282035 = r282033 * r282034;
        double r282036 = r282030 - r282035;
        return r282036;
}

double f(double x, double y) {
        double r282037 = x;
        double r282038 = 3.0;
        double r282039 = 8.0;
        double r282040 = r282038 / r282039;
        double r282041 = y;
        double r282042 = r282040 * r282041;
        double r282043 = r282037 - r282042;
        return r282043;
}

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