SRS_Standard 2019-03-29 03.29 pair #432291181

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.73604 seconds
cpu usage	22.7429
user time	21.618
system time	1.12495
max virtual memory	7.8635104E7
max residence set size	3378652.0

stage attributes

key	value
starexec-result	YES

output

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

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