Linear.Matrix:fromQuaternion from linear-1.19.1.3, A

Time bar (total: 1.4s)

analyze0.0ms (0%)

Algorithm
1×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
ival-sub: 0.0ms (0% of total)
ival-mult: 0.0ms (0% of total)
const: 0.0ms (0% of total)
backward-pass: 0.0ms (0% of total)

sample1.0s (72.6%)

Results
659.0ms8256×0valid
Precisions
Click to see histograms. Total time spent on operations: 354.0ms
ival-mult: 292.0ms (82.6% of total)
ival-sub: 48.0ms (13.6% of total)
const: 11.0ms (3.1% of total)
backward-pass: 3.0ms (0.8% of total)
Bogosity

preprocess112.0ms (8.1%)

Algorithm
1×egg-herbie
Rules
597×fma-neg
216×fma-define
172×unsub-neg
163×associate-*r*
148×distribute-lft-in
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
028212
191196
2210196
3722196
41664196
52112196
62480196
72600196
82600196
Stop Event
1×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 #s(literal 2 binary64) (-.f64 (*.f64 x x) (*.f64 x y)))
(*.f64 #s(literal 2 binary64) (*.f64 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 x (-.f64 x (neg.f64 y))))
(*.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x y)))
(*.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)))
(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 x (*.f64 #s(literal -2 binary64) (+.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 x (-.f64 x (neg.f64 y))))
(*.f64 (*.f64 x (+.f64 x y)) #s(literal -2 binary64))
(*.f64 x (*.f64 #s(literal -2 binary64) (+.f64 x y)))
(*.f64 #s(literal 2 binary64) (-.f64 (*.f64 y y) (*.f64 y x)))
(*.f64 #s(literal 2 binary64) (*.f64 y (-.f64 y x)))
(*.f64 y (*.f64 (-.f64 y x) #s(literal 2 binary64)))
(*.f64 y (*.f64 #s(literal 2 binary64) (-.f64 y x)))
(*.f64 y (*.f64 #s(literal -2 binary64) (-.f64 x y)))

explain72.0ms (5.2%)

FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
90-0-(-.f64 (*.f64 x x) (*.f64 x y))
00-0-x
00-0-(*.f64 x y)
00-0-(*.f64 x x)
00-0-(*.f64 #s(literal 2 binary64) (-.f64 (*.f64 x x) (*.f64 x y)))
00-0-#s(literal 2 binary64)
00-0-y
Results
46.0ms512×0valid
Compiler

Compiled 67 to 25 computations (62.7% saved)

Precisions
Click to see histograms. Total time spent on operations: 24.0ms
ival-mult: 18.0ms (75.5% of total)
ival-sub: 5.0ms (21% of total)
const: 1.0ms (4.2% of total)
backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler

Compiled 9 to 6 computations (33.3% saved)

prune1.0ms (0%)

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

Compiled 9 to 6 computations (33.3% saved)

localize24.0ms (1.7%)

Results
17.0ms256×0valid
Compiler

Compiled 21 to 8 computations (61.9% saved)

Precisions
Click to see histograms. Total time spent on operations: 7.0ms
ival-sub: 3.0ms (40.5% of total)
ival-mult: 3.0ms (40.5% of total)
const: 0.0ms (0% of total)
backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler

Compiled 2 to 2 computations (0% saved)

prune6.0ms (0.4%)

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

Compiled 27 to 17 computations (37% saved)

regimes5.0ms (0.4%)

Accuracy

Total -2.2b remaining (-∞%)

Threshold costs -2.2b (-∞%)

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

4 calls:

1.0ms
x
1.0ms
y
1.0ms
(*.f64 #s(literal 2 binary64) (-.f64 (*.f64 x x) (*.f64 x y)))
1.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.2%)

Algorithm
1×egg-herbie
Rules
3×*-commutative
2×sub-neg
2×+-commutative
1×neg-sub0
1×neg-mul-1
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01128
11628
22128
32328
42428
Stop Event
1×saturated
Calls
Call 1
Inputs
(*.f64 #s(literal 2 binary64) (*.f64 x (-.f64 x y)))
Outputs
(*.f64 #s(literal 2 binary64) (*.f64 x (-.f64 x y)))

soundness134.0ms (9.6%)

Rules
597×fma-neg
216×fma-define
172×unsub-neg
163×associate-*r*
148×distribute-lft-in
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
028212
191196
2210196
3722196
41664196
52112196
62480196
72600196
82600196
Stop Event
1×done
1×saturated
Compiler

Compiled 27 to 17 computations (37% saved)

preprocess25.0ms (1.8%)

Compiler

Compiled 58 to 38 computations (34.5% saved)

end0.0ms (0%)

Profiling

Loading profile data...