details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.38263 seconds
cpu usage	19.429
user time	18.6437
system time	0.785283
max virtual memory	1.8283316E7
max residence set size	1820676.0

stage attributes

key	value
starexec-result	YES

output

19.04/7.27 YES 19.29/7.30 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 19.29/7.30 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 19.29/7.30 19.29/7.30 19.29/7.30 Termination of the given ETRS could be proven: 19.29/7.30 19.29/7.30 (0) ETRS 19.29/7.30 (1) EquationalDependencyPairsProof [EQUIVALENT, 112 ms] 19.29/7.30 (2) EDP 19.29/7.30 (3) EDependencyGraphProof [EQUIVALENT, 0 ms] 19.29/7.30 (4) AND 19.29/7.30 (5) EDP 19.29/7.30 (6) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 19.29/7.30 (7) EDP 19.29/7.30 (8) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 19.29/7.30 (9) EDP 19.29/7.30 (10) PisEmptyProof [EQUIVALENT, 0 ms] 19.29/7.30 (11) YES 19.29/7.30 (12) EDP 19.29/7.30 (13) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 19.29/7.30 (14) EDP 19.29/7.30 (15) EDPPoloProof [EQUIVALENT, 151 ms] 19.29/7.30 (16) EDP 19.29/7.30 (17) EDependencyGraphProof [EQUIVALENT, 0 ms] 19.29/7.30 (18) EDP 19.29/7.30 (19) EDPPoloProof [EQUIVALENT, 18 ms] 19.29/7.30 (20) EDP 19.29/7.30 (21) PisEmptyProof [EQUIVALENT, 0 ms] 19.29/7.30 (22) YES 19.29/7.30 (23) EDP 19.29/7.30 (24) ESharpUsableEquationsProof [EQUIVALENT, 4 ms] 19.29/7.30 (25) EDP 19.29/7.30 (26) EDPPoloProof [EQUIVALENT, 781 ms] 19.29/7.30 (27) EDP 19.29/7.30 (28) EDependencyGraphProof [EQUIVALENT, 0 ms] 19.29/7.30 (29) EDP 19.29/7.30 (30) EDPPoloProof [EQUIVALENT, 765 ms] 19.29/7.30 (31) EDP 19.29/7.30 (32) EDPPoloProof [EQUIVALENT, 528 ms] 19.29/7.30 (33) EDP 19.29/7.30 (34) EDependencyGraphProof [EQUIVALENT, 0 ms] 19.29/7.30 (35) EDP 19.29/7.30 (36) EDPPoloProof [EQUIVALENT, 38 ms] 19.29/7.30 (37) EDP 19.29/7.30 (38) EDPPoloProof [EQUIVALENT, 34 ms] 19.29/7.30 (39) EDP 19.29/7.30 (40) PisEmptyProof [EQUIVALENT, 0 ms] 19.29/7.30 (41) YES 19.29/7.30 (42) EDP 19.29/7.30 (43) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 19.29/7.30 (44) EDP 19.29/7.30 (45) EUsableRulesReductionPairsProof [EQUIVALENT, 7 ms] 19.29/7.30 (46) EDP 19.29/7.30 (47) PisEmptyProof [EQUIVALENT, 0 ms] 19.29/7.30 (48) YES 19.29/7.30 (49) EDP 19.29/7.30 (50) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 19.29/7.30 (51) EDP 19.29/7.30 (52) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 19.29/7.30 (53) EDP 19.29/7.30 (54) EDependencyGraphProof [EQUIVALENT, 0 ms] 19.29/7.30 (55) TRUE 19.29/7.30 19.29/7.30 19.29/7.30 ---------------------------------------- 19.29/7.30 19.29/7.30 (0) 19.29/7.30 Obligation: 19.29/7.30 Equational rewrite system: 19.29/7.30 The TRS R consists of the following rules: 19.29/7.30 19.29/7.30 union(X, empty) -> X 19.29/7.30 union(empty, X) -> X 19.29/7.30 0(z) -> z 19.29/7.30 U101(tt, X) -> X 19.29/7.30 U11(tt) -> z 19.29/7.30 U111(tt, A, B) -> plus(sum(A), sum(B)) 19.29/7.30 U21(tt, X, Y) -> 0(mult(X, Y)) 19.29/7.30 U31(tt, X, Y) -> plus(0(mult(X, Y)), Y) 19.29/7.30 U41(tt, X) -> X 19.29/7.30 U51(tt, X, Y) -> 0(plus(X, Y)) 19.29/7.30 U61(tt, X, Y) -> 1(plus(X, Y)) 19.29/7.30 U71(tt, X, Y) -> 0(plus(plus(X, Y), 1(z))) 19.29/7.30 U81(tt, X) -> X 19.29/7.30 U91(tt, A, B) -> mult(prod(A), prod(B)) 19.29/7.30 and(tt, X) -> X 19.29/7.30 isBag(empty) -> tt 19.29/7.30 isBag(singl(V1)) -> isBin(V1) 19.29/7.30 isBag(union(V1, V2)) -> and(isBag(V1), isBag(V2)) 19.29/7.30 isBin(z) -> tt 19.29/7.30 isBin(0(V1)) -> isBin(V1) 19.29/7.30 isBin(1(V1)) -> isBin(V1) 19.29/7.30 isBin(mult(V1, V2)) -> and(isBin(V1), isBin(V2)) 19.29/7.30 isBin(plus(V1, V2)) -> and(isBin(V1), isBin(V2)) 19.29/7.30 isBin(prod(V1)) -> isBag(V1) 19.29/7.30 isBin(sum(V1)) -> isBag(V1) 19.29/7.30 mult(z, X) -> U11(isBin(X)) 19.29/7.30 mult(0(X), Y) -> U21(and(isBin(X), isBin(Y)), X, Y) 19.29/7.30 mult(1(X), Y) -> U31(and(isBin(X), isBin(Y)), X, Y) 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