Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Equational pair #487092758
details
property
value
status
complete
benchmark
AC53.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.05425 seconds
cpu usage
4.81379
user time
4.62276
system time
0.19103
max virtual memory
1.8408912E7
max residence set size
266880.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given ETRS could be proven: (0) ETRS (1) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] (2) EDP (3) EDependencyGraphProof [EQUIVALENT, 0 ms] (4) EDP (5) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (6) EDP (7) EDPProblemToQDPProblemProof [EQUIVALENT, 0 ms] (8) QDP (9) MNOCProof [EQUIVALENT, 0 ms] (10) QDP (11) MRRProof [EQUIVALENT, 0 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Equational rewrite system: The TRS R consists of the following rules: p(s(x)) -> x fac(0) -> s(0) fac(s(x)) -> times(s(x), fac(p(s(x)))) The set E consists of the following equations: times(x, y) == times(y, x) times(times(x, y), z) == times(x, times(y, z)) ---------------------------------------- (1) EquationalDependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,DA_STEIN] we result in the following initial EDP problem: The TRS P consists of the following rules: FAC(s(x)) -> FAC(p(s(x))) FAC(s(x)) -> P(s(x)) The TRS R consists of the following rules: p(s(x)) -> x fac(0) -> s(0) fac(s(x)) -> times(s(x), fac(p(s(x)))) The set E consists of the following equations: times(x, y) == times(y, x) times(times(x, y), z) == times(x, times(y, z)) E# is empty. We have to consider all minimal (P,E#,R,E)-chains ---------------------------------------- (2) Obligation: The TRS P consists of the following rules: FAC(s(x)) -> FAC(p(s(x))) FAC(s(x)) -> P(s(x)) The TRS R consists of the following rules: p(s(x)) -> x fac(0) -> s(0) fac(s(x)) -> times(s(x), fac(p(s(x)))) The set E consists of the following equations: times(x, y) == times(y, x) times(times(x, y), z) == times(x, times(y, z)) E# is empty. We have to consider all minimal (P,E#,R,E)-chains ---------------------------------------- (3) EDependencyGraphProof (EQUIVALENT) The approximation of the Equational Dependency Graph [DA_STEIN] contains 1 SCC with 1 less node. ---------------------------------------- (4) Obligation: The TRS P consists of the following rules: FAC(s(x)) -> FAC(p(s(x))) 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 TRS Equational