details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.90956091881 seconds
cpu usage	4.503020743
max memory	3.06429952E8

stage attributes

key	value
output-size	5346
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) DependencyPairsProof [EQUIVALENT, 0 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) NonTerminationLoopProof [COMPLETE, 0 ms] (14) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(s(x), x) -> f(s(x), round(x)) round(0) -> 0 round(0) -> s(0) round(s(0)) -> s(0) round(s(s(x))) -> s(s(round(x))) 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: F(s(x), x) -> F(s(x), round(x)) F(s(x), x) -> ROUND(x) ROUND(s(s(x))) -> ROUND(x) The TRS R consists of the following rules: f(s(x), x) -> f(s(x), round(x)) round(0) -> 0 round(0) -> s(0) round(s(0)) -> s(0) round(s(s(x))) -> s(s(round(x))) 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 2 SCCs with 1 less node. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Q DP problem: The TRS P consists of the following rules: ROUND(s(s(x))) -> ROUND(x) The TRS R consists of the following rules: f(s(x), x) -> f(s(x), round(x)) round(0) -> 0 round(0) -> s(0) round(s(0)) -> s(0) round(s(s(x))) -> s(s(round(x))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Stand 20472