Average Error: 0.1 → 0.0
Time: 2.1s
Precision: binary64
\[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t\]
↓
\[1 \cdot \frac{x}{8} + \left(t - y \cdot \frac{z}{2}\right)\]
\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t
↓
1 \cdot \frac{x}{8} + \left(t - y \cdot \frac{z}{2}\right)
(FPCore (x y z t)
 :precision binary64
 (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))
↓
(FPCore (x y z t)
 :precision binary64
 (+ (* 1.0 (/ x 8.0)) (- t (* y (/ z 2.0)))))
double code(double x, double y, double z, double t) {
	return ((double) (((double) (((double) ((1.0 / 8.0) * x)) - (((double) (y * z)) / 2.0))) + t));
}
↓
double code(double x, double y, double z, double t) {
	return ((double) (((double) (1.0 * (x / 8.0))) + ((double) (t - ((double) (y * (z / 2.0)))))));
}

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.1
Target0.0
Herbie0.0
\[\left(\frac{x}{8} + t\right) - \frac{z}{2} \cdot y\]

Derivation

  1. Initial program 0.1

    \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t\]

  2. Simplified0.0

    \[\leadsto \color{blue}{1 \cdot \frac{x}{8} + \left(t - y \cdot \frac{z}{2}\right)}\]

  3. Final simplification0.0

    \[\leadsto 1 \cdot \frac{x}{8} + \left(t - y \cdot \frac{z}{2}\right)\]

Reproduce

herbie shell --seed 2020198 
(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))