Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, A

Average Error: 6.6 → 2.1

Time: 30.0s

Precision: binary64

Cost: 2248

Math

\[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

↓

\[\begin{array}{l} t_1 := x \cdot y + z \cdot t\\ t_2 := a + b \cdot c\\ t_3 := c \cdot t_2\\ \mathbf{if}\;t_3 \leq -\infty:\\ \;\;\;\;2 \cdot \left(t_1 - c \cdot \left(c \cdot \left(b \cdot i\right)\right)\right)\\ \mathbf{elif}\;t_3 \leq 5 \cdot 10^{+285}:\\ \;\;\;\;2 \cdot \left(t_1 - i \cdot t_3\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(x \cdot y - c \cdot \left(t_2 \cdot i\right)\right)\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (* 2.0 (- (+ (* x y) (* z t)) (* (* (+ a (* b c)) c) i))))

↓

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ (* x y) (* z t))) (t_2 (+ a (* b c))) (t_3 (* c t_2)))
   (if (<= t_3 (- INFINITY))
     (* 2.0 (- t_1 (* c (* c (* b i)))))
     (if (<= t_3 5e+285)
       (* 2.0 (- t_1 (* i t_3)))
       (* 2.0 (- (* x y) (* c (* t_2 i))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}

↓

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = (x * y) + (z * t);
	double t_2 = a + (b * c);
	double t_3 = c * t_2;
	double tmp;
	if (t_3 <= -((double) INFINITY)) {
		tmp = 2.0 * (t_1 - (c * (c * (b * i))));
	} else if (t_3 <= 5e+285) {
		tmp = 2.0 * (t_1 - (i * t_3));
	} else {
		tmp = 2.0 * ((x * y) - (c * (t_2 * i)));
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}

↓

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = (x * y) + (z * t);
	double t_2 = a + (b * c);
	double t_3 = c * t_2;
	double tmp;
	if (t_3 <= -Double.POSITIVE_INFINITY) {
		tmp = 2.0 * (t_1 - (c * (c * (b * i))));
	} else if (t_3 <= 5e+285) {
		tmp = 2.0 * (t_1 - (i * t_3));
	} else {
		tmp = 2.0 * ((x * y) - (c * (t_2 * i)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))

↓

def code(x, y, z, t, a, b, c, i):
	t_1 = (x * y) + (z * t)
	t_2 = a + (b * c)
	t_3 = c * t_2
	tmp = 0
	if t_3 <= -math.inf:
		tmp = 2.0 * (t_1 - (c * (c * (b * i))))
	elif t_3 <= 5e+285:
		tmp = 2.0 * (t_1 - (i * t_3))
	else:
		tmp = 2.0 * ((x * y) - (c * (t_2 * i)))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(2.0 * Float64(Float64(Float64(x * y) + Float64(z * t)) - Float64(Float64(Float64(a + Float64(b * c)) * c) * i)))
end

↓

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(x * y) + Float64(z * t))
	t_2 = Float64(a + Float64(b * c))
	t_3 = Float64(c * t_2)
	tmp = 0.0
	if (t_3 <= Float64(-Inf))
		tmp = Float64(2.0 * Float64(t_1 - Float64(c * Float64(c * Float64(b * i)))));
	elseif (t_3 <= 5e+285)
		tmp = Float64(2.0 * Float64(t_1 - Float64(i * t_3)));
	else
		tmp = Float64(2.0 * Float64(Float64(x * y) - Float64(c * Float64(t_2 * i))));
	end
	return tmp
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
end

↓

function tmp_2 = code(x, y, z, t, a, b, c, i)
	t_1 = (x * y) + (z * t);
	t_2 = a + (b * c);
	t_3 = c * t_2;
	tmp = 0.0;
	if (t_3 <= -Inf)
		tmp = 2.0 * (t_1 - (c * (c * (b * i))));
	elseif (t_3 <= 5e+285)
		tmp = 2.0 * (t_1 - (i * t_3));
	else
		tmp = 2.0 * ((x * y) - (c * (t_2 * i)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(2.0 * N[(N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(c * t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(2.0 * N[(t$95$1 - N[(c * N[(c * N[(b * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 5e+285], N[(2.0 * N[(t$95$1 - N[(i * t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[(x * y), $MachinePrecision] - N[(c * N[(t$95$2 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Target

Original	6.6
Target	1.9
Herbie	2.1

\[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(a + b \cdot c\right) \cdot \left(c \cdot i\right)\right) \]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (+.f64 a (*.f64 b c)) c) < -inf.0

   1. Initial program 64.0

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in a around 0 40.8

      \[\leadsto 2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \color{blue}{{c}^{2} \cdot \left(i \cdot b\right)}\right) \]

   3. Simplified 19.5

      \[\leadsto 2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \color{blue}{c \cdot \left(c \cdot \left(i \cdot b\right)\right)}\right) \]
      Proof

      [Start] 40.8	\[ 2 \cdot \left(\left(x \cdot y + z \cdot t\right) - {c}^{2} \cdot \left(i \cdot b\right)\right) \]
      unpow2 [=>] 40.8	\[ 2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \color{blue}{\left(c \cdot c\right)} \cdot \left(i \cdot b\right)\right) \]
      associate-*l* [=>] 19.5	\[ 2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \color{blue}{c \cdot \left(c \cdot \left(i \cdot b\right)\right)}\right) \]

   if -inf.0 < (*.f64 (+.f64 a (*.f64 b c)) c) < 5.00000000000000016e285

   1. Initial program 0.3

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   if 5.00000000000000016e285 < (*.f64 (+.f64 a (*.f64 b c)) c)

   1. Initial program 54.2

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in z around 0 15.5

      \[\leadsto 2 \cdot \color{blue}{\left(y \cdot x - c \cdot \left(i \cdot \left(c \cdot b + a\right)\right)\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 2.1

   \[\leadsto \begin{array}{l} \mathbf{if}\;c \cdot \left(a + b \cdot c\right) \leq -\infty:\\ \;\;\;\;2 \cdot \left(\left(x \cdot y + z \cdot t\right) - c \cdot \left(c \cdot \left(b \cdot i\right)\right)\right)\\ \mathbf{elif}\;c \cdot \left(a + b \cdot c\right) \leq 5 \cdot 10^{+285}:\\ \;\;\;\;2 \cdot \left(\left(x \cdot y + z \cdot t\right) - i \cdot \left(c \cdot \left(a + b \cdot c\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(x \cdot y - c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right)\\ \end{array} \]

Alternatives

Alternative 1
Error	11.3
Cost	2128

\[\begin{array}{l} t_1 := x \cdot y + z \cdot t\\ t_2 := 2 \cdot \left(t_1 - c \cdot \left(b \cdot \left(c \cdot i\right)\right)\right)\\ \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{-80}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \cdot y \leq 10^{-266}:\\ \;\;\;\;2 \cdot \left(z \cdot t - c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right)\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-62}:\\ \;\;\;\;2 \cdot \left(t_1 - i \cdot \left(c \cdot \left(b \cdot c\right)\right)\right)\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-17}:\\ \;\;\;\;2 \cdot \left(t_1 - i \cdot \left(a \cdot c\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \]

Alternative 2
Error	21.5
Cost	1756

\[\begin{array}{l} t_1 := 2 \cdot \left(x \cdot y - c \cdot \left(a \cdot i\right)\right)\\ t_2 := 2 \cdot \left(x \cdot y + z \cdot t\right)\\ \mathbf{if}\;c \leq -4.1 \cdot 10^{+99}:\\ \;\;\;\;c \cdot \left(b \cdot \left(i \cdot \left(c \cdot -2\right)\right)\right)\\ \mathbf{elif}\;c \leq 0.00112:\\ \;\;\;\;t_2\\ \mathbf{elif}\;c \leq 8.2 \cdot 10^{+14}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;c \leq 1.3 \cdot 10^{+37}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;c \leq 1.52 \cdot 10^{+50}:\\ \;\;\;\;2 \cdot \left(z \cdot t - b \cdot \left(i \cdot \left(c \cdot c\right)\right)\right)\\ \mathbf{elif}\;c \leq 7.6 \cdot 10^{+67}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;c \leq 4 \cdot 10^{+124}:\\ \;\;\;\;2 \cdot \left(z \cdot t - i \cdot \left(b \cdot \left(c \cdot c\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right) \cdot -2\\ \end{array} \]

Alternative 3
Error	21.5
Cost	1756

\[\begin{array}{l} t_1 := 2 \cdot \left(x \cdot y - c \cdot \left(a \cdot i\right)\right)\\ t_2 := 2 \cdot \left(x \cdot y + z \cdot t\right)\\ \mathbf{if}\;c \leq -3.2 \cdot 10^{+100}:\\ \;\;\;\;c \cdot \left(b \cdot \left(i \cdot \left(c \cdot -2\right)\right)\right)\\ \mathbf{elif}\;c \leq 0.00112:\\ \;\;\;\;t_2\\ \mathbf{elif}\;c \leq 2.9 \cdot 10^{+15}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;c \leq 2.7 \cdot 10^{+37}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;c \leq 3.7 \cdot 10^{+50}:\\ \;\;\;\;2 \cdot \left(z \cdot t - \left(b \cdot i\right) \cdot \left(c \cdot c\right)\right)\\ \mathbf{elif}\;c \leq 1.7 \cdot 10^{+67}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;c \leq 1.65 \cdot 10^{+126}:\\ \;\;\;\;2 \cdot \left(z \cdot t - i \cdot \left(b \cdot \left(c \cdot c\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right) \cdot -2\\ \end{array} \]

Alternative 4
Error	20.5
Cost	1756

\[\begin{array}{l} t_1 := 2 \cdot \left(x \cdot y - c \cdot \left(a \cdot i\right)\right)\\ t_2 := 2 \cdot \left(x \cdot y + z \cdot t\right)\\ t_3 := 2 \cdot \left(x \cdot y - c \cdot \left(c \cdot \left(b \cdot i\right)\right)\right)\\ \mathbf{if}\;c \leq -1.2 \cdot 10^{+79}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;c \leq 0.00112:\\ \;\;\;\;t_2\\ \mathbf{elif}\;c \leq 1.55 \cdot 10^{+15}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;c \leq 7 \cdot 10^{+35}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;c \leq 4 \cdot 10^{+50}:\\ \;\;\;\;2 \cdot \left(z \cdot t - \left(b \cdot i\right) \cdot \left(c \cdot c\right)\right)\\ \mathbf{elif}\;c \leq 5.3 \cdot 10^{+66}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;c \leq 9.2 \cdot 10^{+130}:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;\left(c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right) \cdot -2\\ \end{array} \]

Alternative 5
Error	19.5
Cost	1620

\[\begin{array}{l} t_1 := 2 \cdot \left(z \cdot t - c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right)\\ t_2 := 2 \cdot \left(x \cdot y - c \cdot \left(c \cdot \left(b \cdot i\right)\right)\right)\\ \mathbf{if}\;c \leq -2.2 \cdot 10^{+78}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;c \leq 8 \cdot 10^{-101}:\\ \;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\ \mathbf{elif}\;c \leq 8.4 \cdot 10^{-51}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;c \leq 0.0039:\\ \;\;\;\;t_2\\ \mathbf{elif}\;c \leq 2.5 \cdot 10^{+14}:\\ \;\;\;\;2 \cdot \left(x \cdot y - c \cdot \left(a \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 6
Error	21.5
Cost	1360

\[\begin{array}{l} \mathbf{if}\;c \leq -2.4 \cdot 10^{+97}:\\ \;\;\;\;c \cdot \left(b \cdot \left(i \cdot \left(c \cdot -2\right)\right)\right)\\ \mathbf{elif}\;c \leq 0.00072:\\ \;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\ \mathbf{elif}\;c \leq 2.8 \cdot 10^{+14}:\\ \;\;\;\;2 \cdot \left(x \cdot y - c \cdot \left(a \cdot i\right)\right)\\ \mathbf{elif}\;c \leq 2.9 \cdot 10^{+48}:\\ \;\;\;\;2 \cdot \left(z \cdot t - b \cdot \left(i \cdot \left(c \cdot c\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right) \cdot -2\\ \end{array} \]

Alternative 7
Error	19.0
Cost	1356

\[\begin{array}{l} t_1 := c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\\ \mathbf{if}\;c \leq -8.2 \cdot 10^{+77}:\\ \;\;\;\;2 \cdot \left(x \cdot y - c \cdot \left(c \cdot \left(b \cdot i\right)\right)\right)\\ \mathbf{elif}\;c \leq 1.8 \cdot 10^{-117}:\\ \;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\ \mathbf{elif}\;c \leq 10^{+34}:\\ \;\;\;\;2 \cdot \left(x \cdot y - t_1\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot t - t_1\right)\\ \end{array} \]

Alternative 8
Error	21.7
Cost	1233

\[\begin{array}{l} \mathbf{if}\;c \leq -3.2 \cdot 10^{+100}:\\ \;\;\;\;c \cdot \left(b \cdot \left(i \cdot \left(c \cdot -2\right)\right)\right)\\ \mathbf{elif}\;c \leq 2.75 \cdot 10^{-7} \lor \neg \left(c \leq 8.2 \cdot 10^{+14}\right) \land c \leq 2 \cdot 10^{+43}:\\ \;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\ \mathbf{else}:\\ \;\;\;\;\left(c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right) \cdot -2\\ \end{array} \]

Alternative 9
Error	21.5
Cost	1232

\[\begin{array}{l} t_1 := 2 \cdot \left(x \cdot y + z \cdot t\right)\\ \mathbf{if}\;c \leq -2.65 \cdot 10^{+98}:\\ \;\;\;\;c \cdot \left(b \cdot \left(i \cdot \left(c \cdot -2\right)\right)\right)\\ \mathbf{elif}\;c \leq 0.00044:\\ \;\;\;\;t_1\\ \mathbf{elif}\;c \leq 8.5 \cdot 10^{+14}:\\ \;\;\;\;2 \cdot \left(x \cdot y - c \cdot \left(a \cdot i\right)\right)\\ \mathbf{elif}\;c \leq 1.6 \cdot 10^{+44}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;\left(c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right) \cdot -2\\ \end{array} \]

Alternative 10
Error	10.0
Cost	1224

\[\begin{array}{l} \mathbf{if}\;c \leq -1.6 \cdot 10^{+78}:\\ \;\;\;\;2 \cdot \left(x \cdot y - c \cdot \left(c \cdot \left(b \cdot i\right)\right)\right)\\ \mathbf{elif}\;c \leq 2.9 \cdot 10^{+34}:\\ \;\;\;\;2 \cdot \left(\left(x \cdot y + z \cdot t\right) - i \cdot \left(a \cdot c\right)\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot t - c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right)\\ \end{array} \]

Alternative 11
Error	9.0
Cost	1224

\[\begin{array}{l} t_1 := x \cdot y + z \cdot t\\ \mathbf{if}\;c \leq -7.5 \cdot 10^{-21}:\\ \;\;\;\;2 \cdot \left(t_1 - c \cdot \left(c \cdot \left(b \cdot i\right)\right)\right)\\ \mathbf{elif}\;c \leq 1.7 \cdot 10^{+34}:\\ \;\;\;\;2 \cdot \left(t_1 - i \cdot \left(a \cdot c\right)\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot t - c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right)\\ \end{array} \]

Alternative 12
Error	8.9
Cost	1224

\[\begin{array}{l} t_1 := x \cdot y + z \cdot t\\ \mathbf{if}\;c \leq -6 \cdot 10^{-20}:\\ \;\;\;\;2 \cdot \left(t_1 - c \cdot \left(b \cdot \left(c \cdot i\right)\right)\right)\\ \mathbf{elif}\;c \leq 2.9 \cdot 10^{+34}:\\ \;\;\;\;2 \cdot \left(t_1 - i \cdot \left(a \cdot c\right)\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot t - c \cdot \left(\left(a + b \cdot c\right) \cdot i\right)\right)\\ \end{array} \]

Alternative 13
Error	1.9
Cost	1216

\[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(a + b \cdot c\right) \cdot \left(c \cdot i\right)\right) \]

Alternative 14
Error	22.4
Cost	973

\[\begin{array}{l} \mathbf{if}\;c \leq -1.1 \cdot 10^{+100} \lor \neg \left(c \leq 1.22 \cdot 10^{+117}\right) \land c \leq 3.1 \cdot 10^{+183}:\\ \;\;\;\;\left(c \cdot \left(c \cdot \left(b \cdot i\right)\right)\right) \cdot -2\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\ \end{array} \]

Alternative 15
Error	22.0
Cost	841

\[\begin{array}{l} \mathbf{if}\;c \leq -1.8 \cdot 10^{+98} \lor \neg \left(c \leq 5.2 \cdot 10^{+122}\right):\\ \;\;\;\;c \cdot \left(b \cdot \left(i \cdot \left(c \cdot -2\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\ \end{array} \]

Alternative 16
Error	37.3
Cost	585

\[\begin{array}{l} \mathbf{if}\;z \leq -3.5 \cdot 10^{+147} \lor \neg \left(z \leq 1.52 \cdot 10^{-68}\right):\\ \;\;\;\;2 \cdot \left(z \cdot t\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(x \cdot y\right)\\ \end{array} \]

Alternative 17
Error	42.9
Cost	320

\[2 \cdot \left(z \cdot t\right) \]

Reproduce

herbie shell --seed 2023054 
(FPCore (x y z t a b c i)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, A"
  :precision binary64

  :herbie-target
  (* 2.0 (- (+ (* x y) (* z t)) (* (+ a (* b c)) (* c i))))

  (* 2.0 (- (+ (* x y) (* z t)) (* (* (+ a (* b c)) c) i))))