SRS Standard pair #516975658

details

property	value
status	complete
benchmark	2-matchbox.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n071.star.cs.uiowa.edu
space	Secret_06_SRS

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	62.3096711636 seconds
cpu usage	244.796507476
max memory	6.189473792E9

stage attributes

key	value
output-size	100618
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) FlatCCProof [EQUIVALENT, 0 ms]
(2) QTRS
(3) RootLabelingProof [EQUIVALENT, 0 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 62 ms]
(6) QTRS
(7) DependencyPairsProof [EQUIVALENT, 58 ms]
(8) QDP
(9) DependencyGraphProof [EQUIVALENT, 0 ms]
(10) QDP
(11) UsableRulesProof [EQUIVALENT, 30 ms]
(12) QDP
(13) QDPOrderProof [EQUIVALENT, 2413 ms]
(14) QDP
(15) DependencyGraphProof [EQUIVALENT, 0 ms]
(16) AND
    (17) QDP
        (18) QDPOrderProof [EQUIVALENT, 1748 ms]
        (19) QDP
        (20) QDPOrderProof [EQUIVALENT, 1614 ms]
        (21) QDP
        (22) QDPOrderProof [EQUIVALENT, 19 ms]
        (23) QDP
        (24) QDPOrderProof [EQUIVALENT, 2701 ms]
        (25) QDP
        (26) QDPOrderProof [EQUIVALENT, 1518 ms]
        (27) QDP
        (28) QDPOrderProof [EQUIVALENT, 1868 ms]
        (29) QDP
        (30) PisEmptyProof [EQUIVALENT, 0 ms]
        (31) YES
    (32) QDP
        (33) QDPOrderProof [EQUIVALENT, 1924 ms]
        (34) QDP
        (35) QDPOrderProof [EQUIVALENT, 1584 ms]
        (36) QDP
        (37) QDPOrderProof [EQUIVALENT, 1187 ms]
        (38) QDP
        (39) QDPOrderProof [EQUIVALENT, 2190 ms]
        (40) QDP
        (41) DependencyGraphProof [EQUIVALENT, 0 ms]
        (42) QDP
        (43) QDPOrderProof [EQUIVALENT, 2903 ms]
        (44) QDP
        (45) DependencyGraphProof [EQUIVALENT, 0 ms]
        (46) TRUE


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

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

   c(c(x1)) -> a(a(a(b(b(b(x1))))))
   b(b(b(a(x1)))) -> b(b(b(b(b(b(b(b(x1))))))))
   b(b(c(c(x1)))) -> c(c(c(a(a(a(a(x1)))))))

Q is empty.

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

(1) FlatCCProof (EQUIVALENT)
We used flat context closure [ROOTLAB]
As Q is empty the flat context closure was sound AND complete.

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

(2)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   b(b(b(a(x1)))) -> b(b(b(b(b(b(b(b(x1))))))))
   c(c(c(x1))) -> c(a(a(a(b(b(b(x1)))))))
   a(c(c(x1))) -> a(a(a(a(b(b(b(x1)))))))
   b(c(c(x1))) -> b(a(a(a(b(b(b(x1)))))))
   c(b(b(c(c(x1))))) -> c(c(c(c(a(a(a(a(x1))))))))
   a(b(b(c(c(x1))))) -> a(c(c(c(a(a(a(a(x1))))))))
   b(b(b(c(c(x1))))) -> b(c(c(c(a(a(a(a(x1))))))))

Q is empty.

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

popout

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

job log

popout

actions all output return to SRS Standard