TRS Stand 20472 pair #381712244

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	n042.star.cs.uiowa.edu
space	Secret_07_TRS

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	3.1743311882 seconds
cpu usage	10.884326135
max memory	8.34322432E8

stage attributes

key	value
output-size	17857
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 t(N) -> cs(r(q(N)),nt(ns(N)))
 q(0()) -> 0()
 q(s(X)) -> s(p(q(X),d(X)))
 d(0()) -> 0()
 d(s(X)) -> s(s(d(X)))
 p(0(),X) -> X
 p(X,0()) -> X
 p(s(X),s(Y)) -> s(s(p(X,Y)))
 f(0(),X) -> nil()
 f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z)))
 t(X) -> nt(X)
 s(X) -> ns(X)
 f(X1,X2) -> nf(X1,X2)
 a(nt(X)) -> t(a(X))
 a(ns(X)) -> s(a(X))
 a(nf(X1,X2)) -> f(a(X1),a(X2))
 a(X) -> X

Proof:
 DP Processor:
  DPs:
   t#(N) -> q#(N)
   q#(s(X)) -> d#(X)
   q#(s(X)) -> q#(X)
   q#(s(X)) -> p#(q(X),d(X))
   q#(s(X)) -> s#(p(q(X),d(X)))
   d#(s(X)) -> d#(X)
   d#(s(X)) -> s#(d(X))
   d#(s(X)) -> s#(s(d(X)))
   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)))
   f#(s(X),cs(Y,Z)) -> a#(Z)
   a#(nt(X)) -> a#(X)
   a#(nt(X)) -> t#(a(X))
   a#(ns(X)) -> a#(X)
   a#(ns(X)) -> s#(a(X))
   a#(nf(X1,X2)) -> a#(X2)
   a#(nf(X1,X2)) -> a#(X1)
   a#(nf(X1,X2)) -> f#(a(X1),a(X2))
  TRS:
   t(N) -> cs(r(q(N)),nt(ns(N)))
   q(0()) -> 0()
   q(s(X)) -> s(p(q(X),d(X)))
   d(0()) -> 0()
   d(s(X)) -> s(s(d(X)))
   p(0(),X) -> X
   p(X,0()) -> X
   p(s(X),s(Y)) -> s(s(p(X,Y)))
   f(0(),X) -> nil()
   f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z)))
   t(X) -> nt(X)
   s(X) -> ns(X)
   f(X1,X2) -> nf(X1,X2)
   a(nt(X)) -> t(a(X))
   a(ns(X)) -> s(a(X))
   a(nf(X1,X2)) -> f(a(X1),a(X2))
   a(X) -> X
  TDG Processor:
   DPs:
    t#(N) -> q#(N)
    q#(s(X)) -> d#(X)
    q#(s(X)) -> q#(X)
    q#(s(X)) -> p#(q(X),d(X))
    q#(s(X)) -> s#(p(q(X),d(X)))
    d#(s(X)) -> d#(X)
    d#(s(X)) -> s#(d(X))
    d#(s(X)) -> s#(s(d(X)))
    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)))
    f#(s(X),cs(Y,Z)) -> a#(Z)
    a#(nt(X)) -> a#(X)
    a#(nt(X)) -> t#(a(X))
    a#(ns(X)) -> a#(X)
    a#(ns(X)) -> s#(a(X))
    a#(nf(X1,X2)) -> a#(X2)
    a#(nf(X1,X2)) -> a#(X1)
    a#(nf(X1,X2)) -> f#(a(X1),a(X2))
   TRS:
    t(N) -> cs(r(q(N)),nt(ns(N)))
    q(0()) -> 0()
    q(s(X)) -> s(p(q(X),d(X)))
    d(0()) -> 0()
    d(s(X)) -> s(s(d(X)))
    p(0(),X) -> X
    p(X,0()) -> X
    p(s(X),s(Y)) -> s(s(p(X,Y)))
    f(0(),X) -> nil()
    f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z)))
    t(X) -> nt(X)

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS Stand 20472