Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715476
details
property
value
status
complete
benchmark
Ex2_Luc03b_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.171909809113 seconds
cpu usage
0.136465806
max memory
6709248.0
stage attributes
key
value
output-size
65537
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR X X1 X2 Y Z) (RULES active(add(s(X),Y)) -> mark(s(add(X,Y))) active(add(0,X)) -> mark(X) active(add(X1,X2)) -> add(active(X1),X2) active(add(X1,X2)) -> add(X1,active(X2)) active(cons(X1,X2)) -> cons(active(X1),X2) active(from(X)) -> from(active(X)) active(from(X)) -> mark(cons(X,from(s(X)))) active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z))) active(fst(0,Z)) -> mark(nil) active(fst(X1,X2)) -> fst(active(X1),X2) active(fst(X1,X2)) -> fst(X1,active(X2)) active(len(cons(X,Z))) -> mark(s(len(Z))) active(len(nil)) -> mark(0) active(len(X)) -> len(active(X)) add(mark(X1),X2) -> mark(add(X1,X2)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) add(X1,mark(X2)) -> mark(add(X1,X2)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(mark(X)) -> mark(from(X)) from(ok(X)) -> ok(from(X)) fst(mark(X1),X2) -> mark(fst(X1,X2)) fst(ok(X1),ok(X2)) -> ok(fst(X1,X2)) fst(X1,mark(X2)) -> mark(fst(X1,X2)) len(mark(X)) -> mark(len(X)) len(ok(X)) -> ok(len(X)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) proper(fst(X1,X2)) -> fst(proper(X1),proper(X2)) proper(len(X)) -> len(proper(X)) proper(s(X)) -> s(proper(X)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(add(s(X),Y)) -> ADD(X,Y) ACTIVE(add(s(X),Y)) -> S(add(X,Y)) ACTIVE(add(X1,X2)) -> ACTIVE(X1) ACTIVE(add(X1,X2)) -> ACTIVE(X2) ACTIVE(add(X1,X2)) -> ADD(active(X1),X2) ACTIVE(add(X1,X2)) -> ADD(X1,active(X2)) ACTIVE(cons(X1,X2)) -> ACTIVE(X1) ACTIVE(cons(X1,X2)) -> CONS(active(X1),X2) ACTIVE(from(X)) -> ACTIVE(X) ACTIVE(from(X)) -> CONS(X,from(s(X))) ACTIVE(from(X)) -> FROM(active(X)) ACTIVE(from(X)) -> FROM(s(X)) ACTIVE(from(X)) -> S(X) ACTIVE(fst(s(X),cons(Y,Z))) -> CONS(Y,fst(X,Z)) ACTIVE(fst(s(X),cons(Y,Z))) -> FST(X,Z) ACTIVE(fst(X1,X2)) -> ACTIVE(X1) ACTIVE(fst(X1,X2)) -> ACTIVE(X2) ACTIVE(fst(X1,X2)) -> FST(active(X1),X2) ACTIVE(fst(X1,X2)) -> FST(X1,active(X2)) ACTIVE(len(cons(X,Z))) -> LEN(Z) ACTIVE(len(cons(X,Z))) -> S(len(Z)) ACTIVE(len(X)) -> ACTIVE(X) ACTIVE(len(X)) -> LEN(active(X)) ADD(mark(X1),X2) -> ADD(X1,X2) ADD(ok(X1),ok(X2)) -> ADD(X1,X2) ADD(X1,mark(X2)) -> ADD(X1,X2) CONS(mark(X1),X2) -> CONS(X1,X2) CONS(ok(X1),ok(X2)) -> CONS(X1,X2) FROM(mark(X)) -> FROM(X) FROM(ok(X)) -> FROM(X) FST(mark(X1),X2) -> FST(X1,X2) FST(ok(X1),ok(X2)) -> FST(X1,X2) FST(X1,mark(X2)) -> FST(X1,X2) LEN(mark(X)) -> LEN(X) LEN(ok(X)) -> LEN(X) PROPER(add(X1,X2)) -> ADD(proper(X1),proper(X2)) PROPER(add(X1,X2)) -> PROPER(X1) PROPER(add(X1,X2)) -> PROPER(X2) PROPER(cons(X1,X2)) -> CONS(proper(X1),proper(X2)) PROPER(cons(X1,X2)) -> PROPER(X1) PROPER(cons(X1,X2)) -> PROPER(X2) PROPER(from(X)) -> FROM(proper(X)) PROPER(from(X)) -> PROPER(X) PROPER(fst(X1,X2)) -> FST(proper(X1),proper(X2)) PROPER(fst(X1,X2)) -> PROPER(X1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472