details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.53159999847 seconds
cpu usage	5.712619115
max memory	3.02493696E8

stage attributes

key	value
output-size	4566
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) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) TransformationProof [EQUIVALENT, 0 ms] (6) QDP (7) MNOCProof [EQUIVALENT, 0 ms] (8) QDP (9) NonTerminationLoopProof [COMPLETE, 0 ms] (10) 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(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(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(a))) F(h(x), y) -> F(x, h(a)) The TRS R consists of the following rules: f(h(x), y) -> h(f(y, f(x, h(a)))) The set Q consists of the following terms: f(h(x0), x1) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) TransformationProof (EQUIVALENT) By forward instantiating [JAR06] the rule F(h(x), y) -> F(x, h(a)) we obtained the following new rules [LPAR04]: (F(h(h(y_0)), x1) -> F(h(y_0), h(a)),F(h(h(y_0)), x1) -> F(h(y_0), h(a))) ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: F(h(x), y) -> F(y, f(x, h(a))) F(h(h(y_0)), x1) -> F(h(y_0), h(a)) The TRS R consists of the following rules: f(h(x), y) -> h(f(y, f(x, h(a)))) popout

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

job log

popout

actions

all output return to TRS Stand 20472