details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	60.4794 seconds
cpu usage	60.4121
user time	59.4416
system time	0.970571
max virtual memory	1142472.0
max residence set size	343820.0

stage attributes

key	value
starexec-result	NO

output

60.33/60.47 NO 60.33/60.47 60.33/60.47 Problem 1: 60.33/60.47 60.33/60.47 (VAR v_NonEmpty:S x:S y:S) 60.33/60.47 (RULES 60.33/60.47 a -> d 60.33/60.47 b -> d 60.33/60.47 e -> e 60.33/60.47 f(x:S,y:S) -> g(x:S) | a ->* d 60.33/60.47 f(x:S,y:S) -> h(x:S) | b ->* d 60.33/60.47 g(s(x:S)) -> x:S 60.33/60.47 h(s(x:S)) -> x:S 60.33/60.47 ) 60.33/60.47 60.33/60.47 Problem 1: 60.33/60.47 Valid CTRS Processor: 60.33/60.47 -> Rules: 60.33/60.47 a -> d 60.33/60.47 b -> d 60.33/60.47 e -> e 60.33/60.47 f(x:S,y:S) -> g(x:S) | a ->* d 60.33/60.47 f(x:S,y:S) -> h(x:S) | b ->* d 60.33/60.47 g(s(x:S)) -> x:S 60.33/60.47 h(s(x:S)) -> x:S 60.33/60.47 -> The system is a deterministic 3-CTRS. 60.33/60.47 60.33/60.47 Problem 1: 60.33/60.47 60.33/60.47 Dependency Pairs Processor: 60.33/60.47 60.33/60.47 Conditional Termination Problem 1: 60.33/60.47 -> Pairs: 60.33/60.47 E -> E 60.33/60.47 F(x:S,y:S) -> G(x:S) | a ->* d 60.33/60.47 F(x:S,y:S) -> H(x:S) | b ->* d 60.33/60.47 -> QPairs: 60.33/60.47 Empty 60.33/60.47 -> Rules: 60.33/60.47 a -> d 60.33/60.47 b -> d 60.33/60.47 e -> e 60.33/60.47 f(x:S,y:S) -> g(x:S) | a ->* d 60.33/60.47 f(x:S,y:S) -> h(x:S) | b ->* d 60.33/60.47 g(s(x:S)) -> x:S 60.33/60.47 h(s(x:S)) -> x:S 60.33/60.47 60.33/60.47 Conditional Termination Problem 2: 60.33/60.47 -> Pairs: 60.33/60.47 F(x:S,y:S) -> A 60.33/60.47 F(x:S,y:S) -> B 60.33/60.47 -> QPairs: 60.33/60.47 Empty 60.33/60.47 -> Rules: 60.33/60.47 a -> d 60.33/60.47 b -> d 60.33/60.47 e -> e 60.33/60.47 f(x:S,y:S) -> g(x:S) | a ->* d 60.33/60.47 f(x:S,y:S) -> h(x:S) | b ->* d 60.33/60.47 g(s(x:S)) -> x:S 60.33/60.47 h(s(x:S)) -> x:S 60.33/60.47 60.33/60.47 Problem 1: 60.33/60.47 60.33/60.47 SCC Processor: 60.33/60.47 -> Pairs: 60.33/60.47 E -> E 60.33/60.47 F(x:S,y:S) -> G(x:S) | a ->* d 60.33/60.47 F(x:S,y:S) -> H(x:S) | b ->* d 60.33/60.47 -> QPairs: 60.33/60.47 Empty 60.33/60.47 -> Rules: 60.33/60.47 a -> d 60.33/60.47 b -> d 60.33/60.47 e -> e 60.33/60.47 f(x:S,y:S) -> g(x:S) | a ->* d 60.33/60.47 f(x:S,y:S) -> h(x:S) | b ->* d 60.33/60.47 g(s(x:S)) -> x:S 60.33/60.47 h(s(x:S)) -> x:S 60.33/60.47 ->Strongly Connected Components: 60.33/60.47 ->->Cycle: 60.33/60.47 ->->-> Pairs: 60.33/60.47 E -> E 60.33/60.47 -> QPairs: 60.33/60.47 Empty 60.33/60.47 ->->-> Rules: 60.33/60.47 a -> d 60.33/60.47 b -> d 60.33/60.47 e -> e 60.33/60.47 f(x:S,y:S) -> g(x:S) | a ->* d 60.33/60.47 f(x:S,y:S) -> h(x:S) | b ->* d 60.33/60.47 g(s(x:S)) -> x:S 60.33/60.47 h(s(x:S)) -> x:S 60.33/60.47 60.33/60.47 Problem 1: 60.33/60.47 60.33/60.47 Infinite Processor: 60.33/60.47 -> Pairs: 60.33/60.47 E -> E 60.33/60.47 -> QPairs: popout

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

job log

popout

actions

all output return to TRS_Conditional 2019-03-28 22.59