Average Error: 0.1 → 0.1
Time: 5.6s
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 r220753 = x;
        double r220754 = 3.0;
        double r220755 = 8.0;
        double r220756 = r220754 / r220755;
        double r220757 = y;
        double r220758 = r220756 * r220757;
        double r220759 = r220753 - r220758;
        return r220759;
}
↓
double f(double x, double y) {
        double r220760 = x;
        double r220761 = 3.0;
        double r220762 = 8.0;
        double r220763 = r220761 / r220762;
        double r220764 = y;
        double r220765 = r220763 * r220764;
        double r220766 = r220760 - r220765;
        return r220766;
}

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