Average Error: 0.1 → 0.1
Time: 5.4s
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 r239696 = x;
        double r239697 = 3.0;
        double r239698 = 8.0;
        double r239699 = r239697 / r239698;
        double r239700 = y;
        double r239701 = r239699 * r239700;
        double r239702 = r239696 - r239701;
        return r239702;
}

double f(double x, double y) {
        double r239703 = x;
        double r239704 = 3.0;
        double r239705 = 8.0;
        double r239706 = r239704 / r239705;
        double r239707 = y;
        double r239708 = r239706 * r239707;
        double r239709 = r239703 - r239708;
        return r239709;
}

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