SRS Stand 10685 pair #381721239

details

property	value
status	complete
benchmark	size-12-alpha-3-num-52.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n074.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.9688680172 seconds
cpu usage	32.080934291
max memory	4.073893888E9

stage attributes

key	value
output-size	6961
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) DependencyPairsProof [EQUIVALENT, 29 ms]
(2) QDP
(3) DependencyGraphProof [EQUIVALENT, 0 ms]
(4) AND
    (5) QDP
        (6) UsableRulesProof [EQUIVALENT, 0 ms]
        (7) QDP
        (8) MNOCProof [EQUIVALENT, 1 ms]
        (9) QDP
        (10) MRRProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) PisEmptyProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) QDPOrderProof [EQUIVALENT, 66 ms]
        (16) QDP
        (17) UsableRulesProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (20) YES


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

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

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

Q is empty.

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

(1) DependencyPairsProof (EQUIVALENT)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
----------------------------------------

(2)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   A(a(x1)) -> A(b(x1))
   A(a(x1)) -> B(x1)
   C(b(x1)) -> B(a(c(c(x1))))
   C(b(x1)) -> A(c(c(x1)))
   C(b(x1)) -> C(c(x1))
   C(b(x1)) -> C(x1)

The TRS R consists of the following rules:

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

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(3) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 3 less nodes.
----------------------------------------

(4)
Complex Obligation (AND)

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

(5)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   A(a(x1)) -> A(b(x1))

The TRS R consists of the following rules:

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

popout

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

job log

popout

actions all output return to SRS Stand 10685