TRS_Conditional 2019-03-28 22.59 pair #432272637

details

property	value
status	complete
benchmark	jlap09-ex16.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n067.star.cs.uiowa.edu
space	Mixed_CTRS_2014

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.90319 seconds
cpu usage	3.97842
user time	3.77435
system time	0.204078
max virtual memory	1.84775E7
max residence set size	307100.0

stage attributes

key	value
starexec-result	MAYBE

output

3.85/1.85	MAYBE
3.85/1.87	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.85/1.87	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.85/1.87	
3.85/1.87	
3.85/1.87	Quasi decreasingness of the given CTRS could not be shown:
3.85/1.87	
3.85/1.87	(0) CTRS
3.85/1.87	(1) CTRSToQTRSProof [SOUND, 0 ms]
3.85/1.87	(2) QTRS
3.85/1.87	(3) AAECC Innermost [EQUIVALENT, 1 ms]
3.85/1.87	(4) QTRS
3.85/1.87	(5) DependencyPairsProof [EQUIVALENT, 0 ms]
3.85/1.87	(6) QDP
3.85/1.87	(7) DependencyGraphProof [EQUIVALENT, 0 ms]
3.85/1.87	(8) QDP
3.85/1.87	(9) UsableRulesProof [EQUIVALENT, 0 ms]
3.85/1.87	(10) QDP
3.85/1.87	(11) QReductionProof [EQUIVALENT, 0 ms]
3.85/1.87	(12) QDP
3.85/1.87	(13) TransformationProof [EQUIVALENT, 0 ms]
3.85/1.87	(14) QDP
3.85/1.87	(15) TransformationProof [EQUIVALENT, 0 ms]
3.85/1.87	(16) QDP
3.85/1.87	(17) UsableRulesProof [EQUIVALENT, 0 ms]
3.85/1.87	(18) QDP
3.85/1.87	(19) QReductionProof [EQUIVALENT, 0 ms]
3.85/1.87	(20) QDP
3.85/1.87	(21) TransformationProof [EQUIVALENT, 0 ms]
3.85/1.87	(22) QDP
3.85/1.87	(23) QReductionProof [EQUIVALENT, 0 ms]
3.85/1.87	(24) QDP
3.85/1.87	(25) NonTerminationLoopProof [COMPLETE, 0 ms]
3.85/1.87	(26) NO
3.85/1.87	
3.85/1.87	
3.85/1.87	----------------------------------------
3.85/1.87	
3.85/1.87	(0)
3.85/1.87	Obligation:
3.85/1.87	Conditional term rewrite system:
3.85/1.87	The TRS R consists of the following rules:
3.85/1.87	
3.85/1.87	   g(x, x) -> g(f(a), f(b))
3.85/1.87	
3.85/1.87	The conditional TRS C consists of the following conditional rules:
3.85/1.87	
3.85/1.87	   f(x) -> c <= a -> b
3.85/1.87	
3.85/1.87	
3.85/1.87	----------------------------------------
3.85/1.87	
3.85/1.87	(1) CTRSToQTRSProof (SOUND)
3.85/1.87	The conditional rules have been transormed into unconditional rules according to [CTRS,AAECCNOC].
3.85/1.87	----------------------------------------
3.85/1.87	
3.85/1.87	(2)
3.85/1.87	Obligation:
3.85/1.87	Q restricted rewrite system:
3.85/1.87	The TRS R consists of the following rules:
3.85/1.87	
3.85/1.87	   f(x) -> U1(a)
3.85/1.87	   U1(b) -> c
3.85/1.87	   g(x, x) -> g(f(a), f(b))
3.85/1.87	
3.85/1.87	Q is empty.
3.85/1.87	
3.85/1.87	----------------------------------------
3.85/1.87	
3.85/1.87	(3) AAECC Innermost (EQUIVALENT)
3.85/1.87	We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is 
3.85/1.87	   f(x) -> U1(a)
3.85/1.87	   U1(b) -> c
3.85/1.87	
3.85/1.87	The TRS R 2 is 
3.85/1.87	   g(x, x) -> g(f(a), f(b))
3.85/1.87	
3.85/1.87	The signature Sigma is {g_2}
3.85/1.87	----------------------------------------
3.85/1.87	
3.85/1.87	(4)
3.85/1.87	Obligation:
3.85/1.87	Q restricted rewrite system:
3.85/1.87	The TRS R consists of the following rules:
3.85/1.87	
3.85/1.87	   f(x) -> U1(a)
3.85/1.87	   U1(b) -> c
3.85/1.87	   g(x, x) -> g(f(a), f(b))
3.85/1.87	
3.85/1.87	The set Q consists of the following terms:
3.85/1.87	
3.85/1.87	   f(x0)
3.85/1.87	   U1(b)
3.85/1.87	   g(x0, x0)
3.85/1.87	
3.85/1.87	
3.85/1.87	----------------------------------------
3.85/1.87	
3.85/1.87	(5) DependencyPairsProof (EQUIVALENT)
3.85/1.87	Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

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