details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.743757 seconds
cpu usage	1.81768
user time	1.32417
system time	0.493508
max virtual memory	5735428.0
max residence set size	68292.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: -(0(),y) -> 0() -(x,0()) -> x -(x,s(y)) -> if(greater(x,s(y)),s(-(x,p(s(y)))),0()) p(0()) -> 0() p(s(x)) -> x Proof: DP Processor: DPs: -#(x,s(y)) -> p#(s(y)) -#(x,s(y)) -> -#(x,p(s(y))) TRS: -(0(),y) -> 0() -(x,0()) -> x -(x,s(y)) -> if(greater(x,s(y)),s(-(x,p(s(y)))),0()) p(0()) -> 0() p(s(x)) -> x TDG Processor: DPs: -#(x,s(y)) -> p#(s(y)) -#(x,s(y)) -> -#(x,p(s(y))) TRS: -(0(),y) -> 0() -(x,0()) -> x -(x,s(y)) -> if(greater(x,s(y)),s(-(x,p(s(y)))),0()) p(0()) -> 0() p(s(x)) -> x graph: -#(x,s(y)) -> -#(x,p(s(y))) -> -#(x,s(y)) -> -#(x,p(s(y))) -#(x,s(y)) -> -#(x,p(s(y))) -> -#(x,s(y)) -> p#(s(y)) SCC Processor: #sccs: 1 #rules: 1 #arcs: 2/4 DPs: -#(x,s(y)) -> -#(x,p(s(y))) TRS: -(0(),y) -> 0() -(x,0()) -> x -(x,s(y)) -> if(greater(x,s(y)),s(-(x,p(s(y)))),0()) p(0()) -> 0() p(s(x)) -> x Usable Rule Processor: DPs: -#(x,s(y)) -> -#(x,p(s(y))) TRS: p(s(x)) -> x Semantic Labeling Processor: dimension: 2 usable rules: interpretation: [1 0] [1] [p](x0) = [1 0]x0 + [0], [1 1] [0] [s](x0) = [1 1]x0 + [1] labeled: -# usable (for model): -# s p argument filtering: pi(s) = 0 pi(p) = [] pi(-#) = [] precedence: -# ~ p ~ s problem: DPs: TRS: p(s(x)) -> x Qed popout

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

job log

popout

actions

all output return to TRS Standard