Average Error: 0.1 → 0.1
Time: 18.1s
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 r252070 = x;
        double r252071 = 3.0;
        double r252072 = 8.0;
        double r252073 = r252071 / r252072;
        double r252074 = y;
        double r252075 = r252073 * r252074;
        double r252076 = r252070 - r252075;
        return r252076;
}

double f(double x, double y) {
        double r252077 = x;
        double r252078 = 3.0;
        double r252079 = 8.0;
        double r252080 = r252078 / r252079;
        double r252081 = y;
        double r252082 = r252080 * r252081;
        double r252083 = r252077 - r252082;
        return r252083;
}

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