details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	6.32906007767 seconds
cpu usage	21.910355275
max memory	1.319919616E9

stage attributes

key	value
output-size	17996
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 146 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 255 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 2(5(x1)) -> 1(3(3(0(1(0(x1)))))) 2(5(x1)) -> 2(2(0(5(0(1(x1)))))) 3(5(x1)) -> 1(3(2(0(0(1(x1)))))) 3(5(x1)) -> 3(2(0(5(3(0(x1)))))) 4(5(x1)) -> 2(2(1(3(2(1(x1)))))) 4(5(x1)) -> 3(2(0(5(0(0(x1)))))) 1(2(5(x1))) -> 1(0(5(0(5(4(x1)))))) 1(2(5(x1))) -> 1(2(2(1(0(1(x1)))))) 1(2(5(x1))) -> 2(0(1(3(1(0(x1)))))) 1(4(5(x1))) -> 1(2(4(0(2(1(x1)))))) 2(5(1(x1))) -> 2(2(2(1(2(3(x1)))))) 2(5(2(x1))) -> 4(0(2(2(3(3(x1)))))) 2(5(3(x1))) -> 2(0(4(1(3(3(x1)))))) 2(5(4(x1))) -> 2(0(5(1(0(1(x1)))))) 3(2(5(x1))) -> 3(2(0(1(0(5(x1)))))) 3(4(2(x1))) -> 3(4(0(2(2(2(x1)))))) 3(5(1(x1))) -> 0(4(2(0(0(5(x1)))))) 3(5(1(x1))) -> 0(4(2(2(3(4(x1)))))) 3(5(1(x1))) -> 2(1(4(1(0(1(x1)))))) 3(5(2(x1))) -> 0(4(3(2(2(2(x1)))))) 3(5(2(x1))) -> 2(0(2(2(3(0(x1)))))) 3(5(2(x1))) -> 2(3(3(2(1(2(x1)))))) 3(5(3(x1))) -> 0(2(4(3(3(0(x1)))))) 3(5(3(x1))) -> 0(5(4(3(3(0(x1)))))) 3(5(3(x1))) -> 2(3(4(0(4(2(x1)))))) 3(5(4(x1))) -> 0(2(0(5(0(0(x1)))))) 3(5(4(x1))) -> 0(5(0(0(1(2(x1)))))) 3(5(5(x1))) -> 0(5(4(1(0(5(x1)))))) 4(5(1(x1))) -> 2(1(0(5(3(3(x1)))))) 4(5(2(x1))) -> 0(5(1(0(0(4(x1)))))) 4(5(4(x1))) -> 2(2(1(0(4(2(x1)))))) 4(5(4(x1))) -> 3(2(0(3(2(0(x1)))))) 5(5(3(x1))) -> 5(1(0(1(2(2(x1)))))) 5(5(4(x1))) -> 5(1(0(4(2(2(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: 2^1(5(x1)) -> 1^1(3(3(0(1(0(x1)))))) 2^1(5(x1)) -> 3^1(3(0(1(0(x1))))) 2^1(5(x1)) -> 3^1(0(1(0(x1)))) 2^1(5(x1)) -> 1^1(0(x1)) 2^1(5(x1)) -> 2^1(2(0(5(0(1(x1)))))) 2^1(5(x1)) -> 2^1(0(5(0(1(x1))))) 2^1(5(x1)) -> 5^1(0(1(x1))) 2^1(5(x1)) -> 1^1(x1) 3^1(5(x1)) -> 1^1(3(2(0(0(1(x1)))))) 3^1(5(x1)) -> 3^1(2(0(0(1(x1))))) 3^1(5(x1)) -> 2^1(0(0(1(x1)))) 3^1(5(x1)) -> 1^1(x1) 3^1(5(x1)) -> 3^1(2(0(5(3(0(x1)))))) 3^1(5(x1)) -> 2^1(0(5(3(0(x1))))) 3^1(5(x1)) -> 5^1(3(0(x1))) 3^1(5(x1)) -> 3^1(0(x1)) 4^1(5(x1)) -> 2^1(2(1(3(2(1(x1)))))) 4^1(5(x1)) -> 2^1(1(3(2(1(x1))))) 4^1(5(x1)) -> 1^1(3(2(1(x1)))) 4^1(5(x1)) -> 3^1(2(1(x1))) 4^1(5(x1)) -> 2^1(1(x1)) popout

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

job log

popout

actions

all output return to SRS Standard