details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	117.386251926 seconds
cpu usage	460.0952688
max memory	1.6673202176E10

stage attributes

key	value
output-size	42122
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: 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, 316 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 1 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 8009 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 4391 ms] (10) QDP (11) PisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(1(0(2(x1)))) -> 2(0(3(1(0(x1))))) 0(1(0(2(x1)))) -> 2(0(0(3(1(2(x1)))))) 0(1(0(2(x1)))) -> 2(0(3(1(0(4(x1)))))) 0(1(0(2(x1)))) -> 2(2(0(3(1(0(x1)))))) 0(1(0(2(x1)))) -> 2(3(1(0(0(2(x1)))))) 0(1(0(2(x1)))) -> 2(3(1(0(3(0(x1)))))) 0(1(0(2(x1)))) -> 4(1(0(3(0(2(x1)))))) 0(1(0(2(x1)))) -> 4(1(0(4(0(2(x1)))))) 0(1(4(2(x1)))) -> 2(3(1(0(4(x1))))) 0(1(4(2(x1)))) -> 2(4(0(3(1(x1))))) 0(1(4(2(x1)))) -> 3(2(1(0(4(x1))))) 0(1(4(2(x1)))) -> 3(2(1(4(0(x1))))) 0(1(4(2(x1)))) -> 4(0(3(1(2(x1))))) 0(1(4(2(x1)))) -> 4(1(0(3(2(x1))))) 0(1(4(2(x1)))) -> 4(1(0(4(2(x1))))) 0(1(4(2(x1)))) -> 4(1(0(5(2(x1))))) 0(1(4(2(x1)))) -> 2(0(3(1(0(4(x1)))))) 0(1(4(2(x1)))) -> 2(0(3(1(4(4(x1)))))) 0(1(4(2(x1)))) -> 2(3(1(4(0(4(x1)))))) 0(1(4(2(x1)))) -> 2(4(3(0(4(1(x1)))))) 0(1(4(2(x1)))) -> 2(4(3(1(0(3(x1)))))) 0(1(4(2(x1)))) -> 3(2(1(0(4(1(x1)))))) 0(1(4(2(x1)))) -> 3(2(2(1(4(0(x1)))))) 0(1(4(2(x1)))) -> 3(2(3(1(0(4(x1)))))) 0(1(4(2(x1)))) -> 3(2(3(1(4(0(x1)))))) 0(1(4(2(x1)))) -> 4(0(3(1(3(2(x1)))))) 0(1(4(2(x1)))) -> 4(0(3(1(4(2(x1)))))) 0(1(4(2(x1)))) -> 4(1(0(4(3(2(x1)))))) 0(1(4(2(x1)))) -> 4(1(0(4(5(2(x1)))))) 0(1(4(2(x1)))) -> 4(1(0(5(3(2(x1)))))) 0(1(4(2(x1)))) -> 4(1(1(0(5(2(x1)))))) 0(1(4(2(x1)))) -> 4(1(3(0(5(2(x1)))))) 0(1(4(2(x1)))) -> 4(3(0(3(1(2(x1)))))) 0(1(4(2(x1)))) -> 4(4(0(3(1(2(x1)))))) 0(0(1(0(2(x1))))) -> 1(0(0(2(0(4(x1)))))) 0(0(1(0(2(x1))))) -> 1(0(4(0(0(2(x1)))))) 0(0(1(0(2(x1))))) -> 2(1(0(3(0(0(x1)))))) 0(0(1(4(2(x1))))) -> 0(0(3(1(2(4(x1)))))) 0(0(1(4(2(x1))))) -> 0(2(3(1(0(4(x1)))))) 0(0(1(4(2(x1))))) -> 0(2(4(0(3(1(x1)))))) 0(0(1(4(2(x1))))) -> 0(3(1(0(2(4(x1)))))) 0(0(1(4(2(x1))))) -> 1(0(3(4(0(2(x1)))))) 0(0(1(4(2(x1))))) -> 2(0(0(3(1(4(x1)))))) 0(0(1(4(2(x1))))) -> 2(1(0(4(0(0(x1)))))) 0(1(2(0(2(x1))))) -> 2(0(1(0(4(2(x1)))))) 0(1(2(4(2(x1))))) -> 2(3(1(0(2(4(x1)))))) 0(1(2(4(2(x1))))) -> 4(1(0(2(2(4(x1)))))) 0(1(3(4(2(x1))))) -> 2(3(1(4(4(0(x1)))))) 0(1(3(4(2(x1))))) -> 2(4(3(0(4(1(x1)))))) 0(1(3(4(2(x1))))) -> 3(2(1(0(4(0(x1)))))) 0(1(3(4(2(x1))))) -> 4(0(3(3(1(2(x1)))))) 0(1(3(4(2(x1))))) -> 4(1(4(0(3(2(x1)))))) 0(1(4(0(2(x1))))) -> 2(0(3(1(0(4(x1)))))) 0(1(5(0(2(x1))))) -> 0(2(3(1(0(5(x1)))))) 0(1(5(0(2(x1))))) -> 3(0(5(1(0(2(x1)))))) 0(1(5(0(2(x1))))) -> 5(1(3(0(0(2(x1)))))) 0(1(5(4(2(x1))))) -> 0(4(4(1(2(5(x1)))))) 0(1(5(4(2(x1))))) -> 1(0(4(5(1(2(x1)))))) 0(1(5(4(2(x1))))) -> 2(0(4(4(5(1(x1)))))) 0(1(5(4(2(x1))))) -> 4(0(2(3(1(5(x1)))))) 0(1(5(4(2(x1))))) -> 4(1(0(2(5(2(x1)))))) 0(1(5(4(2(x1))))) -> 4(1(0(5(2(5(x1)))))) 0(1(5(4(2(x1))))) -> 4(2(1(3(0(5(x1)))))) 0(1(5(4(2(x1))))) -> 4(3(1(0(2(5(x1)))))) 0(1(5(4(2(x1))))) -> 4(4(0(5(1(2(x1)))))) popout

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

job log

popout

actions

all output return to SRS Stand 10685