Average Error: 0.1 → 0.1
Time: 7.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 r179090 = x;
        double r179091 = 3.0;
        double r179092 = 8.0;
        double r179093 = r179091 / r179092;
        double r179094 = y;
        double r179095 = r179093 * r179094;
        double r179096 = r179090 - r179095;
        return r179096;
}
↓
double f(double x, double y) {
        double r179097 = x;
        double r179098 = 3.0;
        double r179099 = 8.0;
        double r179100 = r179098 / r179099;
        double r179101 = y;
        double r179102 = r179100 * r179101;
        double r179103 = r179097 - r179102;
        return r179103;
}

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