details

property	value
status	timeout (wallclock)
benchmark	213719.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	ICFP_2010

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	301.008731127 seconds
cpu usage	1423.5199721
max memory	1.7303650304E10

stage attributes

unavailable

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, 129 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 5 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 4521 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 25.9 s] (10) QDP (11) QDPOrderProof [EQUIVALENT, 971 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 5012 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 5703 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 4420 ms] (18) QDP (19) PisEmptyProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(1(2(3(x1)))) -> 2(0(3(1(2(x1))))) 0(1(2(3(x1)))) -> 2(0(3(1(3(x1))))) 0(1(2(3(x1)))) -> 2(0(3(2(1(x1))))) 0(1(2(3(x1)))) -> 2(1(0(3(0(x1))))) 0(1(2(3(x1)))) -> 2(1(3(0(2(x1))))) 0(1(2(3(x1)))) -> 2(1(4(3(0(x1))))) 0(1(2(3(x1)))) -> 2(3(0(2(1(x1))))) 0(1(2(3(x1)))) -> 2(0(3(2(1(1(x1)))))) 0(1(2(3(x1)))) -> 2(0(3(3(2(1(x1)))))) 0(1(2(3(x1)))) -> 2(1(3(0(3(0(x1)))))) 0(1(5(3(x1)))) -> 2(1(0(3(3(5(x1)))))) 0(1(5(3(x1)))) -> 2(1(0(3(4(5(x1)))))) 0(5(2(3(x1)))) -> 2(0(3(3(5(x1))))) 0(5(2(3(x1)))) -> 2(0(0(3(5(3(x1)))))) 0(0(1(2(3(x1))))) -> 0(2(0(3(1(0(x1)))))) 0(0(1(2(3(x1))))) -> 2(1(1(3(0(0(x1)))))) 0(0(4(2(3(x1))))) -> 0(3(4(0(3(2(x1)))))) 0(0(4(2(3(x1))))) -> 3(0(0(2(4(4(x1)))))) 0(0(5(2(3(x1))))) -> 0(3(5(2(4(0(x1)))))) 0(1(0(2(3(x1))))) -> 3(2(4(1(0(0(x1)))))) 0(1(0(5(3(x1))))) -> 0(1(1(5(0(3(x1)))))) 0(1(0(5(3(x1))))) -> 1(5(0(0(3(4(x1)))))) 0(1(2(1(3(x1))))) -> 2(1(0(0(3(1(x1)))))) 0(1(2(2(3(x1))))) -> 2(0(3(3(1(2(x1)))))) 0(1(2(3(3(x1))))) -> 2(0(3(3(4(1(x1)))))) 0(1(2(5(3(x1))))) -> 2(5(0(3(1(0(x1)))))) 0(4(5(5(3(x1))))) -> 5(0(3(4(1(5(x1)))))) 0(4(5(5(3(x1))))) -> 5(4(0(3(3(5(x1)))))) 0(5(2(1(3(x1))))) -> 2(1(0(3(3(5(x1)))))) 0(5(4(2(3(x1))))) -> 2(0(3(4(5(1(x1)))))) 1(0(0(5(3(x1))))) -> 0(3(1(3(5(0(x1)))))) 1(0(1(2(3(x1))))) -> 1(1(1(2(3(0(x1)))))) 1(0(1(2(3(x1))))) -> 1(2(0(3(5(1(x1)))))) 1(5(3(5(3(x1))))) -> 5(5(0(3(3(1(x1)))))) 4(0(1(2(3(x1))))) -> 2(1(4(4(0(3(x1)))))) 4(0(1(2(3(x1))))) -> 4(3(2(1(0(0(x1)))))) 5(0(0(5(3(x1))))) -> 3(0(3(5(5(0(x1)))))) 5(0(1(2(3(x1))))) -> 3(0(3(1(2(5(x1)))))) 5(0(1(2(3(x1))))) -> 4(5(3(0(2(1(x1)))))) 5(0(1(2(3(x1))))) -> 5(1(0(3(0(2(x1)))))) 5(0(1(2(3(x1))))) -> 5(1(0(3(1(2(x1)))))) 5(0(4(2(3(x1))))) -> 0(2(4(1(5(3(x1)))))) 5(0(4(2(3(x1))))) -> 0(3(3(5(2(4(x1)))))) 5(0(4(2(3(x1))))) -> 2(4(4(0(3(5(x1)))))) 5(0(5(2(3(x1))))) -> 5(0(3(5(4(2(x1)))))) 5(3(0(5(3(x1))))) -> 5(5(3(0(0(3(x1)))))) 5(3(1(2(3(x1))))) -> 2(0(3(1(5(3(x1)))))) 5(3(1(2(3(x1))))) -> 3(3(0(2(1(5(x1)))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- popout

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

job log

popout

actions

all output return to SRS Stand 10685