details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	3.53400421143 seconds
cpu usage	9.456005669
max memory	5.56883968E8

stage attributes

key	value
output-size	5407
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) TransformationProof [EQUIVALENT, 0 ms] (8) QDP (9) MNOCProof [EQUIVALENT, 0 ms] (10) QDP (11) NonTerminationLoopProof [COMPLETE, 0 ms] (12) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(h(x), y) -> h(f(y, f(x, h(f(a, a))))) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(h(x), y) -> h(f(y, f(x, h(f(a, a))))) The set Q consists of the following terms: f(h(x0), x1) ---------------------------------------- (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(h(x), y) -> F(y, f(x, h(f(a, a)))) F(h(x), y) -> F(x, h(f(a, a))) F(h(x), y) -> F(a, a) The TRS R consists of the following rules: f(h(x), y) -> h(f(y, f(x, h(f(a, a))))) The set Q consists of the following terms: f(h(x0), x1) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: F(h(x), y) -> F(x, h(f(a, a))) F(h(x), y) -> F(y, f(x, h(f(a, a)))) The TRS R consists of the following rules: f(h(x), y) -> h(f(y, f(x, h(f(a, a))))) The set Q consists of the following terms: popout

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

job log

popout

actions

all output return to TRS Standard