Average Error: 0.0 → 0.0
Time: 2.1s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y, double z, double t) {
	return ((double) (((double) (((double) (((double) (1.0 / 8.0)) * x)) - ((double) (((double) (y * z)) / 2.0)))) + t));
}

↓
double code(double x, double y, double z, double t) {
	return ((double) (((double) (((double) (((double) (1.0 / 8.0)) * x)) - ((double) (((double) (y * z)) / 2.0)))) + t));
}

Error
Bits error versus x
Bits error versus y
Bits error versus z
Bits error versus t
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original0.0
Target0.0
Herbie0.0
\[\]
Derivation
  1. Initial program 0.0
    \[\]
  2. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x y z t)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, B"
  :precision binary64

  :herbie-target
  (- (+ (/ x 8.0) t) (* (/ z 2.0) y))

  (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))