details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	16.293902874 seconds
cpu usage	61.402603166
max memory	5.060968448E9

stage attributes

key	value
output-size	142192
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, 33 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 4815 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 4 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 2 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 6 ms] (12) QTRS (13) RisEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(0(1(1(1(2(3(3(1(3(3(2(x1))))))))))))) -> 0(2(2(1(0(1(2(3(0(0(3(2(2(3(1(2(2(x1))))))))))))))))) 0(0(0(3(3(1(1(1(3(3(1(3(2(x1))))))))))))) -> 3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1))))))))))))))))) 0(0(2(0(3(1(3(2(1(0(0(2(3(x1))))))))))))) -> 0(2(2(2(1(3(3(3(2(2(0(3(1(3(2(1(2(x1))))))))))))))))) 0(1(0(0(3(3(2(1(2(0(1(2(3(x1))))))))))))) -> 3(2(2(1(2(2(0(3(0(2(2(2(1(2(2(3(1(x1))))))))))))))))) 0(1(2(0(1(1(0(2(2(1(2(0(2(x1))))))))))))) -> 2(0(3(3(2(2(1(0(3(3(3(3(2(2(2(3(3(x1))))))))))))))))) 0(1(2(1(1(1(2(2(0(1(3(2(0(x1))))))))))))) -> 2(3(2(0(1(2(3(0(3(3(2(1(3(3(1(3(3(x1))))))))))))))))) 0(2(2(0(0(3(1(0(3(2(1(3(0(x1))))))))))))) -> 3(1(2(2(1(3(3(2(2(3(0(2(2(1(1(1(0(x1))))))))))))))))) 0(2(3(3(1(0(3(3(0(2(3(1(1(x1))))))))))))) -> 2(1(3(2(2(2(0(2(2(2(3(3(2(2(2(0(3(x1))))))))))))))))) 0(3(0(3(0(2(3(0(0(3(1(2(1(x1))))))))))))) -> 3(1(1(2(2(3(0(1(2(2(2(2(3(2(2(2(0(x1))))))))))))))))) 0(3(0(3(1(0(1(2(2(0(3(1(3(x1))))))))))))) -> 2(3(2(2(3(0(3(0(3(3(2(2(1(2(2(0(3(x1))))))))))))))))) 1(0(0(1(2(2(2(3(2(3(2(0(1(x1))))))))))))) -> 1(2(1(0(2(2(1(2(1(0(3(3(2(2(2(3(3(x1))))))))))))))))) 1(0(2(3(0(3(2(3(2(2(3(2(3(x1))))))))))))) -> 1(3(2(2(1(2(2(2(3(3(2(2(3(1(2(1(2(x1))))))))))))))))) 1(3(1(0(1(1(3(2(2(1(1(2(1(x1))))))))))))) -> 1(2(3(2(3(2(1(2(2(2(2(2(2(0(1(2(2(x1))))))))))))))))) 2(0(0(1(3(0(3(1(3(0(1(2(1(x1))))))))))))) -> 2(2(3(3(0(1(0(0(3(3(3(1(0(2(2(1(2(x1))))))))))))))))) 2(0(0(2(3(0(3(1(0(0(2(1(3(x1))))))))))))) -> 2(0(2(1(2(2(2(2(3(2(3(1(3(3(1(3(1(x1))))))))))))))))) 2(1(0(2(2(0(0(1(3(2(0(3(3(x1))))))))))))) -> 2(0(2(2(1(3(2(1(1(1(2(2(1(3(3(3(3(x1))))))))))))))))) 2(1(0(3(0(3(0(3(3(0(2(1(1(x1))))))))))))) -> 2(2(0(1(2(1(1(0(2(2(2(3(2(3(0(2(2(x1))))))))))))))))) 2(1(1(2(0(1(1(3(0(2(3(0(1(x1))))))))))))) -> 2(2(3(3(3(3(3(2(1(0(1(2(2(3(3(2(2(x1))))))))))))))))) 2(1(1(3(3(0(3(2(3(2(1(1(3(x1))))))))))))) -> 2(3(2(3(2(2(3(3(2(1(2(2(3(3(0(1(3(x1))))))))))))))))) 2(1(1(3(3(3(0(3(0(3(0(0(2(x1))))))))))))) -> 2(0(2(2(0(2(1(3(3(3(2(3(3(2(3(3(2(x1))))))))))))))))) 2(2(0(0(1(0(2(3(0(3(0(1(0(x1))))))))))))) -> 2(2(2(1(0(2(0(1(3(1(3(0(3(3(3(3(2(x1))))))))))))))))) 2(2(0(0(3(0(2(2(3(0(1(3(3(x1))))))))))))) -> 2(2(1(1(0(1(2(1(2(0(2(2(2(0(2(2(2(x1))))))))))))))))) 2(2(0(3(0(1(0(2(3(2(3(1(2(x1))))))))))))) -> 2(2(0(2(2(2(1(0(0(3(1(3(1(3(3(2(2(x1))))))))))))))))) 2(2(1(0(2(1(2(1(1(0(1(2(0(x1))))))))))))) -> 2(2(0(2(0(3(1(2(2(0(1(2(2(2(2(2(2(x1))))))))))))))))) 2(3(1(1(0(2(3(1(2(3(3(1(1(x1))))))))))))) -> 2(2(2(1(2(1(1(2(0(2(0(0(3(0(1(3(3(x1))))))))))))))))) 2(3(2(0(3(0(1(3(2(2(2(0(2(x1))))))))))))) -> 2(1(2(2(3(0(0(1(3(2(2(3(2(2(3(3(2(x1))))))))))))))))) 2(3(2(1(1(1(3(2(3(2(3(2(1(x1))))))))))))) -> 2(2(2(0(3(2(2(0(2(3(2(3(0(2(2(0(2(x1))))))))))))))))) 3(0(2(3(0(1(0(3(3(0(0(1(0(x1))))))))))))) -> 3(0(0(1(2(2(3(3(3(2(0(1(2(0(3(3(2(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: 0(0(0(1(1(1(2(3(3(1(3(3(2(x1))))))))))))) -> 0(2(2(1(0(1(2(3(0(0(3(2(2(3(1(2(2(x1))))))))))))))))) 0(0(2(0(3(1(3(2(1(0(0(2(3(x1))))))))))))) -> 0(2(2(2(1(3(3(3(2(2(0(3(1(3(2(1(2(x1))))))))))))))))) 1(0(0(1(2(2(2(3(2(3(2(0(1(x1))))))))))))) -> 1(2(1(0(2(2(1(2(1(0(3(3(2(2(2(3(3(x1))))))))))))))))) 1(0(2(3(0(3(2(3(2(2(3(2(3(x1))))))))))))) -> 1(3(2(2(1(2(2(2(3(3(2(2(3(1(2(1(2(x1))))))))))))))))) 1(3(1(0(1(1(3(2(2(1(1(2(1(x1))))))))))))) -> 1(2(3(2(3(2(1(2(2(2(2(2(2(0(1(2(2(x1))))))))))))))))) 2(0(0(1(3(0(3(1(3(0(1(2(1(x1))))))))))))) -> 2(2(3(3(0(1(0(0(3(3(3(1(0(2(2(1(2(x1))))))))))))))))) 2(0(0(2(3(0(3(1(0(0(2(1(3(x1))))))))))))) -> 2(0(2(1(2(2(2(2(3(2(3(1(3(3(1(3(1(x1))))))))))))))))) 2(1(0(2(2(0(0(1(3(2(0(3(3(x1))))))))))))) -> 2(0(2(2(1(3(2(1(1(1(2(2(1(3(3(3(3(x1))))))))))))))))) 2(1(0(3(0(3(0(3(3(0(2(1(1(x1))))))))))))) -> 2(2(0(1(2(1(1(0(2(2(2(3(2(3(0(2(2(x1))))))))))))))))) 2(1(1(2(0(1(1(3(0(2(3(0(1(x1))))))))))))) -> 2(2(3(3(3(3(3(2(1(0(1(2(2(3(3(2(2(x1))))))))))))))))) 2(1(1(3(3(0(3(2(3(2(1(1(3(x1))))))))))))) -> 2(3(2(3(2(2(3(3(2(1(2(2(3(3(0(1(3(x1))))))))))))))))) 2(1(1(3(3(3(0(3(0(3(0(0(2(x1))))))))))))) -> 2(0(2(2(0(2(1(3(3(3(2(3(3(2(3(3(2(x1))))))))))))))))) 2(2(0(0(1(0(2(3(0(3(0(1(0(x1))))))))))))) -> 2(2(2(1(0(2(0(1(3(1(3(0(3(3(3(3(2(x1))))))))))))))))) 2(2(0(0(3(0(2(2(3(0(1(3(3(x1))))))))))))) -> 2(2(1(1(0(1(2(1(2(0(2(2(2(0(2(2(2(x1))))))))))))))))) 2(2(0(3(0(1(0(2(3(2(3(1(2(x1))))))))))))) -> 2(2(0(2(2(2(1(0(0(3(1(3(1(3(3(2(2(x1))))))))))))))))) 2(2(1(0(2(1(2(1(1(0(1(2(0(x1))))))))))))) -> 2(2(0(2(0(3(1(2(2(0(1(2(2(2(2(2(2(x1))))))))))))))))) 2(3(1(1(0(2(3(1(2(3(3(1(1(x1))))))))))))) -> 2(2(2(1(2(1(1(2(0(2(0(0(3(0(1(3(3(x1))))))))))))))))) 2(3(2(0(3(0(1(3(2(2(2(0(2(x1))))))))))))) -> 2(1(2(2(3(0(0(1(3(2(2(3(2(2(3(3(2(x1))))))))))))))))) 2(3(2(1(1(1(3(2(3(2(3(2(1(x1))))))))))))) -> 2(2(2(0(3(2(2(0(2(3(2(3(0(2(2(0(2(x1))))))))))))))))) popout

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

job log

popout

actions

all output return to SRS Stand 10685