details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	7.4048640728 seconds
cpu usage	7.153824913
max memory	1.7465344E7

stage attributes

key	value
output-size	199998
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 x1) (RULES 0(0(4(1(x1)))) -> 1(4(0(3(0(3(x1)))))) 0(0(5(5(1(x1))))) -> 1(0(0(3(5(5(x1)))))) 0(0(5(1(x1)))) -> 0(0(3(1(2(5(x1)))))) 0(0(1(1(x1)))) -> 1(2(0(0(3(1(x1)))))) 0(0(1(x1))) -> 0(1(2(0(3(2(x1)))))) 0(0(1(x1))) -> 0(1(2(0(3(x1))))) 0(0(1(x1))) -> 1(2(0(0(3(2(x1)))))) 0(0(2(1(x1)))) -> 2(2(0(3(0(1(x1)))))) 0(4(4(1(x1)))) -> 2(4(0(3(4(1(x1)))))) 0(4(1(0(x1)))) -> 0(4(0(1(2(x1))))) 0(4(1(4(1(x1))))) -> 4(4(0(1(2(1(x1)))))) 0(4(1(x1))) -> 4(0(3(1(x1)))) 0(4(1(x1))) -> 4(2(1(2(0(3(x1)))))) 0(4(1(x1))) -> 2(4(0(5(3(1(x1)))))) 0(4(1(x1))) -> 2(4(0(3(2(1(x1)))))) 0(4(2(1(x1)))) -> 4(0(3(5(1(2(x1)))))) 0(4(2(1(x1)))) -> 4(0(3(2(2(1(x1)))))) 0(5(0(1(x1)))) -> 0(2(0(3(5(1(x1)))))) 0(5(0(1(x1)))) -> 5(2(0(3(0(1(x1)))))) 0(5(5(4(1(x1))))) -> 4(1(0(5(5(3(x1)))))) 0(5(1(0(x1)))) -> 0(1(2(0(3(5(x1)))))) 0(5(1(0(x1)))) -> 2(0(1(3(5(0(x1)))))) 0(1(0(5(0(x1))))) -> 0(1(5(2(0(0(x1)))))) 0(1(0(x1))) -> 2(0(3(1(2(0(x1)))))) 0(1(4(1(x1)))) -> 0(1(2(4(1(2(x1)))))) 0(1(5(0(x1)))) -> 1(2(5(0(0(3(x1)))))) 0(1(1(0(x1)))) -> 1(2(0(0(1(2(x1)))))) 0(2(4(1(x1)))) -> 4(0(5(3(1(2(x1)))))) 0(2(5(0(1(x1))))) -> 2(0(3(5(0(1(x1)))))) 0(3(1(0(0(x1))))) -> 0(0(3(0(1(2(x1)))))) 4(0(5(1(x1)))) -> 1(4(0(5(3(2(x1)))))) 4(4(1(0(5(x1))))) -> 4(0(5(3(4(1(x1)))))) 4(1(0(0(x1)))) -> 0(4(1(2(0(x1))))) 4(1(0(1(x1)))) -> 1(1(2(0(4(x1))))) 4(1(0(x1))) -> 1(2(0(4(x1)))) 4(1(5(0(0(x1))))) -> 1(2(0(4(5(0(x1)))))) 4(1(5(0(x1)))) -> 1(4(0(3(5(x1))))) 4(1(5(0(x1)))) -> 1(2(0(5(4(x1))))) 4(1(5(5(0(x1))))) -> 5(1(3(0(5(4(x1)))))) 4(3(1(0(1(x1))))) -> 1(1(2(3(0(4(x1)))))) 4(3(1(0(x1)))) -> 1(4(2(0(3(x1))))) 4(3(1(0(x1)))) -> 2(0(2(1(3(4(x1)))))) 4(3(1(0(x1)))) -> 2(1(4(2(0(3(x1)))))) 4(3(1(0(x1)))) -> 2(2(4(0(1(3(x1)))))) 4(3(1(5(0(x1))))) -> 5(1(0(3(2(4(x1)))))) 4(3(1(1(0(x1))))) -> 1(2(0(1(4(3(x1)))))) 5(0(1(0(x1)))) -> 0(3(5(1(2(0(x1)))))) 5(0(1(0(x1)))) -> 1(5(2(0(3(0(x1)))))) 5(4(1(0(x1)))) -> 0(1(2(4(5(2(x1)))))) ) Problem 1: Dependency Pairs Processor: -> Pairs: 0#(0(4(1(x1)))) -> 0#(3(0(3(x1)))) 0#(0(4(1(x1)))) -> 0#(3(x1)) 0#(0(4(1(x1)))) -> 4#(0(3(0(3(x1))))) 0#(0(5(5(1(x1))))) -> 0#(0(3(5(5(x1))))) 0#(0(5(5(1(x1))))) -> 0#(3(5(5(x1)))) 0#(0(5(5(1(x1))))) -> 5#(5(x1)) 0#(0(5(5(1(x1))))) -> 5#(x1) 0#(0(5(1(x1)))) -> 0#(0(3(1(2(5(x1)))))) 0#(0(5(1(x1)))) -> 0#(3(1(2(5(x1))))) 0#(0(5(1(x1)))) -> 5#(x1) 0#(0(1(1(x1)))) -> 0#(0(3(1(x1)))) 0#(0(1(1(x1)))) -> 0#(3(1(x1))) 0#(0(1(x1))) -> 0#(1(2(0(3(x1))))) 0#(0(1(x1))) -> 0#(3(x1)) 0#(0(2(1(x1)))) -> 0#(1(x1)) 0#(0(2(1(x1)))) -> 0#(3(0(1(x1)))) 0#(4(4(1(x1)))) -> 0#(3(4(1(x1)))) 0#(4(4(1(x1)))) -> 4#(0(3(4(1(x1))))) 0#(4(1(x1))) -> 0#(3(1(x1))) 0#(4(1(x1))) -> 0#(3(x1)) 0#(4(1(x1))) -> 4#(0(3(1(x1)))) 0#(4(1(x1))) -> 4#(2(1(2(0(3(x1)))))) 0#(5(0(1(x1)))) -> 0#(3(0(1(x1)))) 0#(5(0(1(x1)))) -> 5#(2(0(3(0(1(x1)))))) 0#(5(5(4(1(x1))))) -> 4#(1(0(5(5(3(x1)))))) 0#(5(1(0(x1)))) -> 0#(1(2(0(3(5(x1)))))) 0#(5(1(0(x1)))) -> 0#(1(3(5(0(x1))))) 0#(5(1(0(x1)))) -> 0#(3(5(x1))) 0#(5(1(0(x1)))) -> 5#(0(x1)) 0#(5(1(0(x1)))) -> 5#(x1) 0#(1(0(5(0(x1))))) -> 0#(0(x1)) 0#(1(0(5(0(x1))))) -> 0#(1(5(2(0(0(x1)))))) 0#(1(0(5(0(x1))))) -> 5#(2(0(0(x1)))) popout

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

job log

popout

actions

all output return to SRS Stand 10685