Average Error: 0.1 → 0.1
Time: 414.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 r208758 = x;
        double r208759 = 3.0;
        double r208760 = 8.0;
        double r208761 = r208759 / r208760;
        double r208762 = y;
        double r208763 = r208761 * r208762;
        double r208764 = r208758 - r208763;
        return r208764;
}
↓
double f(double x, double y) {
        double r208765 = x;
        double r208766 = 3.0;
        double r208767 = 8.0;
        double r208768 = r208766 / r208767;
        double r208769 = y;
        double r208770 = r208768 * r208769;
        double r208771 = r208765 - r208770;
        return r208771;
}

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