Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905245
details
property
value
status
complete
benchmark
Ex5_Zan97_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n069.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.56667304039 seconds
cpu usage
3.343298008
max memory
1.90234624E8
stage attributes
key
value
output-size
1797
starexec-result
WORST_CASE(?, O(1))
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, 1). (0) CpxTRS (1) NarrowingOnBasicTermsTerminatesProof [FINISHED, 0 ms] (2) BOUNDS(1, 1) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, 1). The TRS R consists of the following rules: f(X) -> if(X, c, n__f(true)) if(true, X, Y) -> X if(false, X, Y) -> activate(Y) f(X) -> n__f(X) activate(n__f(X)) -> f(X) activate(X) -> X S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) NarrowingOnBasicTermsTerminatesProof (FINISHED) Constant runtime complexity proven by termination of constructor-based narrowing. The maximal most general narrowing sequences give rise to the following rewrite sequences: activate(n__f(x0)) ->^* n__f(x0) activate(n__f(false)) ->^* n__f(true) activate(n__f(false)) ->^* n__f(true) activate(n__f(false)) ->^* c activate(n__f(true)) ->^* c if(false, x0, n__f(x1)) ->^* n__f(x1) if(false, x0, n__f(false)) ->^* n__f(true) if(false, x0, n__f(false)) ->^* n__f(true) if(false, x0, n__f(false)) ->^* c if(false, x0, n__f(true)) ->^* c f(x0) ->^* n__f(x0) f(false) ->^* n__f(true) f(false) ->^* n__f(true) f(false) ->^* c f(true) ->^* c ---------------------------------------- (2) BOUNDS(1, 1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807