TRS_Contextsensitive 2019-03-21 05.07 pair #429997067

details

property	value
status	complete
benchmark	LengthOfFiniteLists_nosorts-noand.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n036.star.cs.uiowa.edu
space	Maude_06

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.518 seconds
cpu usage	3.47237
user time	3.31364
system time	0.158727
max virtual memory	1.8407068E7
max residence set size	218440.0

stage attributes

key	value
starexec-result	NO

output

3.32/1.48	NO
3.32/1.49	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.32/1.49	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.32/1.49	
3.32/1.49	
3.32/1.49	Termination of the given CSR could be disproven:
3.32/1.49	
3.32/1.49	(0) CSR
3.32/1.49	(1) CSRRRRProof [EQUIVALENT, 46 ms]
3.32/1.49	(2) CSR
3.32/1.49	(3) ContextSensitiveLoopProof [COMPLETE, 4 ms]
3.32/1.49	(4) NO
3.32/1.49	
3.32/1.49	
3.32/1.49	----------------------------------------
3.32/1.49	
3.32/1.49	(0)
3.32/1.49	Obligation:
3.32/1.49	Context-sensitive rewrite system:
3.32/1.49	The TRS R consists of the following rules:
3.32/1.49	
3.32/1.49	   zeros -> cons(0, zeros)
3.32/1.49	   U11(tt, L) -> U12(tt, L)
3.32/1.49	   U12(tt, L) -> s(length(L))
3.32/1.49	   length(nil) -> 0
3.32/1.49	   length(cons(N, L)) -> U11(tt, L)
3.32/1.49	
3.32/1.49	The replacement map contains the following entries:
3.32/1.49	
3.32/1.49	zeros: empty set
3.32/1.49	cons: {1}
3.32/1.49	0: empty set
3.32/1.49	U11: {1}
3.32/1.49	tt: empty set
3.32/1.49	U12: {1}
3.32/1.49	s: {1}
3.32/1.49	length: {1}
3.32/1.49	nil: empty set
3.32/1.49	
3.32/1.49	----------------------------------------
3.32/1.49	
3.32/1.49	(1) CSRRRRProof (EQUIVALENT)
3.32/1.49	The following CSR is given: Context-sensitive rewrite system:
3.32/1.49	The TRS R consists of the following rules:
3.32/1.49	
3.32/1.49	   zeros -> cons(0, zeros)
3.32/1.49	   U11(tt, L) -> U12(tt, L)
3.32/1.49	   U12(tt, L) -> s(length(L))
3.32/1.49	   length(nil) -> 0
3.32/1.49	   length(cons(N, L)) -> U11(tt, L)
3.32/1.49	
3.32/1.49	The replacement map contains the following entries:
3.32/1.49	
3.32/1.49	zeros: empty set
3.32/1.49	cons: {1}
3.32/1.49	0: empty set
3.32/1.49	U11: {1}
3.32/1.49	tt: empty set
3.32/1.49	U12: {1}
3.32/1.49	s: {1}
3.32/1.49	length: {1}
3.32/1.49	nil: empty set
3.32/1.49	Used ordering:
3.32/1.49	Polynomial interpretation [POLO]:
3.32/1.49	
3.32/1.49	   POL(0) = 0
3.32/1.49	   POL(U11(x_1, x_2)) = x_1 + 2*x_2
3.32/1.49	   POL(U12(x_1, x_2)) = x_1 + 2*x_2
3.32/1.49	   POL(cons(x_1, x_2)) = 2*x_1 + 2*x_2
3.32/1.49	   POL(length(x_1)) = x_1
3.32/1.49	   POL(nil) = 1
3.32/1.49	   POL(s(x_1)) = 2*x_1
3.32/1.49	   POL(tt) = 0
3.32/1.49	   POL(zeros) = 0
3.32/1.49	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
3.32/1.49	
3.32/1.49	   length(nil) -> 0
3.32/1.49	
3.32/1.49	
3.32/1.49	
3.32/1.49	
3.32/1.49	----------------------------------------
3.32/1.49	
3.32/1.49	(2)
3.32/1.49	Obligation:
3.32/1.49	Context-sensitive rewrite system:
3.32/1.49	The TRS R consists of the following rules:
3.32/1.49	
3.32/1.49	   zeros -> cons(0, zeros)
3.32/1.49	   U11(tt, L) -> U12(tt, L)
3.32/1.49	   U12(tt, L) -> s(length(L))
3.32/1.49	   length(cons(N, L)) -> U11(tt, L)
3.32/1.49	
3.32/1.49	The replacement map contains the following entries:
3.32/1.49	
3.32/1.49	zeros: empty set
3.32/1.49	cons: {1}
3.32/1.49	0: empty set
3.32/1.49	U11: {1}
3.32/1.49	tt: empty set

popout

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

job log

popout

actions all output return to TRS_Contextsensitive 2019-03-21 05.07