Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716301
details
property
value
status
complete
benchmark
Ex4_7_15_Bor03_iGM.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)
0.4769551754 seconds
cpu usage
0.445607195
max memory
5758976.0
stage attributes
key
value
output-size
32192
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 X X1 X2) (RULES active(f(s(0))) -> mark(f(p(s(0)))) active(f(0)) -> mark(cons(0,f(s(0)))) active(p(s(0))) -> mark(0) cons(active(X1),X2) -> cons(X1,X2) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) f(active(X)) -> f(X) f(mark(X)) -> f(X) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(f(X)) -> active(f(mark(X))) mark(p(X)) -> active(p(mark(X))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) p(active(X)) -> p(X) p(mark(X)) -> p(X) s(active(X)) -> s(X) s(mark(X)) -> s(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(f(s(0))) -> MARK(f(p(s(0)))) ACTIVE(f(0)) -> MARK(cons(0,f(s(0)))) ACTIVE(p(s(0))) -> MARK(0) CONS(active(X1),X2) -> CONS(X1,X2) CONS(mark(X1),X2) -> CONS(X1,X2) CONS(X1,active(X2)) -> CONS(X1,X2) CONS(X1,mark(X2)) -> CONS(X1,X2) F(active(X)) -> F(X) F(mark(X)) -> F(X) MARK(cons(X1,X2)) -> ACTIVE(cons(mark(X1),X2)) MARK(cons(X1,X2)) -> CONS(mark(X1),X2) MARK(cons(X1,X2)) -> MARK(X1) MARK(f(X)) -> ACTIVE(f(mark(X))) MARK(f(X)) -> F(mark(X)) MARK(f(X)) -> MARK(X) MARK(p(X)) -> ACTIVE(p(mark(X))) MARK(p(X)) -> MARK(X) MARK(p(X)) -> P(mark(X)) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) MARK(s(X)) -> S(mark(X)) P(active(X)) -> P(X) P(mark(X)) -> P(X) S(active(X)) -> S(X) S(mark(X)) -> S(X) -> Rules: active(f(s(0))) -> mark(f(p(s(0)))) active(f(0)) -> mark(cons(0,f(s(0)))) active(p(s(0))) -> mark(0) cons(active(X1),X2) -> cons(X1,X2) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) f(active(X)) -> f(X) f(mark(X)) -> f(X) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(f(X)) -> active(f(mark(X))) mark(p(X)) -> active(p(mark(X))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) p(active(X)) -> p(X) p(mark(X)) -> p(X) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1: SCC Processor: -> Pairs: ACTIVE(f(s(0))) -> MARK(f(p(s(0)))) ACTIVE(f(0)) -> MARK(cons(0,f(s(0)))) ACTIVE(p(s(0))) -> MARK(0) CONS(active(X1),X2) -> CONS(X1,X2) CONS(mark(X1),X2) -> CONS(X1,X2) CONS(X1,active(X2)) -> CONS(X1,X2) CONS(X1,mark(X2)) -> CONS(X1,X2) F(active(X)) -> F(X) F(mark(X)) -> F(X) MARK(cons(X1,X2)) -> ACTIVE(cons(mark(X1),X2)) MARK(cons(X1,X2)) -> CONS(mark(X1),X2) MARK(cons(X1,X2)) -> MARK(X1) MARK(f(X)) -> ACTIVE(f(mark(X))) MARK(f(X)) -> F(mark(X)) MARK(f(X)) -> MARK(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472