TRS Equational pair #516978191

details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	24.6111760139 seconds
cpu usage	43.222122058
max memory	1.880694784E9

stage attributes

key	value
output-size	122442
starexec-result	MAYBE

output

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


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


MAYBE
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


Termination of the given ETRS could not be shown:

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


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

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

   0(#) -> #
   +(#, x) -> x
   +(0(x), 0(y)) -> 0(+(x, y))
   +(0(x), 1(y)) -> 1(+(x, y))
   +(0(x), j(y)) -> j(+(x, y))
   +(1(x), 1(y)) -> j(+(1(#), +(x, y)))
   +(j(x), j(y)) -> 1(+(j(#), +(x, y)))
   +(1(x), j(y)) -> 0(+(x, y))
   opp(#) -> #
   opp(0(x)) -> 0(opp(x))
   opp(1(x)) -> j(opp(x))
   opp(j(x)) -> 1(opp(x))
   -(x, y) -> +(opp(y), x)
   *(#, x) -> #
   *(0(x), y) -> 0(*(x, y))
   *(1(x), y) -> +(0(*(x, y)), y)
   *(j(x), y) -> -(0(*(x, y)), y)
   abs(x) -> test_abs_pos(x, x)
   test_abs_pos(#, x) -> x
   test_abs_pos(0(x), y) -> test_abs_pos(x, y)
   test_abs_pos(1(x), y) -> test_abs_pos(x, y)

popout

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

job log

popout

actions all output return to TRS Equational