TRS Conditional pair #487562890

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.55661797523 seconds
cpu usage	10.267023639
max memory	9.01574656E8

stage attributes

key	value
output-size	11787
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Quasi decreasingness of the given CTRS could not be shown:

(0) CTRS
(1) CTRSToQTRSProof [SOUND, 0 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 57 ms]
(4) QTRS
(5) DependencyPairsProof [EQUIVALENT, 0 ms]
(6) QDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) AND
    (9) QDP
        (10) UsableRulesProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) UsableRulesProof [EQUIVALENT, 0 ms]
        (16) QDP
        (17) TransformationProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) TransformationProof [EQUIVALENT, 0 ms]
        (20) QDP
        (21) MRRProof [EQUIVALENT, 11 ms]
        (22) QDP
        (23) TransformationProof [EQUIVALENT, 0 ms]
        (24) QDP
        (25) NonTerminationLoopProof [COMPLETE, 0 ms]
        (26) NO


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

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

   gcd(x, 0) -> x
   gcd(0, x) -> x
   iadd(y) -> tp2(0, y)
   iadd(s(z)) -> u1(iadd(z))
   u1(tp2(x, y)) -> tp2(s(x), y)
   iadd(add(x, y)) -> tp2(x, y)

The conditional TRS C consists of the following conditional rules:

   gcd(z, y) -> gcd(x, y) <= iadd(z) -> tp2(x, y)
   gcd(y, z) -> gcd(x, y) <= iadd(z) -> tp2(x, y)


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

(1) CTRSToQTRSProof (SOUND)
The conditional rules have been transormed into unconditional rules according to [CTRS,AAECCNOC].
----------------------------------------

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

   gcd(z, y) -> U1(iadd(z), y)
   U1(tp2(x, y), y) -> gcd(x, y)
   gcd(y, z) -> U2(iadd(z), y)
   U2(tp2(x, y), y) -> gcd(x, y)
   gcd(x, 0) -> x
   gcd(0, x) -> x
   iadd(y) -> tp2(0, y)
   iadd(s(z)) -> u1(iadd(z))
   u1(tp2(x, y)) -> tp2(s(x), y)
   iadd(add(x, y)) -> tp2(x, y)

Q is empty.

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

(3) QTRSRRRProof (EQUIVALENT)
Used ordering:
Polynomial interpretation [POLO]:

   POL(0) = 0
   POL(U1(x_1, x_2)) = x_1 + x_2
   POL(U2(x_1, x_2)) = x_1 + 2*x_2
   POL(add(x_1, x_2)) = 1 + 2*x_1 + 2*x_2
   POL(gcd(x_1, x_2)) = 1 + 2*x_1 + x_2
   POL(iadd(x_1)) = 1 + x_1
   POL(s(x_1)) = x_1
   POL(tp2(x_1, x_2)) = 1 + 2*x_1 + x_2

popout

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

job log

popout

actions all output return to TRS Conditional