details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	17.8601 seconds
cpu usage	45.1381
user time	43.6969
system time	1.44122
max virtual memory	1.8771924E7
max residence set size	3875128.0

stage attributes

key	value
starexec-result	NO

output

NO proof of /export/starexec/sandbox2/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) 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, 5245 ms] (18) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, y) -> cond(and(isNat(x), isNat(y)), x, y) cond(tt, x, y) -> f(s(x), s(y)) isNat(s(x)) -> isNat(x) isNat(0) -> tt and(tt, tt) -> tt and(ff, x) -> ff and(x, ff) -> ff Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is isNat(s(x)) -> isNat(x) isNat(0) -> tt and(tt, tt) -> tt and(ff, x) -> ff and(x, ff) -> ff The TRS R 2 is f(x, y) -> cond(and(isNat(x), isNat(y)), x, y) cond(tt, x, y) -> f(s(x), s(y)) The signature Sigma is {f_2, cond_3} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, y) -> cond(and(isNat(x), isNat(y)), x, y) cond(tt, x, y) -> f(s(x), s(y)) isNat(s(x)) -> isNat(x) isNat(0) -> tt and(tt, tt) -> tt and(ff, x) -> ff and(x, ff) -> ff The set Q consists of the following terms: f(x0, x1) cond(tt, x0, x1) isNat(s(x0)) isNat(0) and(tt, tt) and(ff, x0) and(x0, ff) ---------------------------------------- (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(x, y) -> COND(and(isNat(x), isNat(y)), x, y) F(x, y) -> AND(isNat(x), isNat(y)) F(x, y) -> ISNAT(x) popout

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

job log

popout

actions

all output return to TRS Standard