details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.853667974472 seconds
cpu usage	1.967728969
max memory	4.89209856E8

stage attributes

key	value
output-size	3786
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: p(s(x)) -> x fact(0()) -> s(0()) fact(s(x)) -> *(s(x),fact(p(s(x)))) *(0(),y) -> 0() *(s(x),y) -> +(*(x,y),y) +(x,0()) -> x +(x,s(y)) -> s(+(x,y)) Proof: DP Processor: DPs: fact#(s(x)) -> p#(s(x)) fact#(s(x)) -> fact#(p(s(x))) fact#(s(x)) -> *#(s(x),fact(p(s(x)))) *#(s(x),y) -> *#(x,y) *#(s(x),y) -> +#(*(x,y),y) +#(x,s(y)) -> +#(x,y) TRS: p(s(x)) -> x fact(0()) -> s(0()) fact(s(x)) -> *(s(x),fact(p(s(x)))) *(0(),y) -> 0() *(s(x),y) -> +(*(x,y),y) +(x,0()) -> x +(x,s(y)) -> s(+(x,y)) TDG Processor: DPs: fact#(s(x)) -> p#(s(x)) fact#(s(x)) -> fact#(p(s(x))) fact#(s(x)) -> *#(s(x),fact(p(s(x)))) *#(s(x),y) -> *#(x,y) *#(s(x),y) -> +#(*(x,y),y) +#(x,s(y)) -> +#(x,y) TRS: p(s(x)) -> x fact(0()) -> s(0()) fact(s(x)) -> *(s(x),fact(p(s(x)))) *(0(),y) -> 0() *(s(x),y) -> +(*(x,y),y) +(x,0()) -> x +(x,s(y)) -> s(+(x,y)) graph: +#(x,s(y)) -> +#(x,y) -> +#(x,s(y)) -> +#(x,y) *#(s(x),y) -> +#(*(x,y),y) -> +#(x,s(y)) -> +#(x,y) *#(s(x),y) -> *#(x,y) -> *#(s(x),y) -> +#(*(x,y),y) *#(s(x),y) -> *#(x,y) -> *#(s(x),y) -> *#(x,y) fact#(s(x)) -> *#(s(x),fact(p(s(x)))) -> *#(s(x),y) -> +#(*(x,y),y) fact#(s(x)) -> *#(s(x),fact(p(s(x)))) -> *#(s(x),y) -> *#(x,y) fact#(s(x)) -> fact#(p(s(x))) -> fact#(s(x)) -> *#(s(x),fact(p(s(x)))) fact#(s(x)) -> fact#(p(s(x))) -> fact#(s(x)) -> fact#(p(s(x))) fact#(s(x)) -> fact#(p(s(x))) -> fact#(s(x)) -> p#(s(x)) SCC Processor: #sccs: 3 #rules: 3 #arcs: 9/36 DPs: fact#(s(x)) -> fact#(p(s(x))) TRS: p(s(x)) -> x fact(0()) -> s(0()) fact(s(x)) -> *(s(x),fact(p(s(x)))) *(0(),y) -> 0() *(s(x),y) -> +(*(x,y),y) +(x,0()) -> x +(x,s(y)) -> s(+(x,y)) Usable Rule Processor: DPs: fact#(s(x)) -> fact#(p(s(x))) TRS: p(s(x)) -> x Semantic Labeling Processor: dimension: 2 usable rules: interpretation: [0 1] [p](x0) = [0 1]x0, [1 1] [1] [s](x0) = [1 1]x0 + [0] labeled: fact# usable (for model): fact# s p argument filtering: pi(s) = 0 pi(p) = 0 popout

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

job log

popout

actions

all output return to TRS Standard