Average Error: 0.1 → 0.1
Time: 5.6s
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 r276004 = x;
        double r276005 = 3.0;
        double r276006 = 8.0;
        double r276007 = r276005 / r276006;
        double r276008 = y;
        double r276009 = r276007 * r276008;
        double r276010 = r276004 - r276009;
        return r276010;
}
↓
double f(double x, double y) {
        double r276011 = x;
        double r276012 = 3.0;
        double r276013 = 8.0;
        double r276014 = r276012 / r276013;
        double r276015 = y;
        double r276016 = r276014 * r276015;
        double r276017 = r276011 - r276016;
        return r276017;
}

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