TRS Equational pair #487523265

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	121.460140228 seconds
cpu usage	144.362472466
max memory	5.3313536E9

stage attributes

key	value
output-size	200787
starexec-result	YES

output

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


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given ETRS could be proven:

(0) ETRS
(1) EquationalDependencyPairsProof [EQUIVALENT, 98 ms]
(2) EDP
(3) EDependencyGraphProof [EQUIVALENT, 1 ms]
(4) AND
    (5) EDP
        (6) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (7) EDP
        (8) EUsableRulesReductionPairsProof [EQUIVALENT, 68 ms]
        (9) EDP
        (10) PisEmptyProof [EQUIVALENT, 0 ms]
        (11) YES
    (12) EDP
        (13) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (14) EDP
        (15) EUsableRulesReductionPairsProof [EQUIVALENT, 70 ms]
        (16) EDP
        (17) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (18) TRUE
    (19) EDP
        (20) ESharpUsableEquationsProof [EQUIVALENT, 11 ms]
        (21) EDP
        (22) EDPPoloProof [EQUIVALENT, 441 ms]
        (23) EDP
        (24) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (25) EDP
        (26) EDPPoloProof [EQUIVALENT, 239 ms]
        (27) EDP
        (28) EDPPoloProof [EQUIVALENT, 222 ms]
        (29) EDP
        (30) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (31) EDP
        (32) EDPPoloProof [EQUIVALENT, 219 ms]
        (33) EDP
        (34) PisEmptyProof [EQUIVALENT, 0 ms]
        (35) YES
    (36) EDP
        (37) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (38) EDP
        (39) EUsableRulesReductionPairsProof [EQUIVALENT, 22 ms]
        (40) EDP
        (41) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (42) TRUE
    (43) EDP
        (44) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (45) EDP
        (46) EDPPoloProof [EQUIVALENT, 59.0 s]
        (47) EDP
        (48) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (49) EDP
        (50) EDPPoloProof [EQUIVALENT, 49.8 s]
        (51) EDP
        (52) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (53) EDP
        (54) EDPPoloProof [EQUIVALENT, 353 ms]
        (55) EDP
        (56) PisEmptyProof [EQUIVALENT, 0 ms]
        (57) YES
    (58) EDP
        (59) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (60) EDP
        (61) EUsableRulesReductionPairsProof [EQUIVALENT, 46 ms]
        (62) EDP
        (63) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (64) 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) -> 0(mult(X, Y))
   U11(tt, V1) -> U12(isBin(V1))
   U111(tt, X, Y) -> plus(0(mult(X, Y)), Y)
   U12(tt) -> tt
   U121(tt, X) -> X
   U131(tt, X, Y) -> 0(plus(X, Y))
   U141(tt, X, Y) -> 1(plus(X, Y))
   U151(tt, X, Y) -> 0(plus(plus(X, Y), 1(z)))
   U161(tt, X) -> X
   U171(tt, A, B) -> mult(prod(A), prod(B))

popout

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

job log

popout

actions all output return to TRS Equational