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	n139.star.cs.uiowa.edu
space	ICFP_2010

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	18.9531 seconds
cpu usage	58.4198
user time	56.4253
system time	1.99448
max virtual memory	1.9477744E7
max residence set size	5008360.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 1 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 4806 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 17 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 14 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 2 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))))))))))))))))) 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))))))))))))))))) 0(0(0(0(3(3(1(1(1(3(3(1(3(2(x1)))))))))))))) -> 0(3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1)))))))))))))))))) 1(0(0(0(3(3(1(1(1(3(3(1(3(2(x1)))))))))))))) -> 1(3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1)))))))))))))))))) 2(0(0(0(3(3(1(1(1(3(3(1(3(2(x1)))))))))))))) -> 2(3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1)))))))))))))))))) 3(0(0(0(3(3(1(1(1(3(3(1(3(2(x1)))))))))))))) -> 3(3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1)))))))))))))))))) 0(0(1(0(0(3(3(2(1(2(0(1(2(3(x1)))))))))))))) -> 0(3(2(2(1(2(2(0(3(0(2(2(2(1(2(2(3(1(x1)))))))))))))))))) popout

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

job log

popout

actions

all output return to SRS Standard