Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487068853
details
property
value
status
complete
benchmark
forward_instantiation2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n185.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.09681 seconds
cpu usage
4.15453
user time
3.93916
system time
0.215377
max virtual memory
1.8476724E7
max residence set size
296048.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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) AAECC Innermost [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) UsableRulesProof [EQUIVALENT, 0 ms] (6) QDP (7) QReductionProof [EQUIVALENT, 0 ms] (8) QDP (9) TransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, y, z) -> g(x, y, z) g(0, 1, x) -> f(x, x, x) a -> b a -> c Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is none The TRS R 2 is f(x, y, z) -> g(x, y, z) g(0, 1, x) -> f(x, x, x) a -> b a -> c The signature Sigma is {f_3, g_3, a, b, c} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, y, z) -> g(x, y, z) g(0, 1, x) -> f(x, x, x) a -> b a -> c The set Q consists of the following terms: f(x0, x1, x2) g(0, 1, x0) a ---------------------------------------- (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: F(x, y, z) -> G(x, y, z) G(0, 1, x) -> F(x, x, x) The TRS R consists of the following rules: f(x, y, z) -> g(x, y, z) g(0, 1, x) -> f(x, x, x) a -> b a -> c The set Q consists of the following terms: f(x0, x1, x2) g(0, 1, x0) a We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) UsableRulesProof (EQUIVALENT) As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R. ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard