Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Conditional 2019-03-28 22.59 pair #432272623
details
property
value
status
complete
benchmark
289.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n126.star.cs.uiowa.edu
space
COPS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.57999 seconds
cpu usage
6.4341
user time
6.13633
system time
0.297763
max virtual memory
1.834726E7
max residence set size
444948.0
stage attributes
key
value
starexec-result
MAYBE
output
6.30/2.50 MAYBE 6.30/2.51 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 6.30/2.51 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.30/2.51 6.30/2.51 6.30/2.51 Quasi decreasingness of the given CTRS could not be shown: 6.30/2.51 6.30/2.51 (0) CTRS 6.30/2.51 (1) CTRSToQTRSProof [SOUND, 0 ms] 6.30/2.51 (2) QTRS 6.30/2.51 (3) DependencyPairsProof [EQUIVALENT, 12 ms] 6.30/2.51 (4) QDP 6.30/2.51 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 6.30/2.51 (6) QDP 6.30/2.51 (7) NonTerminationLoopProof [COMPLETE, 254 ms] 6.30/2.51 (8) NO 6.30/2.51 6.30/2.51 6.30/2.51 ---------------------------------------- 6.30/2.51 6.30/2.51 (0) 6.30/2.51 Obligation: 6.30/2.51 Conditional term rewrite system: 6.30/2.51 The TRS R consists of the following rules: 6.30/2.51 6.30/2.51 App(App(App(S, x), y), z) -> App(App(x, z), App(y, z)) 6.30/2.51 App(App(K, x), y) -> x 6.30/2.51 App(I, x) -> x 6.30/2.51 App(App(App(C, T), x), y) -> x 6.30/2.51 App(App(App(C, F), x), y) -> y 6.30/2.51 6.30/2.51 The conditional TRS C consists of the following conditional rules: 6.30/2.51 6.30/2.51 App(App(App(C, z), x), y) -> x <= x -> y 6.30/2.51 App(App(App(C, z), x), y) -> y <= x -> y 6.30/2.51 6.30/2.51 6.30/2.51 ---------------------------------------- 6.30/2.51 6.30/2.51 (1) CTRSToQTRSProof (SOUND) 6.30/2.51 The conditional rules have been transormed into unconditional rules according to [CTRS,AAECCNOC]. 6.30/2.53 ---------------------------------------- 6.30/2.53 6.30/2.53 (2) 6.30/2.53 Obligation: 6.30/2.53 Q restricted rewrite system: 6.30/2.53 The TRS R consists of the following rules: 6.30/2.53 6.30/2.53 App(App(App(C, z), x), y) -> U1(x, x, y) 6.30/2.53 U1(y, x, y) -> y 6.30/2.53 U1(y, x, y) -> x 6.30/2.53 App(App(App(S, x), y), z) -> App(App(x, z), App(y, z)) 6.30/2.53 App(App(K, x), y) -> x 6.30/2.53 App(I, x) -> x 6.30/2.53 App(App(App(C, T), x), y) -> x 6.30/2.53 App(App(App(C, F), x), y) -> y 6.30/2.53 6.30/2.53 Q is empty. 6.30/2.53 6.30/2.53 ---------------------------------------- 6.30/2.53 6.30/2.53 (3) DependencyPairsProof (EQUIVALENT) 6.30/2.53 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 6.30/2.53 ---------------------------------------- 6.30/2.53 6.30/2.53 (4) 6.30/2.53 Obligation: 6.30/2.53 Q DP problem: 6.30/2.53 The TRS P consists of the following rules: 6.30/2.53 6.30/2.53 APP(App(App(C, z), x), y) -> U1^1(x, x, y) 6.30/2.53 APP(App(App(S, x), y), z) -> APP(App(x, z), App(y, z)) 6.30/2.53 APP(App(App(S, x), y), z) -> APP(x, z) 6.30/2.53 APP(App(App(S, x), y), z) -> APP(y, z) 6.30/2.53 6.30/2.53 The TRS R consists of the following rules: 6.30/2.53 6.30/2.53 App(App(App(C, z), x), y) -> U1(x, x, y) 6.30/2.53 U1(y, x, y) -> y 6.30/2.53 U1(y, x, y) -> x 6.30/2.53 App(App(App(S, x), y), z) -> App(App(x, z), App(y, z)) 6.30/2.53 App(App(K, x), y) -> x 6.30/2.53 App(I, x) -> x 6.30/2.53 App(App(App(C, T), x), y) -> x 6.30/2.53 App(App(App(C, F), x), y) -> y 6.30/2.53 6.30/2.53 Q is empty. 6.30/2.53 We have to consider all minimal (P,Q,R)-chains. 6.30/2.53 ---------------------------------------- 6.30/2.53 6.30/2.53 (5) DependencyGraphProof (EQUIVALENT) 6.30/2.53 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node. 6.30/2.53 ---------------------------------------- 6.30/2.53 6.30/2.53 (6) 6.30/2.53 Obligation: 6.30/2.53 Q DP problem: 6.30/2.53 The TRS P consists of the following rules: 6.30/2.53 6.30/2.53 APP(App(App(S, x), y), z) -> APP(x, z)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Conditional 2019-03-28 22.59