SRS_Standard 2019-03-29 03.29 pair #432294277

details

property	value
status	complete
benchmark	dup06.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n151.star.cs.uiowa.edu
space	Trafo_06

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.9058 seconds
cpu usage	42.8468
user time	40.9224
system time	1.92447
max virtual memory	8.2965112E7
max residence set size	4478188.0

stage attributes

key	value
starexec-result	YES

output

42.33/11.72	YES
42.33/11.75	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
42.33/11.75	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
42.33/11.75	
42.33/11.75	
42.33/11.75	Termination w.r.t. Q of the given QTRS could be proven:
42.33/11.75	
42.33/11.75	(0) QTRS
42.33/11.75	(1) DependencyPairsProof [EQUIVALENT, 29 ms]
42.33/11.75	(2) QDP
42.33/11.75	(3) DependencyGraphProof [EQUIVALENT, 4 ms]
42.33/11.75	(4) AND
42.33/11.75	    (5) QDP
42.33/11.75	        (6) UsableRulesProof [EQUIVALENT, 4 ms]
42.33/11.75	        (7) QDP
42.33/11.75	        (8) MNOCProof [EQUIVALENT, 7 ms]
42.33/11.75	        (9) QDP
42.33/11.75	        (10) MRRProof [EQUIVALENT, 19 ms]
42.33/11.75	        (11) QDP
42.33/11.75	        (12) QDPOrderProof [EQUIVALENT, 10 ms]
42.33/11.75	        (13) QDP
42.33/11.75	        (14) PisEmptyProof [EQUIVALENT, 0 ms]
42.33/11.75	        (15) YES
42.33/11.75	    (16) QDP
42.33/11.75	        (17) MRRProof [EQUIVALENT, 43 ms]
42.33/11.75	        (18) QDP
42.33/11.75	        (19) QDPOrderProof [EQUIVALENT, 0 ms]
42.33/11.75	        (20) QDP
42.33/11.75	        (21) PisEmptyProof [EQUIVALENT, 0 ms]
42.33/11.75	        (22) YES
42.33/11.75	
42.33/11.75	
42.33/11.75	----------------------------------------
42.33/11.75	
42.33/11.75	(0)
42.33/11.75	Obligation:
42.33/11.75	Q restricted rewrite system:
42.33/11.75	The TRS R consists of the following rules:
42.33/11.75	
42.33/11.75	   a(a(b(b(x1)))) -> b(b(c(c(a(a(x1))))))
42.33/11.75	   b(b(c(c(x1)))) -> c(c(b(b(b(b(x1))))))
42.33/11.75	   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))
42.33/11.75	
42.33/11.75	Q is empty.
42.33/11.75	
42.33/11.75	----------------------------------------
42.33/11.75	
42.33/11.75	(1) DependencyPairsProof (EQUIVALENT)
42.33/11.75	Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
42.33/11.75	----------------------------------------
42.33/11.75	
42.33/11.75	(2)
42.33/11.75	Obligation:
42.33/11.75	Q DP problem:
42.33/11.75	The TRS P consists of the following rules:
42.33/11.75	
42.33/11.75	   A(a(b(b(x1)))) -> B(b(c(c(a(a(x1))))))
42.33/11.75	   A(a(b(b(x1)))) -> B(c(c(a(a(x1)))))
42.33/11.75	   A(a(b(b(x1)))) -> A(a(x1))
42.33/11.75	   A(a(b(b(x1)))) -> A(x1)
42.33/11.75	   B(b(c(c(x1)))) -> B(b(b(b(x1))))
42.33/11.75	   B(b(c(c(x1)))) -> B(b(b(x1)))
42.33/11.75	   B(b(c(c(x1)))) -> B(b(x1))
42.33/11.75	   B(b(c(c(x1)))) -> B(x1)
42.33/11.75	   B(b(a(a(x1)))) -> A(a(c(c(b(b(x1))))))
42.33/11.75	   B(b(a(a(x1)))) -> A(c(c(b(b(x1)))))
42.33/11.75	   B(b(a(a(x1)))) -> B(b(x1))
42.33/11.75	   B(b(a(a(x1)))) -> B(x1)
42.33/11.75	
42.33/11.75	The TRS R consists of the following rules:
42.33/11.75	
42.33/11.75	   a(a(b(b(x1)))) -> b(b(c(c(a(a(x1))))))
42.33/11.75	   b(b(c(c(x1)))) -> c(c(b(b(b(b(x1))))))
42.33/11.75	   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))
42.33/11.75	
42.33/11.75	Q is empty.
42.33/11.75	We have to consider all minimal (P,Q,R)-chains.
42.33/11.75	----------------------------------------
42.33/11.75	
42.33/11.75	(3) DependencyGraphProof (EQUIVALENT)
42.33/11.75	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 4 less nodes.
42.33/11.75	----------------------------------------
42.33/11.75	
42.33/11.75	(4)
42.33/11.75	Complex Obligation (AND)
42.33/11.75	
42.33/11.75	----------------------------------------
42.33/11.75	
42.33/11.75	(5)
42.33/11.75	Obligation:
42.33/11.75	Q DP problem:
42.33/11.75	The TRS P consists of the following rules:
42.33/11.75	
42.33/11.75	   B(b(c(c(x1)))) -> B(b(b(x1)))
42.33/11.75	   B(b(c(c(x1)))) -> B(b(b(b(x1))))
42.33/11.75	   B(b(c(c(x1)))) -> B(b(x1))
42.33/11.75	   B(b(c(c(x1)))) -> B(x1)
42.33/11.75	   B(b(a(a(x1)))) -> B(b(x1))
42.33/11.75	   B(b(a(a(x1)))) -> B(x1)
42.33/11.75

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