TRS Outer 67415 pair #381918022

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	62.7971668243 seconds
cpu usage	88.686822286
max memory	3.971825664E9

stage attributes

key	value
output-size	28218
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


MAYBE
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Outermost Termination of the given OTRS could not be shown:

(0) OTRS
(1) Trivial-Transformation [SOUND, 0 ms]
(2) QTRS
    (3) DependencyPairsProof [EQUIVALENT, 0 ms]
    (4) QDP
    (5) DependencyGraphProof [EQUIVALENT, 0 ms]
    (6) QDP
    (7) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms]
    (8) QDP
    (9) NonTerminationLoopProof [COMPLETE, 0 ms]
    (10) NO
(11) Thiemann-SpecialC-Transformation [EQUIVALENT, 0 ms]
(12) QTRS
    (13) DependencyPairsProof [EQUIVALENT, 0 ms]
    (14) QDP
    (15) DependencyGraphProof [EQUIVALENT, 0 ms]
    (16) AND
        (17) QDP
            (18) UsableRulesProof [EQUIVALENT, 0 ms]
            (19) QDP
            (20) QReductionProof [EQUIVALENT, 0 ms]
            (21) QDP
            (22) MRRProof [EQUIVALENT, 16 ms]
            (23) QDP
            (24) MRRProof [EQUIVALENT, 0 ms]
            (25) QDP
            (26) QReductionProof [EQUIVALENT, 0 ms]
            (27) QDP
            (28) MRRProof [EQUIVALENT, 0 ms]
            (29) QDP
            (30) UsableRulesReductionPairsProof [EQUIVALENT, 7 ms]
            (31) QDP
            (32) DependencyGraphProof [EQUIVALENT, 0 ms]
            (33) TRUE
        (34) QDP
            (35) UsableRulesProof [EQUIVALENT, 0 ms]
            (36) QDP
                (37) QReductionProof [EQUIVALENT, 0 ms]
                (38) QDP
                (39) TransformationProof [EQUIVALENT, 0 ms]
                (40) QDP
            (41) UsableRulesProof [EQUIVALENT, 0 ms]
            (42) QDP
                (43) QReductionProof [EQUIVALENT, 0 ms]
                (44) QDP


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

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

   p(x, y, x) -> q(p(y, x, y))
   q(q(x)) -> c



Outermost Strategy.

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

(1) Trivial-Transformation (SOUND)
We applied the Trivial transformation  to transform the outermost TRS to a standard TRS.
----------------------------------------

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

   p(x, y, x) -> q(p(y, x, y))
   q(q(x)) -> c

Q is empty.

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

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

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

popout

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

job log

popout

actions all output return to TRS Outer 67415