Metrics for Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample953.0ms (61.9%)

Memory

-48.7MiB live, 1 039.3MiB allocated; 366ms collecting garbage

Samples

436.0ms

8 256×

valid

Precisions

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

ival-sub: 116.0ms (59.8% of total)

ival-mult: 67.0ms (34.5% of total)

ival-true: 5.0ms (2.6% of total)

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

adjust: 2.0ms (1% of total)

Bogosity

explain73.0ms (4.8%)

Memory

24.3MiB live, 112.8MiB allocated; 14ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 x (*.f64 y y))`
-	-	`y`
-	-	`(*.f64 y y)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

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

Precision?

0/0

Recall?

0/0

Samples

41.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

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

ival-sub: 2.0ms (28.1% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess17.0ms (1.1%)

Memory

9.3MiB live, 56.0MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	34
1	33	34
2	87	32
3	146	32
4	192	32
0	4	5
0	6	5
1	12	5
2	33	5
3	59	5
4	74	5
0	74	5

Stop Event

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

Calls

Call 1

Inputs
(-.f64 x (*.f64 y y))

Outputs
(-.f64 x (*.f64 y y))

Symmetry

(abs y)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 x (*.f64 y y))

Compiler

Compiled 5 to 4 computations (20% saved)

series3.0ms (0.2%)

Memory

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

Counts

4 → 10

Calls

Call 1

Inputs
(-.f64 x (*.f64 y y))
x
(*.f64 y y)
y

Outputs
#s(approx (- x (* y y)) #s(hole binary64 (* -1 (pow y 2))))
#s(approx (- x (* y y)) #s(hole binary64 (- x (pow y 2))))
#s(approx x #s(hole binary64 x))
#s(approx (- x (* y y)) #s(hole binary64 x))
#s(approx (- x (* y y)) #s(hole binary64 (* x (+ 1 (* -1 (/ (pow y 2) x))))))
#s(approx (- x (* y y)) #s(hole binary64 (* -1 (* x (- (/ (pow y 2) x) 1)))))
#s(approx (- x (* y y)) #s(hole binary64 (+ x (* -1 (pow y 2)))))
#s(approx (* y y) #s(hole binary64 (pow y 2)))
#s(approx y #s(hole binary64 y))
#s(approx (- x (* y y)) #s(hole binary64 (* (pow y 2) (- (/ x (pow y 2)) 1))))

Calls

6 calls:

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

simplify103.0ms (6.7%)

Memory

-3.7MiB live, 190.8MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	31	91
1	67	91
2	195	91
3	775	91
4	2884	91
5	6554	91
0	8166	91

Stop Event

1×	iter limit
1×	node limit

Counts

10 → 10

Calls

Call 1

Inputs
#s(approx (- x (* y y)) #s(hole binary64 (* -1 (pow y 2))))
#s(approx (- x (* y y)) #s(hole binary64 (- x (pow y 2))))
#s(approx x #s(hole binary64 x))
#s(approx (- x (* y y)) #s(hole binary64 x))
#s(approx (- x (* y y)) #s(hole binary64 (* x (+ 1 (* -1 (/ (pow y 2) x))))))
#s(approx (- x (* y y)) #s(hole binary64 (* -1 (* x (- (/ (pow y 2) x) 1)))))
#s(approx (- x (* y y)) #s(hole binary64 (+ x (* -1 (pow y 2)))))
#s(approx (* y y) #s(hole binary64 (pow y 2)))
#s(approx y #s(hole binary64 y))
#s(approx (- x (* y y)) #s(hole binary64 (* (pow y 2) (- (/ x (pow y 2)) 1))))

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

rewrite50.0ms (3.3%)

Memory

-15.9MiB live, 130.7MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	27	10
0	210	10

Stop Event

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

Counts

4 → 30

Calls

Call 1

Inputs
(-.f64 x (*.f64 y y))
x
(*.f64 y y)
y

Outputs
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 (neg.f64 y) y) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (pow.f64 y #s(literal 4 binary64)) (.f64 x (*.f64 (neg.f64 y) y)))))
(/.f64 (neg.f64 (-.f64 (*.f64 x x) (pow.f64 y #s(literal 4 binary64)))) (neg.f64 (fma.f64 y y x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 6 binary64)))) (neg.f64 (fma.f64 x x (fma.f64 (*.f64 y y) x (pow.f64 y #s(literal 4 binary64))))))
(/.f64 (-.f64 (*.f64 x x) (pow.f64 y #s(literal 4 binary64))) (fma.f64 y y x))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 6 binary64))) (fma.f64 x x (fma.f64 (*.f64 y y) x (pow.f64 y #s(literal 4 binary64)))))
(fma.f64 (neg.f64 y) y x)
(fma.f64 y (neg.f64 y) x)
(-.f64 (/.f64 (*.f64 x x) (fma.f64 y y x)) (/.f64 (pow.f64 y #s(literal 4 binary64)) (fma.f64 y y x)))
(-.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x (fma.f64 (.f64 y y) x (pow.f64 y #s(literal 4 binary64))))) (/.f64 (pow.f64 y #s(literal 6 binary64)) (fma.f64 x x (fma.f64 (.f64 y y) x (pow.f64 y #s(literal 4 binary64))))))
(-.f64 x (*.f64 (neg.f64 (neg.f64 y)) y))
(-.f64 x (*.f64 y y))
(+.f64 (*.f64 (neg.f64 y) y) x)
(+.f64 x (*.f64 (neg.f64 (neg.f64 y)) (neg.f64 y)))
(+.f64 x (*.f64 (neg.f64 (fabs.f64 y)) (fabs.f64 y)))
(+.f64 x (*.f64 (neg.f64 y) y))
x
(*.f64 (pow.f64 y #s(literal 1 binary64)) (pow.f64 y #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 y)) (neg.f64 (neg.f64 y)))
(*.f64 (neg.f64 (fabs.f64 y)) (neg.f64 (fabs.f64 y)))
(*.f64 (fabs.f64 (fabs.f64 y)) (fabs.f64 (fabs.f64 y)))
(*.f64 (neg.f64 y) (neg.f64 y))
(*.f64 (fabs.f64 y) (fabs.f64 y))
(*.f64 y y)
(pow.f64 (neg.f64 y) #s(literal 2 binary64))
(pow.f64 (fabs.f64 y) #s(literal 2 binary64))
(pow.f64 y #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 y) y))
(fabs.f64 (*.f64 y y))
(exp.f64 (*.f64 (log.f64 y) #s(literal 2 binary64)))
y

eval4.0ms (0.2%)

Memory: 11.6MiB live, 11.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 370 to 100 computations (73% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	37	2	39
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	37	3	40

Accuracy

100.0%

Counts

40 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 x (*.f64 y y))
▶	54.4%	#s(approx (- x (* y y)) (*.f64 (neg.f64 y) y))
▶	48.1%	#s(approx (- x (* y y)) x)

Compiler

Compiled 22 to 16 computations (27.3% saved)

series39.0ms (2.5%)

Memory

-34.3MiB live, 12.4MiB allocated; 3ms collecting garbage

Counts

6 → 11

Calls

Call 1

Inputs
#s(approx (- x (* y y)) x)
x
#s(approx (- x (* y y)) (*.f64 (neg.f64 y) y))
(*.f64 (neg.f64 y) y)
(neg.f64 y)
y

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

Calls

6 calls:

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

simplify109.0ms (7.1%)

Memory

7.3MiB live, 159.3MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	35	98
1	72	98
2	200	98
3	860	98
4	3094	98
5	6416	98
0	8031	98

Stop Event

1×	iter limit
1×	node limit

Counts

11 → 11

Calls

Call 1

Inputs
#s(approx (- x (* y y)) #s(hole binary64 (* -1 (pow y 2))))
#s(approx (- x (* y y)) #s(hole binary64 (- x (pow y 2))))
#s(approx x #s(hole binary64 x))
#s(approx (- x (* y y)) #s(hole binary64 x))
#s(approx (- x (* y y)) #s(hole binary64 (* x (+ 1 (* -1 (/ (pow y 2) x))))))
#s(approx (- x (* y y)) #s(hole binary64 (* -1 (* x (- (/ (pow y 2) x) 1)))))
#s(approx (- x (* y y)) #s(hole binary64 (+ x (* -1 (pow y 2)))))
#s(approx (* (neg y) y) #s(hole binary64 (* -1 (pow y 2))))
#s(approx (neg y) #s(hole binary64 (* -1 y)))
#s(approx y #s(hole binary64 y))
#s(approx (- x (* y y)) #s(hole binary64 (* (pow y 2) (- (/ x (pow y 2)) 1))))

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

rewrite32.0ms (2.1%)

Memory

-4.7MiB live, 38.9MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	25
0	10	25
1	31	25
0	204	25

Stop Event

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

Counts

6 → 12

Calls

Call 1

Inputs
#s(approx (- x (* y y)) x)
x
#s(approx (- x (* y y)) (*.f64 (neg.f64 y) y))
(*.f64 (neg.f64 y) y)
(neg.f64 y)
y

Outputs
#s(approx (- x (* y y)) x)
x
#s(approx (- x (* y y)) (*.f64 (neg.f64 y) y))
(*.f64 (neg.f64 (fabs.f64 y)) (fabs.f64 y))
(*.f64 (neg.f64 (neg.f64 y)) (neg.f64 y))
(*.f64 (fabs.f64 y) (neg.f64 (fabs.f64 y)))
(*.f64 (neg.f64 y) (neg.f64 (neg.f64 y)))
(*.f64 (neg.f64 y) y)
(*.f64 y (neg.f64 y))
(neg.f64 (*.f64 y y))
(neg.f64 y)
y

eval2.0ms (0.1%)

Memory: 3.7MiB live, 3.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 231 to 47 computations (79.7% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

24 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 x (*.f64 y y))
✓	54.4%	#s(approx (- x (* y y)) (*.f64 (neg.f64 y) y))
✓	48.1%	#s(approx (- x (* y y)) x)

Compiler

Compiled 44 to 26 computations (40.9% saved)

regimes6.0ms (0.4%)

Memory

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

Counts

3 → 1

Calls

Call 1

Inputs
#s(approx (- x (* y y)) x)
#s(approx (- x (* y y)) (*.f64 (neg.f64 y) y))
(-.f64 x (*.f64 y y))

Outputs
(-.f64 x (*.f64 y y))

Calls

4 calls:

2.0ms	x
2.0ms	y
2.0ms	(*.f64 y y)
1.0ms	(-.f64 x (*.f64 y y))

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 y y)`
100.0%	1	`(-.f64 x (*.f64 y y))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 11 computations (-10% saved)

regimes5.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- x (* y y)) x)
#s(approx (- x (* y y)) (*.f64 (neg.f64 y) y))

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

Calls

4 calls:

1.0ms	x
1.0ms	y
1.0ms	(-.f64 x (*.f64 y y))
1.0ms	(*.f64 y y)

Results

Accuracy	Segments	Branch
86.6%	2	`(*.f64 y y)`
81.6%	2	`(-.f64 x (*.f64 y y))`
65.7%	3	`x`
86.6%	2	`y`

Compiler

Compiled 10 to 11 computations (-10% saved)

regimes35.0ms (2.3%)

Memory

-44.3MiB live, 10.1MiB allocated; 10ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- x (* y y)) x)

Outputs
#s(approx (- x (* y y)) x)

Calls

4 calls:

24.0ms	y
1.0ms	(*.f64 y y)
1.0ms	x
1.0ms	(-.f64 x (*.f64 y y))

Results

Accuracy	Segments	Branch
48.1%	1	`x`
48.1%	1	`(-.f64 x (*.f64 y y))`
48.1%	1	`(*.f64 y y)`
48.1%	1	`y`

Compiler

Compiled 10 to 11 computations (-10% saved)

bsearch8.0ms (0.5%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
7.0ms	1.3809903703870279e-59	1.1568322214810116e-58

Samples

3.0ms

96×

valid

Compiler

Compiled 110 to 93 computations (15.5% saved)

Precisions

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

ival-mult: 1.0ms (80.3% of total)

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

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

adjust: 0.0ms (0% of total)

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

simplify11.0ms (0.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	33
1	26	33
2	52	33
3	79	33
4	94	33

Stop Event

1×

saturated

Calls

Call 1

Inputs

(-.f64 x (*.f64 y y))

(if (<=.f64 y #s(literal 3250998599192227/28269553036454149273332760011886696253239742350009903329945699220681916416 binary64)) #s(approx (- x (* y y)) x) #s(approx (- x (* y y)) (*.f64 (neg.f64 y) y)))

#s(approx (- x (* y y)) x)

Outputs

(-.f64 x (*.f64 y y))

(if (<=.f64 y #s(literal 3250998599192227/28269553036454149273332760011886696253239742350009903329945699220681916416 binary64)) #s(approx (- x (* y y)) x) #s(approx (- x (* y y)) (*.f64 (neg.f64 y) y)))

#s(approx (- x (* y y)) x)

derivations68.0ms (4.4%)

Memory

-11.1MiB live, 29.7MiB allocated; 15ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 33 to 13 computations (60.6% saved)

preprocess16.0ms (1%)

Memory: 32.4MiB live, 32.4MiB allocated; 0ms collecting garbage
Remove: (abs y)
Compiler: Compiled 96 to 50 computations (47.9% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample953.0ms (61.9%)

explain73.0ms (4.8%)

preprocess17.0ms (1.1%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.2%)

simplify103.0ms (6.7%)

rewrite50.0ms (3.3%)

eval4.0ms (0.2%)

prune2.0ms (0.1%)

series39.0ms (2.5%)

simplify109.0ms (7.1%)

rewrite32.0ms (2.1%)

eval2.0ms (0.1%)

prune3.0ms (0.2%)

regimes6.0ms (0.4%)

regimes5.0ms (0.3%)

regimes35.0ms (2.3%)

bsearch8.0ms (0.5%)

simplify11.0ms (0.7%)

derivations68.0ms (4.4%)

preprocess16.0ms (1%)

end0.0ms (0%)

Profiling