Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487093024
details
property
value
status
complete
benchmark
Ex25_Luc06_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.132894 seconds
cpu usage
0.106669
user time
0.058732
system time
0.047937
max virtual memory
113188.0
max residence set size
9368.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S X:S) (RULES active(c(X:S)) -> mark(d(X:S)) active(f(f(X:S))) -> mark(c(f(g(f(X:S))))) active(f(X:S)) -> f(active(X:S)) active(h(X:S)) -> h(active(X:S)) active(h(X:S)) -> mark(c(d(X:S))) c(ok(X:S)) -> ok(c(X:S)) d(ok(X:S)) -> ok(d(X:S)) f(mark(X:S)) -> mark(f(X:S)) f(ok(X:S)) -> ok(f(X:S)) g(ok(X:S)) -> ok(g(X:S)) h(mark(X:S)) -> mark(h(X:S)) h(ok(X:S)) -> ok(h(X:S)) proper(c(X:S)) -> c(proper(X:S)) proper(d(X:S)) -> d(proper(X:S)) proper(f(X:S)) -> f(proper(X:S)) proper(g(X:S)) -> g(proper(X:S)) proper(h(X:S)) -> h(proper(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(c(X:S)) -> D(X:S) ACTIVE(f(f(X:S))) -> C(f(g(f(X:S)))) ACTIVE(f(f(X:S))) -> F(g(f(X:S))) ACTIVE(f(f(X:S))) -> G(f(X:S)) ACTIVE(f(X:S)) -> ACTIVE(X:S) ACTIVE(f(X:S)) -> F(active(X:S)) ACTIVE(h(X:S)) -> ACTIVE(X:S) ACTIVE(h(X:S)) -> C(d(X:S)) ACTIVE(h(X:S)) -> D(X:S) ACTIVE(h(X:S)) -> H(active(X:S)) C(ok(X:S)) -> C(X:S) D(ok(X:S)) -> D(X:S) F(mark(X:S)) -> F(X:S) F(ok(X:S)) -> F(X:S) G(ok(X:S)) -> G(X:S) H(mark(X:S)) -> H(X:S) H(ok(X:S)) -> H(X:S) PROPER(c(X:S)) -> C(proper(X:S)) PROPER(c(X:S)) -> PROPER(X:S) PROPER(d(X:S)) -> D(proper(X:S)) PROPER(d(X:S)) -> PROPER(X:S) PROPER(f(X:S)) -> F(proper(X:S)) PROPER(f(X:S)) -> PROPER(X:S) PROPER(g(X:S)) -> G(proper(X:S)) PROPER(g(X:S)) -> PROPER(X:S) PROPER(h(X:S)) -> H(proper(X:S)) PROPER(h(X:S)) -> PROPER(X:S) TOP(mark(X:S)) -> PROPER(X:S) TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> ACTIVE(X:S) TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(c(X:S)) -> mark(d(X:S)) active(f(f(X:S))) -> mark(c(f(g(f(X:S))))) active(f(X:S)) -> f(active(X:S)) active(h(X:S)) -> h(active(X:S)) active(h(X:S)) -> mark(c(d(X:S))) c(ok(X:S)) -> ok(c(X:S)) d(ok(X:S)) -> ok(d(X:S)) f(mark(X:S)) -> mark(f(X:S)) f(ok(X:S)) -> ok(f(X:S)) g(ok(X:S)) -> ok(g(X:S)) h(mark(X:S)) -> mark(h(X:S)) h(ok(X:S)) -> ok(h(X:S)) proper(c(X:S)) -> c(proper(X:S)) proper(d(X:S)) -> d(proper(X:S)) proper(f(X:S)) -> f(proper(X:S)) proper(g(X:S)) -> g(proper(X:S)) proper(h(X:S)) -> h(proper(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) Problem 1: SCC Processor: -> Pairs: ACTIVE(c(X:S)) -> D(X:S) ACTIVE(f(f(X:S))) -> C(f(g(f(X:S)))) ACTIVE(f(f(X:S))) -> F(g(f(X:S))) ACTIVE(f(f(X:S))) -> G(f(X:S)) ACTIVE(f(X:S)) -> ACTIVE(X:S) ACTIVE(f(X:S)) -> F(active(X:S)) ACTIVE(h(X:S)) -> ACTIVE(X:S) ACTIVE(h(X:S)) -> C(d(X:S)) ACTIVE(h(X:S)) -> D(X:S) ACTIVE(h(X:S)) -> H(active(X:S)) C(ok(X:S)) -> C(X:S) D(ok(X:S)) -> D(X:S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost