Metrics for Examples.Basics.BasicTests:f1 from sbv-4.4

analyze0.0ms (0%)

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 10 to 6 computations (40% saved)

sample990.0ms (67.1%)

Results

566.0ms	4698×	body	256	valid
412.0ms	3558×	body	256	infinite

Bogosity

preprocess223.0ms (15.1%)

Algorithm

2×	egg-herbie

Rules

3394×	`fma-neg`
3140×	`associate-+r+`
2382×	`fma-def`
680×	`sub-neg`
532×	`unsub-neg`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	38
1	18	38
2	54	38
3	144	38
4	406	38
5	931	38
6	1656	38
7	2398	38
8	3799	38
9	4480	38
10	4632	38
11	4670	38
12	4708	38
13	4708	38
14	4708	38
15	4710	38
16	6774	38
17	6907	38
18	7102	38
0	2	2

Stop Event

1×	saturated
1×	node limit

Calls

Call 1

Inputs
0
1

Outputs
0
1

Call 2

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

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

Compiler

Compiled 11 to 7 computations (36.4% saved)

simplify172.0ms (11.6%)

Algorithm

1×	egg-herbie

Rules

6300×	`fma-def`
1852×	`distribute-lft-in`
1692×	`distribute-rgt-in`
618×	`sub-neg`
416×	`fma-neg`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	19
1	12	19
2	31	19
3	84	19
4	221	19
5	504	19
6	969	19
7	1848	19
8	3536	19
9	4138	19
10	4306	19
11	4348	19
12	4386	19
13	4386	19
14	4386	19
15	4388	19

Stop Event

1×	node limit

Counts

1 → 3

Calls

Call 1

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

Outputs
(*.f64 (+.f64 x y) (-.f64 x y))
(fma.f64 y (neg.f64 y) (*.f64 x x))
(-.f64 (.f64 x x) (.f64 y y))

eval1.0ms (0%)

Compiler: Compiled 23 to 10 computations (56.5% saved)

prune1.0ms (0.1%)

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	2	1	3
Fresh	0	1	1
Picked	0	0	0
Done	0	0	0
Total	2	2	4

Accurracy

100.0%

Counts

4 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 18 to 10 computations (44.4% saved)

localize23.0ms (1.6%)

Compiler: Compiled 18 to 6 computations (66.7% saved)

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accurracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 18 to 10 computations (44.4% saved)

simplify4.0ms (0.3%)

Algorithm

1×	egg-herbie

Rules

6×	`+-commutative`
4×	`sub-neg`
4×	`*-commutative`
2×	`neg-mul-1`
2×	`neg-sub0`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	19
1	12	19
2	17	19
3	19	19
4	20	19

Stop Event

1×	done
1×	saturated

Calls

Call 1

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

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

Compiler

Compiled 9 to 5 computations (44.4% saved)

soundness0.0ms (0%)

end59.0ms (4%)

Compiler: Compiled 36 to 20 computations (44.4% saved)

analyze0.0ms (0%)

sample990.0ms (67.1%)

preprocess223.0ms (15.1%)

simplify172.0ms (11.6%)

eval1.0ms (0%)

prune1.0ms (0.1%)

localize23.0ms (1.6%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify4.0ms (0.3%)

soundness0.0ms (0%)

end59.0ms (4%)

Profiling