Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381719520
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
n099.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.48959207535 seconds
cpu usage
10.160052593
max memory
8.941568E8
stage attributes
key
value
output-size
6806
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: 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, 17 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 23 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) UsableRulesProof [EQUIVALENT, 1 ms] (11) QDP (12) QDPOrderProof [EQUIVALENT, 0 ms] (13) QDP (14) PisEmptyProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (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) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(a(a(x1))) -> a(c(b(a(b(x1))))) a(b(x1)) -> b(b(a(x1))) a(c(b(x1))) -> b(a(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: B(a(a(x1))) -> A(c(b(a(b(x1))))) B(a(a(x1))) -> B(a(b(x1))) B(a(a(x1))) -> A(b(x1)) B(a(a(x1))) -> B(x1) A(b(x1)) -> B(b(a(x1))) A(b(x1)) -> B(a(x1)) A(b(x1)) -> A(x1) A(c(b(x1))) -> B(a(c(x1))) A(c(b(x1))) -> A(c(x1)) The TRS R consists of the following rules: b(a(a(x1))) -> a(c(b(a(b(x1))))) a(b(x1)) -> b(b(a(x1))) a(c(b(x1))) -> b(a(c(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06].
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685