Average Error: 0.1 → 0.1
Time: 4.3s
Precision: binary64
Cost: 320
\[x - \frac{3}{8} \cdot y\]
↓
\[x - 0.375 \cdot y\]
x - \frac{3}{8} \cdot y
↓
x - 0.375 \cdot y
(FPCore (x y) :precision binary64 (- x (* (/ 3.0 8.0) y)))
↓
(FPCore (x y) :precision binary64 (- x (* 0.375 y)))
double code(double x, double y) {
	return x - ((3.0 / 8.0) * y);
}
↓
double code(double x, double y) {
	return x - (0.375 * y);
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Alternatives

Alternative 1
Error16.9
Cost1050
\[\begin{array}{l} \mathbf{if}\;y \leq -4.884132055789445 \cdot 10^{-63} \lor \neg \left(y \leq 2.253701988489841 \cdot 10^{-59} \lor \neg \left(y \leq 7.147788070644602 \cdot 10^{-50}\right) \land \left(y \leq 3.182123080566351 \cdot 10^{+25} \lor \neg \left(y \leq 6.561011205482206 \cdot 10^{+39}\right) \land y \leq 5.981266544615255 \cdot 10^{+61}\right)\right):\\ \;\;\;\;y \cdot -0.375\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array}\]
Alternative 2
Error31.5
Cost64
\[x\]
Alternative 3
Error61.8
Cost64
\[1\]

Error

Derivation

  1. Initial program 0.1

    \[x - \frac{3}{8} \cdot y\]

  2. Simplified0.1

    \[\leadsto \color{blue}{x - 0.375 \cdot y}\]

  3. Simplified0.1

    \[\leadsto \color{blue}{x - 0.375 \cdot y}\]

  4. Final simplification0.1

    \[\leadsto x - 0.375 \cdot y\]

Reproduce

herbie shell --seed 2021044 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (/ 3.0 8.0) y)))