details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	2.00017499924 seconds
cpu usage	1.81138657
max memory	1.2406784E7

stage attributes

key	value
output-size	125751
starexec-result	YES

output

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

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

job log

popout

actions

all output return to SRS Standard