Average Error: 0.1 → 0.1
Time: 12.0s
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 r196092 = x;
        double r196093 = 3.0;
        double r196094 = 8.0;
        double r196095 = r196093 / r196094;
        double r196096 = y;
        double r196097 = r196095 * r196096;
        double r196098 = r196092 - r196097;
        return r196098;
}
↓
double f(double x, double y) {
        double r196099 = x;
        double r196100 = 3.0;
        double r196101 = 8.0;
        double r196102 = r196100 / r196101;
        double r196103 = y;
        double r196104 = r196102 * r196103;
        double r196105 = r196099 - r196104;
        return r196105;
}

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