SRS_Standard 2019-03-29 03.29 pair #432289051

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.58452 seconds
cpu usage	22.376
user time	21.4155
system time	0.96049
max virtual memory	4.1905812E7
max residence set size	2637592.0

stage attributes

key	value
starexec-result	YES

output

21.86/6.45	YES
22.17/6.50	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
22.17/6.50	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
22.17/6.50	
22.17/6.50	
22.17/6.50	Termination w.r.t. Q of the given QTRS could be proven:
22.17/6.50	
22.17/6.50	(0) QTRS
22.17/6.50	(1) DependencyPairsProof [EQUIVALENT, 24 ms]
22.17/6.50	(2) QDP
22.17/6.50	(3) MRRProof [EQUIVALENT, 62 ms]
22.17/6.50	(4) QDP
22.17/6.50	(5) QDPOrderProof [EQUIVALENT, 74 ms]
22.17/6.50	(6) QDP
22.17/6.50	(7) PisEmptyProof [EQUIVALENT, 0 ms]
22.17/6.50	(8) YES
22.17/6.50	
22.17/6.50	
22.17/6.50	----------------------------------------
22.17/6.50	
22.17/6.50	(0)
22.17/6.50	Obligation:
22.17/6.50	Q restricted rewrite system:
22.17/6.50	The TRS R consists of the following rules:
22.17/6.50	
22.17/6.50	   0(0(0(0(x1)))) -> 1(0(0(1(x1))))
22.17/6.50	   0(1(0(1(x1)))) -> 0(0(1(0(x1))))
22.17/6.50	
22.17/6.50	Q is empty.
22.17/6.50	
22.17/6.50	----------------------------------------
22.17/6.50	
22.17/6.50	(1) DependencyPairsProof (EQUIVALENT)
22.17/6.50	Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
22.17/6.50	----------------------------------------
22.17/6.50	
22.17/6.50	(2)
22.17/6.50	Obligation:
22.17/6.50	Q DP problem:
22.17/6.50	The TRS P consists of the following rules:
22.17/6.50	
22.17/6.50	   0^1(0(0(0(x1)))) -> 0^1(0(1(x1)))
22.17/6.50	   0^1(0(0(0(x1)))) -> 0^1(1(x1))
22.17/6.50	   0^1(1(0(1(x1)))) -> 0^1(0(1(0(x1))))
22.17/6.50	   0^1(1(0(1(x1)))) -> 0^1(1(0(x1)))
22.17/6.50	   0^1(1(0(1(x1)))) -> 0^1(x1)
22.17/6.50	
22.17/6.50	The TRS R consists of the following rules:
22.17/6.50	
22.17/6.50	   0(0(0(0(x1)))) -> 1(0(0(1(x1))))
22.17/6.50	   0(1(0(1(x1)))) -> 0(0(1(0(x1))))
22.17/6.50	
22.17/6.50	Q is empty.
22.17/6.50	We have to consider all minimal (P,Q,R)-chains.
22.17/6.50	----------------------------------------
22.17/6.50	
22.17/6.50	(3) MRRProof (EQUIVALENT)
22.17/6.50	By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
22.17/6.50	
22.17/6.50	Strictly oriented dependency pairs:
22.17/6.50	
22.17/6.50	   0^1(0(0(0(x1)))) -> 0^1(0(1(x1)))
22.17/6.50	   0^1(0(0(0(x1)))) -> 0^1(1(x1))
22.17/6.50	   0^1(1(0(1(x1)))) -> 0^1(1(0(x1)))
22.17/6.50	   0^1(1(0(1(x1)))) -> 0^1(x1)
22.17/6.50	
22.17/6.50	
22.17/6.50	Used ordering: Polynomial interpretation [POLO]:
22.17/6.50	
22.17/6.50	   POL(0(x_1)) = 1 + x_1
22.17/6.50	   POL(0^1(x_1)) = x_1
22.17/6.50	   POL(1(x_1)) = 1 + x_1
22.17/6.50	
22.17/6.50	
22.17/6.50	----------------------------------------
22.17/6.50	
22.17/6.50	(4)
22.17/6.50	Obligation:
22.17/6.50	Q DP problem:
22.17/6.50	The TRS P consists of the following rules:
22.17/6.50	
22.17/6.50	   0^1(1(0(1(x1)))) -> 0^1(0(1(0(x1))))
22.17/6.50	
22.17/6.50	The TRS R consists of the following rules:
22.17/6.50	
22.17/6.50	   0(0(0(0(x1)))) -> 1(0(0(1(x1))))
22.17/6.50	   0(1(0(1(x1)))) -> 0(0(1(0(x1))))
22.17/6.50	
22.17/6.50	Q is empty.
22.17/6.50	We have to consider all minimal (P,Q,R)-chains.
22.17/6.50	----------------------------------------
22.17/6.50	
22.17/6.50	(5) QDPOrderProof (EQUIVALENT)
22.17/6.50	We use the reduction pair processor [LPAR04,JAR06].
22.17/6.50	
22.17/6.50	
22.17/6.50	The following pairs can be oriented strictly and are deleted.
22.17/6.50	
22.17/6.50	   0^1(1(0(1(x1)))) -> 0^1(0(1(0(x1))))
22.17/6.50	The remaining pairs can at least be oriented weakly.

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