Metrics for Hyperbolic secant

analyze0.0ms (0%)

Algorithm

1×

Search

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

Compiler

Compiled 10 to 8 computations (20% saved)

Precisions

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

Operation ival-div, time spent: 0.0ms, 0.0% of total-time

Operation ival-exp, time spent: 0.0ms, 0.0% of total-time

Operation ival-add, time spent: 0.0ms, 0.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

Operation ival-neg, time spent: 0.0ms, 0.0% of total-time

sample1.4s (49.4%)

Results

1.4s	8255×	256	valid
0.0ms	1×	256	valid

Precisions

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

Operation ival-exp, time spent: 345.0ms, 53.0% of total-time

Operation ival-add, time spent: 130.0ms, 20.0% of total-time

Operation ival-div, time spent: 84.0ms, 13.0% of total-time

Operation ival-neg, time spent: 80.0ms, 12.0% of total-time

Operation const, time spent: 14.0ms, 2.0% of total-time

Bogosity

preprocess141.0ms (4.8%)

Algorithm

1×	egg-herbie

Rules

40×	`fma-define`
40×	`fmm-def`
24×	`sub-neg`
14×	`distribute-lft-neg-in`
14×	`cancel-sign-sub-inv`

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`x`
-	-	`(exp.f64 (neg.f64 x))`
-	-	`(neg.f64 x)`
-	-	`(exp.f64 x)`
-	-	`(+.f64 (exp.f64 x) (exp.f64 (neg.f64 x)))`
-	-	`#s(literal 2 binary64)`
-	-	`(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	124
1	35	124
2	67	124
3	113	124
4	170	124
5	231	124
6	286	124
7	302	124
8	309	124
9	320	124
10	332	124
11	334	124

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 (neg.f64 x)) (exp.f64 (neg.f64 (neg.f64 x)))))
(neg.f64 (/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 (neg.f64 x)) (exp.f64 (neg.f64 (neg.f64 x))))))

Outputs
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 (neg.f64 x)) (exp.f64 (neg.f64 (neg.f64 x)))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(neg.f64 (/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 (neg.f64 x)) (exp.f64 (neg.f64 (neg.f64 x))))))
(/.f64 #s(literal -2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))

Symmetry

(abs x)

Compiler

Compiled 59 to 25 computations (57.6% saved)

Precisions

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

Operation ival-exp, time spent: 9.0ms, 42.0% of total-time

Operation ival-div, time spent: 5.0ms, 23.0% of total-time

Operation ival-add, time spent: 3.0ms, 14.0% of total-time

Operation ival-neg, time spent: 2.0ms, 9.0% of total-time

Operation const, time spent: 1.0ms, 5.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))

Compiler

Compiled 9 to 7 computations (22.2% saved)

localize37.0ms (1.3%)

Localize:

Found 1 expressions with local error:

New	Accuracy	Program
✓	100.0%	(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))

Compiler

Compiled 25 to 9 computations (64% saved)

Precisions

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

Operation ival-exp, time spent: 5.0ms, 50.0% of total-time

Operation ival-div, time spent: 2.0ms, 20.0% of total-time

Operation ival-add, time spent: 2.0ms, 20.0% of total-time

Operation const, time spent: 1.0ms, 10.0% of total-time

Operation ival-neg, time spent: 1.0ms, 10.0% of total-time

series3.0ms (0.1%)

Counts

1 → 8

Calls

Call 1

Inputs
#<alt (/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))>

Outputs
#<alt #s(literal 1 binary64)>
#<alt (+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64))))>
#<alt (+.f64 #s(literal 1 binary64) (.f64 (pow.f64 x #s(literal 2 binary64)) (-.f64 (.f64 #s(literal 5/24 binary64) (pow.f64 x #s(literal 2 binary64))) #s(literal 1/2 binary64))))>
#<alt (+.f64 #s(literal 1 binary64) (.f64 (pow.f64 x #s(literal 2 binary64)) (-.f64 (.f64 (pow.f64 x #s(literal 2 binary64)) (+.f64 #s(literal 5/24 binary64) (*.f64 #s(literal -61/720 binary64) (pow.f64 x #s(literal 2 binary64))))) #s(literal 1/2 binary64))))>
#<alt (/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))>
#<alt (/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))>
#<alt (/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))>
#<alt (/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))>

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	(/ 2 (+ (exp x) (exp (neg x))))
1.0ms	x	@	inf	(/ 2 (+ (exp x) (exp (neg x))))
1.0ms	x	@	0	(/ 2 (+ (exp x) (exp (neg x))))

rewrite396.0ms (13.5%)

Algorithm

1×	batch-egg-rewrite

Rules

62×	`add-exp-log`
62×	`add-log-exp`
62×	`log1p-expm1-u`
62×	`expm1-log1p-u`
60×	`add-cube-cbrt`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	20
1	144	20
2	2343	20

Stop Event

1×

unsound

Counts

1 → 10

Calls

Call 1

Inputs
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))

Outputs
#s(literal -4 binary64)
#s(literal -2 binary64)
#s(literal -1 binary64)
#s(literal 0 binary64)
#s(literal 1/2 binary64)
#s(literal 1 binary64)
#s(literal 3/2 binary64)
#s(literal 2 binary64)
#s(literal 3 binary64)
#s(literal 4 binary64)

simplify469.0ms (16%)

Algorithm

1×	egg-herbie

Rules

2386×	`fma-define`
583×	`fmm-def`
386×	`distribute-lft-in`
264×	`associate-+l-`
250×	`distribute-rgt-in`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	37	256
1	68	240
2	136	240
3	294	240
4	582	240
5	929	240
6	1108	240
7	1587	240
8	2418	240
9	3805	240
10	4690	240
11	5136	240
12	5208	240
13	5216	240
14	5216	240
15	5348	240
16	5404	240
17	5404	240
18	7287	240
19	7287	240
20	7287	240
21	7287	240
22	7287	240
23	7289	240

Stop Event

1×

saturated

Counts

18 → 23

Calls

Call 1

Inputs
#s(literal 1 binary64)
(+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64))))
(+.f64 #s(literal 1 binary64) (.f64 (pow.f64 x #s(literal 2 binary64)) (-.f64 (.f64 #s(literal 5/24 binary64) (pow.f64 x #s(literal 2 binary64))) #s(literal 1/2 binary64))))
(+.f64 #s(literal 1 binary64) (.f64 (pow.f64 x #s(literal 2 binary64)) (-.f64 (.f64 (pow.f64 x #s(literal 2 binary64)) (+.f64 #s(literal 5/24 binary64) (*.f64 #s(literal -61/720 binary64) (pow.f64 x #s(literal 2 binary64))))) #s(literal 1/2 binary64))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))
#s(literal -4 binary64)
#s(literal -2 binary64)
#s(literal -1 binary64)
#s(literal 0 binary64)
#s(literal 1/2 binary64)
#s(literal 1 binary64)
#s(literal 3/2 binary64)
#s(literal 2 binary64)
#s(literal 3 binary64)
#s(literal 4 binary64)

Outputs
#s(literal 1 binary64)
(+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64))))
(fma.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64)) #s(literal 1 binary64))
(+.f64 #s(literal 1 binary64) (.f64 (pow.f64 x #s(literal 2 binary64)) (-.f64 (.f64 #s(literal 5/24 binary64) (pow.f64 x #s(literal 2 binary64))) #s(literal 1/2 binary64))))
(+.f64 #s(literal 1 binary64) (*.f64 (pow.f64 x #s(literal 2 binary64)) (fma.f64 #s(literal 5/24 binary64) (pow.f64 x #s(literal 2 binary64)) #s(literal -1/2 binary64))))
(fma.f64 (pow.f64 x #s(literal 2 binary64)) (fma.f64 (pow.f64 x #s(literal 2 binary64)) #s(literal 5/24 binary64) #s(literal -1/2 binary64)) #s(literal 1 binary64))
(fma.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64)) (fma.f64 #s(literal 5/24 binary64) (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)))
(+.f64 #s(literal 1 binary64) (.f64 (pow.f64 x #s(literal 2 binary64)) (-.f64 (.f64 (pow.f64 x #s(literal 2 binary64)) (+.f64 #s(literal 5/24 binary64) (*.f64 #s(literal -61/720 binary64) (pow.f64 x #s(literal 2 binary64))))) #s(literal 1/2 binary64))))
(+.f64 #s(literal 1 binary64) (.f64 (pow.f64 x #s(literal 2 binary64)) (fma.f64 (pow.f64 x #s(literal 2 binary64)) (+.f64 #s(literal 5/24 binary64) (.f64 (pow.f64 x #s(literal 2 binary64)) #s(literal -61/720 binary64))) #s(literal -1/2 binary64))))
(fma.f64 (pow.f64 x #s(literal 2 binary64)) (fma.f64 (pow.f64 x #s(literal 2 binary64)) (fma.f64 (pow.f64 x #s(literal 2 binary64)) #s(literal -61/720 binary64) #s(literal 5/24 binary64)) #s(literal -1/2 binary64)) #s(literal 1 binary64))
(fma.f64 (pow.f64 x #s(literal 2 binary64)) (fma.f64 (pow.f64 x #s(literal 2 binary64)) #s(literal 5/24 binary64) (fma.f64 #s(literal -61/720 binary64) (pow.f64 x #s(literal 4 binary64)) #s(literal -1/2 binary64))) #s(literal 1 binary64))
(fma.f64 #s(literal -61/720 binary64) (pow.f64 x #s(literal 6 binary64)) (fma.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64)) (fma.f64 #s(literal 5/24 binary64) (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (*.f64 #s(literal -1 binary64) x))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
#s(literal -4 binary64)
#s(literal -2 binary64)
#s(literal -1 binary64)
#s(literal 0 binary64)
#s(literal 1/2 binary64)
#s(literal 1 binary64)
#s(literal 3/2 binary64)
#s(literal 2 binary64)
#s(literal 3 binary64)
#s(literal 4 binary64)

eval65.0ms (2.2%)

Compiler: Compiled 173 to 143 computations (17.3% saved)

prune4.0ms (0.1%)

Pruning

3 alts after pruning (3 fresh and 0 done)

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

Accuracy

100.0%

Counts

24 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	48.3%	(+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64))))
▶	48.8%	#s(literal 1 binary64)
▶	54.2%	#s(literal 0 binary64)

Compiler

Compiled 12 to 11 computations (8.3% saved)

localize182.0ms (6.2%)

Compiler: Compiled 23 to 19 computations (17.4% saved)
Precisions: Click to see histograms. Total time spent on operations: 145.0ms
Operation ival-pow, time spent: 139.0ms, 96.0% of total-time
Operation ival-mult, time spent: 3.0ms, 2.0% of total-time
Operation const, time spent: 2.0ms, 1.0% of total-time
Operation ival-add, time spent: 2.0ms, 1.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune2.0ms (0.1%)

Pruning

3 alts after pruning (0 fresh and 3 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	3	3
Done	0	0
Total	3	3

Accuracy

100.0%

Counts

3 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	48.3%	(+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64))))
✓	48.8%	#s(literal 1 binary64)
✓	54.2%	#s(literal 0 binary64)

Compiler

Compiled 30 to 26 computations (13.3% saved)

regimes4.0ms (0.1%)

Counts

4 → 1

Calls

Call 1

Inputs
#s(literal 0 binary64)
#s(literal 1 binary64)
(+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64))))
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))

Outputs
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))

Calls

3 calls:

2.0ms	x
1.0ms	(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
1.0ms	(+.f64 (exp.f64 x) (exp.f64 (neg.f64 x)))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))`
100.0%	1	`(+.f64 (exp.f64 x) (exp.f64 (neg.f64 x)))`

Compiler

Compiled 18 to 13 computations (27.8% saved)

regimes9.0ms (0.3%)

Counts

3 → 2

Calls

Call 1

Inputs
#s(literal 0 binary64)
#s(literal 1 binary64)
(+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64))))

Outputs
(+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64))))
#s(literal 0 binary64)

Calls

1 calls:

9.0ms

Results

Accuracy	Segments	Branch
100.0%	2	`x`

Compiler

Compiled 2 to 1 computations (50% saved)

regimes2.0ms (0.1%)

Counts

2 → 2

Calls

Call 1

Inputs
#s(literal 0 binary64)
#s(literal 1 binary64)

Outputs
#s(literal 1 binary64)
#s(literal 0 binary64)

Calls

1 calls:

2.0ms

Results

Accuracy	Segments	Branch
99.9%	2	`x`

Compiler

Compiled 2 to 1 computations (50% saved)

regimes1.0ms (0%)

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(literal 0 binary64)

Outputs
#s(literal 0 binary64)

Calls

1 calls:

1.0ms

Results

Accuracy	Segments	Branch
54.2%	1	`x`

Compiler

Compiled 2 to 1 computations (50% saved)

bsearch24.0ms (0.8%)

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
24.0ms	4.780471924983433e-7	69869040.65072925

Results

21.0ms	159×	256	valid
0.0ms	1×	256	valid

Compiler

Compiled 133 to 120 computations (9.8% saved)

Precisions

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

Operation ival-exp, time spent: 4.0ms, 52.0% of total-time

Operation ival-div, time spent: 1.0ms, 13.0% of total-time

Operation ival-add, time spent: 1.0ms, 13.0% of total-time

Operation ival-neg, time spent: 1.0ms, 13.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

bsearch62.0ms (2.1%)

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
62.0ms	4.780471924983433e-7	69869040.65072925

Results

59.0ms	159×	256	valid
0.0ms	1×	256	valid

Compiler

Compiled 73 to 70 computations (4.1% saved)

Precisions

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

Operation ival-div, time spent: 41.0ms, 87.0% of total-time

Operation ival-exp, time spent: 4.0ms, 8.0% of total-time

Operation ival-add, time spent: 1.0ms, 2.0% of total-time

Operation ival-neg, time spent: 1.0ms, 2.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

simplify5.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
3×	`+-commutative`
2×	`*-commutative`
1×	`sub-neg`
1×	`neg-sub0`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	81
1	37	81
2	39	81
3	40	81

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(if (<=.f64 x #s(literal 6530219459687219/4503599627370496 binary64)) (+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64)))) #s(literal 0 binary64))
(if (<=.f64 x #s(literal 350 binary64)) #s(literal 1 binary64) #s(literal 0 binary64))
#s(literal 0 binary64)

Outputs
(/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x))))
(if (<=.f64 x #s(literal 6530219459687219/4503599627370496 binary64)) (+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) (pow.f64 x #s(literal 2 binary64)))) #s(literal 0 binary64))
(if (<=.f64 x #s(literal 350 binary64)) #s(literal 1 binary64) #s(literal 0 binary64))
#s(literal 0 binary64)

Compiler

Compiled 31 to 26 computations (16.1% saved)

soundness32.0ms (1.1%)

Rules

62×	`add-exp-log`
62×	`add-log-exp`
62×	`log1p-expm1-u`
62×	`expm1-log1p-u`
60×	`add-cube-cbrt`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	20
1	144	20
2	2343	20

Stop Event

1×

unsound

end0.0ms (0%)

preprocess43.0ms (1.5%)

Compiler: Compiled 152 to 126 computations (17.1% saved)

Iter	Nodes	Cost
0	17	124
1	35	124
2	67	124
3	113	124
4	170	124
5	231	124
6	286	124
7	302	124
8	309	124
9	320	124
10	332	124
11	334	124

Iter	Nodes	Cost
0	17	124
1	35	124
2	67	124
3	113	124
4	170	124
5	231	124
6	286	124
7	302	124
8	309	124
9	320	124
10	332	124
11	334	124

analyze0.0ms (0%)

sample1.4s (49.4%)

preprocess141.0ms (4.8%)

eval0.0ms (0%)

prune1.0ms (0%)

localize37.0ms (1.3%)

series3.0ms (0.1%)

rewrite396.0ms (13.5%)

simplify469.0ms (16%)

eval65.0ms (2.2%)

prune4.0ms (0.1%)

localize182.0ms (6.2%)

eval0.0ms (0%)

prune2.0ms (0.1%)

regimes4.0ms (0.1%)

regimes9.0ms (0.3%)

regimes2.0ms (0.1%)

regimes1.0ms (0%)

bsearch24.0ms (0.8%)

bsearch62.0ms (2.1%)

simplify5.0ms (0.2%)

soundness32.0ms (1.1%)

end0.0ms (0%)

preprocess43.0ms (1.5%)

Profiling

Iter	Nodes	Cost
0	17	124
1	35	124
2	67	124
3	113	124
4	170	124
5	231	124
6	286	124
7	302	124
8	309	124
9	320	124
10	332	124
11	334	124