Average Error: 0.1 → 0.1
Time: 18.5s
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 r171703 = x;
        double r171704 = 3.0;
        double r171705 = 8.0;
        double r171706 = r171704 / r171705;
        double r171707 = y;
        double r171708 = r171706 * r171707;
        double r171709 = r171703 - r171708;
        return r171709;
}

double f(double x, double y) {
        double r171710 = x;
        double r171711 = 3.0;
        double r171712 = 8.0;
        double r171713 = r171711 / r171712;
        double r171714 = y;
        double r171715 = r171713 * r171714;
        double r171716 = r171710 - r171715;
        return r171716;
}

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