TRS_Innermost 2019-03-28 22.12 pair #432270846

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.65888 seconds
cpu usage	10.422
user time	9.98278
system time	0.439226
max virtual memory	3.6980352E7
max residence set size	573360.0

stage attributes

key	value
starexec-result	YES

output

10.23/4.61	YES
10.34/4.62	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
10.34/4.62	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.34/4.62	
10.34/4.62	
10.34/4.62	Termination w.r.t. Q of the given QTRS could be proven:
10.34/4.62	
10.34/4.62	(0) QTRS
10.34/4.62	(1) DependencyPairsProof [EQUIVALENT, 17 ms]
10.34/4.62	(2) QDP
10.34/4.62	(3) DependencyGraphProof [EQUIVALENT, 0 ms]
10.34/4.62	(4) AND
10.34/4.62	    (5) QDP
10.34/4.62	        (6) UsableRulesProof [EQUIVALENT, 0 ms]
10.34/4.62	        (7) QDP
10.34/4.62	        (8) QReductionProof [EQUIVALENT, 0 ms]
10.34/4.62	        (9) QDP
10.34/4.62	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.34/4.62	        (11) YES
10.34/4.62	    (12) QDP
10.34/4.62	        (13) QDPOrderProof [EQUIVALENT, 29 ms]
10.34/4.62	        (14) QDP
10.34/4.62	        (15) TransformationProof [EQUIVALENT, 0 ms]
10.34/4.62	        (16) QDP
10.34/4.62	        (17) QDPQMonotonicMRRProof [EQUIVALENT, 23 ms]
10.34/4.62	        (18) QDP
10.34/4.62	        (19) TransformationProof [SOUND, 0 ms]
10.34/4.62	        (20) QDP
10.34/4.62	        (21) DependencyGraphProof [EQUIVALENT, 0 ms]
10.34/4.62	        (22) QDP
10.34/4.62	        (23) TransformationProof [EQUIVALENT, 0 ms]
10.34/4.62	        (24) QDP
10.34/4.62	        (25) DependencyGraphProof [EQUIVALENT, 0 ms]
10.34/4.62	        (26) QDP
10.34/4.62	        (27) TransformationProof [EQUIVALENT, 0 ms]
10.34/4.62	        (28) QDP
10.34/4.62	        (29) DependencyGraphProof [EQUIVALENT, 0 ms]
10.34/4.62	        (30) QDP
10.34/4.62	        (31) TransformationProof [EQUIVALENT, 0 ms]
10.34/4.62	        (32) QDP
10.34/4.62	        (33) QDPOrderProof [EQUIVALENT, 0 ms]
10.34/4.62	        (34) QDP
10.34/4.62	        (35) DependencyGraphProof [EQUIVALENT, 0 ms]
10.34/4.62	        (36) TRUE
10.34/4.62	
10.34/4.62	
10.34/4.62	----------------------------------------
10.34/4.62	
10.34/4.62	(0)
10.34/4.62	Obligation:
10.34/4.62	Q restricted rewrite system:
10.34/4.62	The TRS R consists of the following rules:
10.34/4.62	
10.34/4.62	   active(f(a, b, X)) -> mark(f(X, X, X))
10.34/4.62	   active(c) -> mark(a)
10.34/4.62	   active(c) -> mark(b)
10.34/4.62	   mark(f(X1, X2, X3)) -> active(f(X1, X2, mark(X3)))
10.34/4.62	   mark(a) -> active(a)
10.34/4.62	   mark(b) -> active(b)
10.34/4.62	   mark(c) -> active(c)
10.34/4.62	   f(mark(X1), X2, X3) -> f(X1, X2, X3)
10.34/4.62	   f(X1, mark(X2), X3) -> f(X1, X2, X3)
10.34/4.62	   f(X1, X2, mark(X3)) -> f(X1, X2, X3)
10.34/4.62	   f(active(X1), X2, X3) -> f(X1, X2, X3)
10.34/4.62	   f(X1, active(X2), X3) -> f(X1, X2, X3)
10.34/4.62	   f(X1, X2, active(X3)) -> f(X1, X2, X3)
10.34/4.62	
10.34/4.62	The set Q consists of the following terms:
10.34/4.62	
10.34/4.62	   active(f(a, b, x0))
10.34/4.62	   active(c)
10.34/4.62	   mark(f(x0, x1, x2))
10.34/4.62	   mark(a)
10.34/4.62	   mark(b)
10.34/4.62	   mark(c)
10.34/4.62	   f(mark(x0), x1, x2)
10.34/4.62	   f(x0, mark(x1), x2)
10.34/4.62	   f(x0, x1, mark(x2))
10.34/4.62	   f(active(x0), x1, x2)
10.34/4.62	   f(x0, active(x1), x2)
10.34/4.62	   f(x0, x1, active(x2))
10.34/4.62	
10.34/4.62	
10.34/4.62	----------------------------------------
10.34/4.62	
10.34/4.62	(1) DependencyPairsProof (EQUIVALENT)
10.34/4.62	Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
10.34/4.62	----------------------------------------
10.34/4.62	
10.34/4.62	(2)
10.34/4.62	Obligation:
10.34/4.62	Q DP problem:
10.34/4.62	The TRS P consists of the following rules:
10.34/4.62	
10.34/4.62	   ACTIVE(f(a, b, X)) -> MARK(f(X, X, X))
10.34/4.62	   ACTIVE(f(a, b, X)) -> F(X, X, X)
10.34/4.62	   ACTIVE(c) -> MARK(a)
10.34/4.62	   ACTIVE(c) -> MARK(b)
10.34/4.62	   MARK(f(X1, X2, X3)) -> ACTIVE(f(X1, X2, mark(X3)))
10.34/4.62	   MARK(f(X1, X2, X3)) -> F(X1, X2, mark(X3))

popout

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

job log

popout

actions all output return to TRS_Innermost 2019-03-28 22.12