Linear.Matrix:fromQuaternion from linear-1.19.1.3, B

Time bar (total: 1.6s)

analyze0.0ms (0%)

Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 12 to 8 computations (33.3% saved)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
Operation ival-add, time spent: 0.0ms, 0.0% of total-time
Operation ival-mult, time spent: 0.0ms, 0.0% of total-time
Operation const, time spent: 0.0ms, 0.0% of total-time

sample1.1s (69.1%)

Results
755.0ms5895×0valid
301.0ms2360×0infinite
0.0ms0valid
Precisions
Click to see histograms. Total time spent on operations: 271.0ms
Operation ival-mult, time spent: 199.0ms, 73.0% of total-time
Operation ival-add, time spent: 56.0ms, 21.0% of total-time
Operation const, time spent: 12.0ms, 4.0% of total-time
Operation backward-pass, time spent: 5.0ms, 2.0% of total-time
Bogosity

preprocess227.0ms (13.9%)

Algorithm
egg-herbie
Rules
837×fma-define
554×fma-neg
143×unsub-neg
114×distribute-lft-neg-in
104×distribute-lft-in
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
190-0-(+.f64 (*.f64 x x) (*.f64 x y))
00-0-x
00-0-(*.f64 x y)
00-0-(*.f64 x x)
01(1.1294345893684766e-256 1.2208059873677142e-68)0-(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x y)))
00-0-#s(literal 2 binary64)
00-0-y
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
028212
195196
2276196
3788196
41499196
52581196
62976196
73094196
83126196
93136196
103137196
Stop Event
saturated
Calls
Call 1
Inputs
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x y)))
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x y)))
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 (neg.f64 x) (neg.f64 x)) (*.f64 (neg.f64 x) y)))
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x (neg.f64 y))))
(neg.f64 (*.f64 #s(literal 2 binary64) (+.f64 (*.f64 (neg.f64 x) (neg.f64 x)) (*.f64 (neg.f64 x) y))))
(neg.f64 (*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x (neg.f64 y)))))
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 y y) (*.f64 y x)))
Outputs
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x y)))
(*.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x y)))
(*.f64 (+.f64 x y) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x y)))
(*.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x y)))
(*.f64 (+.f64 x y) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 (neg.f64 x) (neg.f64 x)) (*.f64 (neg.f64 x) y)))
(*.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x (neg.f64 y))))
(*.f64 #s(literal 2 binary64) (*.f64 x (-.f64 x y)))
(*.f64 (-.f64 y x) (*.f64 x #s(literal -2 binary64)))
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x (neg.f64 y))))
(*.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x (neg.f64 y))))
(*.f64 #s(literal 2 binary64) (*.f64 x (-.f64 x y)))
(*.f64 (-.f64 y x) (*.f64 x #s(literal -2 binary64)))
(neg.f64 (*.f64 #s(literal 2 binary64) (+.f64 (*.f64 (neg.f64 x) (neg.f64 x)) (*.f64 (neg.f64 x) y))))
(*.f64 #s(literal -2 binary64) (*.f64 x (+.f64 x (neg.f64 y))))
(*.f64 (*.f64 x (-.f64 x y)) #s(literal -2 binary64))
(*.f64 #s(literal 2 binary64) (*.f64 x (-.f64 y x)))
(neg.f64 (*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x (neg.f64 y)))))
(*.f64 #s(literal -2 binary64) (*.f64 x (+.f64 x (neg.f64 y))))
(*.f64 (*.f64 x (-.f64 x y)) #s(literal -2 binary64))
(*.f64 #s(literal 2 binary64) (*.f64 x (-.f64 y x)))
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 y y) (*.f64 y x)))
(*.f64 #s(literal 2 binary64) (*.f64 y (+.f64 y x)))
(*.f64 #s(literal 2 binary64) (*.f64 y (+.f64 x y)))
Compiler

Compiled 67 to 25 computations (62.7% saved)

Precisions
Click to see histograms. Total time spent on operations: 23.0ms
Operation ival-mult, time spent: 19.0ms, 83.0% of total-time
Operation ival-add, time spent: 3.0ms, 13.0% of total-time
Operation const, time spent: 1.0ms, 4.0% of total-time

eval1.0ms (0%)

Compiler

Compiled 16 to 9 computations (43.8% saved)

prune1.0ms (0.1%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 (+.f64 x y) (*.f64 #s(literal 2 binary64) x))
Compiler

Compiled 9 to 6 computations (33.3% saved)

localize35.0ms (2.1%)

Compiler

Compiled 19 to 10 computations (47.4% saved)

Precisions
Click to see histograms. Total time spent on operations: 11.0ms
Operation ival-mult, time spent: 8.0ms, 76.0% of total-time
Operation ival-add, time spent: 2.0ms, 19.0% of total-time
Operation const, time spent: 1.0ms, 10.0% of total-time

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)

PrunedKeptTotal
New000
Fresh000
Picked011
Done000
Total011
Accuracy
100.0%
Counts
1 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 (+.f64 x y) (*.f64 #s(literal 2 binary64) x))
Compiler

Compiled 27 to 17 computations (37% saved)

regimes9.0ms (0.5%)

Accuracy

Total -4.8b remaining (-∞%)

Threshold costs -4.8b (-∞%)

Counts
2 → 1
Calls
Call 1
Inputs
(*.f64 (+.f64 x y) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x y)))
Outputs
(*.f64 (+.f64 x y) (*.f64 #s(literal 2 binary64) x))
Calls

4 calls:

2.0ms
(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x y)))
2.0ms
x
2.0ms
y
2.0ms
(+.f64 (*.f64 x x) (*.f64 x y))
Results
AccuracySegmentsBranch
100.0%1x
100.0%1y
100.0%1(*.f64 #s(literal 2 binary64) (+.f64 (*.f64 x x) (*.f64 x y)))
100.0%1(+.f64 (*.f64 x x) (*.f64 x y))
Compiler

Compiled 26 to 16 computations (38.5% saved)

simplify2.0ms (0.1%)

Algorithm
egg-herbie
Rules
*-commutative
+-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01128
11428
Stop Event
done
saturated
Calls
Call 1
Inputs
(*.f64 (+.f64 x y) (*.f64 #s(literal 2 binary64) x))
Outputs
(*.f64 (+.f64 x y) (*.f64 #s(literal 2 binary64) x))
(*.f64 (+.f64 x y) (*.f64 x #s(literal 2 binary64)))
Compiler

Compiled 9 to 6 computations (33.3% saved)

soundness195.0ms (11.9%)

Rules
837×fma-define
554×fma-neg
143×unsub-neg
114×distribute-lft-neg-in
104×distribute-lft-in
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
028212
195196
2276196
3788196
41499196
52581196
62976196
73094196
83126196
93136196
103137196
Stop Event
saturated
Compiler

Compiled 48 to 24 computations (50% saved)

end0.0ms (0%)

preprocess34.0ms (2.1%)

Compiler

Compiled 58 to 38 computations (34.5% saved)

Profiling

Loading profile data...