details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.7776 seconds
cpu usage	36.3025
user time	34.6189
system time	1.68366
max virtual memory	1.9875064E7
max residence set size	4636456.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, 11 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 197 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 49 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 299 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 385 ms] (14) QDP (15) PisEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(0(1(2(1(1(1(0(0(1(0(1(x1))))))))))))) -> 0(0(1(0(1(1(0(2(0(0(2(0(1(0(1(0(1(x1))))))))))))))))) 0(0(1(0(0(1(1(1(0(1(2(0(1(x1))))))))))))) -> 0(1(1(0(0(1(0(1(1(1(1(0(2(0(1(1(1(x1))))))))))))))))) 0(0(1(0(1(0(1(0(0(1(0(2(0(x1))))))))))))) -> 0(1(1(1(0(1(1(2(1(2(0(1(1(1(0(1(1(x1))))))))))))))))) 0(0(1(1(1(1(1(2(1(1(2(1(1(x1))))))))))))) -> 0(1(2(0(1(0(0(1(2(1(0(0(1(0(1(1(1(x1))))))))))))))))) 0(1(0(2(0(2(1(0(0(1(0(1(1(x1))))))))))))) -> 0(0(0(1(1(1(1(1(0(2(2(0(1(1(1(0(1(x1))))))))))))))))) 0(1(0(2(2(1(1(2(1(2(2(0(1(x1))))))))))))) -> 0(1(2(2(0(0(1(0(1(0(2(1(0(2(2(0(1(x1))))))))))))))))) 0(1(1(0(1(1(0(1(0(2(1(0(0(x1))))))))))))) -> 0(1(2(0(1(1(0(1(1(1(1(1(0(0(1(0(0(x1))))))))))))))))) 0(1(1(1(2(1(2(0(1(2(1(0(1(x1))))))))))))) -> 0(1(0(1(0(1(1(0(0(1(0(2(0(1(0(0(1(x1))))))))))))))))) 0(2(0(0(1(1(2(0(1(0(1(0(2(x1))))))))))))) -> 0(0(1(2(0(0(1(0(1(0(1(1(0(0(1(1(1(x1))))))))))))))))) 1(0(2(0(0(2(0(1(2(0(1(0(1(x1))))))))))))) -> 1(1(0(0(1(0(2(1(2(0(1(1(1(0(1(1(1(x1))))))))))))))))) 1(0(2(0(2(1(0(2(0(1(1(2(0(x1))))))))))))) -> 1(2(0(2(0(0(1(0(1(0(0(0(1(2(0(1(0(x1))))))))))))))))) 1(1(0(0(2(2(2(0(1(2(0(1(1(x1))))))))))))) -> 1(0(1(1(1(0(0(1(2(0(1(2(0(0(0(0(1(x1))))))))))))))))) 1(2(0(1(0(2(0(1(0(1(2(1(0(x1))))))))))))) -> 1(0(1(1(2(0(1(0(0(1(0(0(1(0(1(2(0(x1))))))))))))))))) 1(2(1(2(0(0(0(1(1(1(0(0(1(x1))))))))))))) -> 1(1(1(1(0(2(0(1(1(0(1(1(2(2(0(0(1(x1))))))))))))))))) 2(0(0(0(2(2(0(2(2(0(1(0(1(x1))))))))))))) -> 2(0(0(1(1(2(1(1(2(0(0(1(2(1(2(0(1(x1))))))))))))))))) 2(0(2(1(0(0(1(0(0(0(1(1(1(x1))))))))))))) -> 0(2(1(2(1(0(1(1(1(0(1(0(1(0(0(1(1(x1))))))))))))))))) 2(0(2(1(1(1(1(0(2(0(1(0(1(x1))))))))))))) -> 2(1(2(0(2(0(1(0(1(2(0(1(0(1(1(1(1(x1))))))))))))))))) 2(1(2(2(1(1(2(2(0(1(1(0(1(x1))))))))))))) -> 2(1(1(1(2(0(1(2(2(0(0(0(1(1(1(0(1(x1))))))))))))))))) 2(2(1(1(1(1(0(1(1(2(0(1(0(x1))))))))))))) -> 0(1(0(1(1(1(1(1(2(2(0(1(2(1(1(1(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: 0(0(0(1(2(1(1(1(0(0(1(0(1(x1))))))))))))) -> 0(0(1(0(1(1(0(2(0(0(2(0(1(0(1(0(1(x1))))))))))))))))) 0(0(1(0(0(1(1(1(0(1(2(0(1(x1))))))))))))) -> 0(1(1(0(0(1(0(1(1(1(1(0(2(0(1(1(1(x1))))))))))))))))) 0(0(1(0(1(0(1(0(0(1(0(2(0(x1))))))))))))) -> 0(1(1(1(0(1(1(2(1(2(0(1(1(1(0(1(1(x1))))))))))))))))) 0(0(1(1(1(1(1(2(1(1(2(1(1(x1))))))))))))) -> 0(1(2(0(1(0(0(1(2(1(0(0(1(0(1(1(1(x1))))))))))))))))) 0(1(0(2(0(2(1(0(0(1(0(1(1(x1))))))))))))) -> 0(0(0(1(1(1(1(1(0(2(2(0(1(1(1(0(1(x1))))))))))))))))) 0(1(0(2(2(1(1(2(1(2(2(0(1(x1))))))))))))) -> 0(1(2(2(0(0(1(0(1(0(2(1(0(2(2(0(1(x1))))))))))))))))) 0(1(1(0(1(1(0(1(0(2(1(0(0(x1))))))))))))) -> 0(1(2(0(1(1(0(1(1(1(1(1(0(0(1(0(0(x1))))))))))))))))) 0(1(1(1(2(1(2(0(1(2(1(0(1(x1))))))))))))) -> 0(1(0(1(0(1(1(0(0(1(0(2(0(1(0(0(1(x1))))))))))))))))) 0(2(0(0(1(1(2(0(1(0(1(0(2(x1))))))))))))) -> 0(0(1(2(0(0(1(0(1(0(1(1(0(0(1(1(1(x1))))))))))))))))) 1(0(2(0(0(2(0(1(2(0(1(0(1(x1))))))))))))) -> 1(1(0(0(1(0(2(1(2(0(1(1(1(0(1(1(1(x1))))))))))))))))) 1(0(2(0(2(1(0(2(0(1(1(2(0(x1))))))))))))) -> 1(2(0(2(0(0(1(0(1(0(0(0(1(2(0(1(0(x1))))))))))))))))) 1(1(0(0(2(2(2(0(1(2(0(1(1(x1))))))))))))) -> 1(0(1(1(1(0(0(1(2(0(1(2(0(0(0(0(1(x1))))))))))))))))) 1(2(0(1(0(2(0(1(0(1(2(1(0(x1))))))))))))) -> 1(0(1(1(2(0(1(0(0(1(0(0(1(0(1(2(0(x1))))))))))))))))) 1(2(1(2(0(0(0(1(1(1(0(0(1(x1))))))))))))) -> 1(1(1(1(0(2(0(1(1(0(1(1(2(2(0(0(1(x1))))))))))))))))) 2(0(0(0(2(2(0(2(2(0(1(0(1(x1))))))))))))) -> 2(0(0(1(1(2(1(1(2(0(0(1(2(1(2(0(1(x1))))))))))))))))) 2(0(2(1(1(1(1(0(2(0(1(0(1(x1))))))))))))) -> 2(1(2(0(2(0(1(0(1(2(0(1(0(1(1(1(1(x1))))))))))))))))) 2(1(2(2(1(1(2(2(0(1(1(0(1(x1))))))))))))) -> 2(1(1(1(2(0(1(2(2(0(0(0(1(1(1(0(1(x1))))))))))))))))) 0(2(0(2(1(0(0(1(0(0(0(1(1(1(x1)))))))))))))) -> 0(0(2(1(2(1(0(1(1(1(0(1(0(1(0(0(1(1(x1)))))))))))))))))) 1(2(0(2(1(0(0(1(0(0(0(1(1(1(x1)))))))))))))) -> 1(0(2(1(2(1(0(1(1(1(0(1(0(1(0(0(1(1(x1)))))))))))))))))) 2(2(0(2(1(0(0(1(0(0(0(1(1(1(x1)))))))))))))) -> 2(0(2(1(2(1(0(1(1(1(0(1(0(1(0(0(1(1(x1)))))))))))))))))) 0(2(2(1(1(1(1(0(1(1(2(0(1(0(x1)))))))))))))) -> 0(0(1(0(1(1(1(1(1(2(2(0(1(2(1(1(1(0(x1)))))))))))))))))) 1(2(2(1(1(1(1(0(1(1(2(0(1(0(x1)))))))))))))) -> 1(0(1(0(1(1(1(1(1(2(2(0(1(2(1(1(1(0(x1)))))))))))))))))) 2(2(2(1(1(1(1(0(1(1(2(0(1(0(x1)))))))))))))) -> 2(0(1(0(1(1(1(1(1(2(2(0(1(2(1(1(1(0(x1)))))))))))))))))) Q is empty. ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled popout

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

job log

popout

actions

all output return to SRS Standard