details

property	value
status	complete
benchmark	#4.23.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	Strategy_removed_AG01

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.687952 seconds
cpu usage	1.62002
user time	1.11607
system time	0.503944
max virtual memory	3494408.0
max residence set size	68688.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: quot(0(),s(y),s(z)) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z))) Proof: DP Processor: DPs: quot#(s(x),s(y),z) -> quot#(x,y,z) plus#(s(x),y) -> plus#(x,y) quot#(x,0(),s(z)) -> plus#(z,s(0())) quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) TRS: quot(0(),s(y),s(z)) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z))) TDG Processor: DPs: quot#(s(x),s(y),z) -> quot#(x,y,z) plus#(s(x),y) -> plus#(x,y) quot#(x,0(),s(z)) -> plus#(z,s(0())) quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) TRS: quot(0(),s(y),s(z)) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z))) graph: plus#(s(x),y) -> plus#(x,y) -> plus#(s(x),y) -> plus#(x,y) quot#(s(x),s(y),z) -> quot#(x,y,z) -> quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) quot#(s(x),s(y),z) -> quot#(x,y,z) -> quot#(x,0(),s(z)) -> plus#(z,s(0())) quot#(s(x),s(y),z) -> quot#(x,y,z) -> quot#(s(x),s(y),z) -> quot#(x,y,z) quot#(x,0(),s(z)) -> plus#(z,s(0())) -> plus#(s(x),y) -> plus#(x,y) quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) -> quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) -> quot#(x,0(),s(z)) -> plus#(z,s(0())) quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) -> quot#(s(x),s(y),z) -> quot#(x,y,z) SCC Processor: #sccs: 2 #rules: 3 #arcs: 8/16 DPs: quot#(s(x),s(y),z) -> quot#(x,y,z) quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) TRS: quot(0(),s(y),s(z)) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z))) Subterm Criterion Processor: simple projection: pi(quot#) = 0 problem: DPs: quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) TRS: quot(0(),s(y),s(z)) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z))) EDG Processor: DPs: quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) TRS: quot(0(),s(y),s(z)) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z))) graph: quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) -> quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) Bounds Processor: bound: 1 enrichment: top-dp automaton: final states: {7} transitions: quot{#,0}(6,6,6) -> 7* 01() -> 13* s0(6) -> 6* 00() -> 6* s1(15) -> 15* s1(13) -> 14* s1(6) -> 12* plus1(6,14) -> 15* popout

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

job log

popout

actions

all output return to TRS Standard