Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487519349
details
property
value
status
complete
benchmark
secr7.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n028.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.05563688278 seconds
cpu usage
20.476516723
max memory
3.000205312E9
stage attributes
key
value
output-size
38635
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: 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, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 65 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 67 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) AND (11) QDP (12) UsableRulesProof [EQUIVALENT, 0 ms] (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) QDPOrderProof [EQUIVALENT, 119 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) AND (21) QDP (22) UsableRulesProof [EQUIVALENT, 0 ms] (23) QDP (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] (25) YES (26) QDP (27) UsableRulesProof [EQUIVALENT, 0 ms] (28) QDP (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] (30) YES (31) QDP (32) UsableRulesProof [EQUIVALENT, 0 ms] (33) QDP (34) QDPSizeChangeProof [EQUIVALENT, 0 ms] (35) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(c(x1))) -> c(b(a(a(c(b(x1)))))) a(x1) -> x1 b(x1) -> x1 c(x1) -> 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: a(a(b(c(x1)))) -> a(c(b(a(a(c(b(x1))))))) b(a(b(c(x1)))) -> b(c(b(a(a(c(b(x1))))))) c(a(b(c(x1)))) -> c(c(b(a(a(c(b(x1))))))) a(a(x1)) -> a(x1) b(a(x1)) -> b(x1) c(a(x1)) -> c(x1) a(b(x1)) -> a(x1) b(b(x1)) -> b(x1) c(b(x1)) -> c(x1) a(c(x1)) -> a(x1) b(c(x1)) -> b(x1) c(c(x1)) -> c(x1) Q is empty. ---------------------------------------- (3) 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