Average Error: 0.1 → 0.1
Time: 18.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 r167332 = x;
        double r167333 = 3.0;
        double r167334 = 8.0;
        double r167335 = r167333 / r167334;
        double r167336 = y;
        double r167337 = r167335 * r167336;
        double r167338 = r167332 - r167337;
        return r167338;
}
↓
double f(double x, double y) {
        double r167339 = x;
        double r167340 = 3.0;
        double r167341 = 8.0;
        double r167342 = r167340 / r167341;
        double r167343 = y;
        double r167344 = r167342 * r167343;
        double r167345 = r167339 - r167344;
        return r167345;
}

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