Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903084
details
property
value
status
timeout (wallclock)
benchmark
#3.31.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.148092031 seconds
cpu usage
639.73320043
max memory
1.4892785664E10
stage attributes
unavailable
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY,?) * Step 1: Sum WORST_CASE(NON_POLY,?) + Considered Problem: - Strict TRS: f(g(x)) -> f(a(g(g(f(x))),g(f(x)))) - Signature: {f/1} / {a/2,g/1} - Obligation: runtime complexity wrt. defined symbols {f} and constructors {a,g} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(NON_POLY,?) + Considered Problem: - Strict TRS: f(g(x)) -> f(a(g(g(f(x))),g(f(x)))) - Signature: {f/1} / {a/2,g/1} - Obligation: runtime complexity wrt. defined symbols {f} and constructors {a,g} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: f(x){x -> g(x)} = f(g(x)) ->^+ f(a(g(g(f(x))),g(f(x)))) = C[f(x) = f(x){}] f(x){x -> g(x)} = f(g(x)) ->^+ f(a(g(g(f(x))),g(f(x)))) = C[f(x) = f(x){}] WORST_CASE(NON_POLY,?)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127