Average Error: 0.1 → 0.1
Time: 9.4s
Precision: binary64
\[\]
\[\]
double code(double x, double y, double z, double t, double a, double b, double c) {
	return ((double) (((double) (((double) (((double) (x * y)) + ((double) (((double) (z * t)) / 16.0)))) - ((double) (((double) (a * b)) / 4.0)))) + c));
}
double code(double x, double y, double z, double t, double a, double b, double c) {
	return ((double) (((double) (((double) (((double) (x * y)) + ((double) (((double) (z * t)) / 16.0)))) - ((double) (((double) (a * b)) / 4.0)))) + c));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Bits error versus b

Bits error versus c

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\]
  2. Final simplification0.1

    \[\leadsto \]

Reproduce

herbie shell --seed 2020191 
(FPCore (x y z t a b c)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, C"
  :precision binary64
  (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))