Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Innermost 2019-03-28 22.12 pair #432271125
details
property
value
status
complete
benchmark
Ex2_Luc03b_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.42581 seconds
cpu usage
0.432722
user time
0.359239
system time
0.073483
max virtual memory
113176.0
max residence set size
14424.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.41 YES 0.00/0.41 0.00/0.41 Problem 1: 0.00/0.41 0.00/0.41 (VAR v_NonEmpty:S X:S X1:S X2:S Y:S Z:S) 0.00/0.41 (RULES 0.00/0.41 active(add(s(X:S),Y:S)) -> mark(s(add(X:S,Y:S))) 0.00/0.41 active(add(0,X:S)) -> mark(X:S) 0.00/0.41 active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) 0.00/0.41 active(fst(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,fst(X:S,Z:S))) 0.00/0.41 active(fst(0,Z:S)) -> mark(nil) 0.00/0.41 active(len(cons(X:S,Z:S))) -> mark(s(len(Z:S))) 0.00/0.41 active(len(nil)) -> mark(0) 0.00/0.41 add(active(X1:S),X2:S) -> add(X1:S,X2:S) 0.00/0.41 add(mark(X1:S),X2:S) -> add(X1:S,X2:S) 0.00/0.41 add(X1:S,active(X2:S)) -> add(X1:S,X2:S) 0.00/0.41 add(X1:S,mark(X2:S)) -> add(X1:S,X2:S) 0.00/0.41 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.41 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.41 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.41 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.41 from(active(X:S)) -> from(X:S) 0.00/0.41 from(mark(X:S)) -> from(X:S) 0.00/0.41 fst(active(X1:S),X2:S) -> fst(X1:S,X2:S) 0.00/0.41 fst(mark(X1:S),X2:S) -> fst(X1:S,X2:S) 0.00/0.41 fst(X1:S,active(X2:S)) -> fst(X1:S,X2:S) 0.00/0.41 fst(X1:S,mark(X2:S)) -> fst(X1:S,X2:S) 0.00/0.41 len(active(X:S)) -> len(X:S) 0.00/0.41 len(mark(X:S)) -> len(X:S) 0.00/0.41 mark(add(X1:S,X2:S)) -> active(add(mark(X1:S),mark(X2:S))) 0.00/0.41 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.41 mark(from(X:S)) -> active(from(mark(X:S))) 0.00/0.41 mark(fst(X1:S,X2:S)) -> active(fst(mark(X1:S),mark(X2:S))) 0.00/0.41 mark(len(X:S)) -> active(len(mark(X:S))) 0.00/0.41 mark(s(X:S)) -> active(s(X:S)) 0.00/0.41 mark(0) -> active(0) 0.00/0.41 mark(nil) -> active(nil) 0.00/0.41 s(active(X:S)) -> s(X:S) 0.00/0.41 s(mark(X:S)) -> s(X:S) 0.00/0.41 ) 0.00/0.41 (STRATEGY INNERMOST) 0.00/0.41 0.00/0.41 Problem 1: 0.00/0.41 0.00/0.41 Dependency Pairs Processor: 0.00/0.41 -> Pairs: 0.00/0.41 ACTIVE(add(s(X:S),Y:S)) -> ADD(X:S,Y:S) 0.00/0.41 ACTIVE(add(s(X:S),Y:S)) -> MARK(s(add(X:S,Y:S))) 0.00/0.41 ACTIVE(add(s(X:S),Y:S)) -> S(add(X:S,Y:S)) 0.00/0.41 ACTIVE(add(0,X:S)) -> MARK(X:S) 0.00/0.41 ACTIVE(from(X:S)) -> CONS(X:S,from(s(X:S))) 0.00/0.41 ACTIVE(from(X:S)) -> FROM(s(X:S)) 0.00/0.41 ACTIVE(from(X:S)) -> MARK(cons(X:S,from(s(X:S)))) 0.00/0.41 ACTIVE(from(X:S)) -> S(X:S) 0.00/0.41 ACTIVE(fst(s(X:S),cons(Y:S,Z:S))) -> CONS(Y:S,fst(X:S,Z:S)) 0.00/0.41 ACTIVE(fst(s(X:S),cons(Y:S,Z:S))) -> FST(X:S,Z:S) 0.00/0.41 ACTIVE(fst(s(X:S),cons(Y:S,Z:S))) -> MARK(cons(Y:S,fst(X:S,Z:S))) 0.00/0.41 ACTIVE(fst(0,Z:S)) -> MARK(nil) 0.00/0.41 ACTIVE(len(cons(X:S,Z:S))) -> LEN(Z:S) 0.00/0.41 ACTIVE(len(cons(X:S,Z:S))) -> MARK(s(len(Z:S))) 0.00/0.41 ACTIVE(len(cons(X:S,Z:S))) -> S(len(Z:S)) 0.00/0.41 ACTIVE(len(nil)) -> MARK(0) 0.00/0.41 ADD(active(X1:S),X2:S) -> ADD(X1:S,X2:S) 0.00/0.41 ADD(mark(X1:S),X2:S) -> ADD(X1:S,X2:S) 0.00/0.41 ADD(X1:S,active(X2:S)) -> ADD(X1:S,X2:S) 0.00/0.41 ADD(X1:S,mark(X2:S)) -> ADD(X1:S,X2:S) 0.00/0.41 CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.41 CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.41 CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.41 CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.41 FROM(active(X:S)) -> FROM(X:S) 0.00/0.41 FROM(mark(X:S)) -> FROM(X:S) 0.00/0.41 FST(active(X1:S),X2:S) -> FST(X1:S,X2:S) 0.00/0.41 FST(mark(X1:S),X2:S) -> FST(X1:S,X2:S) 0.00/0.41 FST(X1:S,active(X2:S)) -> FST(X1:S,X2:S) 0.00/0.41 FST(X1:S,mark(X2:S)) -> FST(X1:S,X2:S) 0.00/0.41 LEN(active(X:S)) -> LEN(X:S) 0.00/0.41 LEN(mark(X:S)) -> LEN(X:S) 0.00/0.41 MARK(add(X1:S,X2:S)) -> ACTIVE(add(mark(X1:S),mark(X2:S))) 0.00/0.41 MARK(add(X1:S,X2:S)) -> ADD(mark(X1:S),mark(X2:S)) 0.00/0.41 MARK(add(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.41 MARK(add(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.41 MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) 0.00/0.41 MARK(cons(X1:S,X2:S)) -> CONS(mark(X1:S),X2:S) 0.00/0.41 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.41 MARK(from(X:S)) -> ACTIVE(from(mark(X:S))) 0.00/0.41 MARK(from(X:S)) -> FROM(mark(X:S)) 0.00/0.41 MARK(from(X:S)) -> MARK(X:S) 0.00/0.41 MARK(fst(X1:S,X2:S)) -> ACTIVE(fst(mark(X1:S),mark(X2:S))) 0.00/0.41 MARK(fst(X1:S,X2:S)) -> FST(mark(X1:S),mark(X2:S)) 0.00/0.41 MARK(fst(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.41 MARK(fst(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.41 MARK(len(X:S)) -> ACTIVE(len(mark(X:S))) 0.00/0.41 MARK(len(X:S)) -> LEN(mark(X:S)) 0.00/0.41 MARK(len(X:S)) -> MARK(X:S) 0.00/0.41 MARK(s(X:S)) -> ACTIVE(s(X:S)) 0.00/0.41 S(active(X:S)) -> S(X:S) 0.00/0.41 S(mark(X:S)) -> S(X:S) 0.00/0.41 -> Rules: 0.00/0.41 active(add(s(X:S),Y:S)) -> mark(s(add(X:S,Y:S)))
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