Average Error: 0.1 → 0.1
Time: 19.3s
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 r189879 = x;
        double r189880 = 3.0;
        double r189881 = 8.0;
        double r189882 = r189880 / r189881;
        double r189883 = y;
        double r189884 = r189882 * r189883;
        double r189885 = r189879 - r189884;
        return r189885;
}
↓
double f(double x, double y) {
        double r189886 = x;
        double r189887 = 3.0;
        double r189888 = 8.0;
        double r189889 = r189887 / r189888;
        double r189890 = y;
        double r189891 = r189889 * r189890;
        double r189892 = r189886 - r189891;
        return r189892;
}

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