SRS_Standard 2019-03-29 03.29 pair #432290071

details

property	value
status	complete
benchmark	size-12-alpha-3-num-110.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n031.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.20305 seconds
cpu usage	20.5186
user time	19.5266
system time	0.992012
max virtual memory	1.02920136E8
max residence set size	2986864.0

stage attributes

key	value
starexec-result	YES

output

19.53/5.93	YES
19.91/6.10	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
19.91/6.10	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
19.91/6.10	
19.91/6.10	
19.91/6.10	Termination w.r.t. Q of the given QTRS could be proven:
19.91/6.10	
19.91/6.10	(0) QTRS
19.91/6.10	(1) QTRS Reverse [EQUIVALENT, 0 ms]
19.91/6.10	(2) QTRS
19.91/6.10	(3) DependencyPairsProof [EQUIVALENT, 0 ms]
19.91/6.10	(4) QDP
19.91/6.10	(5) DependencyGraphProof [EQUIVALENT, 0 ms]
19.91/6.10	(6) QDP
19.91/6.10	(7) QDPOrderProof [EQUIVALENT, 138 ms]
19.91/6.10	(8) QDP
19.91/6.10	(9) UsableRulesProof [EQUIVALENT, 0 ms]
19.91/6.10	(10) QDP
19.91/6.10	(11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
19.91/6.10	(12) YES
19.91/6.10	
19.91/6.10	
19.91/6.10	----------------------------------------
19.91/6.10	
19.91/6.10	(0)
19.91/6.10	Obligation:
19.91/6.10	Q restricted rewrite system:
19.91/6.10	The TRS R consists of the following rules:
19.91/6.10	
19.91/6.10	   a(x1) -> x1
19.91/6.10	   a(a(b(x1))) -> b(b(a(a(x1))))
19.91/6.10	   c(b(x1)) -> c(a(x1))
19.91/6.10	
19.91/6.10	Q is empty.
19.91/6.10	
19.91/6.10	----------------------------------------
19.91/6.10	
19.91/6.10	(1) QTRS Reverse (EQUIVALENT)
19.91/6.10	We applied the QTRS Reverse Processor [REVERSE].
19.91/6.10	----------------------------------------
19.91/6.10	
19.91/6.10	(2)
19.91/6.10	Obligation:
19.91/6.10	Q restricted rewrite system:
19.91/6.10	The TRS R consists of the following rules:
19.91/6.10	
19.91/6.10	   a(x1) -> x1
19.91/6.10	   b(a(a(x1))) -> a(a(b(b(x1))))
19.91/6.10	   b(c(x1)) -> a(c(x1))
19.91/6.10	
19.91/6.10	Q is empty.
19.91/6.10	
19.91/6.10	----------------------------------------
19.91/6.10	
19.91/6.10	(3) DependencyPairsProof (EQUIVALENT)
19.91/6.10	Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
19.91/6.10	----------------------------------------
19.91/6.10	
19.91/6.10	(4)
19.91/6.10	Obligation:
19.91/6.10	Q DP problem:
19.91/6.10	The TRS P consists of the following rules:
19.91/6.10	
19.91/6.10	   B(a(a(x1))) -> A(a(b(b(x1))))
19.91/6.10	   B(a(a(x1))) -> A(b(b(x1)))
19.91/6.10	   B(a(a(x1))) -> B(b(x1))
19.91/6.10	   B(a(a(x1))) -> B(x1)
19.91/6.10	   B(c(x1)) -> A(c(x1))
19.91/6.10	
19.91/6.10	The TRS R consists of the following rules:
19.91/6.10	
19.91/6.10	   a(x1) -> x1
19.91/6.10	   b(a(a(x1))) -> a(a(b(b(x1))))
19.91/6.10	   b(c(x1)) -> a(c(x1))
19.91/6.10	
19.91/6.10	Q is empty.
19.91/6.10	We have to consider all minimal (P,Q,R)-chains.
19.91/6.10	----------------------------------------
19.91/6.10	
19.91/6.10	(5) DependencyGraphProof (EQUIVALENT)
19.91/6.10	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 3 less nodes.
19.91/6.10	----------------------------------------
19.91/6.10	
19.91/6.10	(6)
19.91/6.10	Obligation:
19.91/6.10	Q DP problem:
19.91/6.10	The TRS P consists of the following rules:
19.91/6.10	
19.91/6.10	   B(a(a(x1))) -> B(x1)
19.91/6.10	   B(a(a(x1))) -> B(b(x1))
19.91/6.10	
19.91/6.10	The TRS R consists of the following rules:
19.91/6.10	
19.91/6.10	   a(x1) -> x1
19.91/6.10	   b(a(a(x1))) -> a(a(b(b(x1))))
19.91/6.10	   b(c(x1)) -> a(c(x1))
19.91/6.10	
19.91/6.10	Q is empty.
19.91/6.10	We have to consider all minimal (P,Q,R)-chains.
19.91/6.10	----------------------------------------

popout

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

job log

popout

actions all output return to SRS_Standard 2019-03-29 03.29