Average Error: 0.1 → 0.1
Time: 6.4s
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 r277654 = x;
        double r277655 = 3.0;
        double r277656 = 8.0;
        double r277657 = r277655 / r277656;
        double r277658 = y;
        double r277659 = r277657 * r277658;
        double r277660 = r277654 - r277659;
        return r277660;
}
↓
double f(double x, double y) {
        double r277661 = x;
        double r277662 = 3.0;
        double r277663 = 8.0;
        double r277664 = r277662 / r277663;
        double r277665 = y;
        double r277666 = r277664 * r277665;
        double r277667 = r277661 - r277666;
        return r277667;
}

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