Integer_TRS_Innermost 2019-03-21 04.53 pair #429995106

details

property	value
status	complete
benchmark	increase3.itrs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n006.star.cs.uiowa.edu
space	Mixed_ITRS_2014

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.58772 seconds
cpu usage	6.36748
user time	5.98874
system time	0.378732
max virtual memory	1.8811212E7
max residence set size	389412.0

stage attributes

key	value
starexec-result	YES

output

5.92/2.49	YES
6.21/2.51	proof of /export/starexec/sandbox/benchmark/theBenchmark.itrs
6.21/2.51	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.21/2.51	
6.21/2.51	
6.21/2.51	Termination of the given ITRS could be proven:
6.21/2.51	
6.21/2.51	(0) ITRS
6.21/2.51	(1) ITRStoIDPProof [EQUIVALENT, 0 ms]
6.21/2.51	(2) IDP
6.21/2.51	(3) UsableRulesProof [EQUIVALENT, 0 ms]
6.21/2.51	(4) IDP
6.21/2.51	(5) IDPNonInfProof [SOUND, 409 ms]
6.21/2.51	(6) IDP
6.21/2.51	(7) IDependencyGraphProof [EQUIVALENT, 0 ms]
6.21/2.51	(8) IDP
6.21/2.51	(9) IDPNonInfProof [SOUND, 61 ms]
6.21/2.51	(10) IDP
6.21/2.51	(11) IDependencyGraphProof [EQUIVALENT, 0 ms]
6.21/2.51	(12) TRUE
6.21/2.51	
6.21/2.51	
6.21/2.51	----------------------------------------
6.21/2.51	
6.21/2.51	(0)
6.21/2.51	Obligation:
6.21/2.51	ITRS problem:
6.21/2.51	
6.21/2.51	The following function symbols are pre-defined:
6.21/2.51	<<<
6.21/2.51	 & 	~ 	Bwand: (Integer, Integer) -> Integer
6.21/2.51	 >= 	~ 	Ge: (Integer, Integer) -> Boolean
6.21/2.51	 | 	~ 	Bwor: (Integer, Integer) -> Integer
6.21/2.51	 / 	~ 	Div: (Integer, Integer) -> Integer
6.21/2.51	 != 	~ 	Neq: (Integer, Integer) -> Boolean
6.21/2.51	 && 	~ 	Land: (Boolean, Boolean) -> Boolean
6.21/2.51	 ! 	~ 	Lnot: (Boolean) -> Boolean
6.21/2.51	 = 	~ 	Eq: (Integer, Integer) -> Boolean
6.21/2.51	 <= 	~ 	Le: (Integer, Integer) -> Boolean
6.21/2.51	 ^ 	~ 	Bwxor: (Integer, Integer) -> Integer
6.21/2.51	 % 	~ 	Mod: (Integer, Integer) -> Integer
6.21/2.51	 + 	~ 	Add: (Integer, Integer) -> Integer
6.21/2.51	 > 	~ 	Gt: (Integer, Integer) -> Boolean
6.21/2.51	 -1 	~ 	UnaryMinus: (Integer) -> Integer
6.21/2.51	 < 	~ 	Lt: (Integer, Integer) -> Boolean
6.21/2.51	 || 	~ 	Lor: (Boolean, Boolean) -> Boolean
6.21/2.51	 - 	~ 	Sub: (Integer, Integer) -> Integer
6.21/2.51	 ~ 	~ 	Bwnot: (Integer) -> Integer
6.21/2.51	 * 	~ 	Mul: (Integer, Integer) -> Integer
6.21/2.51	>>>
6.21/2.51	
6.21/2.51	The TRS R consists of the following rules:
6.21/2.51	f(x, y, z) -> Cond_f(x > y && x > z, x, y, z)
6.21/2.51	Cond_f(TRUE, x, y, z) -> f(x, y + 1, z)
6.21/2.51	f(x, y, z) -> Cond_f1(x > y && x > z, x, y, z)
6.21/2.51	Cond_f1(TRUE, x, y, z) -> f(x, y, z + 1)
6.21/2.51	The set Q consists of the following terms:
6.21/2.51	f(x0, x1, x2)
6.21/2.51	Cond_f(TRUE, x0, x1, x2)
6.21/2.51	Cond_f1(TRUE, x0, x1, x2)
6.21/2.51	
6.21/2.51	----------------------------------------
6.21/2.51	
6.21/2.51	(1) ITRStoIDPProof (EQUIVALENT)
6.21/2.51	Added dependency pairs
6.21/2.51	----------------------------------------
6.21/2.51	
6.21/2.51	(2)
6.21/2.51	Obligation:
6.21/2.51	IDP problem:
6.21/2.51	The following function symbols are pre-defined:
6.21/2.51	<<<
6.21/2.51	 & 	~ 	Bwand: (Integer, Integer) -> Integer
6.21/2.51	 >= 	~ 	Ge: (Integer, Integer) -> Boolean
6.21/2.51	 | 	~ 	Bwor: (Integer, Integer) -> Integer
6.21/2.51	 / 	~ 	Div: (Integer, Integer) -> Integer
6.21/2.51	 != 	~ 	Neq: (Integer, Integer) -> Boolean
6.21/2.51	 && 	~ 	Land: (Boolean, Boolean) -> Boolean
6.21/2.51	 ! 	~ 	Lnot: (Boolean) -> Boolean
6.21/2.51	 = 	~ 	Eq: (Integer, Integer) -> Boolean
6.21/2.51	 <= 	~ 	Le: (Integer, Integer) -> Boolean
6.21/2.51	 ^ 	~ 	Bwxor: (Integer, Integer) -> Integer
6.21/2.51	 % 	~ 	Mod: (Integer, Integer) -> Integer
6.21/2.51	 + 	~ 	Add: (Integer, Integer) -> Integer
6.21/2.51	 > 	~ 	Gt: (Integer, Integer) -> Boolean
6.21/2.51	 -1 	~ 	UnaryMinus: (Integer) -> Integer
6.21/2.51	 < 	~ 	Lt: (Integer, Integer) -> Boolean
6.21/2.51	 || 	~ 	Lor: (Boolean, Boolean) -> Boolean
6.21/2.51	 - 	~ 	Sub: (Integer, Integer) -> Integer
6.21/2.51	 ~ 	~ 	Bwnot: (Integer) -> Integer
6.21/2.51	 * 	~ 	Mul: (Integer, Integer) -> Integer
6.21/2.51	>>>
6.21/2.51	
6.21/2.51	
6.21/2.51	The following domains are used:
6.21/2.51	   Boolean, Integer
6.21/2.51	
6.21/2.51	The ITRS R consists of the following rules:
6.21/2.51	f(x, y, z) -> Cond_f(x > y && x > z, x, y, z)
6.21/2.51	Cond_f(TRUE, x, y, z) -> f(x, y + 1, z)

popout

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

job log

popout

actions all output return to Integer_TRS_Innermost 2019-03-21 04.53