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	n021.star.cs.uiowa.edu
space	AProVE_10

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	17.0421369076 seconds
cpu usage	41.903790104
max memory	3.928109056E9

stage attributes

key	value
output-size	11923
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, 4791 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: popout

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

job log

popout

actions

all output return to TRS Stand 20472