Average Error: 0.1 → 0.1
Time: 6.2s
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 r234088 = x;
        double r234089 = 3.0;
        double r234090 = 8.0;
        double r234091 = r234089 / r234090;
        double r234092 = y;
        double r234093 = r234091 * r234092;
        double r234094 = r234088 - r234093;
        return r234094;
}

double f(double x, double y) {
        double r234095 = x;
        double r234096 = 3.0;
        double r234097 = 8.0;
        double r234098 = r234096 / r234097;
        double r234099 = y;
        double r234100 = r234098 * r234099;
        double r234101 = r234095 - r234100;
        return r234101;
}

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