Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Innermost 2019-03-28 22.12 pair #432271095
details
property
value
status
complete
benchmark
PEANO_nosorts_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n031.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.179116 seconds
cpu usage
0.176219
user time
0.120241
system time
0.055978
max virtual memory
113176.0
max residence set size
6696.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.17 YES 0.00/0.17 0.00/0.17 Problem 1: 0.00/0.17 0.00/0.17 (VAR v_NonEmpty:S M:S N:S X:S X1:S X2:S) 0.00/0.17 (RULES 0.00/0.17 a__and(tt,X:S) -> mark(X:S) 0.00/0.17 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.17 a__plus(N:S,0) -> mark(N:S) 0.00/0.17 a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) 0.00/0.17 a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.17 mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 mark(tt) -> tt 0.00/0.17 ) 0.00/0.17 (STRATEGY INNERMOST) 0.00/0.17 0.00/0.17 Problem 1: 0.00/0.17 0.00/0.17 Dependency Pairs Processor: 0.00/0.17 -> Pairs: 0.00/0.17 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.17 A__PLUS(N:S,0) -> MARK(N:S) 0.00/0.17 A__PLUS(N:S,s(M:S)) -> A__PLUS(mark(N:S),mark(M:S)) 0.00/0.17 A__PLUS(N:S,s(M:S)) -> MARK(M:S) 0.00/0.17 A__PLUS(N:S,s(M:S)) -> MARK(N:S) 0.00/0.17 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.17 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) 0.00/0.17 MARK(plus(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(plus(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 -> Rules: 0.00/0.17 a__and(tt,X:S) -> mark(X:S) 0.00/0.17 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.17 a__plus(N:S,0) -> mark(N:S) 0.00/0.17 a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) 0.00/0.17 a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.17 mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 mark(tt) -> tt 0.00/0.17 0.00/0.17 Problem 1: 0.00/0.17 0.00/0.17 SCC Processor: 0.00/0.17 -> Pairs: 0.00/0.17 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.17 A__PLUS(N:S,0) -> MARK(N:S) 0.00/0.17 A__PLUS(N:S,s(M:S)) -> A__PLUS(mark(N:S),mark(M:S)) 0.00/0.17 A__PLUS(N:S,s(M:S)) -> MARK(M:S) 0.00/0.17 A__PLUS(N:S,s(M:S)) -> MARK(N:S) 0.00/0.17 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.17 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) 0.00/0.17 MARK(plus(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(plus(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 -> Rules: 0.00/0.17 a__and(tt,X:S) -> mark(X:S) 0.00/0.17 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.17 a__plus(N:S,0) -> mark(N:S) 0.00/0.17 a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) 0.00/0.17 a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.17 mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 mark(tt) -> tt 0.00/0.17 ->Strongly Connected Components: 0.00/0.17 ->->Cycle: 0.00/0.17 ->->-> Pairs: 0.00/0.17 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.17 A__PLUS(N:S,0) -> MARK(N:S) 0.00/0.17 A__PLUS(N:S,s(M:S)) -> A__PLUS(mark(N:S),mark(M:S)) 0.00/0.17 A__PLUS(N:S,s(M:S)) -> MARK(M:S) 0.00/0.17 A__PLUS(N:S,s(M:S)) -> MARK(N:S) 0.00/0.17 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.17 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) 0.00/0.17 MARK(plus(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(plus(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 ->->-> Rules: 0.00/0.17 a__and(tt,X:S) -> mark(X:S) 0.00/0.17 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.17 a__plus(N:S,0) -> mark(N:S) 0.00/0.17 a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) 0.00/0.17 a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.17 mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 mark(tt) -> tt 0.00/0.17 0.00/0.17 Problem 1: 0.00/0.17
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Innermost 2019-03-28 22.12