TRS_Conditional 2019-03-28 22.59 pair #432272472

details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	32.4797 seconds
cpu usage	32.4482
user time	31.2885
system time	1.15966
max virtual memory	1144744.0
max residence set size	53116.0

stage attributes

key	value
starexec-result	NO

output

32.39/32.47	NO
32.39/32.47	
32.39/32.47	Problem 1: 
32.39/32.47	
32.39/32.47	(VAR v_NonEmpty:S x:S y:S z:S)
32.39/32.47	(RULES
32.39/32.47	between(x:S,y:S,z:S) -> ttrue | up(x:S) ->* y:S, down(z:S) ->* y:S
32.39/32.47	down(s(x:S)) -> down(x:S)
32.39/32.47	down(x:S) -> x:S
32.39/32.47	up(x:S) -> up(s(x:S))
32.39/32.47	up(x:S) -> x:S
32.39/32.47	)
32.39/32.47	
32.39/32.47	Problem 1: 
32.39/32.47	Valid CTRS Processor:
32.39/32.47	-> Rules:
32.39/32.47	 between(x:S,y:S,z:S) -> ttrue | up(x:S) ->* y:S, down(z:S) ->* y:S
32.39/32.47	 down(s(x:S)) -> down(x:S)
32.39/32.47	 down(x:S) -> x:S
32.39/32.47	 up(x:S) -> up(s(x:S))
32.39/32.47	 up(x:S) -> x:S
32.39/32.47	-> The system is a deterministic 3-CTRS.
32.39/32.47	
32.39/32.47	Problem 1: 
32.39/32.47	
32.39/32.47	Dependency Pairs Processor:
32.39/32.47	
32.39/32.47	Conditional Termination Problem 1:
32.39/32.47	-> Pairs:
32.39/32.47	 DOWN(s(x:S)) -> DOWN(x:S)
32.39/32.47	 UP(x:S) -> UP(s(x:S))
32.39/32.47	-> QPairs:
32.39/32.47	 Empty
32.39/32.47	-> Rules:
32.39/32.47	 between(x:S,y:S,z:S) -> ttrue | up(x:S) ->* y:S, down(z:S) ->* y:S
32.39/32.47	 down(s(x:S)) -> down(x:S)
32.39/32.47	 down(x:S) -> x:S
32.39/32.47	 up(x:S) -> up(s(x:S))
32.39/32.47	 up(x:S) -> x:S
32.39/32.47	
32.39/32.47	Conditional Termination Problem 2:
32.39/32.47	-> Pairs:
32.39/32.47	 BETWEEN(x:S,y:S,z:S) -> DOWN(z:S) | up(x:S) ->* y:S
32.39/32.47	 BETWEEN(x:S,y:S,z:S) -> UP(x:S)
32.39/32.47	-> QPairs:
32.39/32.47	 DOWN(s(x:S)) -> DOWN(x:S)
32.39/32.47	 UP(x:S) -> UP(s(x:S))
32.39/32.47	-> Rules:
32.39/32.47	 between(x:S,y:S,z:S) -> ttrue | up(x:S) ->* y:S, down(z:S) ->* y:S
32.39/32.47	 down(s(x:S)) -> down(x:S)
32.39/32.47	 down(x:S) -> x:S
32.39/32.47	 up(x:S) -> up(s(x:S))
32.39/32.47	 up(x:S) -> x:S
32.39/32.47	
32.39/32.47	Problem 1: 
32.39/32.47	
32.39/32.47	SCC Processor:
32.39/32.47	-> Pairs:
32.39/32.47	 DOWN(s(x:S)) -> DOWN(x:S)
32.39/32.47	 UP(x:S) -> UP(s(x:S))
32.39/32.47	-> QPairs:
32.39/32.47	 Empty
32.39/32.47	-> Rules:
32.39/32.47	 between(x:S,y:S,z:S) -> ttrue | up(x:S) ->* y:S, down(z:S) ->* y:S
32.39/32.47	 down(s(x:S)) -> down(x:S)
32.39/32.47	 down(x:S) -> x:S
32.39/32.47	 up(x:S) -> up(s(x:S))
32.39/32.47	 up(x:S) -> x:S
32.39/32.47	->Strongly Connected Components:
32.39/32.47	->->Cycle:
32.39/32.47	->->-> Pairs:
32.39/32.47	 UP(x:S) -> UP(s(x:S))
32.39/32.47	-> QPairs:
32.39/32.47	 Empty
32.39/32.47	->->-> Rules:
32.39/32.47	 between(x:S,y:S,z:S) -> ttrue | up(x:S) ->* y:S, down(z:S) ->* y:S
32.39/32.47	 down(s(x:S)) -> down(x:S)
32.39/32.47	 down(x:S) -> x:S
32.39/32.47	 up(x:S) -> up(s(x:S))
32.39/32.47	 up(x:S) -> x:S
32.39/32.47	->->Cycle:
32.39/32.47	->->-> Pairs:
32.39/32.47	 DOWN(s(x:S)) -> DOWN(x:S)
32.39/32.47	-> QPairs:
32.39/32.47	 Empty
32.39/32.47	->->-> Rules:
32.39/32.47	 between(x:S,y:S,z:S) -> ttrue | up(x:S) ->* y:S, down(z:S) ->* y:S
32.39/32.47	 down(s(x:S)) -> down(x:S)
32.39/32.47	 down(x:S) -> x:S
32.39/32.47	 up(x:S) -> up(s(x:S))
32.39/32.47	 up(x:S) -> x:S
32.39/32.47	
32.39/32.47	Problem 1: 
32.39/32.47	
32.39/32.47	Infinite Processor:
32.39/32.47	-> Pairs:
32.39/32.47	 UP(x:S) -> UP(s(x:S))
32.39/32.47	-> QPairs:
32.39/32.47	 Empty
32.39/32.47	-> Rules:

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