Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381718567
details
property
value
status
complete
benchmark
09.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
Zantema_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.3765938282 seconds
cpu usage
25.805396266
max memory
3.867348992E9
stage attributes
key
value
output-size
11320
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 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, 20 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) MRRProof [EQUIVALENT, 67 ms] (11) QDP (12) DependencyGraphProof [EQUIVALENT, 0 ms] (13) AND (14) QDP (15) QDPOrderProof [EQUIVALENT, 0 ms] (16) QDP (17) DependencyGraphProof [EQUIVALENT, 0 ms] (18) TRUE (19) QDP (20) QDPOrderProof [EQUIVALENT, 0 ms] (21) QDP (22) PisEmptyProof [EQUIVALENT, 0 ms] (23) YES (24) QDP (25) UsableRulesProof [EQUIVALENT, 0 ms] (26) QDP (27) MRRProof [EQUIVALENT, 31 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(s(x1)) -> s(a(x1)) b(a(b(s(x1)))) -> a(b(s(a(x1)))) b(a(b(b(x1)))) -> c(s(x1)) c(s(x1)) -> a(b(a(b(x1)))) a(b(a(a(x1)))) -> b(a(b(a(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: s(a(x1)) -> a(s(x1)) s(b(a(b(x1)))) -> a(s(b(a(x1)))) b(b(a(b(x1)))) -> s(c(x1)) s(c(x1)) -> b(a(b(a(x1)))) a(a(b(a(x1)))) -> a(b(a(b(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: S(a(x1)) -> A(s(x1)) S(a(x1)) -> S(x1) S(b(a(b(x1)))) -> A(s(b(a(x1)))) S(b(a(b(x1)))) -> S(b(a(x1))) S(b(a(b(x1)))) -> B(a(x1)) S(b(a(b(x1)))) -> A(x1) B(b(a(b(x1)))) -> S(c(x1)) S(c(x1)) -> B(a(b(a(x1)))) S(c(x1)) -> A(b(a(x1)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685