Average Error: 0.1 → 0.1
Time: 5.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 r259593 = x;
        double r259594 = 3.0;
        double r259595 = 8.0;
        double r259596 = r259594 / r259595;
        double r259597 = y;
        double r259598 = r259596 * r259597;
        double r259599 = r259593 - r259598;
        return r259599;
}

double f(double x, double y) {
        double r259600 = x;
        double r259601 = 3.0;
        double r259602 = 8.0;
        double r259603 = r259601 / r259602;
        double r259604 = y;
        double r259605 = r259603 * r259604;
        double r259606 = r259600 - r259605;
        return r259606;
}

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