Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307944
details
property
value
status
complete
benchmark
sat.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n044.star.cs.uiowa.edu
space
TCT_12
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.535 seconds
cpu usage
344.806
user time
342.11
system time
2.69615
max virtual memory
1.8281972E7
max residence set size
6054856.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
344.69/291.49 WORST_CASE(Omega(n^1), ?) 344.69/291.50 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 344.69/291.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 344.69/291.50 344.69/291.50 344.69/291.50 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 344.69/291.50 344.69/291.50 (0) CpxTRS 344.69/291.50 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 344.69/291.50 (2) CpxTRS 344.69/291.50 (3) SlicingProof [LOWER BOUND(ID), 0 ms] 344.69/291.50 (4) CpxTRS 344.69/291.50 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 344.69/291.50 (6) typed CpxTrs 344.69/291.50 (7) OrderProof [LOWER BOUND(ID), 0 ms] 344.69/291.50 (8) typed CpxTrs 344.69/291.50 (9) RewriteLemmaProof [LOWER BOUND(ID), 1330 ms] 344.69/291.50 (10) BEST 344.69/291.50 (11) proven lower bound 344.69/291.50 (12) LowerBoundPropagationProof [FINISHED, 0 ms] 344.69/291.50 (13) BOUNDS(n^1, INF) 344.69/291.50 (14) typed CpxTrs 344.69/291.50 (15) RewriteLemmaProof [LOWER BOUND(ID), 116 ms] 344.69/291.50 (16) typed CpxTrs 344.69/291.50 (17) RewriteLemmaProof [LOWER BOUND(ID), 365 ms] 344.69/291.50 (18) typed CpxTrs 344.69/291.50 344.69/291.50 344.69/291.50 ---------------------------------------- 344.69/291.50 344.69/291.50 (0) 344.69/291.50 Obligation: 344.69/291.50 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 344.69/291.50 344.69/291.50 344.69/291.50 The TRS R consists of the following rules: 344.69/291.50 344.69/291.50 if(true, t, e) -> t 344.69/291.50 if(false, t, e) -> e 344.69/291.50 member(x, nil) -> false 344.69/291.50 member(x, cons(y, ys)) -> if(eq(x, y), true, member(x, ys)) 344.69/291.50 eq(nil, nil) -> true 344.69/291.50 eq(O(x), 0(y)) -> eq(x, y) 344.69/291.50 eq(0(x), 1(y)) -> false 344.69/291.50 eq(1(x), 0(y)) -> false 344.69/291.50 eq(1(x), 1(y)) -> eq(x, y) 344.69/291.50 negate(0(x)) -> 1(x) 344.69/291.50 negate(1(x)) -> 0(x) 344.69/291.50 choice(cons(x, xs)) -> x 344.69/291.50 choice(cons(x, xs)) -> choice(xs) 344.69/291.50 guess(nil) -> nil 344.69/291.50 guess(cons(clause, cnf)) -> cons(choice(clause), guess(cnf)) 344.69/291.50 verify(nil) -> true 344.69/291.50 verify(cons(l, ls)) -> if(member(negate(l), ls), false, verify(ls)) 344.69/291.50 sat(cnf) -> satck(cnf, guess(cnf)) 344.69/291.50 satck(cnf, assign) -> if(verify(assign), assign, unsat) 344.69/291.50 344.69/291.50 S is empty. 344.69/291.50 Rewrite Strategy: FULL 344.69/291.50 ---------------------------------------- 344.69/291.50 344.69/291.50 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 344.69/291.50 Renamed function symbols to avoid clashes with predefined symbol. 344.69/291.50 ---------------------------------------- 344.69/291.50 344.69/291.50 (2) 344.69/291.50 Obligation: 344.69/291.50 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 344.69/291.50 344.69/291.50 344.69/291.50 The TRS R consists of the following rules: 344.69/291.50 344.69/291.50 if(true, t, e) -> t 344.69/291.50 if(false, t, e) -> e 344.69/291.50 member(x, nil) -> false 344.69/291.50 member(x, cons(y, ys)) -> if(eq(x, y), true, member(x, ys)) 344.69/291.50 eq(nil, nil) -> true 344.69/291.50 eq(O(x), 0(y)) -> eq(x, y) 344.69/291.50 eq(0(x), 1(y)) -> false 344.69/291.50 eq(1(x), 0(y)) -> false 344.69/291.50 eq(1(x), 1(y)) -> eq(x, y) 344.69/291.50 negate(0(x)) -> 1(x) 344.69/291.50 negate(1(x)) -> 0(x) 344.69/291.50 choice(cons(x, xs)) -> x 344.69/291.50 choice(cons(x, xs)) -> choice(xs) 344.69/291.50 guess(nil) -> nil 344.69/291.50 guess(cons(clause, cnf)) -> cons(choice(clause), guess(cnf)) 344.69/291.50 verify(nil) -> true 344.69/291.50 verify(cons(l, ls)) -> if(member(negate(l), ls), false, verify(ls)) 344.69/291.50 sat(cnf) -> satck(cnf, guess(cnf)) 344.69/291.50 satck(cnf, assign) -> if(verify(assign), assign, unsat) 344.69/291.50 344.69/291.50 S is empty. 344.69/291.50 Rewrite Strategy: FULL 344.69/291.50 ---------------------------------------- 344.69/291.50 344.69/291.50 (3) SlicingProof (LOWER BOUND(ID)) 344.69/291.50 Sliced the following arguments: 344.69/291.50 satck/0 344.69/291.50
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