Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516976462
details
property
value
status
complete
benchmark
random-152.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n136.star.cs.uiowa.edu
space
Waldmann_19
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
5.15511798859 seconds
cpu usage
16.696888485
max memory
1.276194816E9
stage attributes
key
value
output-size
11259
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, 52 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 10 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) AND (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 2 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(b(b(x1)))) -> b(b(a(a(x1)))) b(b(a(a(x1)))) -> a(b(a(b(x1)))) a(b(a(a(x1)))) -> 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: b(b(b(b(x1)))) -> a(a(b(b(x1)))) a(a(b(b(x1)))) -> b(a(b(a(x1)))) a(a(b(a(x1)))) -> 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: b(b(b(b(b(x1))))) -> b(a(a(b(b(x1))))) a(b(b(b(b(x1))))) -> a(a(a(b(b(x1))))) b(a(a(b(b(x1))))) -> b(b(a(b(a(x1))))) a(a(a(b(b(x1))))) -> a(b(a(b(a(x1))))) b(a(a(b(a(x1))))) -> b(b(a(b(a(x1))))) a(a(a(b(a(x1))))) -> 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. ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard