SRS Stand 10685 pair #381718738

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	n191.star.cs.uiowa.edu
space	Secret_06_SRS

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	59.1703960896 seconds
cpu usage	232.755809813
max memory	8.472686592E9

stage attributes

key	value
output-size	100697
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 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, 83 ms]
(6) QTRS
(7) DependencyPairsProof [EQUIVALENT, 199 ms]
(8) QDP
(9) DependencyGraphProof [EQUIVALENT, 0 ms]
(10) QDP
(11) UsableRulesProof [EQUIVALENT, 60 ms]
(12) QDP
(13) QDPOrderProof [EQUIVALENT, 2433 ms]
(14) QDP
(15) DependencyGraphProof [EQUIVALENT, 0 ms]
(16) AND
    (17) QDP
        (18) QDPOrderProof [EQUIVALENT, 2100 ms]
        (19) QDP
        (20) QDPOrderProof [EQUIVALENT, 1098 ms]
        (21) QDP
        (22) QDPOrderProof [EQUIVALENT, 195 ms]
        (23) QDP
        (24) QDPOrderProof [EQUIVALENT, 2215 ms]
        (25) QDP
        (26) QDPOrderProof [EQUIVALENT, 1213 ms]
        (27) QDP
        (28) QDPOrderProof [EQUIVALENT, 1526 ms]
        (29) QDP
        (30) PisEmptyProof [EQUIVALENT, 0 ms]
        (31) YES
    (32) QDP
        (33) QDPOrderProof [EQUIVALENT, 2115 ms]
        (34) QDP
        (35) QDPOrderProof [EQUIVALENT, 1266 ms]
        (36) QDP
        (37) QDPOrderProof [EQUIVALENT, 827 ms]
        (38) QDP
        (39) QDPOrderProof [EQUIVALENT, 2034 ms]
        (40) QDP
        (41) DependencyGraphProof [EQUIVALENT, 0 ms]
        (42) QDP
        (43) QDPOrderProof [EQUIVALENT, 2524 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 Stand 10685