details

property	value
status	complete
benchmark	baabababba-abababbaababab.srs.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n172.star.cs.uiowa.edu
space	Wenzel_16

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	209.13896513 seconds
cpu usage	784.688170146
max memory	1.6746041344E10

stage attributes

key	value
output-size	52481
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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) DependencyPairsProof [EQUIVALENT, 34 ms] (8) QDP (9) SemLabProof [SOUND, 245 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 1 ms] (12) AND (13) QDP (14) UsableRulesReductionPairsProof [EQUIVALENT, 4 ms] (15) QDP (16) MRRProof [EQUIVALENT, 7 ms] (17) QDP (18) PisEmptyProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) MRRProof [EQUIVALENT, 31 ms] (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 36 ms] (26) QDP (27) PisEmptyProof [EQUIVALENT, 0 ms] (28) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(a(a(b(a(b(a(b(b(a(x1)))))))))) -> a(b(a(b(a(b(b(a(a(b(a(b(a(b(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: a(b(b(a(b(a(b(a(a(b(x1)))))))))) -> b(a(b(a(b(a(a(b(b(a(b(a(b(a(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: a(a(b(b(a(b(a(b(a(a(b(x1))))))))))) -> a(b(a(b(a(b(a(a(b(b(a(b(a(b(a(x1))))))))))))))) b(a(b(b(a(b(a(b(a(a(b(x1))))))))))) -> b(b(a(b(a(b(a(a(b(b(a(b(a(b(a(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. ---------------------------------------- (6) Obligation: popout

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

job log

popout

actions

all output return to SRS Standard