TRS Stand 20472 pair #381716352

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.10967612267 seconds
cpu usage	17.271534339
max memory	1.900986368E9

stage attributes

key	value
output-size	15390
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) QTRS Reverse [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 12 ms]
(4) QDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) AND
    (7) QDP
        (8) UsableRulesProof [EQUIVALENT, 0 ms]
        (9) QDP
        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (11) YES
    (12) QDP
        (13) UsableRulesProof [EQUIVALENT, 0 ms]
        (14) QDP
        (15) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (16) YES
    (17) QDP
        (18) UsableRulesProof [EQUIVALENT, 0 ms]
        (19) QDP
        (20) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (21) YES
    (22) QDP
        (23) UsableRulesProof [EQUIVALENT, 0 ms]
        (24) QDP
        (25) QDPOrderProof [EQUIVALENT, 23 ms]
        (26) QDP
        (27) DependencyGraphProof [EQUIVALENT, 0 ms]
        (28) AND
            (29) QDP
                (30) MRRProof [EQUIVALENT, 9 ms]
                (31) QDP
                (32) PisEmptyProof [EQUIVALENT, 0 ms]
                (33) YES
            (34) QDP
                (35) MRRProof [EQUIVALENT, 7 ms]
                (36) QDP
                (37) PisEmptyProof [EQUIVALENT, 0 ms]
                (38) YES


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

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

   active(g(X)) -> mark(h(X))
   active(c) -> mark(d)
   active(h(d)) -> mark(g(c))
   proper(g(X)) -> g(proper(X))
   proper(h(X)) -> h(proper(X))
   proper(c) -> ok(c)
   proper(d) -> ok(d)
   g(ok(X)) -> ok(g(X))
   h(ok(X)) -> ok(h(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))

Q is empty.

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

(1) QTRS Reverse (EQUIVALENT)
We applied the QTRS Reverse Processor [REVERSE].
----------------------------------------

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

   g(active(X)) -> h(mark(X))
   c'(active(x)) -> d'(mark(x))
   d'(h(active(x))) -> c'(g(mark(x)))
   g(proper(X)) -> proper(g(X))
   h(proper(X)) -> proper(h(X))
   c'(proper(x)) -> c'(ok(x))
   d'(proper(x)) -> d'(ok(x))
   ok(g(X)) -> g(ok(X))
   ok(h(X)) -> h(ok(X))
   mark(top(X)) -> proper(top(X))
   ok(top(X)) -> active(top(X))

Q is empty.

popout

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

job log

popout

actions all output return to TRS Stand 20472