Metrics for Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, A

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze67.0ms (4.2%)

Memory

-12.5MiB live, 36.7MiB allocated; 15ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
0%	0%	99.9%	0.1%	0%	0%	0%	3
50%	49.9%	49.9%	0.1%	0%	0%	0%	4
50%	49.9%	49.9%	0.1%	0%	0%	0%	5
50%	49.9%	49.9%	0.1%	0%	0%	0%	6
75%	74.9%	25%	0.1%	0%	0%	0%	7
75%	74.9%	25%	0.1%	0%	0%	0%	8
75%	74.9%	25%	0.1%	0%	0%	0%	9
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	10
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	11
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	12

Compiler

Compiled 7 to 7 computations (0% saved)

sample651.0ms (40.8%)

Memory

13.5MiB live, 720.6MiB allocated; 167ms collecting garbage

Samples

335.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 142.0ms

ival-mult: 74.0ms (52.2% of total)

ival-div: 62.0ms (43.8% of total)

ival-assert: 3.0ms (2.1% of total)

adjust: 2.0ms (1.4% of total)

Bogosity

explain52.0ms (3.3%)

Memory

3.4MiB live, 96.3MiB allocated; 11ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
27	-	1	(7.215370306330903e-306 3.634589909088204e-14 -1.0761854314696118e-157)	`(/.f64 (*.f64 x y) z)`
0	-	0	-	`y`
0	-	0	-	`z`
0	-	0	-	`(*.f64 x y)`
0	-	0	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`/.f64`	`(/.f64 (*.f64 x y) z)`	u/n	15	0
↳	`(*.f64 x y)`	underflow	34
`/.f64`	`(/.f64 (*.f64 x y) z)`	o/n	11	0
↳	`(*.f64 x y)`	overflow	36

Confusion

	Predicted +	Predicted -
+	26	1
-	0	229

Precision

1.0

Recall

0.9629629629629629

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	26	0	1
-	0	0	229

Precision?

1.0

Recall?

0.9629629629629629

Freqs

test

number	freq
0	230
1	26

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

28.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

Click to see histograms. Total time spent on operations: 8.0ms

ival-div: 4.0ms (47.2% of total)

ival-mult: 4.0ms (47.2% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess21.0ms (1.3%)

Memory

29.7MiB live, 29.7MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	53
1	46	53
2	86	53
3	145	53
4	210	53
5	280	53
0	5	5
0	7	5
1	10	5
2	13	5
3	14	5
0	14	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) z)

Outputs
(/.f64 (*.f64 x y) z)
(/.f64 (*.f64 y x) z)

Symmetry

(negabs x)

(negabs y)

(negabs z)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 3 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.9MiB live, 0.9MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	90.1%	(/.f64 (*.f64 x y) z)

Compiler

Compiled 5 to 5 computations (0% saved)

series38.0ms (2.4%)

Memory

-28.3MiB live, 18.1MiB allocated; 8ms collecting garbage

Counts

5 → 5

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) z)
(*.f64 x y)
x
y
z

Outputs
#s(approx (/ (* x y) z) #s(hole binary64 (/ (* x y) z)))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))
#s(approx z #s(hole binary64 z))

Calls

9 calls:

Time	Variable		Point	Expression
32.0ms	y	@	-inf	((/ (* x y) z) (* x y) x y z)
1.0ms	x	@	-inf	((/ (* x y) z) (* x y) x y z)
1.0ms	x	@	inf	((/ (* x y) z) (* x y) x y z)
1.0ms	y	@	inf	((/ (* x y) z) (* x y) x y z)
1.0ms	x	@	0	((/ (* x y) z) (* x y) x y z)

rewrite17.0ms (1%)

Memory

21.1MiB live, 21.1MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	38
0	13	38
1	19	38
2	36	38
3	71	38
4	107	38
0	107	38

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

10 → 24

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) z)
(*.f64 x y)
x
y
z
#s(approx (/ (* x y) z) #s(hole binary64 (/ (* x y) z)))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))
#s(approx z #s(hole binary64 z))

Outputs
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))
(*.f64 (/.f64 x z) y)
(*.f64 (neg.f64 x) (/.f64 (neg.f64 y) z))
(*.f64 (neg.f64 y) (/.f64 (neg.f64 x) z))
(*.f64 (/.f64 y z) x)
(*.f64 y (/.f64 x z))
(*.f64 x (/.f64 y z))
(/.f64 (*.f64 (neg.f64 x) y) (neg.f64 z))
(/.f64 (*.f64 y x) z)
(neg.f64 (*.f64 (/.f64 (neg.f64 x) z) y))
(*.f64 (neg.f64 x) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 x))
(*.f64 y x)
(*.f64 x y)
(neg.f64 (*.f64 (neg.f64 x) y))
x
y
z
#s(approx (/ (* x y) z) (/.f64 (*.f64 y x) z))
#s(approx (* x y) (*.f64 y x))
#s(approx x x)
#s(approx y y)
#s(approx z z)

eval2.0ms (0.1%)

Memory: 3.0MiB live, 3.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 154 to 45 computations (70.8% saved)

prune4.0ms (0.3%)

Memory

5.3MiB live, 5.3MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	22	2	24
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	22	3	25

Accuracy

99.9%

Counts

25 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	90.1%	(/.f64 (*.f64 x y) z)
	92.4%	(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))
▶	93.1%	(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))

Compiler

Compiled 19 to 19 computations (0% saved)

series7.0ms (0.4%)

Memory

8.7MiB live, 8.7MiB allocated; 0ms collecting garbage

Counts

7 → 7

Calls

Call 1

Inputs
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(/.f64 (neg.f64 x) z)
(neg.f64 x)
x
z
(neg.f64 y)
y

Outputs
#s(approx (* (/ (neg x) z) (neg y)) #s(hole binary64 (/ (* x y) z)))
#s(approx (/ (neg x) z) #s(hole binary64 (* -1 (/ x z))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (neg y) #s(hole binary64 (* -1 y)))
#s(approx y #s(hole binary64 y))
#s(approx z #s(hole binary64 z))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((* (/ (neg x) z) (neg y)) (/ (neg x) z) (neg x) x z (neg y) y)
1.0ms	x	@	0	((* (/ (neg x) z) (neg y)) (/ (neg x) z) (neg x) x z (neg y) y)
1.0ms	x	@	inf	((* (/ (neg x) z) (neg y)) (/ (neg x) z) (neg x) x z (neg y) y)
1.0ms	z	@	inf	((* (/ (neg x) z) (neg y)) (/ (neg x) z) (neg x) x z (neg y) y)
1.0ms	y	@	-inf	((* (/ (neg x) z) (neg y)) (/ (neg x) z) (neg x) x z (neg y) y)

rewrite72.0ms (4.5%)

Memory

-20.5MiB live, 35.1MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	25	62
0	29	59
1	50	55
2	120	55
3	255	55
0	458	55

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

14 → 50

Calls

Call 1

Inputs
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(/.f64 (neg.f64 x) z)
(neg.f64 x)
x
z
(neg.f64 y)
y
#s(approx (* (/ (neg x) z) (neg y)) #s(hole binary64 (/ (* x y) z)))
#s(approx (/ (neg x) z) #s(hole binary64 (* -1 (/ x z))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (neg y) #s(hole binary64 (* -1 y)))
#s(approx y #s(hole binary64 y))
#s(approx z #s(hole binary64 z))

Outputs
(*.f64 y (/.f64 x z))
(.f64 (/.f64 #s(literal -1 binary64) z) (.f64 y (neg.f64 x)))
(.f64 (pow.f64 z #s(literal -1 binary64)) (.f64 y x))
(*.f64 (/.f64 y (neg.f64 z)) (neg.f64 x))
(.f64 (.f64 y (/.f64 x z)) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 y (/.f64 x z)))
(*.f64 (/.f64 y z) x)
(.f64 (.f64 y x) (pow.f64 z #s(literal -1 binary64)))
(.f64 (/.f64 (.f64 y (neg.f64 x)) z) #s(literal -1 binary64))
(.f64 (.f64 y (neg.f64 x)) (/.f64 #s(literal -1 binary64) z))
(*.f64 (/.f64 x z) y)
(.f64 #s(literal -1 binary64) (/.f64 (.f64 y (neg.f64 x)) z))
(*.f64 (neg.f64 y) (/.f64 (neg.f64 x) z))
(*.f64 (neg.f64 x) (/.f64 y (neg.f64 z)))
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(*.f64 x (/.f64 y z))
(/.f64 (*.f64 y x) z)
(/.f64 (*.f64 y (neg.f64 x)) (neg.f64 z))
(neg.f64 (/.f64 (*.f64 y (neg.f64 x)) z))
(*.f64 (/.f64 #s(literal -1 binary64) z) x)
(*.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x))
(*.f64 #s(literal 1 binary64) (/.f64 (neg.f64 x) z))
(*.f64 (/.f64 x z) #s(literal -1 binary64))
(*.f64 #s(literal -1 binary64) (/.f64 x z))
(*.f64 (neg.f64 x) (pow.f64 z #s(literal -1 binary64)))
(*.f64 (/.f64 (neg.f64 x) z) #s(literal 1 binary64))
(*.f64 x (/.f64 #s(literal -1 binary64) z))
(/.f64 (neg.f64 x) z)
(/.f64 x (neg.f64 z))
(neg.f64 (/.f64 x z))
(*.f64 #s(literal 1 binary64) (neg.f64 x))
(*.f64 #s(literal -1 binary64) x)
(*.f64 (neg.f64 x) #s(literal 1 binary64))
(*.f64 x #s(literal -1 binary64))
(neg.f64 x)
x
z
(*.f64 y #s(literal -1 binary64))
(*.f64 #s(literal 1 binary64) (neg.f64 y))
(*.f64 #s(literal -1 binary64) y)
(*.f64 (neg.f64 y) #s(literal 1 binary64))
(neg.f64 y)
y
#s(approx (* (/ (neg x) z) (neg y)) (*.f64 y (/.f64 x z)))
#s(approx (/ (neg x) z) (/.f64 (neg.f64 x) z))
#s(approx (neg x) (neg.f64 x))
#s(approx x x)
#s(approx (neg y) (neg.f64 y))
#s(approx y y)
#s(approx z z)

eval4.0ms (0.3%)

Memory: 8.4MiB live, 8.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 391 to 98 computations (74.9% saved)

prune43.0ms (2.7%)

Memory

-10.4MiB live, 34.9MiB allocated; 5ms collecting garbage

Pruning

5 alts after pruning (3 fresh and 2 done)

	Pruned	Kept	Total
New	48	2	50
Fresh	0	1	1
Picked	0	1	1
Done	0	1	1
Total	48	5	53

Accuracy

100.0%

Counts

53 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	90.1%	(/.f64 (*.f64 x y) z)
	90.0%	(.f64 (pow.f64 z #s(literal -1 binary64)) (.f64 y x))
	92.4%	(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))
✓	93.1%	(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
▶	93.0%	(.f64 (.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x)) (neg.f64 y))

Compiler

Compiled 35 to 35 computations (0% saved)

series7.0ms (0.4%)

Memory

10.7MiB live, 10.7MiB allocated; 0ms collecting garbage

Counts

9 → 8

Calls

Call 1

Inputs
(.f64 (.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x)) (neg.f64 y))
(*.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x))
(pow.f64 z #s(literal -1 binary64))
z
#s(literal -1 binary64)
(neg.f64 x)
x
(neg.f64 y)
y

Outputs
#s(approx (* (* (pow z -1) (neg x)) (neg y)) #s(hole binary64 (/ (* x y) z)))
#s(approx (* (pow z -1) (neg x)) #s(hole binary64 (* -1 (/ x z))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (neg y) #s(hole binary64 (* -1 y)))
#s(approx y #s(hole binary64 y))
#s(approx (pow z -1) #s(hole binary64 (/ 1 z)))
#s(approx z #s(hole binary64 z))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((* (* (pow z -1) (neg x)) (neg y)) (* (pow z -1) (neg x)) (pow z -1) z -1 (neg x) x (neg y) y)
1.0ms	z	@	-inf	((* (* (pow z -1) (neg x)) (neg y)) (* (pow z -1) (neg x)) (pow z -1) z -1 (neg x) x (neg y) y)
1.0ms	x	@	inf	((* (* (pow z -1) (neg x)) (neg y)) (* (pow z -1) (neg x)) (pow z -1) z -1 (neg x) x (neg y) y)
1.0ms	z	@	0	((* (* (pow z -1) (neg x)) (neg y)) (* (pow z -1) (neg x)) (pow z -1) z -1 (neg x) x (neg y) y)
1.0ms	y	@	-inf	((* (* (pow z -1) (neg x)) (neg y)) (* (pow z -1) (neg x)) (pow z -1) z -1 (neg x) x (neg y) y)

rewrite34.0ms (2.1%)

Memory

-19.9MiB live, 26.9MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	30	81
0	36	78
1	72	66
0	218	66

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

17 → 82

Calls

Call 1

Inputs
(.f64 (.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x)) (neg.f64 y))
(*.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x))
(pow.f64 z #s(literal -1 binary64))
z
#s(literal -1 binary64)
(neg.f64 x)
x
(neg.f64 y)
y
#s(approx (* (* (pow z -1) (neg x)) (neg y)) #s(hole binary64 (/ (* x y) z)))
#s(approx (* (pow z -1) (neg x)) #s(hole binary64 (* -1 (/ x z))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (neg y) #s(hole binary64 (* -1 y)))
#s(approx y #s(hole binary64 y))
#s(approx (pow z -1) #s(hole binary64 (/ 1 z)))
#s(approx z #s(hole binary64 z))

Outputs
(.f64 (.f64 (neg.f64 y) (pow.f64 z #s(literal -1 binary64))) (neg.f64 x))
(.f64 (.f64 (/.f64 (neg.f64 x) z) #s(literal -1 binary64)) y)
(*.f64 (/.f64 y z) x)
(.f64 (.f64 (neg.f64 y) (neg.f64 x)) (pow.f64 z #s(literal -1 binary64)))
(*.f64 (/.f64 x z) y)
(.f64 (neg.f64 (/.f64 (.f64 y x) z)) #s(literal -1 binary64))
(.f64 (pow.f64 z #s(literal -1/2 binary64)) (.f64 (pow.f64 z #s(literal -1/2 binary64)) (*.f64 (neg.f64 y) (neg.f64 x))))
(*.f64 (neg.f64 y) (/.f64 (neg.f64 x) z))
(.f64 (neg.f64 x) (.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 y)))
(*.f64 y (/.f64 x z))
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(*.f64 x (/.f64 y z))
(.f64 (pow.f64 z #s(literal -1 binary64)) (.f64 (neg.f64 y) (neg.f64 x)))
(.f64 #s(literal -1 binary64) (neg.f64 (/.f64 (.f64 y x) z)))
(/.f64 (.f64 #s(literal 1 binary64) (.f64 (neg.f64 y) (neg.f64 x))) z)
(/.f64 (.f64 #s(literal -1 binary64) (.f64 (neg.f64 y) (neg.f64 x))) (neg.f64 z))
(/.f64 (*.f64 (neg.f64 y) (neg.f64 x)) (neg.f64 (neg.f64 z)))
(/.f64 (*.f64 (neg.f64 y) x) (neg.f64 z))
(/.f64 (*.f64 y x) z)
(neg.f64 (/.f64 (*.f64 (neg.f64 y) x) z))
(neg.f64 (/.f64 (*.f64 y x) (neg.f64 z)))
(neg.f64 (*.f64 (neg.f64 y) (/.f64 x z)))
(neg.f64 (*.f64 (/.f64 x z) (neg.f64 y)))
(neg.f64 (neg.f64 (/.f64 (*.f64 y x) z)))
(.f64 (.f64 (neg.f64 x) (pow.f64 z #s(literal -1/2 binary64))) (pow.f64 z #s(literal -1/2 binary64)))
(.f64 (.f64 (pow.f64 z #s(literal -1 binary64)) #s(literal -1 binary64)) x)
(*.f64 (neg.f64 (pow.f64 z #s(literal -1 binary64))) x)
(*.f64 (/.f64 x z) #s(literal -1 binary64))
(.f64 (pow.f64 z #s(literal -1/2 binary64)) (.f64 (pow.f64 z #s(literal -1/2 binary64)) (neg.f64 x)))
(*.f64 (neg.f64 x) (pow.f64 z #s(literal -1 binary64)))
(.f64 x (.f64 #s(literal -1 binary64) (pow.f64 z #s(literal -1 binary64))))
(*.f64 x (/.f64 #s(literal -1 binary64) z))
(*.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x))
(*.f64 #s(literal -1 binary64) (/.f64 x z))
(/.f64 (*.f64 #s(literal 1 binary64) (neg.f64 x)) z)
(/.f64 (*.f64 #s(literal -1 binary64) (neg.f64 x)) (neg.f64 z))
(/.f64 (*.f64 (neg.f64 x) #s(literal 1 binary64)) z)
(/.f64 (*.f64 (neg.f64 x) #s(literal -1 binary64)) (neg.f64 z))
(/.f64 (neg.f64 (neg.f64 x)) (neg.f64 z))
(/.f64 (neg.f64 x) (neg.f64 (neg.f64 z)))
(/.f64 (neg.f64 x) z)
(/.f64 x (neg.f64 z))
(neg.f64 (*.f64 (/.f64 x z) #s(literal 1 binary64)))
(neg.f64 (*.f64 #s(literal 1 binary64) (/.f64 x z)))
(neg.f64 (/.f64 x z))
(*.f64 (neg.f64 (pow.f64 z #s(literal -1/2 binary64))) (neg.f64 (pow.f64 z #s(literal -1/2 binary64))))
(*.f64 (fabs.f64 (pow.f64 z #s(literal -1/2 binary64))) (fabs.f64 (pow.f64 z #s(literal -1/2 binary64))))
(*.f64 (pow.f64 z #s(literal -1/2 binary64)) (pow.f64 z #s(literal -1/2 binary64)))
(pow.f64 (exp.f64 (log.f64 z)) #s(literal -1 binary64))
(pow.f64 (*.f64 z z) #s(literal -1/2 binary64))
(pow.f64 (pow.f64 z #s(literal -1/2 binary64)) #s(literal 2 binary64))
(pow.f64 z #s(literal -1 binary64))
(/.f64 #s(literal 1 binary64) (neg.f64 (neg.f64 z)))
(/.f64 #s(literal 1 binary64) (pow.f64 z #s(literal 1 binary64)))
(/.f64 #s(literal 1 binary64) z)
(/.f64 #s(literal -1 binary64) (neg.f64 z))
(neg.f64 (/.f64 #s(literal -1 binary64) z))
(neg.f64 (/.f64 #s(literal 1 binary64) (neg.f64 z)))
(exp.f64 (*.f64 (log.f64 z) #s(literal -1 binary64)))
(+.f64 (cosh.f64 (.f64 (log.f64 z) #s(literal -1 binary64))) (sinh.f64 (.f64 (log.f64 z) #s(literal -1 binary64))))
z
#s(literal -1 binary64)
(*.f64 x #s(literal -1 binary64))
(*.f64 #s(literal -1 binary64) x)
(neg.f64 (*.f64 x #s(literal 1 binary64)))
(neg.f64 (*.f64 #s(literal 1 binary64) x))
(neg.f64 x)
x
(*.f64 y #s(literal -1 binary64))
(*.f64 #s(literal -1 binary64) y)
(neg.f64 (*.f64 y #s(literal 1 binary64)))
(neg.f64 (*.f64 #s(literal 1 binary64) y))
(neg.f64 y)
y
#s(approx (* (* (pow z -1) (neg x)) (neg y)) (/.f64 (*.f64 y x) z))
#s(approx (* (pow z -1) (neg x)) (/.f64 (neg.f64 x) z))
#s(approx (neg x) (neg.f64 x))
#s(approx x x)
#s(approx (neg y) (neg.f64 y))
#s(approx y y)
#s(approx (pow z -1) (pow.f64 z #s(literal -1 binary64)))
#s(approx z z)

eval7.0ms (0.4%)

Memory: 11.8MiB live, 11.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 786 to 211 computations (73.2% saved)

prune69.0ms (4.3%)

Memory

-17.8MiB live, 77.1MiB allocated; 17ms collecting garbage

Pruning

7 alts after pruning (4 fresh and 3 done)

	Pruned	Kept	Total
New	79	3	82
Fresh	1	1	2
Picked	0	1	1
Done	0	2	2
Total	80	7	87

Accuracy

100.0%

Counts

87 → 7

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	90.1%	(/.f64 (*.f64 x y) z)
	89.8%	(.f64 (pow.f64 z #s(literal -1/2 binary64)) (.f64 (pow.f64 z #s(literal -1/2 binary64)) (*.f64 (neg.f64 y) (neg.f64 x))))
	90.0%	(.f64 (pow.f64 z #s(literal -1 binary64)) (.f64 (neg.f64 y) (neg.f64 x)))
	92.4%	(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))
✓	93.1%	(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
✓	93.0%	(.f64 (.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x)) (neg.f64 y))
▶	92.3%	(.f64 (.f64 (neg.f64 y) (pow.f64 z #s(literal -1 binary64))) (neg.f64 x))

Compiler

Compiled 59 to 56 computations (5.1% saved)

series7.0ms (0.4%)

Memory

10.8MiB live, 10.8MiB allocated; 0ms collecting garbage

Counts

9 → 8

Calls

Call 1

Inputs
(.f64 (.f64 (neg.f64 y) (pow.f64 z #s(literal -1 binary64))) (neg.f64 x))
(*.f64 (neg.f64 y) (pow.f64 z #s(literal -1 binary64)))
(neg.f64 y)
y
(pow.f64 z #s(literal -1 binary64))
z
#s(literal -1 binary64)
(neg.f64 x)
x

Outputs
#s(approx (* (* (neg y) (pow z -1)) (neg x)) #s(hole binary64 (/ (* x y) z)))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (* (neg y) (pow z -1)) #s(hole binary64 (* -1 (/ y z))))
#s(approx (neg y) #s(hole binary64 (* -1 y)))
#s(approx y #s(hole binary64 y))
#s(approx (pow z -1) #s(hole binary64 (/ 1 z)))
#s(approx z #s(hole binary64 z))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((* (* (neg y) (pow z -1)) (neg x)) (* (neg y) (pow z -1)) (neg y) y (pow z -1) z -1 (neg x) x)
1.0ms	z	@	0	((* (* (neg y) (pow z -1)) (neg x)) (* (neg y) (pow z -1)) (neg y) y (pow z -1) z -1 (neg x) x)
1.0ms	x	@	-inf	((* (* (neg y) (pow z -1)) (neg x)) (* (neg y) (pow z -1)) (neg y) y (pow z -1) z -1 (neg x) x)
1.0ms	z	@	-inf	((* (* (neg y) (pow z -1)) (neg x)) (* (neg y) (pow z -1)) (neg y) y (pow z -1) z -1 (neg x) x)
1.0ms	y	@	inf	((* (* (neg y) (pow z -1)) (neg x)) (* (neg y) (pow z -1)) (neg y) y (pow z -1) z -1 (neg x) x)

rewrite31.0ms (2%)

Memory

-12.0MiB live, 34.7MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	30	81
0	36	78
1	71	66
0	218	66

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

17 → 81

Calls

Call 1

Inputs
(.f64 (.f64 (neg.f64 y) (pow.f64 z #s(literal -1 binary64))) (neg.f64 x))
(*.f64 (neg.f64 y) (pow.f64 z #s(literal -1 binary64)))
(neg.f64 y)
y
(pow.f64 z #s(literal -1 binary64))
z
#s(literal -1 binary64)
(neg.f64 x)
x
#s(approx (* (* (neg y) (pow z -1)) (neg x)) #s(hole binary64 (/ (* x y) z)))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (* (neg y) (pow z -1)) #s(hole binary64 (* -1 (/ y z))))
#s(approx (neg y) #s(hole binary64 (* -1 y)))
#s(approx y #s(hole binary64 y))
#s(approx (pow z -1) #s(hole binary64 (/ 1 z)))
#s(approx z #s(hole binary64 z))

Outputs
(.f64 (.f64 (neg.f64 x) (neg.f64 y)) (pow.f64 z #s(literal -1 binary64)))
(.f64 (.f64 (/.f64 (neg.f64 y) z) #s(literal -1 binary64)) x)
(.f64 (.f64 (neg.f64 x) (pow.f64 z #s(literal -1 binary64))) (neg.f64 y))
(.f64 (neg.f64 (/.f64 (.f64 x y) z)) #s(literal -1 binary64))
(*.f64 (/.f64 y z) x)
(*.f64 (neg.f64 x) (/.f64 (neg.f64 y) z))
(.f64 (neg.f64 y) (.f64 (neg.f64 x) (pow.f64 z #s(literal -1 binary64))))
(*.f64 x (/.f64 y z))
(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))
(.f64 (pow.f64 z #s(literal -1 binary64)) (.f64 (neg.f64 y) (neg.f64 x)))
(.f64 #s(literal -1 binary64) (.f64 y (*.f64 (neg.f64 x) (pow.f64 z #s(literal -1 binary64)))))
(.f64 #s(literal -1 binary64) (neg.f64 (/.f64 (.f64 x y) z)))
(*.f64 y (/.f64 x z))
(.f64 y (.f64 #s(literal -1 binary64) (*.f64 (neg.f64 x) (pow.f64 z #s(literal -1 binary64)))))
(/.f64 (neg.f64 (*.f64 (neg.f64 x) y)) (neg.f64 (neg.f64 z)))
(/.f64 (*.f64 (neg.f64 x) y) (neg.f64 z))
(/.f64 (*.f64 x y) z)
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) z))
(neg.f64 (/.f64 (*.f64 x y) (neg.f64 z)))
(neg.f64 (*.f64 (neg.f64 x) (/.f64 y z)))
(neg.f64 (.f64 y (.f64 (neg.f64 x) (pow.f64 z #s(literal -1 binary64)))))
(neg.f64 (*.f64 (/.f64 y z) (neg.f64 x)))
(neg.f64 (neg.f64 (/.f64 (*.f64 x y) z)))
(.f64 (.f64 (neg.f64 y) (pow.f64 z #s(literal -1/2 binary64))) (pow.f64 z #s(literal -1/2 binary64)))
(.f64 (.f64 (pow.f64 z #s(literal -1 binary64)) #s(literal -1 binary64)) y)
(.f64 (pow.f64 z #s(literal -1/2 binary64)) (.f64 (pow.f64 z #s(literal -1/2 binary64)) (neg.f64 y)))
(*.f64 (/.f64 y z) #s(literal -1 binary64))
(*.f64 (neg.f64 y) (pow.f64 z #s(literal -1 binary64)))
(*.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 y))
(*.f64 #s(literal -1 binary64) (/.f64 y z))
(.f64 y (.f64 #s(literal -1 binary64) (pow.f64 z #s(literal -1 binary64))))
(*.f64 y (/.f64 #s(literal -1 binary64) z))
(*.f64 y (neg.f64 (pow.f64 z #s(literal -1 binary64))))
(/.f64 (*.f64 #s(literal 1 binary64) (neg.f64 y)) z)
(/.f64 (*.f64 #s(literal -1 binary64) (neg.f64 y)) (neg.f64 z))
(/.f64 (*.f64 (neg.f64 y) #s(literal 1 binary64)) z)
(/.f64 (*.f64 (neg.f64 y) #s(literal -1 binary64)) (neg.f64 z))
(/.f64 (neg.f64 (neg.f64 y)) (neg.f64 z))
(/.f64 (neg.f64 y) (neg.f64 (neg.f64 z)))
(/.f64 (neg.f64 y) z)
(/.f64 y (neg.f64 z))
(neg.f64 (*.f64 (/.f64 y z) #s(literal 1 binary64)))
(neg.f64 (*.f64 #s(literal 1 binary64) (/.f64 y z)))
(neg.f64 (/.f64 y z))
(*.f64 #s(literal -1 binary64) y)
(*.f64 y #s(literal -1 binary64))
(neg.f64 (*.f64 y #s(literal 1 binary64)))
(neg.f64 (*.f64 #s(literal 1 binary64) y))
(neg.f64 y)
y
(*.f64 (neg.f64 (pow.f64 z #s(literal -1/2 binary64))) (neg.f64 (pow.f64 z #s(literal -1/2 binary64))))
(*.f64 (fabs.f64 (pow.f64 z #s(literal -1/2 binary64))) (fabs.f64 (pow.f64 z #s(literal -1/2 binary64))))
(*.f64 (pow.f64 z #s(literal -1/2 binary64)) (pow.f64 z #s(literal -1/2 binary64)))
(pow.f64 (exp.f64 (log.f64 z)) #s(literal -1 binary64))
(pow.f64 (*.f64 z z) #s(literal -1/2 binary64))
(pow.f64 (pow.f64 z #s(literal -1/2 binary64)) #s(literal 2 binary64))
(pow.f64 z #s(literal -1 binary64))
(/.f64 #s(literal 1 binary64) (neg.f64 (neg.f64 z)))
(/.f64 #s(literal 1 binary64) (pow.f64 z #s(literal 1 binary64)))
(/.f64 #s(literal 1 binary64) z)
(/.f64 #s(literal -1 binary64) (neg.f64 z))
(neg.f64 (/.f64 #s(literal -1 binary64) z))
(neg.f64 (/.f64 #s(literal 1 binary64) (neg.f64 z)))
(exp.f64 (*.f64 (log.f64 z) #s(literal -1 binary64)))
(+.f64 (cosh.f64 (.f64 (log.f64 z) #s(literal -1 binary64))) (sinh.f64 (.f64 (log.f64 z) #s(literal -1 binary64))))
z
#s(literal -1 binary64)
(*.f64 x #s(literal -1 binary64))
(*.f64 #s(literal -1 binary64) x)
(neg.f64 (*.f64 x #s(literal 1 binary64)))
(neg.f64 (*.f64 #s(literal 1 binary64) x))
(neg.f64 x)
x
#s(approx (* (* (neg y) (pow z -1)) (neg x)) (/.f64 (*.f64 x y) z))
#s(approx (neg x) (neg.f64 x))
#s(approx x x)
#s(approx (* (neg y) (pow z -1)) (/.f64 (neg.f64 y) z))
#s(approx (neg y) (neg.f64 y))
#s(approx y y)
#s(approx (pow z -1) (pow.f64 z #s(literal -1 binary64)))
#s(approx z z)

eval7.0ms (0.5%)

Memory: 12.7MiB live, 12.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 778 to 210 computations (73% saved)

prune50.0ms (3.2%)

Memory

6.7MiB live, 99.3MiB allocated; 7ms collecting garbage

Pruning

7 alts after pruning (3 fresh and 4 done)

	Pruned	Kept	Total
New	80	1	81
Fresh	1	2	3
Picked	0	1	1
Done	0	3	3
Total	81	7	88

Accuracy

100.0%

Counts

88 → 7

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	90.1%	(/.f64 (*.f64 x y) z)
	89.8%	(.f64 (pow.f64 z #s(literal -1/2 binary64)) (.f64 (pow.f64 z #s(literal -1/2 binary64)) (*.f64 (neg.f64 y) (neg.f64 x))))
	90.0%	(.f64 (pow.f64 z #s(literal -1 binary64)) (.f64 (neg.f64 y) (neg.f64 x)))
	92.4%	(.f64 (/.f64 (.f64 (neg.f64 y) #s(literal 1 binary64)) z) (neg.f64 x))
✓	93.1%	(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
✓	93.0%	(.f64 (.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x)) (neg.f64 y))
✓	92.3%	(.f64 (.f64 (neg.f64 y) (pow.f64 z #s(literal -1 binary64))) (neg.f64 x))

Compiler

Compiled 136 to 87 computations (36% saved)

regimes24.0ms (1.5%)

Memory

-25.6MiB live, 25.0MiB allocated; 15ms collecting garbage

Accuracy

Total -15.3b remaining (-9352.6%)

Threshold costs -15.3b (-9352.6%)

Counts

9 → 2

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) z)
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))
(.f64 (/.f64 (.f64 (neg.f64 y) #s(literal 1 binary64)) z) (neg.f64 x))
(.f64 (pow.f64 z #s(literal -1 binary64)) (.f64 y x))
(.f64 (.f64 (neg.f64 y) (pow.f64 z #s(literal -1 binary64))) (neg.f64 x))
(.f64 (.f64 (pow.f64 z #s(literal -1 binary64)) (neg.f64 x)) (neg.f64 y))
(.f64 (pow.f64 z #s(literal -1 binary64)) (.f64 (neg.f64 y) (neg.f64 x)))
(.f64 (pow.f64 z #s(literal -1/2 binary64)) (.f64 (pow.f64 z #s(literal -1/2 binary64)) (*.f64 (neg.f64 y) (neg.f64 x))))

Outputs
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))

Calls

5 calls:

13.0ms	(*.f64 x y)
3.0ms	z
3.0ms	y
3.0ms	x
2.0ms	(/.f64 (*.f64 x y) z)

Results

Accuracy	Segments	Branch
99.8%	3	`(*.f64 x y)`
99.7%	2	`(/.f64 (*.f64 x y) z)`
95.6%	2	`x`
97.9%	3	`y`
99.7%	2	`z`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

bsearch2.0ms (0.1%)

Memory

1.6MiB live, 1.6MiB allocated; 0ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	predicate-same

Steps

Time	Left	Right
1.0ms	2.960395112271853e-56	3.613690563471344e-51

Samples

1.0ms

16×

valid

Compiler

Compiled 22 to 27 computations (-22.7% saved)

Precisions

Click to see histograms. Total time spent on operations: 0.0ms

ival-div: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-mult: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

simplify86.0ms (5.4%)

Memory

15.1MiB live, 62.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	12	18
1	28	18
2	57	14
3	93	14
4	146	14
5	190	14
6	219	14
7	227	14
8	229	14
9	231	14
10	247	14
11	429	14
12	3284	14

Stop Event

1×	node limit

Calls

Call 1

Inputs

(if (<=.f64 z #s(literal 5521397077432451/110427941548649020598956093796432407239217743554726184882600387580788736 binary64)) (*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y)) (*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x)))

Outputs

(if (<=.f64 z #s(literal 5521397077432451/110427941548649020598956093796432407239217743554726184882600387580788736 binary64)) (*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y)) (*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x)))

(if (<=.f64 z #s(literal 5521397077432451/110427941548649020598956093796432407239217743554726184882600387580788736 binary64)) (*.f64 (/.f64 x z) y) (*.f64 (/.f64 y z) x))

derivations3.0ms (0.2%)

Memory

4.3MiB live, 4.3MiB allocated; 0ms collecting garbage

Stop Event

1×

fuel

Compiler

Compiled 14 to 10 computations (28.6% saved)

preprocess291.0ms (18.3%)

Memory: 22.4MiB live, 356.7MiB allocated; 79ms collecting garbage
Compiler: Compiled 196 to 140 computations (28.6% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze67.0ms (4.2%)

sample651.0ms (40.8%)

explain52.0ms (3.3%)

preprocess21.0ms (1.3%)

eval0.0ms (0%)

prune0.0ms (0%)

series38.0ms (2.4%)

rewrite17.0ms (1%)

eval2.0ms (0.1%)

prune4.0ms (0.3%)

series7.0ms (0.4%)

rewrite72.0ms (4.5%)

eval4.0ms (0.3%)

prune43.0ms (2.7%)

series7.0ms (0.4%)

rewrite34.0ms (2.1%)

eval7.0ms (0.4%)

prune69.0ms (4.3%)

series7.0ms (0.4%)

rewrite31.0ms (2%)

eval7.0ms (0.5%)

prune50.0ms (3.2%)

regimes24.0ms (1.5%)

bsearch2.0ms (0.1%)

simplify86.0ms (5.4%)

derivations3.0ms (0.2%)

preprocess291.0ms (18.3%)

end0.0ms (0%)

Profiling