details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.03543615341 seconds
cpu usage	2.768062846
max memory	2.33385984E8

stage attributes

key	value
output-size	15628
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: active(f(a(),X,X)) -> mark(f(X,b(),b())) active(b()) -> mark(a()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(a()) -> active(a()) mark(b()) -> active(b()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [mark](x0) = [0 1 0]x0 + [1] [0 0 0] [0], [1 0 0] [1 0 0] [1 1 0] [f](x0, x1, x2) = [0 0 0]x0 + [0 0 0]x1 + [0 0 0]x2 [0 0 0] [0 0 0] [1 0 0] , [0] [b] = [0] [0], [0] [a] = [0] [0], [1 1 0] [0] [active](x0) = [0 0 0]x0 + [1] [0 0 0] [0] orientation: [2 1 0] [0] [1 0 0] [0] active(f(a(),X,X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = mark(f(X,b(),b())) [0 0 0] [0] [0 0 0] [0] [0] [0] active(b()) = [1] >= [1] = mark(a()) [0] [0] [1 0 0] [1 0 0] [1 1 0] [0] [1 0 0] [1 0 0] [1 1 0] [0] mark(f(X1,X2,X3)) = [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 + [1] = active(f(X1,mark(X2),X3)) [0 0 0] [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0 0 0] [0] [0] [0] mark(a()) = [1] >= [1] = active(a()) [0] [0] [0] [0] mark(b()) = [1] >= [1] = active(b()) [0] [0] [1 0 0] [1 0 0] [1 1 0] [1 0 0] [1 0 0] [1 1 0] f(mark(X1),X2,X3) = [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 >= [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 = f(X1,X2,X3) [0 0 0] [0 0 0] [1 0 0] [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1 0 0] [1 1 0] [1 0 0] [1 0 0] [1 1 0] f(X1,mark(X2),X3) = [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 >= [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 = f(X1,X2,X3) [0 0 0] [0 0 0] [1 0 0] [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1 0 0] [1 1 0] [1] [1 0 0] [1 0 0] [1 1 0] f(X1,X2,mark(X3)) = [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 = f(X1,X2,X3) [0 0 0] [0 0 0] [1 0 0] [0] [0 0 0] [0 0 0] [1 0 0] [1 1 0] [1 0 0] [1 1 0] [1 0 0] [1 0 0] [1 1 0] f(active(X1),X2,X3) = [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 >= [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 = f(X1,X2,X3) [0 0 0] [0 0 0] [1 0 0] [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1 1 0] [1 1 0] [1 0 0] [1 0 0] [1 1 0] f(X1,active(X2),X3) = [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 >= [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 = f(X1,X2,X3) [0 0 0] [0 0 0] [1 0 0] [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1 0 0] [1 1 0] [1] [1 0 0] [1 0 0] [1 1 0] f(X1,X2,active(X3)) = [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0 0 0]X3 = f(X1,X2,X3) [0 0 0] [0 0 0] [1 1 0] [0] [0 0 0] [0 0 0] [1 0 0] problem: active(f(a(),X,X)) -> mark(f(X,b(),b())) active(b()) -> mark(a()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(a()) -> active(a()) mark(b()) -> active(b()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) Matrix Interpretation Processor: dim=2 popout

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

job log

popout

actions

all output return to TRS Standard