Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487510805
details
property
value
status
complete
benchmark
random-289.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n112.star.cs.uiowa.edu
space
Waldmann_19
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.93972802162 seconds
cpu usage
32.511651175
max memory
4.009689088E9
stage attributes
key
value
output-size
8654
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) DependencyPairsProof [EQUIVALENT, 20 ms] (2) QDP (3) QDPOrderProof [EQUIVALENT, 61 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) QDPOrderProof [EQUIVALENT, 67 ms] (9) QDP (10) PisEmptyProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) QDPOrderProof [EQUIVALENT, 133 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 201 ms] (16) QDP (17) PisEmptyProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(x1)))) -> a(b(a(b(x1)))) b(b(a(b(x1)))) -> b(b(b(b(x1)))) a(a(a(b(x1)))) -> b(a(b(b(x1)))) b(a(b(b(x1)))) -> b(a(b(a(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(a(a(a(x1)))) -> A(b(a(b(x1)))) A(a(a(a(x1)))) -> B(a(b(x1))) A(a(a(a(x1)))) -> A(b(x1)) A(a(a(a(x1)))) -> B(x1) B(b(a(b(x1)))) -> B(b(b(b(x1)))) B(b(a(b(x1)))) -> B(b(b(x1))) B(b(a(b(x1)))) -> B(b(x1)) A(a(a(b(x1)))) -> B(a(b(b(x1)))) A(a(a(b(x1)))) -> A(b(b(x1))) A(a(a(b(x1)))) -> B(b(x1)) B(a(b(b(x1)))) -> B(a(b(a(x1)))) B(a(b(b(x1)))) -> A(b(a(x1))) B(a(b(b(x1)))) -> B(a(x1)) B(a(b(b(x1)))) -> A(x1) The TRS R consists of the following rules: a(a(a(a(x1)))) -> a(b(a(b(x1)))) b(b(a(b(x1)))) -> b(b(b(b(x1)))) a(a(a(b(x1)))) -> b(a(b(b(x1)))) b(a(b(b(x1)))) -> b(a(b(a(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. A(a(a(a(x1)))) -> B(a(b(x1))) A(a(a(a(x1)))) -> A(b(x1)) A(a(a(a(x1)))) -> B(x1) B(b(a(b(x1)))) -> B(b(b(x1))) B(b(a(b(x1)))) -> B(b(x1)) A(a(a(b(x1)))) -> B(a(b(b(x1)))) A(a(a(b(x1)))) -> A(b(b(x1))) A(a(a(b(x1)))) -> B(b(x1)) B(a(b(b(x1)))) -> B(a(x1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard