Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Conditional 2019-03-28 22.59 pair #432272615
details
property
value
status
complete
benchmark
389.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n012.star.cs.uiowa.edu
space
COPS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.23606 seconds
cpu usage
5.34482
user time
5.11912
system time
0.225695
max virtual memory
1.8611656E7
max residence set size
483256.0
stage attributes
key
value
starexec-result
MAYBE
output
5.06/2.19 MAYBE 5.06/2.19 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 5.06/2.19 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.06/2.19 5.06/2.19 5.06/2.19 Quasi decreasingness of the given CTRS could not be shown: 5.06/2.19 5.06/2.19 (0) CTRS 5.06/2.19 (1) CTRSToQTRSProof [SOUND, 0 ms] 5.06/2.19 (2) QTRS 5.06/2.19 (3) Overlay + Local Confluence [EQUIVALENT, 0 ms] 5.06/2.19 (4) QTRS 5.06/2.19 (5) DependencyPairsProof [EQUIVALENT, 0 ms] 5.06/2.19 (6) QDP 5.06/2.19 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 5.06/2.19 (8) AND 5.06/2.19 (9) QDP 5.06/2.19 (10) UsableRulesProof [EQUIVALENT, 0 ms] 5.06/2.19 (11) QDP 5.06/2.19 (12) QReductionProof [EQUIVALENT, 0 ms] 5.06/2.19 (13) QDP 5.06/2.19 (14) NonTerminationLoopProof [COMPLETE, 0 ms] 5.06/2.19 (15) NO 5.06/2.19 (16) QDP 5.06/2.19 (17) UsableRulesProof [EQUIVALENT, 0 ms] 5.06/2.19 (18) QDP 5.06/2.19 (19) QReductionProof [EQUIVALENT, 0 ms] 5.06/2.19 (20) QDP 5.06/2.19 (21) NonTerminationLoopProof [COMPLETE, 0 ms] 5.06/2.19 (22) NO 5.06/2.19 5.06/2.19 5.06/2.19 ---------------------------------------- 5.06/2.19 5.06/2.19 (0) 5.06/2.19 Obligation: 5.06/2.19 Conditional term rewrite system: 5.06/2.19 The TRS R consists of the following rules: 5.06/2.19 5.06/2.19 a -> f(a) 5.06/2.19 5.06/2.19 The conditional TRS C consists of the following conditional rules: 5.06/2.19 5.06/2.19 f(x) -> b <= f(x) -> z, x -> z 5.06/2.19 5.06/2.19 5.06/2.19 ---------------------------------------- 5.06/2.19 5.06/2.19 (1) CTRSToQTRSProof (SOUND) 5.06/2.19 The conditional rules have been transormed into unconditional rules according to [CTRS,AAECCNOC]. 5.06/2.19 ---------------------------------------- 5.06/2.19 5.06/2.19 (2) 5.06/2.19 Obligation: 5.06/2.19 Q restricted rewrite system: 5.06/2.19 The TRS R consists of the following rules: 5.06/2.19 5.06/2.19 f(x) -> U1(f(x), x) 5.06/2.19 U1(z, x) -> U2(x) 5.06/2.19 U2(z) -> b 5.06/2.19 a -> f(a) 5.06/2.19 5.06/2.19 Q is empty. 5.06/2.19 5.06/2.19 ---------------------------------------- 5.06/2.19 5.06/2.19 (3) Overlay + Local Confluence (EQUIVALENT) 5.06/2.19 The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. 5.06/2.19 ---------------------------------------- 5.06/2.19 5.06/2.19 (4) 5.06/2.19 Obligation: 5.06/2.19 Q restricted rewrite system: 5.06/2.19 The TRS R consists of the following rules: 5.06/2.19 5.06/2.19 f(x) -> U1(f(x), x) 5.06/2.19 U1(z, x) -> U2(x) 5.06/2.19 U2(z) -> b 5.06/2.19 a -> f(a) 5.06/2.19 5.06/2.19 The set Q consists of the following terms: 5.06/2.19 5.06/2.19 f(x0) 5.06/2.19 U1(x0, x1) 5.06/2.19 U2(x0) 5.06/2.19 a 5.06/2.19 5.06/2.19 5.06/2.19 ---------------------------------------- 5.06/2.19 5.06/2.19 (5) DependencyPairsProof (EQUIVALENT) 5.06/2.19 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 5.06/2.19 ---------------------------------------- 5.06/2.19 5.06/2.19 (6) 5.06/2.19 Obligation: 5.06/2.19 Q DP problem: 5.06/2.19 The TRS P consists of the following rules: 5.06/2.19 5.06/2.19 F(x) -> U1^1(f(x), x)
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