TRS_Equational 2019-03-21 05.09 pair #429997337

details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0527111 seconds
cpu usage	0.05099
user time	0.023599
system time	0.027391
max virtual memory	113176.0
max residence set size	4116.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.05	YES
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	(VAR x)
0.00/0.05	(THEORY 
0.00/0.05	(AC plus))
0.00/0.05	(RULES
0.00/0.05	f(x) -> plus(g(x),a)
0.00/0.05	plus(f(x),g(x)) -> plus(g(x),plus(g(x),g(x)))
0.00/0.05	)
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	Reduction Order Processor:
0.00/0.05	-> Rules:
0.00/0.05	 f(x) -> plus(g(x),a)
0.00/0.05	 plus(f(x),g(x)) -> plus(g(x),plus(g(x),g(x)))
0.00/0.05	->Interpretation type:
0.00/0.05	 Linear
0.00/0.05	->Coefficients:
0.00/0.05	 Natural Numbers
0.00/0.05	->Dimension:
0.00/0.05	 1
0.00/0.05	->Bound:
0.00/0.05	 2
0.00/0.05	->Interpretation:
0.00/0.05	 
0.00/0.05	[f](X) = 2.X + 1
0.00/0.05	[plus](X1,X2) = X1 + X2
0.00/0.05	[a] = 0
0.00/0.05	[g](X) = X
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	Reduction Order Processor:
0.00/0.05	-> Rules:
0.00/0.05	 plus(f(x),g(x)) -> plus(g(x),plus(g(x),g(x)))
0.00/0.05	->Interpretation type:
0.00/0.05	 Linear
0.00/0.05	->Coefficients:
0.00/0.05	 Natural Numbers
0.00/0.05	->Dimension:
0.00/0.05	 1
0.00/0.05	->Bound:
0.00/0.05	 2
0.00/0.05	->Interpretation:
0.00/0.05	 
0.00/0.05	[f](X) = 2.X + 2
0.00/0.05	[plus](X1,X2) = X1 + X2
0.00/0.05	[a] = 0
0.00/0.05	[g](X) = X
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	Dependency Pairs Processor:
0.00/0.05	-> FAxioms:
0.00/0.05	 PLUS(plus(x1,x2),x3) = PLUS(x1,plus(x2,x3))
0.00/0.05	 PLUS(x1,x2) = PLUS(x2,x1)
0.00/0.05	-> Pairs:
0.00/0.05	 Empty
0.00/0.05	-> EAxioms:
0.00/0.05	 plus(plus(x1,x2),x3) = plus(x1,plus(x2,x3))
0.00/0.05	 plus(x1,x2) = plus(x2,x1)
0.00/0.05	-> Rules:
0.00/0.05	 Empty
0.00/0.05	-> SRules:
0.00/0.05	 PLUS(plus(x1,x2),x3) -> PLUS(x1,x2)
0.00/0.05	 PLUS(x1,plus(x2,x3)) -> PLUS(x2,x3)
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	SCC Processor:
0.00/0.05	-> FAxioms:
0.00/0.05	 PLUS(plus(x1,x2),x3) = PLUS(x1,plus(x2,x3))
0.00/0.05	 PLUS(x1,x2) = PLUS(x2,x1)
0.00/0.05	-> Pairs:
0.00/0.05	 Empty
0.00/0.05	-> EAxioms:
0.00/0.05	 plus(plus(x1,x2),x3) = plus(x1,plus(x2,x3))
0.00/0.05	 plus(x1,x2) = plus(x2,x1)
0.00/0.05	-> Rules:
0.00/0.05	 Empty
0.00/0.05	-> SRules:
0.00/0.05	 PLUS(plus(x1,x2),x3) -> PLUS(x1,x2)
0.00/0.05	 PLUS(x1,plus(x2,x3)) -> PLUS(x2,x3)
0.00/0.05	->Strongly Connected Components:
0.00/0.05	 There is no strongly connected component
0.00/0.05	
0.00/0.05	The problem is finite.
0.00/0.05	EOF

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS_Equational 2019-03-21 05.09