Average Error: 0.1 → 0.1
Time: 5.3s
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 r260074 = x;
        double r260075 = 3.0;
        double r260076 = 8.0;
        double r260077 = r260075 / r260076;
        double r260078 = y;
        double r260079 = r260077 * r260078;
        double r260080 = r260074 - r260079;
        return r260080;
}
↓
double f(double x, double y) {
        double r260081 = x;
        double r260082 = 3.0;
        double r260083 = 8.0;
        double r260084 = r260082 / r260083;
        double r260085 = y;
        double r260086 = r260084 * r260085;
        double r260087 = r260081 - r260086;
        return r260087;
}

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