Average Error: 0.1 → 0.1
Time: 5.8s
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 r250769 = x;
        double r250770 = 3.0;
        double r250771 = 8.0;
        double r250772 = r250770 / r250771;
        double r250773 = y;
        double r250774 = r250772 * r250773;
        double r250775 = r250769 - r250774;
        return r250775;
}
↓
double f(double x, double y) {
        double r250776 = x;
        double r250777 = 3.0;
        double r250778 = 8.0;
        double r250779 = r250777 / r250778;
        double r250780 = y;
        double r250781 = r250779 * r250780;
        double r250782 = r250776 - r250781;
        return r250782;
}

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