TRS Stand 20472 pair #381711776

details

property	value
status	complete
benchmark	emmes-nonloop-ex1_1.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n089.star.cs.uiowa.edu
space	EEG_IJCAR_12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	12.4166519642 seconds
cpu usage	39.090350701
max memory	3.644919808E9

stage attributes

key	value
output-size	9337
starexec-result	NO

output

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


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


NO
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 disproven:

(0) QTRS
(1) AAECC Innermost [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 0 ms]
(4) QDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) AND
    (7) QDP
        (8) UsableRulesProof [EQUIVALENT, 0 ms]
        (9) QDP
        (10) QReductionProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) MNOCProof [EQUIVALENT, 0 ms]
        (16) QDP
        (17) NonLoopProof [COMPLETE, 130 ms]
        (18) NO


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

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

   f(true, x, y) -> f(gt(x, y), plus2(x), plus1(y))
   gt(s(x), 0) -> true
   gt(0, y) -> false
   gt(s(x), s(y)) -> gt(x, y)
   plus1(x) -> s(x)
   plus2(x) -> s(s(x))

Q is empty.

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

(1) AAECC Innermost (EQUIVALENT)
We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is 
   gt(s(x), 0) -> true
   gt(0, y) -> false
   gt(s(x), s(y)) -> gt(x, y)
   plus1(x) -> s(x)
   plus2(x) -> s(s(x))

The TRS R 2 is 
   f(true, x, y) -> f(gt(x, y), plus2(x), plus1(y))

The signature Sigma is {f_3}
----------------------------------------

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

   f(true, x, y) -> f(gt(x, y), plus2(x), plus1(y))
   gt(s(x), 0) -> true
   gt(0, y) -> false
   gt(s(x), s(y)) -> gt(x, y)
   plus1(x) -> s(x)
   plus2(x) -> s(s(x))

The set Q consists of the following terms:

   f(true, x0, x1)
   gt(s(x0), 0)
   gt(0, x0)
   gt(s(x0), s(x1))
   plus1(x0)
   plus2(x0)


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

(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:

   F(true, x, y) -> F(gt(x, y), plus2(x), plus1(y))

popout

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

job log

popout

actions all output return to TRS Stand 20472