TRS Outer 67415 pair #381918078

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	68.2784230709 seconds
cpu usage	79.887379618
max memory	3.946962944E9

stage attributes

key	value
output-size	26519
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) QTRSRRRProof [EQUIVALENT, 62 ms]
    (4) QTRS
    (5) AAECC Innermost [EQUIVALENT, 0 ms]
    (6) QTRS
    (7) DependencyPairsProof [EQUIVALENT, 0 ms]
    (8) QDP
    (9) DependencyGraphProof [EQUIVALENT, 0 ms]
    (10) QDP
    (11) UsableRulesProof [EQUIVALENT, 0 ms]
    (12) QDP
    (13) QReductionProof [EQUIVALENT, 0 ms]
    (14) QDP
    (15) TransformationProof [EQUIVALENT, 0 ms]
    (16) QDP
    (17) UsableRulesProof [EQUIVALENT, 0 ms]
    (18) QDP
    (19) QReductionProof [EQUIVALENT, 0 ms]
    (20) QDP
    (21) TransformationProof [EQUIVALENT, 0 ms]
    (22) QDP
    (23) UsableRulesProof [EQUIVALENT, 0 ms]
    (24) QDP
    (25) QReductionProof [EQUIVALENT, 0 ms]
    (26) QDP
    (27) TransformationProof [EQUIVALENT, 0 ms]
    (28) QDP
    (29) NonTerminationLoopProof [COMPLETE, 0 ms]
    (30) NO
(31) Thiemann-SpecialC-Transformation [EQUIVALENT, 0 ms]
(32) QTRS
    (33) QTRSRRRProof [EQUIVALENT, 36 ms]
    (34) QTRS
    (35) DependencyPairsProof [EQUIVALENT, 0 ms]
    (36) QDP
    (37) DependencyGraphProof [EQUIVALENT, 0 ms]
    (38) AND
        (39) QDP
            (40) UsableRulesProof [EQUIVALENT, 0 ms]
            (41) QDP
            (42) QReductionProof [EQUIVALENT, 0 ms]
            (43) QDP
            (44) MRRProof [EQUIVALENT, 0 ms]
            (45) QDP
            (46) PisEmptyProof [EQUIVALENT, 0 ms]
            (47) YES
        (48) QDP
            (49) UsableRulesProof [EQUIVALENT, 0 ms]
            (50) QDP
                (51) QReductionProof [EQUIVALENT, 0 ms]
                (52) QDP
                (53) TransformationProof [SOUND, 0 ms]
                (54) QDP
                (55) DependencyGraphProof [EQUIVALENT, 0 ms]
                (56) QDP
            (57) UsableRulesProof [EQUIVALENT, 0 ms]
            (58) QDP
                (59) QReductionProof [EQUIVALENT, 0 ms]
                (60) QDP


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

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

   f(x, x) -> f(0, 1)
   0 -> 2
   1 -> 2
   f(x, 2) -> 2
   f(2, x) -> 2



Outermost Strategy.

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

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

(2)

popout

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

job log

popout

actions all output return to TRS Outer 67415