details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	179.641 seconds
cpu usage	179.824
user time	173.301
system time	6.52279
max virtual memory	832360.0
max residence set size	245688.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES 0(0(1(2(x1:S)))) -> 2(3(0(x1:S))) 0(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 3(3(1(2(3(0(4(0(0(0(2(0(x1:S)))))))))))) 1(3(5(4(1(2(2(x1:S))))))) -> 3(3(3(4(4(0(x1:S)))))) 1(3(5(5(2(x1:S))))) -> 1(3(2(3(x1:S)))) 2(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 5(2(4(1(1(4(5(1(0(1(2(0(3(0(1(2(3(4(3(1(x1:S)))))))))))))))))))) 2(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 2(2(4(2(1(4(3(0(5(1(3(3(0(x1:S))))))))))))) 2(1(5(2(1(3(4(4(x1:S)))))))) -> 4(0(3(4(0(1(2(x1:S))))))) 2(2(5(3(2(2(x1:S)))))) -> 5(1(1(0(3(x1:S))))) 2(4(1(2(5(2(4(1(3(2(0(3(x1:S)))))))))))) -> 4(3(0(4(2(3(4(3(4(2(0(x1:S))))))))))) 2(5(1(2(1(1(x1:S)))))) -> 5(2(1(2(4(1(x1:S)))))) 3(4(1(4(2(4(x1:S)))))) -> 1(3(3(3(x1:S)))) 3(4(2(1(1(2(2(5(4(x1:S))))))))) -> 3(3(3(1(3(3(4(x1:S))))))) 3(5(2(2(4(5(x1:S)))))) -> 3(2(4(3(0(x1:S))))) 4(2(5(2(x1:S)))) -> 1(4(0(x1:S))) 4(5(0(3(1(3(2(2(5(2(2(4(1(3(2(x1:S))))))))))))))) -> 4(5(3(2(1(4(5(0(0(0(4(5(4(0(0(x1:S))))))))))))))) 4(5(3(4(x1:S)))) -> 4(4(2(4(x1:S)))) 4(5(4(3(0(5(1(x1:S))))))) -> 4(3(3(5(4(1(x1:S)))))) 5(2(1(0(1(5(x1:S)))))) -> 5(4(2(4(5(1(x1:S)))))) 5(2(1(3(1(5(2(5(4(4(x1:S)))))))))) -> 5(3(4(5(0(1(4(0(3(x1:S))))))))) 5(2(2(1(2(x1:S))))) -> 0(0(2(3(x1:S)))) 5(2(2(5(2(4(4(1(2(0(1(1(0(1(1(x1:S))))))))))))))) -> 5(0(5(4(3(2(1(0(3(3(5(0(4(1(x1:S)))))))))))))) 5(4(0(2(2(4(0(4(x1:S)))))))) -> 3(1(5(1(3(0(4(x1:S))))))) 5(4(1(5(1(5(4(4(2(2(0(4(3(1(5(4(4(3(1(x1:S))))))))))))))))))) -> 3(0(4(5(1(1(3(5(3(4(4(4(5(1(4(3(3(1(x1:S)))))))))))))))))) 5(4(2(0(3(3(0(0(4(0(3(2(0(5(1(x1:S))))))))))))))) -> 5(0(1(0(0(2(1(1(0(3(2(2(1(3(x1:S)))))))))))))) 5(4(4(5(0(1(4(5(4(x1:S))))))))) -> 1(5(5(0(4(1(4(5(4(x1:S))))))))) ) Problem 1: Dependency Pairs Processor: -> Pairs: 0#(0(1(2(x1:S)))) -> 0#(x1:S) 0#(0(1(2(x1:S)))) -> 2#(3(0(x1:S))) 0#(0(1(2(x1:S)))) -> 3#(0(x1:S)) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 0#(0(0(2(0(x1:S))))) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 0#(0(2(0(x1:S)))) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 0#(2(0(x1:S))) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 0#(4(0(0(0(2(0(x1:S))))))) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 1#(2(3(0(4(0(0(0(2(0(x1:S)))))))))) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 2#(0(x1:S)) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 2#(3(0(4(0(0(0(2(0(x1:S))))))))) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 3#(0(4(0(0(0(2(0(x1:S)))))))) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 3#(1(2(3(0(4(0(0(0(2(0(x1:S))))))))))) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 3#(3(1(2(3(0(4(0(0(0(2(0(x1:S)))))))))))) 0#(2(3(5(4(2(2(1(0(3(3(5(0(x1:S))))))))))))) -> 4#(0(0(0(2(0(x1:S)))))) 1#(3(5(4(1(2(2(x1:S))))))) -> 0#(x1:S) 1#(3(5(4(1(2(2(x1:S))))))) -> 3#(3(3(4(4(0(x1:S)))))) 1#(3(5(4(1(2(2(x1:S))))))) -> 3#(3(4(4(0(x1:S))))) 1#(3(5(4(1(2(2(x1:S))))))) -> 3#(4(4(0(x1:S)))) 1#(3(5(4(1(2(2(x1:S))))))) -> 4#(0(x1:S)) 1#(3(5(4(1(2(2(x1:S))))))) -> 4#(4(0(x1:S))) 1#(3(5(5(2(x1:S))))) -> 1#(3(2(3(x1:S)))) 1#(3(5(5(2(x1:S))))) -> 2#(3(x1:S)) 1#(3(5(5(2(x1:S))))) -> 3#(2(3(x1:S))) 1#(3(5(5(2(x1:S))))) -> 3#(x1:S) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 0#(1(2(0(3(0(1(2(3(4(3(1(x1:S)))))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 0#(1(2(3(4(3(1(x1:S))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 0#(3(0(1(2(3(4(3(1(x1:S))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 1#(0(1(2(0(3(0(1(2(3(4(3(1(x1:S))))))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 1#(1(4(5(1(0(1(2(0(3(0(1(2(3(4(3(1(x1:S))))))))))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 1#(2(0(3(0(1(2(3(4(3(1(x1:S))))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 1#(2(3(4(3(1(x1:S)))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 1#(4(5(1(0(1(2(0(3(0(1(2(3(4(3(1(x1:S)))))))))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 1#(x1:S) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 2#(0(3(0(1(2(3(4(3(1(x1:S)))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 2#(3(4(3(1(x1:S))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 2#(4(1(1(4(5(1(0(1(2(0(3(0(1(2(3(4(3(1(x1:S))))))))))))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 3#(0(1(2(3(4(3(1(x1:S)))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 3#(1(x1:S)) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 3#(4(3(1(x1:S)))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 4#(1(1(4(5(1(0(1(2(0(3(0(1(2(3(4(3(1(x1:S)))))))))))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 4#(3(1(x1:S))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 4#(5(1(0(1(2(0(3(0(1(2(3(4(3(1(x1:S))))))))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 5#(1(0(1(2(0(3(0(1(2(3(4(3(1(x1:S)))))))))))))) 2#(0(3(0(2(2(2(0(1(4(2(1(0(4(4(3(3(1(4(4(x1:S)))))))))))))))))))) -> 5#(2(4(1(1(4(5(1(0(1(2(0(3(0(1(2(3(4(3(1(x1:S)))))))))))))))))))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 0#(5(1(3(3(0(x1:S)))))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 0#(x1:S) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 1#(3(3(0(x1:S)))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 1#(4(3(0(5(1(3(3(0(x1:S))))))))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 2#(1(4(3(0(5(1(3(3(0(x1:S)))))))))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 2#(2(4(2(1(4(3(0(5(1(3(3(0(x1:S))))))))))))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 2#(4(2(1(4(3(0(5(1(3(3(0(x1:S)))))))))))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 3#(0(5(1(3(3(0(x1:S))))))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 3#(0(x1:S)) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 3#(3(0(x1:S))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 4#(2(1(4(3(0(5(1(3(3(0(x1:S))))))))))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 4#(3(0(5(1(3(3(0(x1:S)))))))) 2#(1(0(2(1(4(0(0(2(0(0(0(5(2(x1:S)))))))))))))) -> 5#(1(3(3(0(x1:S))))) 2#(1(5(2(1(3(4(4(x1:S)))))))) -> 0#(1(2(x1:S))) 2#(1(5(2(1(3(4(4(x1:S)))))))) -> 0#(3(4(0(1(2(x1:S)))))) 2#(1(5(2(1(3(4(4(x1:S)))))))) -> 1#(2(x1:S)) 2#(1(5(2(1(3(4(4(x1:S)))))))) -> 2#(x1:S) 2#(1(5(2(1(3(4(4(x1:S)))))))) -> 3#(4(0(1(2(x1:S))))) 2#(1(5(2(1(3(4(4(x1:S)))))))) -> 4#(0(1(2(x1:S)))) popout

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

job log

popout

actions

all output return to SRS Standard