details

property	value
status	complete
benchmark	sym-5.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n144.star.cs.uiowa.edu
space	Waldmann_06_SRS

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	86.6830508709 seconds
cpu usage	342.794302791
max memory	4.501999616E9

stage attributes

key	value
output-size	4252
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES 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 proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 26 ms] (2) QDP (3) QDPOrderProof [EQUIVALENT, 91 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 2669 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(x1))) -> b(b(b(x1))) b(b(b(b(x1)))) -> a(b(b(a(x1)))) 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(a(a(x1))) -> B(b(b(x1))) A(a(a(x1))) -> B(b(x1)) A(a(a(x1))) -> B(x1) B(b(b(b(x1)))) -> A(b(b(a(x1)))) B(b(b(b(x1)))) -> B(b(a(x1))) B(b(b(b(x1)))) -> B(a(x1)) B(b(b(b(x1)))) -> A(x1) The TRS R consists of the following rules: a(a(a(x1))) -> b(b(b(x1))) b(b(b(b(x1)))) -> a(b(b(a(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. A(a(a(x1))) -> B(b(x1)) A(a(a(x1))) -> B(x1) B(b(b(b(x1)))) -> B(b(a(x1))) B(b(b(b(x1)))) -> B(a(x1)) B(b(b(b(x1)))) -> A(x1) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation: POL( A_1(x_1) ) = 2x_1 + 2 POL( B_1(x_1) ) = 2x_1 + 2 POL( b_1(x_1) ) = 2x_1 + 2 POL( a_1(x_1) ) = 2x_1 + 2 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: b(b(b(b(x1)))) -> a(b(b(a(x1)))) a(a(a(x1))) -> b(b(b(x1))) ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A(a(a(x1))) -> B(b(b(x1))) B(b(b(b(x1)))) -> A(b(b(a(x1)))) 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 SRS Standard