Metrics for Numeric.Interval.Internal:scale from intervals-0.7.1, B

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.6MiB live, 0.6MiB 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 7 computations (0% saved)

sample1.1s (48.2%)

Memory

17.0MiB live, 1 085.9MiB allocated; 445ms collecting garbage

Samples

834.0ms

8 256×

valid

Precisions

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

ival-mult: 154.0ms (55.4% of total)

ival-div: 108.0ms (38.9% of total)

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

exact: 5.0ms (1.8% of total)

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

adjust: 2.0ms (0.7% of total)

Bogosity

explain83.0ms (3.5%)

Memory

17.8MiB live, 107.6MiB allocated; 20ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
-	-	`(*.f64 x 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

20.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.1% of total)

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

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess298.0ms (12.6%)

Memory

-7.8MiB live, 170.9MiB allocated; 61ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	30
1	31	27
2	70	25
3	152	25
4	247	25
5	420	25
6	1523	25
7	4833	25
0	5	5
0	7	5
1	12	5
2	18	5
3	31	5
4	59	5
5	163	5
6	1040	5
7	5503	5
0	8410	5

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

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

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

Symmetry

(negabs y)

(negabs x)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series5.0ms (0.2%)

Memory

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

Counts

5 → 4

Calls

Call 1

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

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

Calls

6 calls:

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

simplify162.0ms (6.8%)

Memory

-12.0MiB live, 137.0MiB allocated; 46ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	24
1	19	24
2	32	24
3	47	24
4	75	24
5	181	24
6	1094	24
7	5299	24
0	8014	24

Stop Event

1×	iter limit
1×	node limit

Counts

4 → 4

Calls

Call 1

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

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

rewrite29.0ms (1.2%)

Memory

0.9MiB live, 46.7MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	16	11
0	47	11

Stop Event

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

Counts

5 → 13

Calls

Call 1

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

Outputs
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(*.f64 y (/.f64 x #s(literal 2 binary64)))
(*.f64 x (/.f64 y #s(literal 2 binary64)))
(/.f64 (neg.f64 (*.f64 (neg.f64 x) y)) #s(literal 2 binary64))
(/.f64 (*.f64 (neg.f64 x) y) #s(literal -2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(*.f64 y x)
(*.f64 x y)
x
y
#s(literal 2 binary64)

eval1.0ms (0.1%)

Memory: 3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 105 to 36 computations (65.7% saved)

prune1.0ms (0%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	15	2	17
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	16	2	18

Accuracy

100.0%

Counts

18 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (/.f64 y #s(literal 2 binary64)) x)
▶	100.0%	#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Compiler

Compiled 16 to 14 computations (12.5% saved)

series5.0ms (0.2%)

Memory

9.6MiB live, 9.5MiB allocated; 0ms collecting garbage

Counts

9 → 7

Calls

Call 1

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

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

Calls

6 calls:

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

simplify150.0ms (6.4%)

Memory

-26.0MiB live, 162.4MiB allocated; 37ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	53
1	30	53
2	39	53
3	52	53
4	80	53
5	186	53
6	1103	53
7	5314	53
0	8029	53

Stop Event

1×	iter limit
1×	node limit

Counts

7 → 7

Calls

Call 1

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

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

rewrite20.0ms (0.8%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	31
0	15	31
1	29	31
0	70	31

Stop Event

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

Counts

9 → 26

Calls

Call 1

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

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

eval3.0ms (0.1%)

Memory: 7.0MiB live, 7.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 299 to 74 computations (75.3% saved)

prune39.0ms (1.7%)

Memory

-34.8MiB live, 23.6MiB allocated; 42ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	34	1	35
Fresh	0	0	0
Picked	2	0	2
Done	0	0	0
Total	36	1	37

Accuracy

100.0%

Counts

37 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Compiler

Compiled 9 to 8 computations (11.1% saved)

series3.0ms (0.1%)

Memory

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

Counts

6 → 5

Calls

Call 1

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

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

Calls

6 calls:

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

simplify176.0ms (7.5%)

Memory

27.3MiB live, 165.3MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	31
1	24	31
2	34	31
3	47	31
4	75	31
5	181	31
6	1105	31
7	5315	31
0	8031	31

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

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

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

rewrite40.0ms (1.7%)

Memory

-22.8MiB live, 74.4MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	22
0	10	22
1	18	22
0	39	22

Stop Event

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

Counts

6 → 8

Calls

Call 1

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

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

eval3.0ms (0.1%)

Memory: 6.4MiB live, 6.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 105 to 21 computations (80% saved)

prune5.0ms (0.2%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	11	0	11
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	11	1	12

Accuracy

100.0%

Counts

12 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Compiler

Compiled 39 to 26 computations (33.3% saved)

regimes23.0ms (1%)

Memory

-12.8MiB live, 32.9MiB allocated; 3ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

13.0ms	y
3.0ms	x
3.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
3.0ms	(*.f64 x y)

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes8.0ms (0.3%)

Memory

18.4MiB live, 18.4MiB 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) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

simplify51.0ms (2.1%)

Memory

-21.9MiB live, 77.6MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	20
1	17	20
2	23	20
3	37	20
4	77	20
5	415	20
6	3627	20

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations87.0ms (3.7%)

Memory

-23.0MiB live, 69.5MiB allocated; 5ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 20 to 13 computations (35% saved)

preprocess31.0ms (1.3%)

Memory

2.5MiB live, 47.9MiB allocated; 8ms collecting garbage

Remove

(sort x y)

(negabs x)

(negabs y)

Compiler

Compiled 104 to 84 computations (19.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.1s (48.2%)

explain83.0ms (3.5%)

preprocess298.0ms (12.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series5.0ms (0.2%)

simplify162.0ms (6.8%)

rewrite29.0ms (1.2%)

eval1.0ms (0.1%)

prune1.0ms (0%)

series5.0ms (0.2%)

simplify150.0ms (6.4%)

rewrite20.0ms (0.8%)

eval3.0ms (0.1%)

prune39.0ms (1.7%)

series3.0ms (0.1%)

simplify176.0ms (7.5%)

rewrite40.0ms (1.7%)

eval3.0ms (0.1%)

prune5.0ms (0.2%)

regimes23.0ms (1%)

regimes8.0ms (0.3%)

simplify51.0ms (2.1%)

derivations87.0ms (3.7%)

preprocess31.0ms (1.3%)

end0.0ms (0%)

Profiling