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 r196801 = x;
        double r196802 = 3.0;
        double r196803 = 8.0;
        double r196804 = r196802 / r196803;
        double r196805 = y;
        double r196806 = r196804 * r196805;
        double r196807 = r196801 - r196806;
        return r196807;
}

double f(double x, double y) {
        double r196808 = x;
        double r196809 = 3.0;
        double r196810 = 8.0;
        double r196811 = r196809 / r196810;
        double r196812 = y;
        double r196813 = r196811 * r196812;
        double r196814 = r196808 - r196813;
        return r196814;
}

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