TRS Equat 89423 pair #381732731

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	n046.star.cs.uiowa.edu
space	Mixed_AC

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.67712593079 seconds
cpu usage	15.796020936
max memory	1.110085632E9

stage attributes

key	value
output-size	126302
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given ETRS could be proven:

(0) ETRS
(1) EquationalDependencyPairsProof [EQUIVALENT, 129 ms]
(2) EDP
(3) EDependencyGraphProof [EQUIVALENT, 0 ms]
(4) AND
    (5) EDP
        (6) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (7) EDP
        (8) EUsableRulesReductionPairsProof [EQUIVALENT, 30 ms]
        (9) EDP
        (10) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (11) TRUE
    (12) EDP
        (13) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (14) EDP
        (15) EDPPoloProof [EQUIVALENT, 81 ms]
        (16) EDP
        (17) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (18) EDP
        (19) EDPPoloProof [EQUIVALENT, 48 ms]
        (20) EDP
        (21) EDPPoloProof [EQUIVALENT, 75 ms]
        (22) EDP
        (23) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (24) EDP
        (25) EDPPoloProof [EQUIVALENT, 17 ms]
        (26) EDP
        (27) PisEmptyProof [EQUIVALENT, 0 ms]
        (28) YES
    (29) EDP
        (30) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (31) EDP
        (32) EUsableRulesReductionPairsProof [EQUIVALENT, 16 ms]
        (33) EDP
        (34) PisEmptyProof [EQUIVALENT, 0 ms]
        (35) YES
    (36) EDP
        (37) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (38) EDP
        (39) EDPPoloProof [EQUIVALENT, 220 ms]
        (40) EDP
        (41) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (42) EDP
        (43) EDPPoloProof [EQUIVALENT, 192 ms]
        (44) EDP
        (45) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (46) EDP
        (47) EDPPoloProof [EQUIVALENT, 85 ms]
        (48) EDP
        (49) PisEmptyProof [EQUIVALENT, 0 ms]
        (50) YES
    (51) EDP
        (52) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (53) EDP
        (54) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms]
        (55) EDP
        (56) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (57) TRUE


----------------------------------------

(0)
Obligation:
Equational rewrite system:
The TRS R consists of the following rules:

   union(X, empty) -> X
   union(empty, X) -> X
   0(z) -> z
   U101(tt, X, Y) -> U102(isBin(Y), X, Y)
   U102(tt, X, Y) -> 0(mult(X, Y))
   U11(tt) -> tt
   U111(tt, X, Y) -> U112(isBin(Y), X, Y)
   U112(tt, X, Y) -> plus(0(mult(X, Y)), Y)
   U121(tt, X) -> X
   U131(tt, X, Y) -> U132(isBin(Y), X, Y)
   U132(tt, X, Y) -> 0(plus(X, Y))
   U141(tt, X, Y) -> U142(isBin(Y), X, Y)
   U142(tt, X, Y) -> 1(plus(X, Y))
   U151(tt, X, Y) -> U152(isBin(Y), X, Y)
   U152(tt, X, Y) -> 0(plus(plus(X, Y), 1(z)))
   U161(tt, X) -> X
   U171(tt, A, B) -> U172(isBag(B), A, B)
   U172(tt, A, B) -> mult(prod(A), prod(B))
   U181(tt, X) -> X
   U191(tt, A, B) -> U192(isBag(B), A, B)

popout

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

job log

popout

actions all output return to TRS Equat 89423