TRS_Equational 2019-03-21 05.09 pair #429997327

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.77032 seconds
cpu usage	16.012
user time	15.395
system time	0.617057
max virtual memory	1.828872E7
max residence set size	1115568.0

stage attributes

key	value
starexec-result	YES

output

15.68/5.69	YES
15.91/5.71	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
15.91/5.71	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
15.91/5.71	
15.91/5.71	
15.91/5.71	Termination of the given ETRS could be proven:
15.91/5.71	
15.91/5.71	(0) ETRS
15.91/5.71	(1) EquationalDependencyPairsProof [EQUIVALENT, 126 ms]
15.91/5.71	(2) EDP
15.91/5.71	(3) EDependencyGraphProof [EQUIVALENT, 0 ms]
15.91/5.71	(4) AND
15.91/5.71	    (5) EDP
15.91/5.71	        (6) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
15.91/5.71	        (7) EDP
15.91/5.71	        (8) EUsableRulesReductionPairsProof [EQUIVALENT, 28 ms]
15.91/5.71	        (9) EDP
15.91/5.71	        (10) EDependencyGraphProof [EQUIVALENT, 0 ms]
15.91/5.71	        (11) TRUE
15.91/5.71	    (12) EDP
15.91/5.71	        (13) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
15.91/5.71	        (14) EDP
15.91/5.71	        (15) EDPPoloProof [EQUIVALENT, 81 ms]
15.91/5.71	        (16) EDP
15.91/5.71	        (17) EDependencyGraphProof [EQUIVALENT, 0 ms]
15.91/5.71	        (18) EDP
15.91/5.71	        (19) EDPPoloProof [EQUIVALENT, 32 ms]
15.91/5.71	        (20) EDP
15.91/5.71	        (21) EDPPoloProof [EQUIVALENT, 45 ms]
15.91/5.71	        (22) EDP
15.91/5.71	        (23) EDependencyGraphProof [EQUIVALENT, 0 ms]
15.91/5.71	        (24) EDP
15.91/5.71	        (25) EDPPoloProof [EQUIVALENT, 0 ms]
15.91/5.71	        (26) EDP
15.91/5.71	        (27) PisEmptyProof [EQUIVALENT, 0 ms]
15.91/5.71	        (28) YES
15.91/5.71	    (29) EDP
15.91/5.71	        (30) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
15.91/5.71	        (31) EDP
15.91/5.71	        (32) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms]
15.91/5.71	        (33) EDP
15.91/5.71	        (34) PisEmptyProof [EQUIVALENT, 0 ms]
15.91/5.71	        (35) YES
15.91/5.71	    (36) EDP
15.91/5.71	        (37) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
15.91/5.71	        (38) EDP
15.91/5.71	        (39) EDPPoloProof [EQUIVALENT, 210 ms]
15.91/5.71	        (40) EDP
15.91/5.71	        (41) EDependencyGraphProof [EQUIVALENT, 0 ms]
15.91/5.71	        (42) EDP
15.91/5.71	        (43) EDPPoloProof [EQUIVALENT, 178 ms]
15.91/5.71	        (44) EDP
15.91/5.71	        (45) EDependencyGraphProof [EQUIVALENT, 0 ms]
15.91/5.71	        (46) EDP
15.91/5.71	        (47) EDPPoloProof [EQUIVALENT, 47 ms]
15.91/5.71	        (48) EDP
15.91/5.71	        (49) PisEmptyProof [EQUIVALENT, 0 ms]
15.91/5.71	        (50) YES
15.91/5.71	    (51) EDP
15.91/5.71	        (52) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
15.91/5.71	        (53) EDP
15.91/5.71	        (54) EUsableRulesReductionPairsProof [EQUIVALENT, 10 ms]
15.91/5.71	        (55) EDP
15.91/5.71	        (56) EDependencyGraphProof [EQUIVALENT, 0 ms]
15.91/5.71	        (57) TRUE
15.91/5.71	
15.91/5.71	
15.91/5.71	----------------------------------------
15.91/5.71	
15.91/5.71	(0)
15.91/5.71	Obligation:
15.91/5.71	Equational rewrite system:
15.91/5.71	The TRS R consists of the following rules:
15.91/5.71	
15.91/5.71	   union(X, empty) -> X
15.91/5.71	   union(empty, X) -> X
15.91/5.71	   0(z) -> z
15.91/5.71	   U101(tt, X, Y) -> U102(isBin(Y), X, Y)
15.91/5.71	   U102(tt, X, Y) -> 0(mult(X, Y))
15.91/5.71	   U11(tt) -> tt
15.91/5.71	   U111(tt, X, Y) -> U112(isBin(Y), X, Y)
15.91/5.71	   U112(tt, X, Y) -> plus(0(mult(X, Y)), Y)
15.91/5.71	   U121(tt, X) -> X
15.91/5.71	   U131(tt, X, Y) -> U132(isBin(Y), X, Y)
15.91/5.71	   U132(tt, X, Y) -> 0(plus(X, Y))
15.91/5.71	   U141(tt, X, Y) -> U142(isBin(Y), X, Y)
15.91/5.71	   U142(tt, X, Y) -> 1(plus(X, Y))
15.91/5.71	   U151(tt, X, Y) -> U152(isBin(Y), X, Y)
15.91/5.71	   U152(tt, X, Y) -> 0(plus(plus(X, Y), 1(z)))
15.91/5.71	   U161(tt, X) -> X
15.91/5.71	   U171(tt, A, B) -> U172(isBag(B), A, B)
15.91/5.71	   U172(tt, A, B) -> mult(prod(A), prod(B))
15.91/5.71	   U181(tt, X) -> X
15.91/5.71	   U191(tt, A, B) -> U192(isBag(B), A, B)
15.91/5.71	   U192(tt, A, B) -> plus(sum(A), sum(B))
15.91/5.71	   U21(tt, V2) -> U22(isBag(V2))
15.91/5.71	   U22(tt) -> tt
15.91/5.71	   U31(tt) -> tt
15.91/5.71	   U41(tt) -> tt
15.91/5.71	   U51(tt, V2) -> U52(isBin(V2))

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