Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487093290
details
property
value
status
complete
benchmark
Ex23_Luc06_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n144.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0804089 seconds
cpu usage
0.085738
user time
0.054295
system time
0.031443
max virtual memory
113188.0
max residence set size
6200.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S X:S) (RULES active(f(f(a))) -> mark(c(f(g(f(a))))) active(f(X:S)) -> f(active(X:S)) active(g(X:S)) -> g(active(X:S)) c(ok(X:S)) -> ok(c(X:S)) f(mark(X:S)) -> mark(f(X:S)) f(ok(X:S)) -> ok(f(X:S)) g(mark(X:S)) -> mark(g(X:S)) g(ok(X:S)) -> ok(g(X:S)) proper(c(X:S)) -> c(proper(X:S)) proper(f(X:S)) -> f(proper(X:S)) proper(g(X:S)) -> g(proper(X:S)) proper(a) -> ok(a) 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(f(X:S)) -> ACTIVE(X:S) ACTIVE(f(X:S)) -> F(active(X:S)) ACTIVE(g(X:S)) -> ACTIVE(X:S) ACTIVE(g(X:S)) -> G(active(X:S)) C(ok(X:S)) -> C(X:S) F(mark(X:S)) -> F(X:S) F(ok(X:S)) -> F(X:S) G(mark(X:S)) -> G(X:S) G(ok(X:S)) -> G(X:S) PROPER(c(X:S)) -> C(proper(X:S)) PROPER(c(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) 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(f(f(a))) -> mark(c(f(g(f(a))))) active(f(X:S)) -> f(active(X:S)) active(g(X:S)) -> g(active(X:S)) c(ok(X:S)) -> ok(c(X:S)) f(mark(X:S)) -> mark(f(X:S)) f(ok(X:S)) -> ok(f(X:S)) g(mark(X:S)) -> mark(g(X:S)) g(ok(X:S)) -> ok(g(X:S)) proper(c(X:S)) -> c(proper(X:S)) proper(f(X:S)) -> f(proper(X:S)) proper(g(X:S)) -> g(proper(X:S)) proper(a) -> ok(a) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) Problem 1: SCC Processor: -> Pairs: ACTIVE(f(X:S)) -> ACTIVE(X:S) ACTIVE(f(X:S)) -> F(active(X:S)) ACTIVE(g(X:S)) -> ACTIVE(X:S) ACTIVE(g(X:S)) -> G(active(X:S)) C(ok(X:S)) -> C(X:S) F(mark(X:S)) -> F(X:S) F(ok(X:S)) -> F(X:S) G(mark(X:S)) -> G(X:S) G(ok(X:S)) -> G(X:S) PROPER(c(X:S)) -> C(proper(X:S)) PROPER(c(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) 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(f(f(a))) -> mark(c(f(g(f(a))))) active(f(X:S)) -> f(active(X:S)) active(g(X:S)) -> g(active(X:S)) c(ok(X:S)) -> ok(c(X:S)) f(mark(X:S)) -> mark(f(X:S)) f(ok(X:S)) -> ok(f(X:S)) g(mark(X:S)) -> mark(g(X:S)) g(ok(X:S)) -> ok(g(X:S)) proper(c(X:S)) -> c(proper(X:S)) proper(f(X:S)) -> f(proper(X:S)) proper(g(X:S)) -> g(proper(X:S)) proper(a) -> ok(a) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost