Average Error: 0.1 → 0.1
Time: 5.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 r253510 = x;
        double r253511 = 3.0;
        double r253512 = 8.0;
        double r253513 = r253511 / r253512;
        double r253514 = y;
        double r253515 = r253513 * r253514;
        double r253516 = r253510 - r253515;
        return r253516;
}

double f(double x, double y) {
        double r253517 = x;
        double r253518 = 3.0;
        double r253519 = 8.0;
        double r253520 = r253518 / r253519;
        double r253521 = y;
        double r253522 = r253520 * r253521;
        double r253523 = r253517 - r253522;
        return r253523;
}

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