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 r320600 = x;
        double r320601 = 3.0;
        double r320602 = 8.0;
        double r320603 = r320601 / r320602;
        double r320604 = y;
        double r320605 = r320603 * r320604;
        double r320606 = r320600 - r320605;
        return r320606;
}
↓
double f(double x, double y) {
        double r320607 = x;
        double r320608 = 3.0;
        double r320609 = 8.0;
        double r320610 = r320608 / r320609;
        double r320611 = y;
        double r320612 = r320610 * r320611;
        double r320613 = r320607 - r320612;
        return r320613;
}

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