SRS Stand 10685 pair #381717394

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.49017000198 seconds
cpu usage	10.269920565
max memory	7.94140672E8

stage attributes

key	value
output-size	24234
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: 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, 46 ms]
(6) QTRS
(7) DependencyPairsProof [EQUIVALENT, 21 ms]
(8) QDP
(9) DependencyGraphProof [EQUIVALENT, 0 ms]
(10) QDP
(11) QDPOrderProof [EQUIVALENT, 91 ms]
(12) QDP
(13) DependencyGraphProof [EQUIVALENT, 0 ms]
(14) AND
    (15) QDP
        (16) UsableRulesProof [EQUIVALENT, 0 ms]
        (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (19) YES
    (20) QDP
        (21) UsableRulesProof [EQUIVALENT, 0 ms]
        (22) QDP
        (23) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (24) YES


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

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

   a(x1) -> x1
   a(b(x1)) -> c(b(a(x1)))
   b(x1) -> a(x1)
   c(c(x1)) -> b(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:

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

Q is empty.

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

(3) RootLabelingProof (EQUIVALENT)
We used plain root labeling [ROOTLAB] with the following heuristic:
LabelAll: All function symbols get labeled

As Q is empty the root labeling was sound AND complete.

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

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

   a_{a_1}(a_{a_1}(x1)) -> a_{a_1}(x1)
   a_{a_1}(a_{b_1}(x1)) -> a_{b_1}(x1)
   a_{a_1}(a_{c_1}(x1)) -> a_{c_1}(x1)

popout

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

job log

popout

actions all output return to SRS Stand 10685