details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	24.3249108791 seconds
cpu usage	48.250917071
max memory	4.84950016E9

stage attributes

key	value
output-size	5608
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/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) NonTerminationLoopProof [COMPLETE, 9789 ms] (7) NO (8) QDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(X, g(X), Y) -> a__f(Y, Y, Y) a__g(b) -> c a__b -> c mark(f(X1, X2, X3)) -> a__f(X1, X2, X3) mark(g(X)) -> a__g(mark(X)) mark(b) -> a__b mark(c) -> c a__f(X1, X2, X3) -> f(X1, X2, X3) a__g(X) -> g(X) a__b -> b 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: A__F(X, g(X), Y) -> A__F(Y, Y, Y) MARK(f(X1, X2, X3)) -> A__F(X1, X2, X3) MARK(g(X)) -> A__G(mark(X)) MARK(g(X)) -> MARK(X) MARK(b) -> A__B The TRS R consists of the following rules: a__f(X, g(X), Y) -> a__f(Y, Y, Y) a__g(b) -> c a__b -> c mark(f(X1, X2, X3)) -> a__f(X1, X2, X3) mark(g(X)) -> a__g(mark(X)) mark(b) -> a__b mark(c) -> c a__f(X1, X2, X3) -> f(X1, X2, X3) a__g(X) -> g(X) a__b -> b 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 3 less nodes. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Q DP problem: The TRS P consists of the following rules: A__F(X, g(X), Y) -> A__F(Y, Y, Y) The TRS R consists of the following rules: popout

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

job log

popout

actions

all output return to TRS Stand 20472