Average Error: 0.1 → 0.1
Time: 7.7s
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 r204061 = x;
        double r204062 = 3.0;
        double r204063 = 8.0;
        double r204064 = r204062 / r204063;
        double r204065 = y;
        double r204066 = r204064 * r204065;
        double r204067 = r204061 - r204066;
        return r204067;
}

double f(double x, double y) {
        double r204068 = x;
        double r204069 = 3.0;
        double r204070 = 8.0;
        double r204071 = r204069 / r204070;
        double r204072 = y;
        double r204073 = r204071 * r204072;
        double r204074 = r204068 - r204073;
        return r204074;
}

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