Average Error: 0.1 → 0.1
Time: 445.0ms
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 r175812 = x;
        double r175813 = 3.0;
        double r175814 = 8.0;
        double r175815 = r175813 / r175814;
        double r175816 = y;
        double r175817 = r175815 * r175816;
        double r175818 = r175812 - r175817;
        return r175818;
}
↓
double f(double x, double y) {
        double r175819 = x;
        double r175820 = 3.0;
        double r175821 = 8.0;
        double r175822 = r175820 / r175821;
        double r175823 = y;
        double r175824 = r175822 * r175823;
        double r175825 = r175819 - r175824;
        return r175825;
}

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