Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487519313
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
n192.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.14337396622 seconds
cpu usage
24.657213482
max memory
3.130503168E9
stage attributes
key
value
output-size
14462
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 20 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 2 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPOrderProof [EQUIVALENT, 298 ms] (9) QDP (10) QDPOrderProof [EQUIVALENT, 100 ms] (11) QDP (12) DependencyGraphProof [EQUIVALENT, 0 ms] (13) QDP (14) QDPOrderProof [EQUIVALENT, 75 ms] (15) QDP (16) QDPOrderProof [EQUIVALENT, 59 ms] (17) QDP (18) PisEmptyProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) UsableRulesProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 65 ms] (24) QDP (25) PisEmptyProof [EQUIVALENT, 0 ms] (26) YES (27) QDP (28) QDPOrderProof [EQUIVALENT, 98 ms] (29) QDP (30) PisEmptyProof [EQUIVALENT, 0 ms] (31) 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) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: A(c(x1)) -> C(b(c(c(a(x1))))) A(c(x1)) -> B(c(c(a(x1)))) A(c(x1)) -> C(c(a(x1))) A(c(x1)) -> C(a(x1)) A(c(x1)) -> A(x1) B(b(b(x1))) -> C(b(x1)) D(d(x1)) -> D(b(d(b(d(x1))))) D(d(x1)) -> B(d(b(d(x1)))) D(d(x1)) -> D(b(d(x1))) D(d(x1)) -> B(d(x1)) A(a(x1)) -> A(d(a(x1))) A(a(x1)) -> D(a(x1)) A(b(x1)) -> C(c(a(x1))) A(b(x1)) -> C(a(x1)) A(b(x1)) -> A(x1) C(c(x1)) -> C(b(c(b(c(x1))))) C(c(x1)) -> B(c(b(c(x1)))) C(c(x1)) -> C(b(c(x1))) C(c(x1)) -> B(c(x1)) C(c(c(x1))) -> C(b(b(x1))) C(c(c(x1))) -> B(b(x1)) C(c(c(x1))) -> B(x1) The TRS R consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard