details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.53162693977 seconds
cpu usage	21.75315096
max memory	1.684185088E9

stage attributes

key	value
output-size	4390
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 43 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 1012 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(b(b(x1)))) -> b(b(b(a(b(x1))))) b(a(b(b(a(b(x1)))))) -> b(b(a(b(b(x1))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(b(b(x1)))) -> b(a(b(b(b(x1))))) b(a(b(b(a(b(x1)))))) -> b(b(a(b(b(x1))))) 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: B(b(b(b(x1)))) -> B(a(b(b(b(x1))))) B(a(b(b(a(b(x1)))))) -> B(b(a(b(b(x1))))) B(a(b(b(a(b(x1)))))) -> B(a(b(b(x1)))) B(a(b(b(a(b(x1)))))) -> B(b(x1)) The TRS R consists of the following rules: b(b(b(b(x1)))) -> b(a(b(b(b(x1))))) b(a(b(b(a(b(x1)))))) -> b(b(a(b(b(x1))))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B(a(b(b(a(b(x1)))))) -> B(a(b(b(x1)))) B(a(b(b(a(b(x1)))))) -> B(b(x1)) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(B(x_1)) = x_1 POL(a(x_1)) = x_1 POL(b(x_1)) = 1 + x_1 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: b(a(b(b(a(b(x1)))))) -> b(b(a(b(b(x1))))) b(b(b(b(x1)))) -> b(a(b(b(b(x1))))) popout

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

job log

popout

actions

all output return to SRS Stand 10685