Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516967451
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
n071.star.cs.uiowa.edu
space
Secret_07_TRS
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.211983919144 seconds
cpu usage
0.156208771
max memory
5570560.0
stage attributes
key
value
output-size
17467
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 v_NonEmpty:S N:S X:S X1:S X2:S Y:S Z:S) (RULES a(nf(X1:S,X2:S)) -> f(a(X1:S),a(X2:S)) a(ns(X:S)) -> s(a(X:S)) a(nt(X:S)) -> t(a(X:S)) a(X:S) -> X:S d(s(X:S)) -> s(s(d(X:S))) d(0) -> 0 f(s(X:S),cs(Y:S,Z:S)) -> cs(Y:S,nf(X:S,a(Z:S))) f(0,X:S) -> nil f(X1:S,X2:S) -> nf(X1:S,X2:S) p(s(X:S),s(Y:S)) -> s(s(p(X:S,Y:S))) p(0,X:S) -> X:S p(X:S,0) -> X:S q(s(X:S)) -> s(p(q(X:S),d(X:S))) q(0) -> 0 s(X:S) -> ns(X:S) t(N:S) -> cs(r(q(N:S)),nt(ns(N:S))) t(X:S) -> nt(X:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(nf(X1:S,X2:S)) -> A(X1:S) A(nf(X1:S,X2:S)) -> A(X2:S) A(nf(X1:S,X2:S)) -> F(a(X1:S),a(X2:S)) A(ns(X:S)) -> A(X:S) A(ns(X:S)) -> S(a(X:S)) A(nt(X:S)) -> A(X:S) A(nt(X:S)) -> T(a(X:S)) D(s(X:S)) -> D(X:S) D(s(X:S)) -> S(d(X:S)) D(s(X:S)) -> S(s(d(X:S))) F(s(X:S),cs(Y:S,Z:S)) -> A(Z:S) P(s(X:S),s(Y:S)) -> P(X:S,Y:S) P(s(X:S),s(Y:S)) -> S(p(X:S,Y:S)) P(s(X:S),s(Y:S)) -> S(s(p(X:S,Y:S))) Q(s(X:S)) -> D(X:S) Q(s(X:S)) -> P(q(X:S),d(X:S)) Q(s(X:S)) -> Q(X:S) Q(s(X:S)) -> S(p(q(X:S),d(X:S))) T(N:S) -> Q(N:S) -> Rules: a(nf(X1:S,X2:S)) -> f(a(X1:S),a(X2:S)) a(ns(X:S)) -> s(a(X:S)) a(nt(X:S)) -> t(a(X:S)) a(X:S) -> X:S d(s(X:S)) -> s(s(d(X:S))) d(0) -> 0 f(s(X:S),cs(Y:S,Z:S)) -> cs(Y:S,nf(X:S,a(Z:S))) f(0,X:S) -> nil f(X1:S,X2:S) -> nf(X1:S,X2:S) p(s(X:S),s(Y:S)) -> s(s(p(X:S,Y:S))) p(0,X:S) -> X:S p(X:S,0) -> X:S q(s(X:S)) -> s(p(q(X:S),d(X:S))) q(0) -> 0 s(X:S) -> ns(X:S) t(N:S) -> cs(r(q(N:S)),nt(ns(N:S))) t(X:S) -> nt(X:S) Problem 1: SCC Processor: -> Pairs: A(nf(X1:S,X2:S)) -> A(X1:S) A(nf(X1:S,X2:S)) -> A(X2:S) A(nf(X1:S,X2:S)) -> F(a(X1:S),a(X2:S)) A(ns(X:S)) -> A(X:S) A(ns(X:S)) -> S(a(X:S)) A(nt(X:S)) -> A(X:S) A(nt(X:S)) -> T(a(X:S)) D(s(X:S)) -> D(X:S) D(s(X:S)) -> S(d(X:S)) D(s(X:S)) -> S(s(d(X:S))) F(s(X:S),cs(Y:S,Z:S)) -> A(Z:S) P(s(X:S),s(Y:S)) -> P(X:S,Y:S) P(s(X:S),s(Y:S)) -> S(p(X:S,Y:S)) P(s(X:S),s(Y:S)) -> S(s(p(X:S,Y:S))) Q(s(X:S)) -> D(X:S) Q(s(X:S)) -> P(q(X:S),d(X:S)) Q(s(X:S)) -> Q(X:S) Q(s(X:S)) -> S(p(q(X:S),d(X:S))) T(N:S) -> Q(N:S) -> Rules: a(nf(X1:S,X2:S)) -> f(a(X1:S),a(X2:S)) a(ns(X:S)) -> s(a(X:S)) a(nt(X:S)) -> t(a(X:S))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard