Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712294
details
property
value
status
complete
benchmark
secret5.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
Secret_07_TRS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.128237009048 seconds
cpu usage
0.130074514
max memory
5406720.0
stage attributes
key
value
output-size
14746
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 N X X1 X2 Y Z) (RULES a(nf(X1,X2)) -> f(a(X1),a(X2)) a(ns(X)) -> s(a(X)) a(nt(X)) -> t(a(X)) a(X) -> X d(s(X)) -> s(s(d(X))) d(0) -> 0 f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) f(0,X) -> nil f(X1,X2) -> nf(X1,X2) p(s(X),s(Y)) -> s(s(p(X,Y))) p(0,X) -> X p(X,0) -> X q(s(X)) -> s(p(q(X),d(X))) q(0) -> 0 s(X) -> ns(X) t(N) -> cs(r(q(N)),nt(ns(N))) t(X) -> nt(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(nf(X1,X2)) -> A(X1) A(nf(X1,X2)) -> A(X2) A(nf(X1,X2)) -> F(a(X1),a(X2)) A(ns(X)) -> A(X) A(ns(X)) -> S(a(X)) A(nt(X)) -> A(X) A(nt(X)) -> T(a(X)) D(s(X)) -> D(X) D(s(X)) -> S(d(X)) D(s(X)) -> S(s(d(X))) F(s(X),cs(Y,Z)) -> A(Z) P(s(X),s(Y)) -> P(X,Y) P(s(X),s(Y)) -> S(p(X,Y)) P(s(X),s(Y)) -> S(s(p(X,Y))) Q(s(X)) -> D(X) Q(s(X)) -> P(q(X),d(X)) Q(s(X)) -> Q(X) Q(s(X)) -> S(p(q(X),d(X))) T(N) -> Q(N) -> Rules: a(nf(X1,X2)) -> f(a(X1),a(X2)) a(ns(X)) -> s(a(X)) a(nt(X)) -> t(a(X)) a(X) -> X d(s(X)) -> s(s(d(X))) d(0) -> 0 f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) f(0,X) -> nil f(X1,X2) -> nf(X1,X2) p(s(X),s(Y)) -> s(s(p(X,Y))) p(0,X) -> X p(X,0) -> X q(s(X)) -> s(p(q(X),d(X))) q(0) -> 0 s(X) -> ns(X) t(N) -> cs(r(q(N)),nt(ns(N))) t(X) -> nt(X) Problem 1: SCC Processor: -> Pairs: A(nf(X1,X2)) -> A(X1) A(nf(X1,X2)) -> A(X2) A(nf(X1,X2)) -> F(a(X1),a(X2)) A(ns(X)) -> A(X) A(ns(X)) -> S(a(X)) A(nt(X)) -> A(X) A(nt(X)) -> T(a(X)) D(s(X)) -> D(X) D(s(X)) -> S(d(X)) D(s(X)) -> S(s(d(X))) F(s(X),cs(Y,Z)) -> A(Z) P(s(X),s(Y)) -> P(X,Y) P(s(X),s(Y)) -> S(p(X,Y)) P(s(X),s(Y)) -> S(s(p(X,Y))) Q(s(X)) -> D(X) Q(s(X)) -> P(q(X),d(X)) Q(s(X)) -> Q(X) Q(s(X)) -> S(p(q(X),d(X))) T(N) -> Q(N) -> Rules: a(nf(X1,X2)) -> f(a(X1),a(X2)) a(ns(X)) -> s(a(X)) a(nt(X)) -> t(a(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472