Average Error: 0.1 → 0.1
Time: 7.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 r894 = x;
        double r895 = 3.0;
        double r896 = 8.0;
        double r897 = r895 / r896;
        double r898 = y;
        double r899 = r897 * r898;
        double r900 = r894 - r899;
        return r900;
}
↓
double f(double x, double y) {
        double r901 = x;
        double r902 = 3.0;
        double r903 = 8.0;
        double r904 = r902 / r903;
        double r905 = y;
        double r906 = r904 * r905;
        double r907 = r901 - r906;
        return r907;
}

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