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 r248037 = x;
        double r248038 = 3.0;
        double r248039 = 8.0;
        double r248040 = r248038 / r248039;
        double r248041 = y;
        double r248042 = r248040 * r248041;
        double r248043 = r248037 - r248042;
        return r248043;
}

double f(double x, double y) {
        double r248044 = x;
        double r248045 = 3.0;
        double r248046 = 8.0;
        double r248047 = r248045 / r248046;
        double r248048 = y;
        double r248049 = r248047 * r248048;
        double r248050 = r248044 - r248049;
        return r248050;
}

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