details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	3.0763 seconds
cpu usage	10.0176
user time	8.42109
system time	1.59647
max virtual memory	3909116.0
max residence set size	167244.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(#()) -> #() +(#(),x) -> x +(x,#()) -> x +(0(x),0(y)) -> 0(+(x,y)) +(0(x),1(y)) -> 1(+(x,y)) +(1(x),0(y)) -> 1(+(x,y)) +(1(x),1(y)) -> 0(+(+(x,y),1(#()))) +(+(x,y),z) -> +(x,+(y,z)) -(#(),x) -> #() -(x,#()) -> x -(0(x),0(y)) -> 0(-(x,y)) -(0(x),1(y)) -> 1(-(-(x,y),1(#()))) -(1(x),0(y)) -> 1(-(x,y)) -(1(x),1(y)) -> 0(-(x,y)) not(true()) -> false() not(false()) -> true() if(true(),x,y) -> x if(false(),x,y) -> y ge(0(x),0(y)) -> ge(x,y) ge(0(x),1(y)) -> not(ge(y,x)) ge(1(x),0(y)) -> ge(x,y) ge(1(x),1(y)) -> ge(x,y) ge(x,#()) -> true() ge(#(),0(x)) -> ge(#(),x) ge(#(),1(x)) -> false() log(x) -> -(log'(x),1(#())) log'(#()) -> #() log'(1(x)) -> +(log'(x),1(#())) log'(0(x)) -> if(ge(x,1(#())),+(log'(x),1(#())),#()) Proof: Matrix Interpretation Processor: dim=1 interpretation: [-](x0, x1) = x0 + x1, [if](x0, x1, x2) = x0 + x1 + x2, [0](x0) = 2x0, [1](x0) = 2x0, [true] = 0, [log](x0) = 4x0 + 4, [#] = 0, [false] = 0, [log'](x0) = 4x0 + 1, [ge](x0, x1) = x0 + x1, [not](x0) = 2x0, [+](x0, x1) = x0 + x1 orientation: 0(#()) = 0 >= 0 = #() +(#(),x) = x >= x = x +(x,#()) = x >= x = x +(0(x),0(y)) = 2x + 2y >= 2x + 2y = 0(+(x,y)) +(0(x),1(y)) = 2x + 2y >= 2x + 2y = 1(+(x,y)) +(1(x),0(y)) = 2x + 2y >= 2x + 2y = 1(+(x,y)) +(1(x),1(y)) = 2x + 2y >= 2x + 2y = 0(+(+(x,y),1(#()))) +(+(x,y),z) = x + y + z >= x + y + z = +(x,+(y,z)) -(#(),x) = x >= 0 = #() -(x,#()) = x >= x = x -(0(x),0(y)) = 2x + 2y >= 2x + 2y = 0(-(x,y)) -(0(x),1(y)) = 2x + 2y >= 2x + 2y = 1(-(-(x,y),1(#()))) -(1(x),0(y)) = 2x + 2y >= 2x + 2y = 1(-(x,y)) -(1(x),1(y)) = 2x + 2y >= 2x + 2y = 0(-(x,y)) not(true()) = 0 >= 0 = false() not(false()) = 0 >= 0 = true() if(true(),x,y) = x + y >= x = x if(false(),x,y) = x + y >= y = y ge(0(x),0(y)) = 2x + 2y >= x + y = ge(x,y) ge(0(x),1(y)) = 2x + 2y >= 2x + 2y = not(ge(y,x)) popout

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

job log

popout

actions

all output return to TRS Standard