details

property	value
status	complete
benchmark	#3.17_mset.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n146.star.cs.uiowa.edu
space	INVY_15

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.71239113808 seconds
cpu usage	21.574551864
max memory	1.595912192E9

stage attributes

key	value
output-size	7947
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: strict: app(nil(),k) -> k app(l,nil()) -> l app(cons(x,l),k) -> cons(x,app(l,k)) sum(cons(x,nil())) -> cons(x,nil()) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) weak: cons(x,cons(y,l)) -> cons(y,cons(x,l)) Proof: Matrix Interpretation Processor: dim=2 interpretation: [1 0] [plus](x0, x1) = x0 + [0 2]x1, [1 1] [1] [app](x0, x1) = [0 1]x0 + x1 + [0], [1 0] [sum](x0) = [2 0]x0, [2] [0] = [0], [0] [nil] = [0], [2] [s](x0) = x0 + [2], [1 0] [cons](x0, x1) = [2 0]x0 + x1 orientation: [1] app(nil(),k) = k + [0] >= k = k [1 1] [1] app(l,nil()) = [0 1]l + [0] >= l = l [1 1] [3 0] [1] [1 1] [1 0] [1] app(cons(x,l),k) = k + [0 1]l + [2 0]x + [0] >= k + [0 1]l + [2 0]x + [0] = cons(x,app(l,k)) [1 0] [1 0] sum(cons(x,nil())) = [2 0]x >= [2 0]x = cons(x,nil()) [1 0] [1 0] [1 0] [1 0] [1 0] [1 0] sum(cons(x,cons(y,l))) = [2 0]l + [2 0]x + [2 0]y >= [2 0]l + [2 0]x + [2 0]y = sum(cons(plus(x,y),l)) [1 0] [1 1] [1 0] [1 0] [1] [1 0] [1 1] [1 0] [1 0] [1] sum(app(l,cons(x,cons(y,k)))) = [2 0]k + [2 2]l + [2 0]x + [2 0]y + [2] >= [2 0]k + [2 2]l + [2 0]x + [2 0]y + [2] = sum(app(l,sum(cons(x,cons(y,k))))) [1 0] [2] plus(0(),y) = [0 2]y + [0] >= y = y [1 0] [2] [1 0] [2] plus(s(x),y) = x + [0 2]y + [2] >= x + [0 2]y + [2] = s(plus(x,y)) [1 0] [1 0] [1 0] [1 0] cons(x,cons(y,l)) = l + [2 0]x + [2 0]y >= l + [2 0]x + [2 0]y = cons(y,cons(x,l)) problem: strict: app(cons(x,l),k) -> cons(x,app(l,k)) sum(cons(x,nil())) -> cons(x,nil()) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) plus(s(x),y) -> s(plus(x,y)) weak: cons(x,cons(y,l)) -> cons(y,cons(x,l)) Matrix Interpretation Processor: dim=2 interpretation: [1 0] [1 0] [plus](x0, x1) = [0 0]x0 + [1 0]x1, [1 0] [app](x0, x1) = x0 + [0 0]x1, [1 0] [0] [sum](x0) = [0 0]x0 + [2], [0] [nil] = [0], [1 0] [s](x0) = [0 0]x0, [1 0] [1 1] [0] popout

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

job log

popout

actions

all output return to TRS Relative