Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, C

start0.0ms (0%)

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

analyze17.0ms (1.9%)

Memory

-20.1MiB live, 26.6MiB allocated; 8ms 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
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 7 to 7 computations (0% saved)

sample520.0ms (59%)

Memory

-6.6MiB live, 942.4MiB allocated; 143ms collecting garbage

Samples

318.0ms

8 256×

valid

Precisions

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

ival-div!: 86.0ms (61.4% of total)

ival-mult!: 53.0ms (37.9% of total)

adjust: 1.0ms (0.7% of total)

Bogosity

preprocess18.0ms (2%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	38	30
2	89	30
3	145	30
4	151	30

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.8%	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 10 to 10 computations (0% saved)

series43.0ms (4.9%)

Memory

-37.5MiB live, 9.2MiB allocated; 3ms collecting garbage

Counts

5 → 4

Calls

Call 1

Inputs
(/.f64 x (*.f64 y #s(literal 3 binary64)))
x
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)

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

Calls

6 calls:

Time	Variable		Point	Expression
38.0ms	y	@	-inf	((/ x (* y 3)) x (* y 3) y 3)
2.0ms	y	@	inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	x	@	-inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	x	@	inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	y	@	0	((/ x (* y 3)) x (* y 3) y 3)

rewrite18.0ms (2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	35
0	16	35
1	26	35
2	57	35
3	127	35
4	153	35
5	156	35
0	156	35

Stop Event

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

Counts

9 → 19

Calls

Call 1

Inputs
(/.f64 x (*.f64 y #s(literal 3 binary64)))
x
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

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

eval1.0ms (0.2%)

Memory: 4.1MiB live, 4.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 50 to 40 computations (20% saved)

prune31.0ms (3.5%)

Memory

-26.4MiB live, 4.2MiB allocated; 8ms collecting garbage

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	12	3	15
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	12	4	16

Accuracy

100.0%

Counts

16 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
▶	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.8%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
▶	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

Compiler

Compiled 24 to 24 computations (0% saved)

series6.0ms (0.7%)

Memory

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

Counts

10 → 8

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(/.f64 x y)
x
y
#s(literal 1/3 binary64)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x #s(literal 3 binary64))
#s(literal 3 binary64)
(/.f64 (/.f64 x y) #s(literal 3 binary64))

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

Calls

6 calls:

Time	Variable		Point	Expression
2.0ms	x	@	0	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))
1.0ms	x	@	-inf	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))
1.0ms	x	@	inf	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))
1.0ms	y	@	-inf	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))
1.0ms	y	@	inf	((/ x (* y 3)) (* (/ x y) 1/3) (/ x y) x y 1/3 (/ (/ x 3) y) (/ x 3) 3 (/ (/ x y) 3))

rewrite49.0ms (5.5%)

Memory

-27.0MiB live, 33.0MiB allocated; 83ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	100
0	34	100
1	52	100
2	99	100
3	151	100
4	172	100
5	174	100
0	174	100

Stop Event

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

Counts

18 → 44

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(/.f64 x y)
x
y
#s(literal 1/3 binary64)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x #s(literal 3 binary64))
#s(literal 3 binary64)
(/.f64 (/.f64 x y) #s(literal 3 binary64))
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ x y) 1/3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x y) #s(hole binary64 (/ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (/ (/ x 3) y) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (/ (/ x y) 3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx y #s(hole binary64 y))

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

eval4.0ms (0.4%)

Memory: 8.2MiB live, 8.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 123 to 86 computations (30.1% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

5 alts after pruning (1 fresh and 4 done)

	Pruned	Kept	Total
New	30	1	31
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	30	5	35

Accuracy

100.0%

Counts

35 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
✓	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.8%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
▶	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 33 to 33 computations (0% saved)

series3.0ms (0.4%)

Memory

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

Counts

6 → 5

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(/.f64 #s(literal 1/3 binary64) y)
#s(literal 1/3 binary64)
y
x

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

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x)
1.0ms	y	@	inf	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x)
1.0ms	x	@	-inf	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x)
1.0ms	x	@	inf	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x)
0.0ms	y	@	0	((/ x (* y 3)) (* (/ 1/3 y) x) (/ 1/3 y) 1/3 y x)

rewrite10.0ms (1.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	57
0	21	57
1	36	57
2	77	57
3	163	57
4	180	57
5	180	57
0	180	57

Stop Event

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

Counts

11 → 23

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(/.f64 #s(literal 1/3 binary64) y)
#s(literal 1/3 binary64)
y
x
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ 1/3 y) x) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (/ 1/3 y) #s(hole binary64 (/ 1/3 y)))
#s(approx y #s(hole binary64 y))

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

eval18.0ms (2%)

Memory: -29.7MiB live, 4.2MiB allocated; 20ms collecting garbage
Compiler: Compiled 68 to 56 computations (17.6% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

5 alts after pruning (0 fresh and 5 done)

	Pruned	Kept	Total
New	15	0	15
Fresh	0	0	0
Picked	0	1	1
Done	0	4	4
Total	15	5	20

Accuracy

100.0%

Counts

20 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
✓	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.8%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
✓	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 52 to 51 computations (1.9% saved)

regimes8.0ms (0.9%)

Memory

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

Counts

5 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(/.f64 x (*.f64 y #s(literal 3 binary64)))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 (/.f64 x y) #s(literal 3 binary64))

Outputs
(/.f64 x (*.f64 y #s(literal 3 binary64)))

Calls

4 calls:

2.0ms	y
2.0ms	(*.f64 y #s(literal 3 binary64))
2.0ms	x
2.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
99.8%	1	`(*.f64 y #s(literal 3 binary64))`
99.8%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.8%	1	`x`
99.8%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes17.0ms (1.9%)

Memory

-22.4MiB live, 19.6MiB allocated; 15ms collecting garbage

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

Calls

4 calls:

12.0ms	x
1.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))
1.0ms	y
1.0ms	(*.f64 y #s(literal 3 binary64))

Results

Accuracy	Segments	Branch
99.6%	1	`(*.f64 y #s(literal 3 binary64))`
99.6%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.6%	1	`x`
99.6%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.5%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Calls

4 calls:

1.0ms	(*.f64 y #s(literal 3 binary64))
1.0ms	y
1.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))
1.0ms	x

Results

Accuracy	Segments	Branch
99.6%	1	`(*.f64 y #s(literal 3 binary64))`
99.6%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.6%	1	`x`
99.6%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

derivations3.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 15 to 15 computations (0% saved)

preprocess106.0ms (12.1%)

Memory

-16.8MiB live, 127.5MiB allocated; 80ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 112 to 112 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze17.0ms (1.9%)

sample520.0ms (59%)

preprocess18.0ms (2%)

series43.0ms (4.9%)

rewrite18.0ms (2%)

eval1.0ms (0.2%)

prune31.0ms (3.5%)

series6.0ms (0.7%)

rewrite49.0ms (5.5%)

eval4.0ms (0.4%)

prune2.0ms (0.3%)

series3.0ms (0.4%)

rewrite10.0ms (1.2%)

eval18.0ms (2%)

prune2.0ms (0.3%)

regimes8.0ms (0.9%)

regimes17.0ms (1.9%)

regimes4.0ms (0.5%)

derivations3.0ms (0.3%)

preprocess106.0ms (12.1%)

end0.0ms (0%)

Profiling