Details

analyze233.0ms (5.9%)

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
0%	0%	99.9%	0.1%	0%	0%	0%	3
0%	0%	99.9%	0.1%	0%	0%	0%	4
0%	0%	99.9%	0.1%	0%	0%	0%	5
0%	0%	99.9%	0.1%	0%	0%	0%	6
12.5%	12.5%	87.4%	0.1%	0%	0%	0%	7
18.8%	18.7%	81.1%	0.1%	0%	0%	0%	8
25%	25%	74.9%	0.1%	0%	0%	0%	9
37.5%	37.4%	62.4%	0.1%	0%	0%	0%	10
44.5%	44.5%	55.4%	0.1%	0%	0%	0%	11
50.4%	50.3%	49.5%	0.1%	0%	0%	0%	12

Compiler

Compiled 16 to 10 computations (37.5% saved)

sample2.8s (71.3%)

Results

1.1s	2847×	body	1024	valid
652.0ms	1178×	body	2048	valid
542.0ms	2945×	body	256	valid
471.0ms	1285×	body	512	valid
1.0ms	1×	body	4096	valid

Bogosity

preprocess84.0ms (2.1%)

Algorithm

2×	egg-herbie

Rules

1262×	`associate--r+`
1042×	`associate-+r-`
954×	`distribute-lft-out`
912×	`associate--l+`
756×	`fma-def`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	116
1	76	116
2	191	4
3	690	4
4	1910	4
5	4937	4
6	6056	4
7	7674	4
0	3	3
1	3	3

Stop Event

1×	unsound
1×	node limit

Calls

Call 1

Inputs
0
1
2

Outputs
0
1
0
2
0

Call 2

Inputs
(-.f64 (fma.f64 x y z) (+.f64 1 (+.f64 (*.f64 x y) z)))
(-.f64 (fma.f64 y x z) (+.f64 1 (+.f64 (*.f64 y x) z)))
(-.f64 (fma.f64 z y x) (+.f64 1 (+.f64 (*.f64 z y) x)))
(-.f64 (fma.f64 x z y) (+.f64 1 (+.f64 (*.f64 x z) y)))

Outputs
(-.f64 (fma.f64 x y z) (+.f64 1 (+.f64 (*.f64 x y) z)))
(-.f64 (fma.f64 x y z) (+.f64 1 (fma.f64 x y z)))
-1
(-.f64 (fma.f64 y x z) (+.f64 1 (+.f64 (*.f64 y x) z)))
(-.f64 (fma.f64 x y z) (+.f64 1 (fma.f64 x y z)))
-1
(-.f64 (fma.f64 z y x) (+.f64 1 (+.f64 (*.f64 z y) x)))
(-.f64 (fma.f64 x y z) (+.f64 1 (fma.f64 x y z)))
-1
(-.f64 (fma.f64 x z y) (+.f64 1 (+.f64 (*.f64 x z) y)))
(-.f64 (fma.f64 x y z) (+.f64 1 (fma.f64 x y z)))
-1

Symmetry

(sort x y z)

Compiler

Compiled 18 to 12 computations (33.3% saved)

simplify301.0ms (7.6%)

Algorithm

1×	egg-herbie

Rules

8032×	`fma-def`
1314×	`+-commutative`
856×	`distribute-neg-in`
748×	`distribute-lft-in`
648×	`unsub-neg`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	12	29
1	27	29
2	67	1
3	237	1
4	670	1
5	2104	1
6	3974	1
7	4946	1
8	6106	1
9	6246	1
10	6278	1
11	6278	1
12	6546	1
13	6621	1
14	6697	1
15	6713	1
16	6713	1
17	6729	1
18	6729	1

Stop Event

1×	node limit

Counts

1 → 4

Calls

Call 1

Inputs
(-.f64 (fma.f64 x y z) (+.f64 1 (+.f64 (*.f64 x y) z)))

Outputs
(-.f64 (fma.f64 x y z) (+.f64 1 (+.f64 (*.f64 x y) z)))
(-.f64 (-.f64 (fma.f64 x y z) 1) (fma.f64 x y z))
(-.f64 (fma.f64 x y z) (+.f64 1 (fma.f64 x y z)))
-1

eval1.0ms (0%)

Compiler: Compiled 38 to 16 computations (57.9% saved)

prune1.0ms (0%)

Pruning

1 alts after pruning (1 fresh and 0 done)

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

Accurracy

100.0%

Counts

5 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
	100.0%	-1

Compiler

Compiled 4 to 4 computations (0% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Pruning

1 alts after pruning (1 fresh and 0 done)

	Kept	Total
New	0	0
Fresh	1	1
Picked	0	0
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%	-1

Compiler

Compiled 4 to 4 computations (0% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Pruning

1 alts after pruning (1 fresh and 0 done)

	Kept	Total
New	0	0
Fresh	1	1
Picked	0	0
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%	-1

Compiler

Compiled 4 to 4 computations (0% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Pruning

1 alts after pruning (1 fresh and 0 done)

	Kept	Total
New	0	0
Fresh	1	1
Picked	0	0
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%	-1

Compiler

Compiled 4 to 4 computations (0% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Pruning

1 alts after pruning (1 fresh and 0 done)

	Kept	Total
New	0	0
Fresh	1	1
Picked	0	0
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%	-1

Compiler

Compiled 4 to 4 computations (0% saved)

regimes15.0ms (0.4%)

Accuracy

Total -47.1b remaining (-∞%)

Threshold costs -47.1b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
-1
(-.f64 (fma.f64 x y z) (+.f64 1 (+.f64 (*.f64 x y) z)))

Outputs
-1

Calls

4 calls:

4.0ms	y
4.0ms	z
4.0ms	x
2.0ms	(-.f64 (fma.f64 x y z) (+.f64 1 (+.f64 (*.f64 x y) z)))

Results

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

Compiler

Compiled 43 to 28 computations (34.9% saved)

simplify4.0ms (0.1%)

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1

Stop Event

1×	fuel
1×	saturated

Calls

Call 1

Inputs
-1

Outputs
-1

Compiler

Compiled 4 to 4 computations (0% saved)

soundness479.0ms (12.1%)

Rules

8032×	`fma-def`
1314×	`+-commutative`
856×	`distribute-neg-in`
748×	`distribute-lft-in`
648×	`unsub-neg`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	12	29
1	27	29
2	67	1
3	237	1
4	670	1
5	2104	1
6	3974	1
7	4946	1
8	6106	1
9	6246	1
10	6278	1
11	6278	1
12	6546	1
13	6621	1
14	6697	1
15	6713	1
16	6713	1
17	6729	1
18	6729	1

Stop Event

1×	node limit

Compiler

Compiled 58 to 22 computations (62.1% saved)

end14.0ms (0.4%)

Remove: (sort x y z)
Compiler: Compiled 12 to 12 computations (0% saved)

Details

analyze233.0ms (5.9%)

sample2.8s (71.3%)

preprocess84.0ms (2.1%)

simplify301.0ms (7.6%)

eval1.0ms (0%)

prune1.0ms (0%)

eval0.0ms (0%)

prune1.0ms (0%)

eval0.0ms (0%)

prune1.0ms (0%)

eval0.0ms (0%)

prune1.0ms (0%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes15.0ms (0.4%)

simplify4.0ms (0.1%)

soundness479.0ms (12.1%)

end14.0ms (0.4%)

Profiling