TRS Stand 20472 pair #381715614

details

property	value
status	complete
benchmark	Ex9_BLR02_C.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n022.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	8.66182088852 seconds
cpu usage	24.262190367
max memory	1.08068864E9

stage attributes

key	value
output-size	93589
starexec-result	YES

output

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


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


YES

Problem:
 active(filter(cons(X,Y),0(),M)) -> mark(cons(0(),filter(Y,M,M)))
 active(filter(cons(X,Y),s(N),M)) -> mark(cons(X,filter(Y,N,M)))
 active(sieve(cons(0(),Y))) -> mark(cons(0(),sieve(Y)))
 active(sieve(cons(s(N),Y))) -> mark(cons(s(N),sieve(filter(Y,N,N))))
 active(nats(N)) -> mark(cons(N,nats(s(N))))
 active(zprimes()) -> mark(sieve(nats(s(s(0())))))
 active(filter(X1,X2,X3)) -> filter(active(X1),X2,X3)
 active(filter(X1,X2,X3)) -> filter(X1,active(X2),X3)
 active(filter(X1,X2,X3)) -> filter(X1,X2,active(X3))
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(s(X)) -> s(active(X))
 active(sieve(X)) -> sieve(active(X))
 active(nats(X)) -> nats(active(X))
 filter(mark(X1),X2,X3) -> mark(filter(X1,X2,X3))
 filter(X1,mark(X2),X3) -> mark(filter(X1,X2,X3))
 filter(X1,X2,mark(X3)) -> mark(filter(X1,X2,X3))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 s(mark(X)) -> mark(s(X))
 sieve(mark(X)) -> mark(sieve(X))
 nats(mark(X)) -> mark(nats(X))
 proper(filter(X1,X2,X3)) -> filter(proper(X1),proper(X2),proper(X3))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(0()) -> ok(0())
 proper(s(X)) -> s(proper(X))
 proper(sieve(X)) -> sieve(proper(X))
 proper(nats(X)) -> nats(proper(X))
 proper(zprimes()) -> ok(zprimes())
 filter(ok(X1),ok(X2),ok(X3)) -> ok(filter(X1,X2,X3))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 s(ok(X)) -> ok(s(X))
 sieve(ok(X)) -> ok(sieve(X))
 nats(ok(X)) -> ok(nats(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 DP Processor:
  DPs:
   active#(filter(cons(X,Y),0(),M)) -> filter#(Y,M,M)
   active#(filter(cons(X,Y),0(),M)) -> cons#(0(),filter(Y,M,M))
   active#(filter(cons(X,Y),s(N),M)) -> filter#(Y,N,M)
   active#(filter(cons(X,Y),s(N),M)) -> cons#(X,filter(Y,N,M))
   active#(sieve(cons(0(),Y))) -> sieve#(Y)
   active#(sieve(cons(0(),Y))) -> cons#(0(),sieve(Y))
   active#(sieve(cons(s(N),Y))) -> filter#(Y,N,N)
   active#(sieve(cons(s(N),Y))) -> sieve#(filter(Y,N,N))
   active#(sieve(cons(s(N),Y))) -> cons#(s(N),sieve(filter(Y,N,N)))
   active#(nats(N)) -> s#(N)
   active#(nats(N)) -> nats#(s(N))
   active#(nats(N)) -> cons#(N,nats(s(N)))
   active#(zprimes()) -> s#(0())
   active#(zprimes()) -> s#(s(0()))
   active#(zprimes()) -> nats#(s(s(0())))
   active#(zprimes()) -> sieve#(nats(s(s(0()))))
   active#(filter(X1,X2,X3)) -> active#(X1)
   active#(filter(X1,X2,X3)) -> filter#(active(X1),X2,X3)
   active#(filter(X1,X2,X3)) -> active#(X2)
   active#(filter(X1,X2,X3)) -> filter#(X1,active(X2),X3)
   active#(filter(X1,X2,X3)) -> active#(X3)
   active#(filter(X1,X2,X3)) -> filter#(X1,X2,active(X3))
   active#(cons(X1,X2)) -> active#(X1)
   active#(cons(X1,X2)) -> cons#(active(X1),X2)
   active#(s(X)) -> active#(X)
   active#(s(X)) -> s#(active(X))
   active#(sieve(X)) -> active#(X)
   active#(sieve(X)) -> sieve#(active(X))
   active#(nats(X)) -> active#(X)
   active#(nats(X)) -> nats#(active(X))
   filter#(mark(X1),X2,X3) -> filter#(X1,X2,X3)
   filter#(X1,mark(X2),X3) -> filter#(X1,X2,X3)
   filter#(X1,X2,mark(X3)) -> filter#(X1,X2,X3)
   cons#(mark(X1),X2) -> cons#(X1,X2)
   s#(mark(X)) -> s#(X)
   sieve#(mark(X)) -> sieve#(X)
   nats#(mark(X)) -> nats#(X)
   proper#(filter(X1,X2,X3)) -> proper#(X3)
   proper#(filter(X1,X2,X3)) -> proper#(X2)
   proper#(filter(X1,X2,X3)) -> proper#(X1)
   proper#(filter(X1,X2,X3)) -> filter#(proper(X1),proper(X2),proper(X3))
   proper#(cons(X1,X2)) -> proper#(X2)
   proper#(cons(X1,X2)) -> proper#(X1)
   proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
   proper#(s(X)) -> proper#(X)
   proper#(s(X)) -> s#(proper(X))
   proper#(sieve(X)) -> proper#(X)
   proper#(sieve(X)) -> sieve#(proper(X))
   proper#(nats(X)) -> proper#(X)
   proper#(nats(X)) -> nats#(proper(X))
   filter#(ok(X1),ok(X2),ok(X3)) -> filter#(X1,X2,X3)
   cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
   s#(ok(X)) -> s#(X)

popout

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

job log

popout

actions all output return to TRS Stand 20472