details

property	value
status	complete
benchmark	size-12-alpha-3-num-376.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n024.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.44280815125 seconds
cpu usage	14.771231783
max memory	1.985056768E9

stage attributes

key	value
output-size	3873
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, 2 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 131 ms] (8) QDP (9) PisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> b(x1) a(c(x1)) -> c(c(c(a(a(b(x1)))))) b(b(x1)) -> 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: a(x1) -> b(x1) c(a(x1)) -> b(a(a(c(c(c(x1)))))) b(b(x1)) -> 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: A(x1) -> B(x1) C(a(x1)) -> B(a(a(c(c(c(x1)))))) C(a(x1)) -> A(a(c(c(c(x1))))) C(a(x1)) -> A(c(c(c(x1)))) C(a(x1)) -> C(c(c(x1))) C(a(x1)) -> C(c(x1)) C(a(x1)) -> C(x1) The TRS R consists of the following rules: a(x1) -> b(x1) c(a(x1)) -> b(a(a(c(c(c(x1)))))) b(b(x1)) -> x1 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: Q DP problem: The TRS P consists of the following rules: C(a(x1)) -> C(c(x1)) C(a(x1)) -> C(c(c(x1))) C(a(x1)) -> C(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 Stand 10685