Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308394
details
property
value
status
complete
benchmark
4.57.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.527 seconds
cpu usage
306.051
user time
304.253
system time
1.79886
max virtual memory
1.8277336E7
max residence set size
5238336.0
stage attributes
key
value
starexec-result
MAYBE
output
305.92/291.48 KILLED 305.92/291.49 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 305.92/291.49 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 305.92/291.49 305.92/291.49 305.92/291.49 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). 305.92/291.49 305.92/291.49 (0) CpxTRS 305.92/291.49 (1) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] 305.92/291.49 (2) CpxTRS 305.92/291.49 (3) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 305.92/291.49 (4) CpxTRS 305.92/291.49 (5) SlicingProof [LOWER BOUND(ID), 0 ms] 305.92/291.49 (6) CpxTRS 305.92/291.49 (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 305.92/291.49 (8) typed CpxTrs 305.92/291.49 (9) OrderProof [LOWER BOUND(ID), 3 ms] 305.92/291.49 (10) typed CpxTrs 305.92/291.49 (11) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 305.92/291.49 (12) TRS for Loop Detection 305.92/291.49 (13) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 305.92/291.49 (14) CpxWeightedTrs 305.92/291.49 (15) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 305.92/291.49 (16) CpxTypedWeightedTrs 305.92/291.49 (17) CompletionProof [UPPER BOUND(ID), 0 ms] 305.92/291.49 (18) CpxTypedWeightedCompleteTrs 305.92/291.49 (19) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 305.92/291.49 (20) CpxTypedWeightedCompleteTrs 305.92/291.49 (21) CompletionProof [UPPER BOUND(ID), 0 ms] 305.92/291.49 (22) CpxTypedWeightedCompleteTrs 305.92/291.49 305.92/291.49 305.92/291.49 ---------------------------------------- 305.92/291.49 305.92/291.49 (0) 305.92/291.49 Obligation: 305.92/291.49 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). 305.92/291.49 305.92/291.49 305.92/291.49 The TRS R consists of the following rules: 305.92/291.49 305.92/291.49 f(x, y, z) -> g(<=(x, y), x, y, z) 305.92/291.49 g(true, x, y, z) -> z 305.92/291.49 g(false, x, y, z) -> f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y)) 305.92/291.49 p(0) -> 0 305.92/291.49 p(s(x)) -> x 305.92/291.49 305.92/291.49 S is empty. 305.92/291.49 Rewrite Strategy: FULL 305.92/291.49 ---------------------------------------- 305.92/291.49 305.92/291.49 (1) RelTrsToTrsProof (UPPER BOUND(ID)) 305.92/291.49 transformed relative TRS to TRS 305.92/291.49 ---------------------------------------- 305.92/291.49 305.92/291.49 (2) 305.92/291.49 Obligation: 305.92/291.49 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). 305.92/291.49 305.92/291.49 305.92/291.49 The TRS R consists of the following rules: 305.92/291.49 305.92/291.49 f(x, y, z) -> g(<=(x, y), x, y, z) 305.92/291.49 g(true, x, y, z) -> z 305.92/291.49 g(false, x, y, z) -> f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y)) 305.92/291.49 p(0) -> 0 305.92/291.49 p(s(x)) -> x 305.92/291.49 305.92/291.49 S is empty. 305.92/291.49 Rewrite Strategy: FULL 305.92/291.49 ---------------------------------------- 305.92/291.49 305.92/291.49 (3) RenamingProof (BOTH BOUNDS(ID, ID)) 305.92/291.49 Renamed function symbols to avoid clashes with predefined symbol. 305.92/291.49 ---------------------------------------- 305.92/291.49 305.92/291.49 (4) 305.92/291.49 Obligation: 305.92/291.49 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). 305.92/291.49 305.92/291.49 305.92/291.49 The TRS R consists of the following rules: 305.92/291.49 305.92/291.49 f(x, y, z) -> g(<=(x, y), x, y, z) 305.92/291.49 g(true, x, y, z) -> z 305.92/291.49 g(false, x, y, z) -> f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y)) 305.92/291.49 p(0') -> 0' 305.92/291.49 p(s(x)) -> x 305.92/291.49 305.92/291.49 S is empty. 305.92/291.49 Rewrite Strategy: FULL 305.92/291.49 ---------------------------------------- 305.92/291.49 305.92/291.49 (5) SlicingProof (LOWER BOUND(ID)) 305.92/291.49 Sliced the following arguments: 305.92/291.49 <=/0 305.92/291.49 <=/1 305.92/291.49 305.92/291.49 ---------------------------------------- 305.92/291.49
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11
