Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716416
details
property
value
status
complete
benchmark
ExIntrod_GM01_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
1.84405612946 seconds
cpu usage
1.823509912
max memory
2.3044096E7
stage attributes
key
value
output-size
52716
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR L X X1 X2) (RULES active(adx(cons(X,L))) -> mark(incr(cons(X,adx(L)))) active(adx(nil)) -> mark(nil) active(adx(X)) -> adx(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(head(cons(X,L))) -> mark(X) active(head(X)) -> head(active(X)) active(incr(cons(X,L))) -> mark(cons(s(X),incr(L))) active(incr(nil)) -> mark(nil) active(incr(X)) -> incr(active(X)) active(s(X)) -> s(active(X)) active(tail(cons(X,L))) -> mark(L) active(tail(X)) -> tail(active(X)) active(nats) -> mark(adx(zeros)) active(zeros) -> mark(cons(0,zeros)) adx(mark(X)) -> mark(adx(X)) adx(ok(X)) -> ok(adx(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) head(mark(X)) -> mark(head(X)) head(ok(X)) -> ok(head(X)) incr(mark(X)) -> mark(incr(X)) incr(ok(X)) -> ok(incr(X)) proper(adx(X)) -> adx(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(head(X)) -> head(proper(X)) proper(incr(X)) -> incr(proper(X)) proper(s(X)) -> s(proper(X)) proper(tail(X)) -> tail(proper(X)) proper(0) -> ok(0) proper(nats) -> ok(nats) proper(nil) -> ok(nil) proper(zeros) -> ok(zeros) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) tail(mark(X)) -> mark(tail(X)) tail(ok(X)) -> ok(tail(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(adx(cons(X,L))) -> ADX(L) ACTIVE(adx(cons(X,L))) -> CONS(X,adx(L)) ACTIVE(adx(cons(X,L))) -> INCR(cons(X,adx(L))) ACTIVE(adx(X)) -> ACTIVE(X) ACTIVE(adx(X)) -> ADX(active(X)) ACTIVE(cons(X1,X2)) -> ACTIVE(X1) ACTIVE(cons(X1,X2)) -> CONS(active(X1),X2) ACTIVE(head(X)) -> ACTIVE(X) ACTIVE(head(X)) -> HEAD(active(X)) ACTIVE(incr(cons(X,L))) -> CONS(s(X),incr(L)) ACTIVE(incr(cons(X,L))) -> INCR(L) ACTIVE(incr(cons(X,L))) -> S(X) ACTIVE(incr(X)) -> ACTIVE(X) ACTIVE(incr(X)) -> INCR(active(X)) ACTIVE(s(X)) -> ACTIVE(X) ACTIVE(s(X)) -> S(active(X)) ACTIVE(tail(X)) -> ACTIVE(X) ACTIVE(tail(X)) -> TAIL(active(X)) ADX(mark(X)) -> ADX(X) ADX(ok(X)) -> ADX(X) CONS(mark(X1),X2) -> CONS(X1,X2) CONS(ok(X1),ok(X2)) -> CONS(X1,X2) HEAD(mark(X)) -> HEAD(X) HEAD(ok(X)) -> HEAD(X) INCR(mark(X)) -> INCR(X) INCR(ok(X)) -> INCR(X) PROPER(adx(X)) -> ADX(proper(X)) PROPER(adx(X)) -> PROPER(X) PROPER(cons(X1,X2)) -> CONS(proper(X1),proper(X2)) PROPER(cons(X1,X2)) -> PROPER(X1) PROPER(cons(X1,X2)) -> PROPER(X2) PROPER(head(X)) -> HEAD(proper(X)) PROPER(head(X)) -> PROPER(X) PROPER(incr(X)) -> INCR(proper(X)) PROPER(incr(X)) -> PROPER(X) PROPER(s(X)) -> PROPER(X) PROPER(s(X)) -> S(proper(X)) PROPER(tail(X)) -> PROPER(X) PROPER(tail(X)) -> TAIL(proper(X)) S(mark(X)) -> S(X) S(ok(X)) -> S(X) TAIL(mark(X)) -> TAIL(X) TAIL(ok(X)) -> TAIL(X) TOP(mark(X)) -> PROPER(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472