Average Error: 0.1 → 0.1
Time: 17.0s
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 r160572 = x;
        double r160573 = 3.0;
        double r160574 = 8.0;
        double r160575 = r160573 / r160574;
        double r160576 = y;
        double r160577 = r160575 * r160576;
        double r160578 = r160572 - r160577;
        return r160578;
}
↓
double f(double x, double y) {
        double r160579 = x;
        double r160580 = 3.0;
        double r160581 = 8.0;
        double r160582 = r160580 / r160581;
        double r160583 = y;
        double r160584 = r160582 * r160583;
        double r160585 = r160579 - r160584;
        return r160585;
}

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