details

property	value
status	complete
benchmark	jlap09-ex17.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n095.star.cs.uiowa.edu
space	Mixed_CTRS_2014

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	12.2781062126 seconds
cpu usage	32.024099858
max memory	1.43536128E9

stage attributes

key	value
output-size	4683
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Quasi decreasingness of the given CTRS could not be shown: (0) CTRS (1) CTRSToQTRSProof [SOUND, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) NonLoopProof [COMPLETE, 514 ms] (8) NO ---------------------------------------- (0) Obligation: Conditional term rewrite system: The TRS R consists of the following rules: a -> h(b) a -> h(c) The conditional TRS C consists of the following conditional rules: f(x) -> y <= a -> h(y) g(x, b) -> g(f(c), x) <= f(b) -> x, x -> c ---------------------------------------- (1) CTRSToQTRSProof (SOUND) The conditional rules have been transormed into unconditional rules according to [CTRS,AAECCNOC]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x) -> U1(a) U1(h(y)) -> y g(x, b) -> U2(f(b), x) U2(x, x) -> U3(x, x) U3(c, x) -> g(f(c), x) a -> h(b) a -> h(c) Q is empty. ---------------------------------------- (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(x) -> U1^1(a) F(x) -> A G(x, b) -> U2^1(f(b), x) G(x, b) -> F(b) U2^1(x, x) -> U3^1(x, x) U3^1(c, x) -> G(f(c), x) U3^1(c, x) -> F(c) The TRS R consists of the following rules: f(x) -> U1(a) U1(h(y)) -> y g(x, b) -> U2(f(b), x) U2(x, x) -> U3(x, x) U3(c, x) -> g(f(c), x) a -> h(b) a -> h(c) Q is empty. 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 4 less nodes. ---------------------------------------- (6) Obligation: popout

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

job log

popout

actions

all output return to TRS Condi 20667