SRS_Standard 2019-03-29 03.29 pair #432289207

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.71006 seconds
cpu usage	16.5705
user time	15.7491
system time	0.82136
max virtual memory	2.1013552E7
max residence set size	2421468.0

stage attributes

key	value
starexec-result	YES

output

14.33/5.15	YES
16.13/5.59	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
16.13/5.59	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
16.13/5.59	
16.13/5.59	
16.13/5.59	Termination w.r.t. Q of the given QTRS could be proven:
16.13/5.59	
16.13/5.59	(0) QTRS
16.13/5.59	(1) QTRS Reverse [EQUIVALENT, 0 ms]
16.13/5.59	(2) QTRS
16.13/5.59	(3) FlatCCProof [EQUIVALENT, 0 ms]
16.13/5.59	(4) QTRS
16.13/5.59	(5) RootLabelingProof [EQUIVALENT, 0 ms]
16.13/5.59	(6) QTRS
16.13/5.59	(7) QTRSRRRProof [EQUIVALENT, 3 ms]
16.13/5.59	(8) QTRS
16.13/5.59	(9) DependencyPairsProof [EQUIVALENT, 0 ms]
16.13/5.59	(10) QDP
16.13/5.59	(11) DependencyGraphProof [EQUIVALENT, 0 ms]
16.13/5.59	(12) AND
16.13/5.59	    (13) QDP
16.13/5.59	        (14) UsableRulesProof [EQUIVALENT, 0 ms]
16.13/5.59	        (15) QDP
16.13/5.59	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.13/5.59	        (17) YES
16.13/5.59	    (18) QDP
16.13/5.59	        (19) UsableRulesProof [EQUIVALENT, 0 ms]
16.13/5.59	        (20) QDP
16.13/5.59	        (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.13/5.59	        (22) YES
16.13/5.59	
16.13/5.59	
16.13/5.59	----------------------------------------
16.13/5.59	
16.13/5.59	(0)
16.13/5.59	Obligation:
16.13/5.59	Q restricted rewrite system:
16.13/5.59	The TRS R consists of the following rules:
16.13/5.59	
16.13/5.59	   a(b(x1)) -> b(b(b(x1)))
16.13/5.59	   b(a(x1)) -> a(a(a(x1)))
16.13/5.59	   a(x1) -> x1
16.13/5.59	   b(x1) -> x1
16.13/5.59	
16.13/5.59	Q is empty.
16.13/5.59	
16.13/5.59	----------------------------------------
16.13/5.59	
16.13/5.59	(1) QTRS Reverse (EQUIVALENT)
16.13/5.59	We applied the QTRS Reverse Processor [REVERSE].
16.13/5.59	----------------------------------------
16.13/5.59	
16.13/5.59	(2)
16.13/5.59	Obligation:
16.13/5.59	Q restricted rewrite system:
16.13/5.59	The TRS R consists of the following rules:
16.13/5.59	
16.13/5.59	   b(a(x1)) -> b(b(b(x1)))
16.13/5.59	   a(b(x1)) -> a(a(a(x1)))
16.13/5.59	   a(x1) -> x1
16.13/5.59	   b(x1) -> x1
16.13/5.59	
16.13/5.59	Q is empty.
16.13/5.59	
16.13/5.59	----------------------------------------
16.13/5.59	
16.13/5.59	(3) FlatCCProof (EQUIVALENT)
16.13/5.59	We used flat context closure [ROOTLAB]
16.13/5.59	As Q is empty the flat context closure was sound AND complete.
16.13/5.59	
16.13/5.59	----------------------------------------
16.13/5.59	
16.13/5.59	(4)
16.13/5.59	Obligation:
16.13/5.59	Q restricted rewrite system:
16.13/5.59	The TRS R consists of the following rules:
16.13/5.59	
16.13/5.59	   b(a(x1)) -> b(b(b(x1)))
16.13/5.59	   a(b(x1)) -> a(a(a(x1)))
16.13/5.59	   b(a(x1)) -> b(x1)
16.13/5.59	   a(a(x1)) -> a(x1)
16.13/5.59	   b(b(x1)) -> b(x1)
16.13/5.59	   a(b(x1)) -> a(x1)
16.13/5.59	
16.13/5.59	Q is empty.
16.13/5.59	
16.13/5.59	----------------------------------------
16.13/5.59	
16.13/5.59	(5) RootLabelingProof (EQUIVALENT)
16.13/5.59	We used plain root labeling [ROOTLAB] with the following heuristic:
16.13/5.59	LabelAll: All function symbols get labeled
16.13/5.59	
16.13/5.59	As Q is empty the root labeling was sound AND complete.
16.13/5.59	
16.13/5.59	----------------------------------------
16.13/5.59	
16.13/5.59	(6)
16.13/5.59	Obligation:
16.13/5.59	Q restricted rewrite system:
16.13/5.59	The TRS R consists of the following rules:

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