Average Error: 0.1 → 0.1
Time: 9.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 r244252 = x;
        double r244253 = 3.0;
        double r244254 = 8.0;
        double r244255 = r244253 / r244254;
        double r244256 = y;
        double r244257 = r244255 * r244256;
        double r244258 = r244252 - r244257;
        return r244258;
}
↓
double f(double x, double y) {
        double r244259 = x;
        double r244260 = 3.0;
        double r244261 = 8.0;
        double r244262 = r244260 / r244261;
        double r244263 = y;
        double r244264 = r244262 * r244263;
        double r244265 = r244259 - r244264;
        return r244265;
}

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