Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516975622
details
property
value
status
complete
benchmark
secr9.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
7.95188498497 seconds
cpu usage
27.64979868
max memory
1.503305728E9
stage attributes
key
value
output-size
15002
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) DependencyPairsProof [EQUIVALENT, 19 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 46 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 1 ms] (8) AND (9) QDP (10) QDPOrderProof [EQUIVALENT, 8 ms] (11) QDP (12) PisEmptyProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) MRRProof [EQUIVALENT, 28 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 211 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) AND (21) QDP (22) QDPOrderProof [EQUIVALENT, 81 ms] (23) QDP (24) PisEmptyProof [EQUIVALENT, 0 ms] (25) YES (26) QDP (27) QDPOrderProof [EQUIVALENT, 7 ms] (28) QDP (29) PisEmptyProof [EQUIVALENT, 0 ms] (30) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(c(x1)) -> c(b(c(c(a(x1))))) b(b(b(x1))) -> c(b(x1)) d(d(x1)) -> d(b(d(b(d(x1))))) a(a(x1)) -> a(d(a(x1))) a(b(x1)) -> c(c(a(x1))) c(c(x1)) -> c(b(c(b(c(x1))))) c(c(c(x1))) -> c(b(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: c(a(x1)) -> a(c(c(b(c(x1))))) b(b(b(x1))) -> b(c(x1)) d(d(x1)) -> d(b(d(b(d(x1))))) a(a(x1)) -> a(d(a(x1))) b(a(x1)) -> a(c(c(x1))) c(c(x1)) -> c(b(c(b(c(x1))))) c(c(c(x1))) -> b(b(c(x1))) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: C(a(x1)) -> A(c(c(b(c(x1))))) C(a(x1)) -> C(c(b(c(x1)))) C(a(x1)) -> C(b(c(x1))) C(a(x1)) -> B(c(x1)) C(a(x1)) -> C(x1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard