details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	29.5600049496 seconds
cpu usage	114.732350921
max memory	5.842915328E9

stage attributes

key	value
output-size	263392
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) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 2764 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 57 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 81 ms] (12) QTRS (13) QTRSRRRProof [EQUIVALENT, 0 ms] (14) QTRS (15) QTRSRRRProof [EQUIVALENT, 54 ms] (16) QTRS (17) QTRSRRRProof [EQUIVALENT, 33 ms] (18) QTRS (19) QTRSRRRProof [EQUIVALENT, 41 ms] (20) QTRS (21) QTRSRRRProof [EQUIVALENT, 26 ms] (22) QTRS (23) QTRSRRRProof [EQUIVALENT, 25 ms] (24) QTRS (25) QTRSRRRProof [EQUIVALENT, 15 ms] (26) QTRS (27) QTRSRRRProof [EQUIVALENT, 3 ms] (28) QTRS (29) QTRSRRRProof [EQUIVALENT, 13 ms] (30) QTRS (31) QTRSRRRProof [EQUIVALENT, 11 ms] (32) QTRS (33) QTRSRRRProof [EQUIVALENT, 2 ms] (34) QTRS (35) QTRSRRRProof [EQUIVALENT, 0 ms] (36) QTRS (37) RisEmptyProof [EQUIVALENT, 0 ms] (38) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 1(3(3(x1))) -> 3(5(3(2(5(0(2(4(5(4(x1)))))))))) 0(3(3(3(x1)))) -> 5(4(3(5(3(0(5(4(4(0(x1)))))))))) 0(3(3(3(1(x1))))) -> 5(4(4(0(3(1(0(5(1(0(x1)))))))))) 1(2(3(3(3(x1))))) -> 4(1(1(2(3(5(0(4(0(5(x1)))))))))) 1(4(4(2(2(x1))))) -> 1(1(2(0(1(1(1(0(2(2(x1)))))))))) 0(3(3(1(4(3(x1)))))) -> 4(4(3(0(2(3(0(3(0(0(x1)))))))))) 3(3(3(3(4(0(x1)))))) -> 3(0(0(2(1(0(5(3(5(4(x1)))))))))) 4(0(1(3(4(0(x1)))))) -> 2(2(3(0(0(0(5(0(0(0(x1)))))))))) 4(1(4(4(4(1(x1)))))) -> 4(1(0(3(3(5(5(5(4(1(x1)))))))))) 0(1(3(5(2(2(3(x1))))))) -> 0(3(0(0(5(0(0(4(4(3(x1)))))))))) 0(2(3(1(3(2(5(x1))))))) -> 0(4(3(1(2(3(2(3(2(0(x1)))))))))) 1(1(3(3(5(3(1(x1))))))) -> 3(5(0(5(3(2(5(0(0(1(x1)))))))))) 3(5(2(0(1(3(3(x1))))))) -> 3(4(3(2(3(2(4(4(5(5(x1)))))))))) 4(1(4(2(4(0(1(x1))))))) -> 5(2(2(1(0(5(5(4(5(1(x1)))))))))) 4(5(1(2(4(4(4(x1))))))) -> 4(1(1(4(5(3(0(1(0(4(x1)))))))))) 5(1(4(5(3(3(3(x1))))))) -> 5(1(4(5(3(4(4(2(3(2(x1)))))))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 3(3(1(x1))) -> 4(5(4(2(0(5(2(3(5(3(x1)))))))))) 3(3(3(0(x1)))) -> 0(4(4(5(0(3(5(3(4(5(x1)))))))))) 1(3(3(3(0(x1))))) -> 0(1(5(0(1(3(0(4(4(5(x1)))))))))) 3(3(3(2(1(x1))))) -> 5(0(4(0(5(3(2(1(1(4(x1)))))))))) 2(2(4(4(1(x1))))) -> 2(2(0(1(1(1(0(2(1(1(x1)))))))))) 3(4(1(3(3(0(x1)))))) -> 0(0(3(0(3(2(0(3(4(4(x1)))))))))) 0(4(3(3(3(3(x1)))))) -> 4(5(3(5(0(1(2(0(0(3(x1)))))))))) 0(4(3(1(0(4(x1)))))) -> 0(0(0(5(0(0(0(3(2(2(x1)))))))))) 1(4(4(4(1(4(x1)))))) -> 1(4(5(5(5(3(3(0(1(4(x1)))))))))) popout

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

job log

popout

actions

all output return to SRS Stand 10685