details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.2645881176 seconds
cpu usage	3.328348702
max memory	3.3163264E8

stage attributes

key	value
output-size	9471
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: sum(cons(s(n),x),cons(m,y)) -> sum(cons(n,x),cons(s(m),y)) sum(cons(0(),x),y) -> sum(x,y) sum(nil(),y) -> y weight(cons(n,cons(m,x))) -> weight(sum(cons(n,cons(m,x)),cons(0(),x))) weight(cons(n,nil())) -> n Proof: Matrix Interpretation Processor: dim=3 interpretation: [0] [nil] = [1] [0], [1 1 1] [1 0 0] [cons](x0, x1) = [0 1 0]x0 + [1 1 0]x1 [0 0 0] [1 0 0] , [0] [0] = [0] [0], [1 1 0] [weight](x0) = [0 1 0]x0 [1 1 0] , [1 0 1] [1] [s](x0) = [0 0 0]x0 + [0] [0 1 0] [1], [1 0 0] [sum](x0, x1) = [0 0 0]x0 + x1 [1 0 0] orientation: [1 1 1] [1 1 1] [1 0 0] [1 0 0] [2] [1 1 1] [1 1 1] [1 0 0] [1 0 0] [2] sum(cons(s(n),x),cons(m,y)) = [0 1 0]m + [0 0 0]n + [0 0 0]x + [1 1 0]y + [0] >= [0 0 0]m + [0 0 0]n + [0 0 0]x + [1 1 0]y + [0] = sum(cons(n,x),cons(s(m),y)) [0 0 0] [1 1 1] [1 0 0] [1 0 0] [2] [0 0 0] [1 1 1] [1 0 0] [1 0 0] [0] [1 0 0] [1 0 0] sum(cons(0(),x),y) = [0 0 0]x + y >= [0 0 0]x + y = sum(x,y) [1 0 0] [1 0 0] sum(nil(),y) = y >= y = y [2 3 2] [1 2 1] [3 1 0] [1 1 1] [1 1 1] [3 1 0] weight(cons(n,cons(m,x))) = [1 2 1]m + [0 1 0]n + [2 1 0]x >= [0 0 0]m + [0 0 0]n + [1 1 0]x = weight(sum(cons(n,cons(m,x)),cons(0(),x))) [2 3 2] [1 2 1] [3 1 0] [1 1 1] [1 1 1] [3 1 0] [1 2 1] [1] weight(cons(n,nil())) = [0 1 0]n + [1] >= n = n [1 2 1] [1] problem: sum(cons(s(n),x),cons(m,y)) -> sum(cons(n,x),cons(s(m),y)) sum(cons(0(),x),y) -> sum(x,y) sum(nil(),y) -> y weight(cons(n,cons(m,x))) -> weight(sum(cons(n,cons(m,x)),cons(0(),x))) Matrix Interpretation Processor: dim=3 interpretation: [1] [nil] = [0] [0], [1 0 1] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 1]x1 [0 0 0] [1 1 1] , [0] [0] = [0] [0], [1 1 0] [weight](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [1] [s](x0) = [0 0 0]x0 + [0] [0 0 1] [1], [1 0 0] [1 0 0] [sum](x0, x1) = [0 0 0]x0 + [0 1 0]x1 [1 0 0] [1 1 1] orientation: [1 0 1] [1 0 1] [1 0 0] [1 0 0] [2] [1 0 1] [1 0 1] [1 0 0] [1 0 0] [2] sum(cons(s(n),x),cons(m,y)) = [0 0 0]m + [0 0 0]n + [0 0 0]x + [0 0 1]y + [0] >= [0 0 0]m + [0 0 0]n + [0 0 0]x + [0 0 1]y + [0] = sum(cons(n,x),cons(s(m),y)) [1 0 1] [1 0 1] [1 0 0] [2 1 2] [2] [1 0 1] [1 0 1] [1 0 0] [2 1 2] [2] [1 0 0] [1 0 0] [1 0 0] [1 0 0] sum(cons(0(),x),y) = [0 0 0]x + [0 1 0]y >= [0 0 0]x + [0 1 0]y = sum(x,y) popout

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

job log

popout

actions

all output return to TRS Standard