details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	4.09753584862 seconds
cpu usage	3.866702698
max memory	2.3502848E7

stage attributes

key	value
output-size	260880
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES 1(2(5(x1:S))) -> 1(2(2(1(0(1(x1:S)))))) 1(2(5(x1:S))) -> 1(0(5(0(5(4(x1:S)))))) 1(2(5(x1:S))) -> 2(0(1(3(1(0(x1:S)))))) 1(4(5(x1:S))) -> 1(2(4(0(2(1(x1:S)))))) 2(5(1(x1:S))) -> 2(2(2(1(2(3(x1:S)))))) 2(5(2(x1:S))) -> 4(0(2(2(3(3(x1:S)))))) 2(5(3(x1:S))) -> 2(0(4(1(3(3(x1:S)))))) 2(5(4(x1:S))) -> 2(0(5(1(0(1(x1:S)))))) 2(5(x1:S)) -> 1(3(3(0(1(0(x1:S)))))) 2(5(x1:S)) -> 2(2(0(5(0(1(x1:S)))))) 3(2(5(x1:S))) -> 3(2(0(1(0(5(x1:S)))))) 3(4(2(x1:S))) -> 3(4(0(2(2(2(x1:S)))))) 3(5(1(x1:S))) -> 2(1(4(1(0(1(x1:S)))))) 3(5(1(x1:S))) -> 0(4(2(2(3(4(x1:S)))))) 3(5(1(x1:S))) -> 0(4(2(0(0(5(x1:S)))))) 3(5(2(x1:S))) -> 2(3(3(2(1(2(x1:S)))))) 3(5(2(x1:S))) -> 2(0(2(2(3(0(x1:S)))))) 3(5(2(x1:S))) -> 0(4(3(2(2(2(x1:S)))))) 3(5(3(x1:S))) -> 2(3(4(0(4(2(x1:S)))))) 3(5(3(x1:S))) -> 0(2(4(3(3(0(x1:S)))))) 3(5(3(x1:S))) -> 0(5(4(3(3(0(x1:S)))))) 3(5(4(x1:S))) -> 0(2(0(5(0(0(x1:S)))))) 3(5(4(x1:S))) -> 0(5(0(0(1(2(x1:S)))))) 3(5(5(x1:S))) -> 0(5(4(1(0(5(x1:S)))))) 3(5(x1:S)) -> 1(3(2(0(0(1(x1:S)))))) 3(5(x1:S)) -> 3(2(0(5(3(0(x1:S)))))) 4(5(1(x1:S))) -> 2(1(0(5(3(3(x1:S)))))) 4(5(2(x1:S))) -> 0(5(1(0(0(4(x1:S)))))) 4(5(4(x1:S))) -> 2(2(1(0(4(2(x1:S)))))) 4(5(4(x1:S))) -> 3(2(0(3(2(0(x1:S)))))) 4(5(x1:S)) -> 2(2(1(3(2(1(x1:S)))))) 4(5(x1:S)) -> 3(2(0(5(0(0(x1:S)))))) 5(5(3(x1:S))) -> 5(1(0(1(2(2(x1:S)))))) 5(5(4(x1:S))) -> 5(1(0(4(2(2(x1:S)))))) ) Problem 1: Dependency Pairs Processor: -> Pairs: 1#(2(5(x1:S))) -> 1#(2(2(1(0(1(x1:S)))))) 1#(2(5(x1:S))) -> 1#(0(1(x1:S))) 1#(2(5(x1:S))) -> 1#(0(5(0(5(4(x1:S)))))) 1#(2(5(x1:S))) -> 1#(x1:S) 1#(2(5(x1:S))) -> 2#(1(0(1(x1:S)))) 1#(2(5(x1:S))) -> 2#(2(1(0(1(x1:S))))) 1#(2(5(x1:S))) -> 4#(x1:S) 1#(2(5(x1:S))) -> 5#(4(x1:S)) 1#(2(5(x1:S))) -> 5#(0(5(4(x1:S)))) 1#(4(5(x1:S))) -> 1#(2(4(0(2(1(x1:S)))))) 1#(4(5(x1:S))) -> 1#(x1:S) 1#(4(5(x1:S))) -> 2#(1(x1:S)) 1#(4(5(x1:S))) -> 2#(4(0(2(1(x1:S))))) 1#(4(5(x1:S))) -> 4#(0(2(1(x1:S)))) 2#(5(1(x1:S))) -> 1#(2(3(x1:S))) 2#(5(1(x1:S))) -> 2#(1(2(3(x1:S)))) 2#(5(1(x1:S))) -> 2#(2(1(2(3(x1:S))))) 2#(5(1(x1:S))) -> 2#(2(2(1(2(3(x1:S)))))) 2#(5(1(x1:S))) -> 2#(3(x1:S)) 2#(5(1(x1:S))) -> 3#(x1:S) 2#(5(2(x1:S))) -> 2#(2(3(3(x1:S)))) 2#(5(2(x1:S))) -> 2#(3(3(x1:S))) 2#(5(2(x1:S))) -> 3#(3(x1:S)) 2#(5(2(x1:S))) -> 3#(x1:S) 2#(5(2(x1:S))) -> 4#(0(2(2(3(3(x1:S)))))) 2#(5(3(x1:S))) -> 1#(3(3(x1:S))) 2#(5(3(x1:S))) -> 2#(0(4(1(3(3(x1:S)))))) 2#(5(3(x1:S))) -> 3#(3(x1:S)) 2#(5(3(x1:S))) -> 4#(1(3(3(x1:S)))) 2#(5(4(x1:S))) -> 1#(0(1(x1:S))) 2#(5(4(x1:S))) -> 1#(x1:S) 2#(5(4(x1:S))) -> 2#(0(5(1(0(1(x1:S)))))) 2#(5(4(x1:S))) -> 5#(1(0(1(x1:S)))) 2#(5(x1:S)) -> 1#(x1:S) 2#(5(x1:S)) -> 2#(2(0(5(0(1(x1:S)))))) 2#(5(x1:S)) -> 2#(0(5(0(1(x1:S))))) 2#(5(x1:S)) -> 5#(0(1(x1:S))) 3#(2(5(x1:S))) -> 1#(0(5(x1:S))) 3#(2(5(x1:S))) -> 2#(0(1(0(5(x1:S))))) 3#(2(5(x1:S))) -> 3#(2(0(1(0(5(x1:S)))))) 3#(4(2(x1:S))) -> 2#(2(2(x1:S))) 3#(4(2(x1:S))) -> 2#(2(x1:S)) 3#(4(2(x1:S))) -> 3#(4(0(2(2(2(x1:S)))))) 3#(4(2(x1:S))) -> 4#(0(2(2(2(x1:S))))) 3#(5(1(x1:S))) -> 1#(4(1(0(1(x1:S))))) 3#(5(1(x1:S))) -> 1#(0(1(x1:S))) 3#(5(1(x1:S))) -> 2#(1(4(1(0(1(x1:S)))))) 3#(5(1(x1:S))) -> 2#(2(3(4(x1:S)))) popout

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

job log

popout

actions

all output return to SRS Standard