details

property	value
status	complete
benchmark	5-matchbox.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	Secret_06_SRS

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	4.43858408928 seconds
cpu usage	14.257987925
max memory	1.239273472E9

stage attributes

key	value
output-size	18578
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished 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, 40 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 0 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 5 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 63 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) QDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 0 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(c(x1))) -> a(a(b(x1))) a(b(c(x1))) -> b(c(b(c(x1)))) a(b(c(x1))) -> c(b(c(a(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: c(b(a(x1))) -> b(a(a(x1))) c(b(a(x1))) -> c(b(c(b(x1)))) c(b(a(x1))) -> a(c(b(c(x1)))) Q is empty. ---------------------------------------- (3) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c(b(a(x1))) -> c(b(c(b(x1)))) c(c(b(a(x1)))) -> c(b(a(a(x1)))) b(c(b(a(x1)))) -> b(b(a(a(x1)))) a(c(b(a(x1)))) -> a(b(a(a(x1)))) c(c(b(a(x1)))) -> c(a(c(b(c(x1))))) b(c(b(a(x1)))) -> b(a(c(b(c(x1))))) a(c(b(a(x1)))) -> a(a(c(b(c(x1))))) Q is empty. ---------------------------------------- (5) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- popout

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

job log

popout

actions

all output return to SRS Standard