Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487519871
details
property
value
status
complete
benchmark
z022.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n014.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.67739892006 seconds
cpu usage
10.991181633
max memory
1.676570624E9
stage attributes
key
value
output-size
5173
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, 15 ms] (2) QDP (3) QDPOrderProof [EQUIVALENT, 32 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 10 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 9 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(b(x1))) -> b(a(b(c(a(x1))))) b(a(x1)) -> a(b(b(x1))) b(c(a(x1))) -> c(a(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(a(b(x1))) -> B(a(b(c(a(x1))))) A(a(b(x1))) -> A(b(c(a(x1)))) A(a(b(x1))) -> B(c(a(x1))) A(a(b(x1))) -> A(x1) B(a(x1)) -> A(b(b(x1))) B(a(x1)) -> B(b(x1)) B(a(x1)) -> B(x1) B(c(a(x1))) -> A(b(x1)) B(c(a(x1))) -> B(x1) The TRS R consists of the following rules: a(a(b(x1))) -> b(a(b(c(a(x1))))) b(a(x1)) -> a(b(b(x1))) b(c(a(x1))) -> c(a(b(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(b(x1))) -> B(c(a(x1))) A(a(b(x1))) -> A(x1) B(a(x1)) -> B(b(x1)) B(a(x1)) -> B(x1) B(c(a(x1))) -> B(x1) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(A(x_1)) = 1 + x_1 POL(B(x_1)) = x_1 POL(a(x_1)) = 1 + x_1 POL(b(x_1)) = x_1 POL(c(x_1)) = x_1 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: b(a(x1)) -> a(b(b(x1))) a(a(b(x1))) -> b(a(b(c(a(x1))))) b(c(a(x1))) -> c(a(b(x1))) ---------------------------------------- (4)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard