details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	76.9918 seconds
cpu usage	302.713
user time	298.795
system time	3.91842
max virtual memory	5710288.0
max residence set size	302468.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: double(x) -> plus(x,x) double(0()) -> 0() double(s(x)) -> s(s(double(x))) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) minus(s(x),s(y)) -> minus(x,y) minus(0(),x) -> 0() minus(x,0()) -> x div(s(x),s(y)) -> s(div(minus(s(x),double(s(y))),s(y))) div(0(),s(y)) -> 0() Proof: DP Processor: DPs: double#(x) -> plus#(x,x) double#(s(x)) -> double#(x) plus#(s(x),y) -> plus#(x,y) minus#(s(x),s(y)) -> minus#(x,y) div#(s(x),s(y)) -> double#(s(y)) div#(s(x),s(y)) -> minus#(s(x),double(s(y))) div#(s(x),s(y)) -> div#(minus(s(x),double(s(y))),s(y)) TRS: double(x) -> plus(x,x) double(0()) -> 0() double(s(x)) -> s(s(double(x))) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) minus(s(x),s(y)) -> minus(x,y) minus(0(),x) -> 0() minus(x,0()) -> x div(s(x),s(y)) -> s(div(minus(s(x),double(s(y))),s(y))) div(0(),s(y)) -> 0() TDG Processor: DPs: double#(x) -> plus#(x,x) double#(s(x)) -> double#(x) plus#(s(x),y) -> plus#(x,y) minus#(s(x),s(y)) -> minus#(x,y) div#(s(x),s(y)) -> double#(s(y)) div#(s(x),s(y)) -> minus#(s(x),double(s(y))) div#(s(x),s(y)) -> div#(minus(s(x),double(s(y))),s(y)) TRS: double(x) -> plus(x,x) double(0()) -> 0() double(s(x)) -> s(s(double(x))) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) minus(s(x),s(y)) -> minus(x,y) minus(0(),x) -> 0() minus(x,0()) -> x div(s(x),s(y)) -> s(div(minus(s(x),double(s(y))),s(y))) div(0(),s(y)) -> 0() graph: div#(s(x),s(y)) -> div#(minus(s(x),double(s(y))),s(y)) -> div#(s(x),s(y)) -> div#(minus(s(x),double(s(y))),s(y)) div#(s(x),s(y)) -> div#(minus(s(x),double(s(y))),s(y)) -> div#(s(x),s(y)) -> minus#(s(x),double(s(y))) div#(s(x),s(y)) -> div#(minus(s(x),double(s(y))),s(y)) -> div#(s(x),s(y)) -> double#(s(y)) div#(s(x),s(y)) -> minus#(s(x),double(s(y))) -> minus#(s(x),s(y)) -> minus#(x,y) div#(s(x),s(y)) -> double#(s(y)) -> double#(s(x)) -> double#(x) div#(s(x),s(y)) -> double#(s(y)) -> double#(x) -> plus#(x,x) minus#(s(x),s(y)) -> minus#(x,y) -> minus#(s(x),s(y)) -> minus#(x,y) plus#(s(x),y) -> plus#(x,y) -> plus#(s(x),y) -> plus#(x,y) double#(s(x)) -> double#(x) -> double#(s(x)) -> double#(x) double#(s(x)) -> double#(x) -> double#(x) -> plus#(x,x) double#(x) -> plus#(x,x) -> plus#(s(x),y) -> plus#(x,y) SCC Processor: #sccs: 4 #rules: 4 #arcs: 11/49 DPs: div#(s(x),s(y)) -> div#(minus(s(x),double(s(y))),s(y)) TRS: double(x) -> plus(x,x) double(0()) -> 0() double(s(x)) -> s(s(double(x))) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) minus(s(x),s(y)) -> minus(x,y) minus(0(),x) -> 0() minus(x,0()) -> x div(s(x),s(y)) -> s(div(minus(s(x),double(s(y))),s(y))) div(0(),s(y)) -> 0() Extended Uncurrying Processor: application symbol: plus symbol table: div# ==> div{0,#}/2 div ==> div0/2 minus ==> minus0/2 s ==> s0/1 s1/2 0 ==> 00/0 01/1 double ==> double0/1 uncurry-rules: plus(00(),x11) -> 01(x11) popout

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

job log

popout

actions

all output return to TRS Standard