Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715601
details
property
value
status
complete
benchmark
Ex2_Luc03b_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n114.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.141345977783 seconds
cpu usage
0.143152964
max memory
6004736.0
stage attributes
key
value
output-size
17259
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 Y Z) (RULES a__add(0,X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__add(X1,X2) -> add(X1,X2) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__fst(0,Z) -> nil a__fst(s(X),cons(Y,Z)) -> cons(mark(Y),fst(X,Z)) a__fst(X1,X2) -> fst(X1,X2) a__len(cons(X,Z)) -> s(len(Z)) a__len(nil) -> 0 a__len(X) -> len(X) mark(0) -> 0 mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(fst(X1,X2)) -> a__fst(mark(X1),mark(X2)) mark(len(X)) -> a__len(mark(X)) mark(nil) -> nil mark(s(X)) -> s(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: A__ADD(0,X) -> MARK(X) A__FROM(X) -> MARK(X) A__FST(s(X),cons(Y,Z)) -> MARK(Y) MARK(add(X1,X2)) -> A__ADD(mark(X1),mark(X2)) MARK(add(X1,X2)) -> MARK(X1) MARK(add(X1,X2)) -> MARK(X2) MARK(cons(X1,X2)) -> MARK(X1) MARK(from(X)) -> A__FROM(mark(X)) MARK(from(X)) -> MARK(X) MARK(fst(X1,X2)) -> A__FST(mark(X1),mark(X2)) MARK(fst(X1,X2)) -> MARK(X1) MARK(fst(X1,X2)) -> MARK(X2) MARK(len(X)) -> A__LEN(mark(X)) MARK(len(X)) -> MARK(X) -> Rules: a__add(0,X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__add(X1,X2) -> add(X1,X2) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__fst(0,Z) -> nil a__fst(s(X),cons(Y,Z)) -> cons(mark(Y),fst(X,Z)) a__fst(X1,X2) -> fst(X1,X2) a__len(cons(X,Z)) -> s(len(Z)) a__len(nil) -> 0 a__len(X) -> len(X) mark(0) -> 0 mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(fst(X1,X2)) -> a__fst(mark(X1),mark(X2)) mark(len(X)) -> a__len(mark(X)) mark(nil) -> nil mark(s(X)) -> s(X) Problem 1: SCC Processor: -> Pairs: A__ADD(0,X) -> MARK(X) A__FROM(X) -> MARK(X) A__FST(s(X),cons(Y,Z)) -> MARK(Y) MARK(add(X1,X2)) -> A__ADD(mark(X1),mark(X2)) MARK(add(X1,X2)) -> MARK(X1) MARK(add(X1,X2)) -> MARK(X2) MARK(cons(X1,X2)) -> MARK(X1) MARK(from(X)) -> A__FROM(mark(X)) MARK(from(X)) -> MARK(X) MARK(fst(X1,X2)) -> A__FST(mark(X1),mark(X2)) MARK(fst(X1,X2)) -> MARK(X1) MARK(fst(X1,X2)) -> MARK(X2) MARK(len(X)) -> A__LEN(mark(X)) MARK(len(X)) -> MARK(X) -> Rules: a__add(0,X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__add(X1,X2) -> add(X1,X2) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__fst(0,Z) -> nil a__fst(s(X),cons(Y,Z)) -> cons(mark(Y),fst(X,Z)) a__fst(X1,X2) -> fst(X1,X2) a__len(cons(X,Z)) -> s(len(Z))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472