details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.53431105614 seconds
cpu usage	6.530751974
max memory	4.83221504E8

stage attributes

key	value
output-size	4811
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) DependencyPairsProof [EQUIVALENT, 0 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) NonTerminationLoopProof [COMPLETE, 0 ms] (12) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(0, 1, g(x, y), z) -> f(g(x, y), g(x, y), g(x, y), h(x)) g(0, 1) -> 0 g(0, 1) -> 1 h(g(x, y)) -> h(x) 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: F(0, 1, g(x, y), z) -> F(g(x, y), g(x, y), g(x, y), h(x)) F(0, 1, g(x, y), z) -> H(x) H(g(x, y)) -> H(x) The TRS R consists of the following rules: f(0, 1, g(x, y), z) -> f(g(x, y), g(x, y), g(x, y), h(x)) g(0, 1) -> 0 g(0, 1) -> 1 h(g(x, y)) -> h(x) 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 1 less node. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Q DP problem: The TRS P consists of the following rules: H(g(x, y)) -> H(x) The TRS R consists of the following rules: f(0, 1, g(x, y), z) -> f(g(x, y), g(x, y), g(x, y), h(x)) g(0, 1) -> 0 g(0, 1) -> 1 h(g(x, y)) -> h(x) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (6) UsableRulesProof (EQUIVALENT) We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R. ---------------------------------------- (7) popout

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

job log

popout

actions

all output return to TRS Standard