Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922055
details
property
value
status
complete
benchmark
86559.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
295.144744158 seconds
cpu usage
1174.39468203
max memory
1.47849216E9
stage attributes
key
value
output-size
20947
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: 0(0(1(1(4(5(3(2(5(3(4(4(3(0(5(4(4(4(2(x1))))))))))))))))))) -> 0(0(4(5(1(4(1(5(3(0(4(0(3(3(4(0(4(0(4(x1))))))))))))))))))) 0(1(0(1(x1)))) -> 0(2(3(1(x1)))) 1(0(2(0(3(5(1(4(5(2(4(4(x1)))))))))))) -> 1(0(1(0(3(2(3(2(1(0(3(3(x1)))))))))))) 1(4(1(4(1(5(2(4(4(3(3(4(5(4(4(1(2(0(2(3(x1)))))))))))))))))))) -> 1(2(1(5(0(1(0(4(4(4(2(5(0(1(5(1(1(4(3(3(x1)))))))))))))))))))) 2(0(0(5(5(0(2(2(2(3(4(1(4(x1))))))))))))) -> 3(3(3(3(1(3(1(4(1(4(5(4(3(x1))))))))))))) 2(1(0(0(4(2(5(5(1(3(3(4(3(3(5(5(3(3(5(2(x1)))))))))))))))))))) -> 4(4(3(3(5(0(4(2(2(1(1(3(1(5(2(5(2(4(5(x1))))))))))))))))))) 2(1(1(3(5(4(0(1(4(2(5(1(4(5(4(5(1(x1))))))))))))))))) -> 2(3(3(3(3(2(1(4(5(5(2(2(4(4(4(3(0(x1))))))))))))))))) 2(1(2(3(2(1(2(5(5(5(0(0(3(2(1(1(x1)))))))))))))))) -> 4(4(1(1(3(3(1(4(2(1(3(0(3(2(3(x1))))))))))))))) 2(1(4(0(1(x1))))) -> 3(0(0(1(x1)))) 2(1(4(5(5(0(2(4(0(5(4(4(1(4(x1)))))))))))))) -> 0(0(2(1(4(3(2(5(3(2(5(2(1(x1))))))))))))) 2(2(2(0(3(3(2(0(4(5(0(x1))))))))))) -> 0(4(0(0(0(0(2(5(1(x1))))))))) 2(3(3(3(1(x1))))) -> 1(1(3(1(x1)))) 2(5(5(1(0(4(4(1(4(0(5(1(1(5(0(0(1(4(x1)))))))))))))))))) -> 3(3(1(0(0(1(1(1(2(1(2(0(2(4(4(3(5(0(x1)))))))))))))))))) 3(1(3(5(4(1(1(4(5(1(1(3(5(1(x1)))))))))))))) -> 3(2(1(2(4(3(5(1(5(5(1(3(4(x1))))))))))))) 3(3(3(1(4(2(0(0(3(0(1(1(3(4(1(2(x1)))))))))))))))) -> 3(0(4(1(5(0(5(3(5(0(4(4(3(0(4(x1))))))))))))))) 4(0(4(2(3(5(0(1(4(4(5(0(x1)))))))))))) -> 3(5(0(2(5(1(2(5(1(4(1(x1))))))))))) 4(1(0(2(3(5(4(1(4(4(1(1(x1)))))))))))) -> 2(5(4(4(5(5(1(2(4(4(2(x1))))))))))) 4(1(2(3(4(x1))))) -> 1(5(3(0(x1)))) 4(2(4(2(4(5(4(5(2(1(5(3(1(0(2(5(2(1(4(2(4(x1))))))))))))))))))))) -> 1(5(3(1(5(0(5(2(0(5(4(3(5(2(1(2(5(4(3(2(1(x1))))))))))))))))))))) 4(4(5(3(0(2(0(0(0(3(5(0(2(1(x1)))))))))))))) -> 2(2(0(4(1(0(0(1(4(2(4(1(3(5(x1)))))))))))))) 4(5(1(3(0(0(3(5(2(1(2(5(2(x1))))))))))))) -> 4(5(0(3(5(3(5(5(3(5(4(0(4(x1))))))))))))) 5(0(2(1(0(3(4(3(4(1(5(3(3(3(4(2(0(5(5(3(5(x1))))))))))))))))))))) -> 3(5(1(1(0(5(4(5(2(1(5(0(4(4(4(3(4(4(1(5(x1)))))))))))))))))))) 5(0(2(4(4(4(4(3(1(2(2(2(2(2(2(5(2(x1))))))))))))))))) -> 5(4(0(4(4(3(5(5(4(3(0(5(5(5(0(0(x1)))))))))))))))) 5(0(3(1(4(1(0(1(0(x1))))))))) -> 2(2(4(1(3(2(2(3(0(x1))))))))) 5(0(5(4(4(4(4(2(5(1(2(3(3(1(1(x1))))))))))))))) -> 1(3(0(5(3(1(3(1(0(3(3(1(0(3(x1)))))))))))))) 5(3(2(4(4(x1))))) -> 0(1(3(0(x1)))) 5(3(5(5(4(0(2(2(4(3(2(2(1(4(1(x1))))))))))))))) -> 5(1(4(2(3(5(4(0(4(4(2(1(0(0(x1)))))))))))))) 5(5(0(4(3(3(x1)))))) -> 0(3(2(1(3(x1))))) 5(5(2(1(3(3(2(5(0(1(0(5(0(5(0(x1))))))))))))))) -> 2(3(5(0(2(4(1(0(5(4(3(0(5(0(x1)))))))))))))) 5(5(5(4(4(0(4(0(2(1(x1)))))))))) -> 5(4(5(4(0(5(0(4(0(3(x1)))))))))) - Signature: {0/1,1/1,2/1,3/1,4/1,5/1} / {} - Obligation: derivational complexity wrt. signature {0,1,2,3,4,5} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_1(1) -> 93 0_1(2) -> 1 0_1(2) -> 49 0_1(2) -> 77 0_1(2) -> 93 0_1(2) -> 105 0_1(2) -> 114 0_1(2) -> 171 0_1(2) -> 235 0_1(3) -> 2 0_1(11) -> 10 0_1(13) -> 12 0_1(17) -> 16 0_1(19) -> 18 0_1(20) -> 30 0_1(21) -> 105 0_1(22) -> 93 0_1(23) -> 22 0_1(25) -> 24 0_1(31) -> 30 0_1(32) -> 250 0_1(36) -> 35 0_1(38) -> 37 0_1(44) -> 43 0_1(50) -> 30 0_1(60) -> 93 0_1(61) -> 93 0_1(65) -> 64 0_1(77) -> 271 0_1(78) -> 93 0_1(91) -> 18 0_1(93) -> 235 0_1(95) -> 30 0_1(103) -> 102 0_1(104) -> 1 0_1(104) -> 93 0_1(104) -> 105 0_1(105) -> 49 0_1(116) -> 115 0_1(117) -> 116 0_1(118) -> 117 0_1(119) -> 118 0_1(122) -> 121
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144