3.16/1.51	YES
3.27/1.52	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
3.27/1.52	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.27/1.52	
3.27/1.52	
3.27/1.52	Termination of the given CSR could be proven:
3.27/1.52	
3.27/1.52	(0) CSR
3.27/1.52	(1) CSRRRRProof [EQUIVALENT, 41 ms]
3.27/1.52	(2) CSR
3.27/1.52	(3) CSRRRRProof [EQUIVALENT, 0 ms]
3.27/1.52	(4) CSR
3.27/1.52	(5) CSRRRRProof [EQUIVALENT, 11 ms]
3.27/1.52	(6) CSR
3.27/1.52	(7) CSRRRRProof [EQUIVALENT, 0 ms]
3.27/1.52	(8) CSR
3.27/1.52	(9) RisEmptyProof [EQUIVALENT, 0 ms]
3.27/1.52	(10) YES
3.27/1.52	
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(0)
3.27/1.52	Obligation:
3.27/1.52	Context-sensitive rewrite system:
3.27/1.52	The TRS R consists of the following rules:
3.27/1.52	
3.27/1.52	   f_1(g_1(a_0)) -> a_0
3.27/1.52	   f_1(f_0(x)) -> b_0
3.27/1.52	   f_1(f_1(x)) -> b_0
3.27/1.52	   g_1(x) -> f_1(g_1(x))
3.27/1.52	   *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x)))
3.27/1.52	   f_0(g_1(x)) -> f_1(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	The replacement map contains the following entries:
3.27/1.52	
3.27/1.52	f_1: empty set
3.27/1.52	g_1: empty set
3.27/1.52	a_0: empty set
3.27/1.52	f_0: {1}
3.27/1.52	b_0: empty set
3.27/1.52	*top*_0: {1}
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(1) CSRRRRProof (EQUIVALENT)
3.27/1.52	The following CSR is given: Context-sensitive rewrite system:
3.27/1.52	The TRS R consists of the following rules:
3.27/1.52	
3.27/1.52	   f_1(g_1(a_0)) -> a_0
3.27/1.52	   f_1(f_0(x)) -> b_0
3.27/1.52	   f_1(f_1(x)) -> b_0
3.27/1.52	   g_1(x) -> f_1(g_1(x))
3.27/1.52	   *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x)))
3.27/1.52	   f_0(g_1(x)) -> f_1(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	The replacement map contains the following entries:
3.27/1.52	
3.27/1.52	f_1: empty set
3.27/1.52	g_1: empty set
3.27/1.52	a_0: empty set
3.27/1.52	f_0: {1}
3.27/1.52	b_0: empty set
3.27/1.52	*top*_0: {1}
3.27/1.52	Used ordering:
3.27/1.52	Polynomial interpretation [POLO]:
3.27/1.52	
3.27/1.52	   POL(*top*_0(x_1)) = x_1
3.27/1.52	   POL(a_0) = 1
3.27/1.52	   POL(b_0) = 0
3.27/1.52	   POL(f_0(x_1)) = x_1
3.27/1.52	   POL(f_1(x_1)) = 1
3.27/1.52	   POL(g_1(x_1)) = 1 + x_1
3.27/1.52	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
3.27/1.52	
3.27/1.52	   f_1(f_0(x)) -> b_0
3.27/1.52	   f_1(f_1(x)) -> b_0
3.27/1.52	
3.27/1.52	
3.27/1.52	
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(2)
3.27/1.52	Obligation:
3.27/1.52	Context-sensitive rewrite system:
3.27/1.52	The TRS R consists of the following rules:
3.27/1.52	
3.27/1.52	   f_1(g_1(a_0)) -> a_0
3.27/1.52	   g_1(x) -> f_1(g_1(x))
3.27/1.52	   *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x)))
3.27/1.52	   f_0(g_1(x)) -> f_1(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	The replacement map contains the following entries:
3.27/1.52	
3.27/1.52	f_1: empty set
3.27/1.52	g_1: empty set
3.27/1.52	a_0: empty set
3.27/1.52	f_0: {1}
3.27/1.52	*top*_0: {1}
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(3) CSRRRRProof (EQUIVALENT)
3.27/1.52	The following CSR is given: Context-sensitive rewrite system:
3.27/1.52	The TRS R consists of the following rules:
3.27/1.52	
3.27/1.52	   f_1(g_1(a_0)) -> a_0
3.27/1.52	   g_1(x) -> f_1(g_1(x))
3.27/1.52	   *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x)))
3.27/1.52	   f_0(g_1(x)) -> f_1(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	The replacement map contains the following entries:
3.27/1.52	
3.27/1.52	f_1: empty set
3.27/1.52	g_1: empty set
3.27/1.52	a_0: empty set
3.27/1.52	f_0: {1}
3.27/1.52	*top*_0: {1}
3.27/1.52	Used ordering:
3.27/1.52	Polynomial interpretation [POLO]:
3.27/1.52	
3.27/1.52	   POL(*top*_0(x_1)) = x_1
3.27/1.52	   POL(a_0) = 1
3.27/1.52	   POL(f_0(x_1)) = x_1
3.27/1.52	   POL(f_1(x_1)) = x_1
3.27/1.52	   POL(g_1(x_1)) = 2*x_1
3.27/1.52	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
3.27/1.52	
3.27/1.52	   f_1(g_1(a_0)) -> a_0
3.27/1.52	
3.27/1.52	
3.27/1.52	
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(4)
3.27/1.52	Obligation:
3.27/1.52	Context-sensitive rewrite system:
3.27/1.52	The TRS R consists of the following rules:
3.27/1.52	
3.27/1.52	   g_1(x) -> f_1(g_1(x))
3.27/1.52	   *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x)))
3.27/1.52	   f_0(g_1(x)) -> f_1(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	The replacement map contains the following entries:
3.27/1.52	
3.27/1.52	f_1: empty set
3.27/1.52	g_1: empty set
3.27/1.52	f_0: {1}
3.27/1.52	*top*_0: {1}
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(5) CSRRRRProof (EQUIVALENT)
3.27/1.52	The following CSR is given: Context-sensitive rewrite system:
3.27/1.52	The TRS R consists of the following rules:
3.27/1.52	
3.27/1.52	   g_1(x) -> f_1(g_1(x))
3.27/1.52	   *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x)))
3.27/1.52	   f_0(g_1(x)) -> f_1(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	The replacement map contains the following entries:
3.27/1.52	
3.27/1.52	f_1: empty set
3.27/1.52	g_1: empty set
3.27/1.52	f_0: {1}
3.27/1.52	*top*_0: {1}
3.27/1.52	Used ordering:
3.27/1.52	Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :
3.27/1.52	
3.27/1.52	   <<<
3.27/1.52	 POL(g_1(x_1)) =  	[[0], [1]] 	 +  	[[1, 0], [0, 0]] 	* 	x_1
3.27/1.52	>>>
3.27/1.52	
3.27/1.52	   <<<
3.27/1.52	 POL(f_1(x_1)) =  	[[0], [0]] 	 +  	[[1, 0], [0, 1]] 	* 	x_1
3.27/1.52	>>>
3.27/1.52	
3.27/1.52	   <<<
3.27/1.52	 POL(*top*_0(x_1)) =  	[[1], [0]] 	 +  	[[1, 1], [0, 0]] 	* 	x_1
3.27/1.52	>>>
3.27/1.52	
3.27/1.52	   <<<
3.27/1.52	 POL(f_0(x_1)) =  	[[0], [0]] 	 +  	[[1, 0], [0, 0]] 	* 	x_1
3.27/1.52	>>>
3.27/1.52	
3.27/1.52	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
3.27/1.52	
3.27/1.52	   *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	
3.27/1.52	
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(6)
3.27/1.52	Obligation:
3.27/1.52	Context-sensitive rewrite system:
3.27/1.52	The TRS R consists of the following rules:
3.27/1.52	
3.27/1.52	   g_1(x) -> f_1(g_1(x))
3.27/1.52	   f_0(g_1(x)) -> f_1(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	The replacement map contains the following entries:
3.27/1.52	
3.27/1.52	f_1: empty set
3.27/1.52	g_1: empty set
3.27/1.52	f_0: {1}
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(7) CSRRRRProof (EQUIVALENT)
3.27/1.52	The following CSR is given: Context-sensitive rewrite system:
3.27/1.52	The TRS R consists of the following rules:
3.27/1.52	
3.27/1.52	   g_1(x) -> f_1(g_1(x))
3.27/1.52	   f_0(g_1(x)) -> f_1(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	The replacement map contains the following entries:
3.27/1.52	
3.27/1.52	f_1: empty set
3.27/1.52	g_1: empty set
3.27/1.52	f_0: {1}
3.27/1.52	Used ordering:
3.27/1.52	Polynomial interpretation [POLO]:
3.27/1.52	
3.27/1.52	   POL(f_0(x_1)) = 1 + 2*x_1
3.27/1.52	   POL(f_1(x_1)) = 0
3.27/1.52	   POL(g_1(x_1)) = 2
3.27/1.52	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
3.27/1.52	
3.27/1.52	   g_1(x) -> f_1(g_1(x))
3.27/1.52	   f_0(g_1(x)) -> f_1(f_0(g_1(x)))
3.27/1.52	
3.27/1.52	
3.27/1.52	
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(8)
3.27/1.52	Obligation:
3.27/1.52	Context-sensitive rewrite system:
3.27/1.52	R is empty.
3.27/1.52	
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(9) RisEmptyProof (EQUIVALENT)
3.27/1.52	The CSR R is empty. Hence, termination is trivially proven.
3.27/1.52	----------------------------------------
3.27/1.52	
3.27/1.52	(10)
3.27/1.52	YES
3.27/1.55	EOF