details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.78651499748 seconds
cpu usage	26.390366628
max memory	3.49589504E9

stage attributes

key	value
output-size	24531
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) QTRSRRRProof [EQUIVALENT, 155 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 66 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 56 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 88 ms] (14) QDP (15) PisEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(1(0(2(x1))))) -> 0(0(1(2(2(x1))))) 0(0(1(0(2(x1))))) -> 0(0(2(1(2(x1))))) 0(0(1(0(2(x1))))) -> 0(1(0(2(2(x1))))) 0(0(1(0(2(x1))))) -> 0(1(1(2(2(x1))))) 0(0(1(0(2(x1))))) -> 0(1(2(0(2(x1))))) 0(0(1(0(2(x1))))) -> 0(1(2(2(0(x1))))) 0(0(1(0(2(x1))))) -> 0(1(2(2(2(x1))))) 0(0(1(0(2(x1))))) -> 0(2(1(0(2(x1))))) 0(0(1(0(2(x1))))) -> 0(2(1(2(2(x1))))) 0(0(1(0(2(x1))))) -> 0(2(2(1(0(x1))))) 0(0(1(0(2(x1))))) -> 0(2(2(1(2(x1))))) 0(0(1(0(2(x1))))) -> 1(0(0(2(2(x1))))) 0(0(1(0(2(x1))))) -> 1(0(2(0(2(x1))))) 0(0(1(0(2(x1))))) -> 1(0(2(2(0(x1))))) 0(0(1(0(2(x1))))) -> 1(0(2(2(2(x1))))) 0(0(1(0(2(x1))))) -> 1(1(0(2(2(x1))))) 0(0(1(0(2(x1))))) -> 1(2(0(2(2(x1))))) 0(0(1(0(2(x1))))) -> 1(2(1(0(2(x1))))) 0(0(1(0(2(x1))))) -> 1(2(2(0(2(x1))))) 0(0(1(0(2(x1))))) -> 1(2(2(2(0(x1))))) 0(0(1(0(2(x1))))) -> 2(1(0(2(2(x1))))) 0(0(1(0(2(x1))))) -> 2(2(1(0(2(x1))))) 0(0(1(0(2(x1))))) -> 2(2(2(1(0(x1))))) 0(1(2(0(2(x1))))) -> 0(1(0(2(2(x1))))) 0(1(2(0(2(x1))))) -> 0(1(1(2(2(x1))))) 0(1(2(0(2(x1))))) -> 0(1(2(2(2(x1))))) 0(1(2(0(2(x1))))) -> 0(2(1(0(2(x1))))) 0(1(2(0(2(x1))))) -> 0(2(1(2(2(x1))))) 0(1(2(0(2(x1))))) -> 0(2(2(1(0(x1))))) 0(1(2(0(2(x1))))) -> 0(2(2(1(2(x1))))) 0(1(2(0(2(x1))))) -> 1(0(2(2(2(x1))))) 0(1(2(0(2(x1))))) -> 1(2(0(2(2(x1))))) 0(1(2(0(2(x1))))) -> 1(2(2(0(2(x1))))) 0(1(2(0(2(x1))))) -> 1(2(2(2(0(x1))))) 1(0(1(0(2(x1))))) -> 0(1(2(2(2(x1))))) 1(0(1(0(2(x1))))) -> 0(2(1(2(2(x1))))) 1(0(1(0(2(x1))))) -> 1(0(0(2(2(x1))))) 1(0(1(0(2(x1))))) -> 1(0(1(2(2(x1))))) 1(0(1(0(2(x1))))) -> 1(0(2(0(2(x1))))) 1(0(1(0(2(x1))))) -> 1(0(2(1(2(x1))))) 1(0(1(0(2(x1))))) -> 1(0(2(2(0(x1))))) 1(0(1(0(2(x1))))) -> 1(0(2(2(2(x1))))) 1(0(1(0(2(x1))))) -> 1(1(0(2(2(x1))))) 1(0(1(0(2(x1))))) -> 1(2(0(2(2(x1))))) 1(0(1(0(2(x1))))) -> 1(2(1(0(2(x1))))) 1(0(1(0(2(x1))))) -> 1(2(2(0(2(x1))))) 1(0(1(0(2(x1))))) -> 1(2(2(2(0(x1))))) 1(0(1(0(2(x1))))) -> 2(0(1(2(2(x1))))) 1(0(1(0(2(x1))))) -> 2(0(2(1(2(x1))))) 1(0(1(0(2(x1))))) -> 2(1(0(2(2(x1))))) 1(0(1(0(2(x1))))) -> 2(1(2(0(2(x1))))) 1(0(1(0(2(x1))))) -> 2(1(2(2(0(x1))))) 1(0(1(0(2(x1))))) -> 2(2(0(1(2(x1))))) 1(0(1(0(2(x1))))) -> 2(2(1(0(2(x1))))) 1(0(1(0(2(x1))))) -> 2(2(1(2(0(x1))))) 1(0(1(0(2(x1))))) -> 2(2(2(1(0(x1))))) 1(0(2(0(2(x1))))) -> 1(0(2(2(2(x1))))) 1(0(2(0(2(x1))))) -> 1(2(0(2(2(x1))))) 1(0(2(0(2(x1))))) -> 1(2(2(0(2(x1))))) 1(0(2(0(2(x1))))) -> 1(2(2(2(0(x1))))) 1(0(2(0(2(x1))))) -> 2(1(0(2(2(x1))))) popout

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

job log

popout

actions

all output return to SRS Stand 10685