?

Average Accuracy: 97.8% → 97.8%
Time: 8.7s
Precision: binary64
Cost: 704

?

\[x + y \cdot \frac{z - t}{a - t} \]
\[x - y \cdot \frac{t - z}{a - t} \]
(FPCore (x y z t a) :precision binary64 (+ x (* y (/ (- z t) (- a t)))))
(FPCore (x y z t a) :precision binary64 (- x (* y (/ (- t z) (- a t)))))
double code(double x, double y, double z, double t, double a) {
	return x + (y * ((z - t) / (a - t)));
}
double code(double x, double y, double z, double t, double a) {
	return x - (y * ((t - z) / (a - t)));
}
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + (y * ((z - t) / (a - t)))
end function
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x - (y * ((t - z) / (a - t)))
end function
public static double code(double x, double y, double z, double t, double a) {
	return x + (y * ((z - t) / (a - t)));
}
public static double code(double x, double y, double z, double t, double a) {
	return x - (y * ((t - z) / (a - t)));
}
def code(x, y, z, t, a):
	return x + (y * ((z - t) / (a - t)))
def code(x, y, z, t, a):
	return x - (y * ((t - z) / (a - t)))
function code(x, y, z, t, a)
	return Float64(x + Float64(y * Float64(Float64(z - t) / Float64(a - t))))
end
function code(x, y, z, t, a)
	return Float64(x - Float64(y * Float64(Float64(t - z) / Float64(a - t))))
end
function tmp = code(x, y, z, t, a)
	tmp = x + (y * ((z - t) / (a - t)));
end
function tmp = code(x, y, z, t, a)
	tmp = x - (y * ((t - z) / (a - t)));
end
code[x_, y_, z_, t_, a_] := N[(x + N[(y * N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
code[x_, y_, z_, t_, a_] := N[(x - N[(y * N[(N[(t - z), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
x + y \cdot \frac{z - t}{a - t}
x - y \cdot \frac{t - z}{a - t}

Error?

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original97.8%
Target99.3%
Herbie97.8%
\[\begin{array}{l} \mathbf{if}\;y < -8.508084860551241 \cdot 10^{-17}:\\ \;\;\;\;x + y \cdot \frac{z - t}{a - t}\\ \mathbf{elif}\;y < 2.894426862792089 \cdot 10^{-49}:\\ \;\;\;\;x + \left(y \cdot \left(z - t\right)\right) \cdot \frac{1}{a - t}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{z - t}{a - t}\\ \end{array} \]

Derivation?

  1. Initial program 97.8%

    \[x + y \cdot \frac{z - t}{a - t} \]
  2. Final simplification97.8%

    \[\leadsto x - y \cdot \frac{t - z}{a - t} \]

Alternatives

Alternative 1
Accuracy82.8%
Cost1104
\[\begin{array}{l} t_1 := x + y \cdot \frac{t}{t - a}\\ t_2 := x - \frac{t - z}{\frac{a}{y}}\\ \mathbf{if}\;a \leq -2.5 \cdot 10^{+109}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq -3.3 \cdot 10^{-142}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq 1.95 \cdot 10^{-90}:\\ \;\;\;\;x + \frac{t - z}{\frac{t}{y}}\\ \mathbf{elif}\;a \leq 1.22 \cdot 10^{+70}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \]
Alternative 2
Accuracy83.9%
Cost841
\[\begin{array}{l} \mathbf{if}\;t \leq -3.4 \cdot 10^{-74} \lor \neg \left(t \leq 1.8 \cdot 10^{-159}\right):\\ \;\;\;\;x + y \cdot \frac{t}{t - a}\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot \frac{y}{a}\\ \end{array} \]
Alternative 3
Accuracy84.7%
Cost841
\[\begin{array}{l} \mathbf{if}\;t \leq -4.5 \cdot 10^{-73} \lor \neg \left(t \leq 6.6 \cdot 10^{-158}\right):\\ \;\;\;\;x + y \cdot \frac{t}{t - a}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{t - z}{\frac{a}{y}}\\ \end{array} \]
Alternative 4
Accuracy77.3%
Cost712
\[\begin{array}{l} \mathbf{if}\;t \leq -1.65 \cdot 10^{-69}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;t \leq 1.15 \cdot 10^{-21}:\\ \;\;\;\;x + y \cdot \frac{z}{a}\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]
Alternative 5
Accuracy77.3%
Cost712
\[\begin{array}{l} \mathbf{if}\;t \leq -3.9 \cdot 10^{-72}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;t \leq 2.55 \cdot 10^{-20}:\\ \;\;\;\;x + z \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]
Alternative 6
Accuracy69.0%
Cost456
\[\begin{array}{l} \mathbf{if}\;t \leq -8 \cdot 10^{-65}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;t \leq 2.7 \cdot 10^{-96}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]
Alternative 7
Accuracy54.7%
Cost64
\[x \]

Error

Reproduce?

herbie shell --seed 2023151 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisLine from plot-0.2.3.4, B"
  :precision binary64

  :herbie-target
  (if (< y -8.508084860551241e-17) (+ x (* y (/ (- z t) (- a t)))) (if (< y 2.894426862792089e-49) (+ x (* (* y (- z t)) (/ 1.0 (- a t)))) (+ x (* y (/ (- z t) (- a t))))))

  (+ x (* y (/ (- z t) (- a t)))))