details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.97241401672 seconds
cpu usage	11.741997541
max memory	6.64215552E8

stage attributes

key	value
output-size	15487
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) TransformationProof [EQUIVALENT, 0 ms] (8) QDP (9) TransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) MNOCProof [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: app(app(const, x), y) -> x app(app(app(subst, f), g), x) -> app(app(f, x), app(g, x)) app(app(fix, f), x) -> app(app(f, app(fix, f)), x) 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: app(app(const, x), y) -> x app(app(app(subst, f), g), x) -> app(app(f, x), app(g, x)) app(app(fix, f), x) -> app(app(f, app(fix, f)), x) The set Q consists of the following terms: app(app(const, x0), x1) app(app(app(subst, x0), x1), x2) app(app(fix, 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: APP(app(app(subst, f), g), x) -> APP(app(f, x), app(g, x)) APP(app(app(subst, f), g), x) -> APP(f, x) APP(app(app(subst, f), g), x) -> APP(g, x) APP(app(fix, f), x) -> APP(app(f, app(fix, f)), x) APP(app(fix, f), x) -> APP(f, app(fix, f)) The TRS R consists of the following rules: app(app(const, x), y) -> x app(app(app(subst, f), g), x) -> app(app(f, x), app(g, x)) app(app(fix, f), x) -> app(app(f, app(fix, f)), x) The set Q consists of the following terms: app(app(const, x0), x1) app(app(app(subst, x0), x1), x2) app(app(fix, x0), x1) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) TransformationProof (EQUIVALENT) By forward instantiating [JAR06] the rule APP(app(app(subst, f), g), x) -> APP(f, x) we obtained the following new rules [LPAR04]: popout

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

job log

popout

actions

all output return to TRS Stand 20472