Average Error: 0.1 → 0.1
Time: 4.7s
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 r234945 = x;
        double r234946 = 3.0;
        double r234947 = 8.0;
        double r234948 = r234946 / r234947;
        double r234949 = y;
        double r234950 = r234948 * r234949;
        double r234951 = r234945 - r234950;
        return r234951;
}
↓
double f(double x, double y) {
        double r234952 = x;
        double r234953 = 3.0;
        double r234954 = 8.0;
        double r234955 = r234953 / r234954;
        double r234956 = y;
        double r234957 = r234955 * r234956;
        double r234958 = r234952 - r234957;
        return r234958;
}

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