details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	45.0787599087 seconds
cpu usage	176.549429016
max memory	7.91021568E9

stage attributes

key	value
output-size	421101
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) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 50 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 13.1 s] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 485 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 58 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 35 ms] (12) QTRS (13) QTRSRRRProof [EQUIVALENT, 38 ms] (14) QTRS (15) QTRSRRRProof [EQUIVALENT, 28 ms] (16) QTRS (17) QTRSRRRProof [EQUIVALENT, 24 ms] (18) QTRS (19) QTRSRRRProof [EQUIVALENT, 18 ms] (20) QTRS (21) QTRSRRRProof [EQUIVALENT, 26 ms] (22) QTRS (23) QTRSRRRProof [EQUIVALENT, 12 ms] (24) QTRS (25) QTRSRRRProof [EQUIVALENT, 2 ms] (26) QTRS (27) QTRSRRRProof [EQUIVALENT, 2 ms] (28) QTRS (29) QTRSRRRProof [EQUIVALENT, 8 ms] (30) QTRS (31) QTRSRRRProof [EQUIVALENT, 1 ms] (32) QTRS (33) RisEmptyProof [EQUIVALENT, 0 ms] (34) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(x1)) -> 0(4(4(5(1(1(3(1(2(1(x1)))))))))) 4(0(x1)) -> 4(4(2(3(0(2(4(2(3(4(x1)))))))))) 0(0(1(x1))) -> 0(4(1(3(0(2(1(5(0(1(x1)))))))))) 4(0(0(x1))) -> 2(2(2(3(0(0(4(4(2(1(x1)))))))))) 0(0(5(2(x1)))) -> 2(3(4(3(0(2(3(0(5(3(x1)))))))))) 1(1(0(0(x1)))) -> 1(3(3(3(4(4(3(2(5(0(x1)))))))))) 4(0(0(1(x1)))) -> 2(2(2(3(3(0(2(3(5(1(x1)))))))))) 5(0(0(4(x1)))) -> 2(5(4(5(2(1(2(3(0(4(x1)))))))))) 5(0(1(5(x1)))) -> 3(5(3(4(4(3(2(2(1(5(x1)))))))))) 0(3(3(5(4(x1))))) -> 0(3(3(2(4(3(3(0(3(4(x1)))))))))) 1(0(0(0(0(x1))))) -> 1(2(0(1(0(2(3(2(1(0(x1)))))))))) 1(0(1(0(1(x1))))) -> 3(5(5(4(4(1(3(1(3(2(x1)))))))))) 3(0(0(3(5(x1))))) -> 3(3(3(4(5(2(3(3(2(4(x1)))))))))) 3(0(0(4(0(x1))))) -> 3(3(0(5(5(3(2(2(5(0(x1)))))))))) 4(0(3(4(0(x1))))) -> 2(3(0(3(2(3(5(5(4(0(x1)))))))))) 5(0(0(0(3(x1))))) -> 5(1(4(2(3(0(0(2(1(3(x1)))))))))) 1(2(0(0(1(3(x1)))))) -> 0(4(2(5(2(2(3(4(4(3(x1)))))))))) 2(0(0(1(0(0(x1)))))) -> 2(4(4(1(0(5(5(2(1(1(x1)))))))))) 2(0(5(5(0(1(x1)))))) -> 2(3(1(4(3(1(3(3(5(1(x1)))))))))) 2(4(1(5(1(0(x1)))))) -> 1(0(3(1(4(5(0(5(4(4(x1)))))))))) 2(5(5(4(1(0(x1)))))) -> 2(5(5(1(1(1(4(2(3(0(x1)))))))))) 3(5(2(5(5(1(x1)))))) -> 2(1(3(4(5(1(4(0(4(1(x1)))))))))) 4(1(0(3(4(3(x1)))))) -> 4(1(4(5(4(1(2(0(1(3(x1)))))))))) 5(0(0(0(0(0(x1)))))) -> 4(5(3(4(0(4(1(4(0(0(x1)))))))))) 0(0(0(0(5(1(0(x1))))))) -> 3(0(5(0(5(5(0(4(0(2(x1)))))))))) 0(3(5(0(0(5(2(x1))))))) -> 2(1(4(4(3(2(5(1(4(3(x1)))))))))) 0(4(5(2(5(5(5(x1))))))) -> 0(4(1(4(0(1(3(2(2(3(x1)))))))))) 1(0(1(4(3(5(5(x1))))))) -> 3(3(0(3(5(4(3(4(0(1(x1)))))))))) 1(5(1(0(0(4(3(x1))))))) -> 4(4(1(1(4(0(4(3(0(3(x1)))))))))) 2(0(0(4(5(1(3(x1))))))) -> 1(0(2(1(4(3(0(4(4(2(x1)))))))))) 3(0(0(5(5(1(3(x1))))))) -> 2(4(5(2(4(4(2(0(0(3(x1)))))))))) 4(0(0(4(0(3(4(x1))))))) -> 3(3(3(3(0(1(5(4(0(4(x1)))))))))) 4(2(4(0(0(1(5(x1))))))) -> 2(3(4(1(3(0(1(2(3(2(x1)))))))))) 4(3(0(4(0(3(4(x1))))))) -> 4(2(4(2(4(4(0(3(0(4(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. popout

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

job log

popout

actions

all output return to SRS Stand 10685