details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	249.557837009 seconds
cpu usage	710.362724576
max memory	1.7336270848E10

stage attributes

key	value
output-size	1118651
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) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 9 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 427 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 5599 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 110 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 6834 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 1 ms] (14) AND (15) QDP (16) QDPOrderProof [EQUIVALENT, 206 ms] (17) QDP (18) PisEmptyProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) QDPOrderProof [EQUIVALENT, 2471 ms] (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) TRUE (25) QDP (26) QDPOrderProof [EQUIVALENT, 173 ms] (27) QDP (28) QDPOrderProof [EQUIVALENT, 1897 ms] (29) QDP (30) PisEmptyProof [EQUIVALENT, 0 ms] (31) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(0(0(0(2(2(1(2(0(0(1(0(x1))))))))))))) -> 0(2(2(0(2(2(0(1(0(2(2(2(2(2(0(2(0(x1))))))))))))))))) 0(0(0(0(2(0(0(1(0(2(2(2(0(x1))))))))))))) -> 0(2(2(0(2(2(0(0(0(0(2(0(2(0(0(0(2(x1))))))))))))))))) 0(0(0(0(2(2(1(2(0(2(2(1(0(x1))))))))))))) -> 0(1(0(0(1(0(2(0(2(2(1(0(0(2(0(2(0(x1))))))))))))))))) 0(0(0(1(1(0(2(0(1(0(0(2(2(x1))))))))))))) -> 0(0(2(0(0(0(0(1(0(1(2(2(2(0(0(2(0(x1))))))))))))))))) 0(0(1(0(0(0(0(0(0(0(2(1(0(x1))))))))))))) -> 0(2(0(0(1(0(2(0(2(0(0(2(0(2(0(2(0(x1))))))))))))))))) 0(0(1(0(2(0(1(0(0(2(0(1(0(x1))))))))))))) -> 1(2(1(0(0(0(0(0(2(0(0(2(0(2(2(2(2(x1))))))))))))))))) 0(0(1(1(2(0(0(1(0(2(0(2(2(x1))))))))))))) -> 0(1(2(0(2(0(0(2(0(2(2(0(2(2(2(1(0(x1))))))))))))))))) 0(0(1(2(0(0(2(0(1(0(0(2(2(x1))))))))))))) -> 0(0(2(0(0(0(1(2(0(2(0(0(0(0(2(2(2(x1))))))))))))))))) 0(0(2(0(0(1(0(1(2(0(0(0(2(x1))))))))))))) -> 0(0(0(2(0(2(0(1(0(2(0(2(2(0(1(0(0(x1))))))))))))))))) 0(0(2(0(2(1(1(1(0(2(2(1(0(x1))))))))))))) -> 0(0(0(0(0(0(1(2(2(2(2(0(1(2(2(0(0(x1))))))))))))))))) 0(0(2(1(0(1(0(1(2(2(0(2(0(x1))))))))))))) -> 0(0(2(2(1(1(0(2(2(0(0(1(0(2(2(0(0(x1))))))))))))))))) 0(0(2(2(2(0(2(1(1(0(0(0(2(x1))))))))))))) -> 0(0(0(0(1(0(2(2(0(0(0(1(0(0(2(0(0(x1))))))))))))))))) 0(1(0(0(2(2(0(0(1(2(2(2(0(x1))))))))))))) -> 1(2(1(0(2(0(0(2(0(0(2(2(0(0(2(2(2(x1))))))))))))))))) 0(1(0(2(1(0(1(1(0(0(2(0(0(x1))))))))))))) -> 0(2(0(1(2(0(0(0(0(0(2(0(1(2(0(0(2(x1))))))))))))))))) 0(1(1(0(2(2(0(1(0(0(0(0(0(x1))))))))))))) -> 0(0(0(0(1(1(2(2(0(2(2(2(2(0(2(0(0(x1))))))))))))))))) 0(1(1(2(1(0(2(2(0(2(0(2(2(x1))))))))))))) -> 0(0(0(1(0(1(0(2(0(2(1(2(0(0(2(0(0(x1))))))))))))))))) 0(1(2(0(0(1(0(2(1(0(2(2(1(x1))))))))))))) -> 0(1(2(1(0(0(0(2(0(0(1(0(0(2(0(0(1(x1))))))))))))))))) 0(1(2(2(2(1(0(0(2(1(1(0(0(x1))))))))))))) -> 0(0(0(1(0(1(2(0(1(2(0(2(2(2(2(0(2(x1))))))))))))))))) 0(2(2(0(0(1(2(1(0(0(1(0(2(x1))))))))))))) -> 0(2(2(2(1(0(2(2(1(0(0(0(2(0(0(1(0(x1))))))))))))))))) 0(2(2(0(2(2(0(0(1(0(0(0(0(x1))))))))))))) -> 0(0(0(2(2(2(0(2(0(2(2(2(2(2(2(2(2(x1))))))))))))))))) 0(2(2(0(2(2(1(2(2(2(2(2(2(x1))))))))))))) -> 0(2(1(2(0(2(0(0(0(2(0(2(2(0(0(2(0(x1))))))))))))))))) 1(0(0(0(2(2(2(0(0(1(0(1(0(x1))))))))))))) -> 0(1(0(0(0(0(2(2(2(0(0(2(0(0(2(1(0(x1))))))))))))))))) 1(0(1(0(2(2(0(2(0(0(0(0(1(x1))))))))))))) -> 2(1(0(0(0(2(0(2(0(0(0(2(2(2(2(0(1(x1))))))))))))))))) 1(0(1(2(0(1(0(2(1(2(1(0(0(x1))))))))))))) -> 1(1(2(2(1(2(2(0(0(2(0(1(0(1(0(2(2(x1))))))))))))))))) 1(0(2(2(0(2(0(2(2(2(0(1(0(x1))))))))))))) -> 2(2(2(0(2(0(2(2(0(2(0(2(0(2(2(2(2(x1))))))))))))))))) 1(1(0(0(0(0(2(1(0(0(2(2(0(x1))))))))))))) -> 2(2(2(0(0(0(0(0(0(2(2(0(0(0(1(0(2(x1))))))))))))))))) 1(2(2(2(2(1(0(0(0(2(2(0(2(x1))))))))))))) -> 0(0(2(2(1(1(0(0(0(0(1(0(0(0(2(0(2(x1))))))))))))))))) 2(0(0(0(2(0(1(2(2(2(0(2(2(x1))))))))))))) -> 2(0(0(2(2(2(0(2(0(2(0(2(0(2(1(1(0(x1))))))))))))))))) 2(0(0(2(0(0(1(1(0(0(2(0(0(x1))))))))))))) -> 1(0(2(2(0(2(2(2(1(0(2(2(2(0(2(2(2(x1))))))))))))))))) 2(0(0(2(2(1(0(1(0(0(2(2(0(x1))))))))))))) -> 2(2(0(0(2(1(0(2(0(2(0(0(0(0(2(0(2(x1))))))))))))))))) 2(2(0(0(0(2(1(0(0(0(2(0(2(x1))))))))))))) -> 0(0(2(0(2(2(2(0(2(0(2(0(0(2(0(2(0(x1))))))))))))))))) Q is empty. ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: popout

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

job log

popout

actions

all output return to SRS Stand 10685