details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	17.9680519104 seconds
cpu usage	59.097386611
max memory	4.305833984E9

stage attributes

key	value
output-size	42562
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) DependencyPairsProof [EQUIVALENT, 279 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 328 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) QDPOrderProof [EQUIVALENT, 85 ms] (11) QDP (12) PisEmptyProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) QDPOrderProof [EQUIVALENT, 85 ms] (16) QDP (17) PisEmptyProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) QDPOrderProof [EQUIVALENT, 118 ms] (21) QDP (22) DependencyGraphProof [EQUIVALENT, 0 ms] (23) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(1(2(x1))) -> 2(1(0(3(x1)))) 0(1(2(x1))) -> 2(1(3(0(x1)))) 0(1(2(x1))) -> 2(1(3(0(4(x1))))) 0(1(2(x1))) -> 2(1(3(4(0(x1))))) 0(1(2(x1))) -> 2(1(3(4(0(4(x1)))))) 0(0(1(2(x1)))) -> 0(2(1(0(3(x1))))) 0(1(1(2(x1)))) -> 1(0(4(1(2(x1))))) 0(1(1(2(x1)))) -> 1(2(1(0(3(x1))))) 0(1(2(0(x1)))) -> 2(1(0(3(0(3(x1)))))) 0(1(2(5(x1)))) -> 2(1(0(3(5(x1))))) 0(1(2(5(x1)))) -> 5(1(0(3(2(x1))))) 0(1(4(2(x1)))) -> 2(1(3(4(0(x1))))) 0(1(4(2(x1)))) -> 2(4(1(0(3(x1))))) 0(1(4(2(x1)))) -> 0(2(1(0(3(4(x1)))))) 2(1(1(5(x1)))) -> 2(5(1(4(1(x1))))) 2(1(1(5(x1)))) -> 5(1(3(2(1(x1))))) 2(1(2(0(x1)))) -> 2(2(1(0(3(x1))))) 2(3(5(5(x1)))) -> 5(1(0(3(2(5(x1)))))) 2(5(3(2(x1)))) -> 5(1(3(2(2(x1))))) 5(1(2(0(x1)))) -> 2(5(1(0(3(x1))))) 0(1(0(1(2(x1))))) -> 0(2(1(1(3(0(x1)))))) 0(1(1(2(5(x1))))) -> 0(1(3(5(1(2(x1)))))) 0(1(1(4(2(x1))))) -> 4(1(0(3(2(1(x1)))))) 0(1(1(5(0(x1))))) -> 0(1(0(5(4(1(x1)))))) 0(1(1(5(4(x1))))) -> 1(4(1(0(3(5(x1)))))) 0(1(2(3(5(x1))))) -> 0(1(3(4(5(2(x1)))))) 0(1(2(3(5(x1))))) -> 0(2(5(1(0(3(x1)))))) 0(1(2(3(5(x1))))) -> 1(0(3(0(2(5(x1)))))) 0(1(2(3(5(x1))))) -> 5(1(3(0(2(0(x1)))))) 0(1(4(0(2(x1))))) -> 4(0(1(3(0(2(x1)))))) 0(1(4(0(2(x1))))) -> 4(0(2(1(3(0(x1)))))) 0(4(5(3(5(x1))))) -> 5(1(0(3(4(5(x1)))))) 2(1(0(1(5(x1))))) -> 1(0(3(2(5(1(x1)))))) 2(1(4(3(5(x1))))) -> 1(3(5(4(4(2(x1)))))) 2(1(4(3(5(x1))))) -> 5(4(4(1(3(2(x1)))))) 2(1(4(5(0(x1))))) -> 2(4(1(0(3(5(x1)))))) 2(2(3(5(0(x1))))) -> 5(2(4(2(0(3(x1)))))) 2(2(4(3(5(x1))))) -> 5(1(3(4(2(2(x1)))))) 2(3(1(1(2(x1))))) -> 1(3(2(1(2(0(x1)))))) 2(3(1(1(2(x1))))) -> 4(1(2(2(1(3(x1)))))) 2(3(2(0(5(x1))))) -> 2(2(1(0(3(5(x1)))))) 2(3(3(1(5(x1))))) -> 1(3(5(1(3(2(x1)))))) 2(5(0(3(5(x1))))) -> 5(2(1(3(0(5(x1)))))) 4(2(0(1(2(x1))))) -> 4(2(2(1(3(0(x1)))))) 5(0(1(2(2(x1))))) -> 4(1(5(2(0(2(x1)))))) 5(1(4(2(2(x1))))) -> 5(1(3(2(4(2(x1)))))) 5(1(4(3(2(x1))))) -> 4(5(1(3(4(2(x1)))))) 5(5(4(3(2(x1))))) -> 5(1(3(4(5(2(x1)))))) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) popout

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

job log

popout

actions

all output return to SRS Stand 10685