details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.04807 seconds
cpu usage	15.9976
user time	14.8299
system time	1.1677
max virtual memory	1.8482052E7
max residence set size	3839856.0

stage attributes

key	value
starexec-result	NO

output

NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 4 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) UsableRulesProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES (15) QDP (16) NonTerminationLoopProof [COMPLETE, 5396 ms] (17) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: ge(x, 0) -> true ge(0, s(y)) -> false ge(s(x), s(y)) -> ge(x, y) minus(x, 0) -> x minus(0, y) -> 0 minus(s(x), s(y)) -> minus(x, y) id_inc(x) -> x id_inc(x) -> s(x) div(x, y) -> if(ge(y, s(0)), ge(x, y), x, y) if(false, b, x, y) -> div_by_zero if(true, false, x, y) -> 0 if(true, true, x, y) -> id_inc(div(minus(x, y), y)) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: GE(s(x), s(y)) -> GE(x, y) MINUS(s(x), s(y)) -> MINUS(x, y) DIV(x, y) -> IF(ge(y, s(0)), ge(x, y), x, y) DIV(x, y) -> GE(y, s(0)) DIV(x, y) -> GE(x, y) IF(true, true, x, y) -> ID_INC(div(minus(x, y), y)) IF(true, true, x, y) -> DIV(minus(x, y), y) IF(true, true, x, y) -> MINUS(x, y) The TRS R consists of the following rules: ge(x, 0) -> true ge(0, s(y)) -> false ge(s(x), s(y)) -> ge(x, y) minus(x, 0) -> x minus(0, y) -> 0 minus(s(x), s(y)) -> minus(x, y) id_inc(x) -> x id_inc(x) -> s(x) div(x, y) -> if(ge(y, s(0)), ge(x, y), x, y) if(false, b, x, y) -> div_by_zero if(true, false, x, y) -> 0 if(true, true, x, y) -> id_inc(div(minus(x, y), y)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs with 4 less nodes. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Q DP problem: popout

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

job log

popout

actions

all output return to TRS Standard