Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922741
details
property
value
status
complete
benchmark
85079.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
294.035565138 seconds
cpu usage
1172.92526987
max memory
2.228584448E9
stage attributes
key
value
output-size
22713
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: 0(0(1(2(2(0(4(2(x1)))))))) -> 2(4(0(0(4(4(3(0(x1)))))))) 0(0(4(1(2(3(5(0(4(0(5(2(4(3(2(3(1(5(1(x1))))))))))))))))))) -> 4(5(3(2(0(2(3(4(5(5(1(1(5(1(5(5(1(4(x1)))))))))))))))))) 0(1(1(1(2(2(4(1(1(1(x1)))))))))) -> 2(1(2(4(0(2(2(5(0(x1))))))))) 0(1(1(3(2(3(1(3(2(x1))))))))) -> 0(0(5(3(3(1(1(0(x1)))))))) 0(1(2(2(3(x1))))) -> 0(4(1(4(3(x1))))) 0(1(3(1(5(2(2(4(4(5(5(2(4(x1))))))))))))) -> 0(3(4(0(0(4(0(2(1(3(4(3(4(x1))))))))))))) 0(1(4(2(0(5(1(5(2(4(0(0(3(4(4(2(x1)))))))))))))))) -> 4(1(5(4(1(0(2(0(3(4(4(1(1(3(4(2(x1)))))))))))))))) 0(2(0(4(4(4(3(4(0(3(5(1(5(5(3(1(4(3(x1)))))))))))))))))) -> 5(2(2(1(1(2(4(2(3(5(0(0(3(1(1(4(0(x1))))))))))))))))) 0(4(2(5(2(1(0(1(0(1(3(3(5(1(1(2(5(0(2(x1))))))))))))))))))) -> 2(4(1(3(3(5(0(2(0(3(3(5(3(0(1(4(5(0(2(x1))))))))))))))))))) 0(4(4(1(2(0(2(2(0(3(3(5(2(2(3(2(3(1(x1)))))))))))))))))) -> 4(4(0(4(0(0(0(1(3(0(3(3(4(4(4(0(2(4(x1)))))))))))))))))) 1(0(0(4(4(4(1(3(2(4(5(1(2(5(3(2(3(2(2(5(2(x1))))))))))))))))))))) -> 1(4(5(1(3(5(4(2(4(4(4(5(0(2(2(1(1(1(1(3(4(x1))))))))))))))))))))) 1(2(3(5(3(0(x1)))))) -> 1(1(4(3(5(1(x1)))))) 1(2(5(2(4(4(0(3(4(0(3(3(2(x1))))))))))))) -> 1(2(4(2(5(3(5(2(1(3(2(0(x1)))))))))))) 1(2(5(5(5(2(5(3(5(x1))))))))) -> 4(5(3(2(5(1(3(2(5(x1))))))))) 1(3(0(4(0(4(2(3(0(2(3(5(0(5(3(5(3(x1))))))))))))))))) -> 1(0(3(0(1(4(5(1(5(3(5(2(3(2(0(1(3(x1))))))))))))))))) 1(3(1(5(0(4(2(2(0(5(5(x1))))))))))) -> 4(4(1(2(2(5(2(2(2(0(5(x1))))))))))) 1(3(5(3(2(3(4(1(5(1(4(1(0(3(x1)))))))))))))) -> 1(1(1(0(0(2(0(3(4(2(1(3(0(3(x1)))))))))))))) 2(0(1(3(1(2(5(4(3(4(4(x1))))))))))) -> 2(1(2(4(4(2(3(4(2(4(4(x1))))))))))) 2(1(3(5(0(0(x1)))))) -> 4(4(2(4(5(0(x1)))))) 2(1(4(3(1(x1))))) -> 4(1(5(3(x1)))) 2(2(2(1(4(1(1(3(0(2(x1)))))))))) -> 0(2(0(4(2(3(5(4(0(x1))))))))) 2(2(4(0(2(2(4(3(5(0(2(3(3(5(3(x1))))))))))))))) -> 2(1(5(1(3(5(5(5(5(0(0(2(5(x1))))))))))))) 2(2(4(2(1(2(3(2(1(4(x1)))))))))) -> 3(3(3(0(4(5(0(2(4(x1))))))))) 2(2(5(1(3(4(5(3(1(4(1(2(3(4(2(2(x1)))))))))))))))) -> 2(5(2(0(4(2(4(4(2(3(4(0(0(4(3(2(x1)))))))))))))))) 3(0(4(4(4(1(1(2(5(2(1(1(4(3(4(4(4(2(x1)))))))))))))))))) -> 3(3(4(5(3(3(5(4(3(3(5(2(3(3(5(3(x1)))))))))))))))) 3(2(1(1(4(2(4(5(2(5(3(3(x1)))))))))))) -> 5(1(3(1(2(4(1(2(2(1(0(x1))))))))))) 3(3(3(4(0(3(1(4(4(4(4(1(3(3(1(4(x1)))))))))))))))) -> 5(5(2(4(0(0(3(0(4(5(0(2(2(2(x1)))))))))))))) 3(3(3(5(3(1(1(2(2(3(4(2(0(2(1(1(x1)))))))))))))))) -> 5(5(1(4(1(4(1(2(5(2(0(5(2(3(1(x1))))))))))))))) 3(4(4(4(2(1(5(3(1(4(1(5(3(5(3(3(0(2(1(3(1(x1))))))))))))))))))))) -> 3(4(3(0(3(3(4(4(3(4(0(1(4(0(1(5(1(5(4(2(3(x1))))))))))))))))))))) 3(5(1(3(0(0(3(3(3(3(1(0(3(0(5(2(0(x1))))))))))))))))) -> 3(5(3(4(3(5(0(5(1(2(0(4(1(5(3(2(0(x1))))))))))))))))) 4(1(0(5(3(4(3(5(4(1(1(x1))))))))))) -> 4(4(4(3(3(2(0(2(4(5(3(x1))))))))))) 4(1(5(1(2(4(1(4(1(x1))))))))) -> 4(2(3(1(3(0(1(3(1(x1))))))))) 4(3(0(3(2(4(5(0(2(5(0(0(4(2(3(1(x1)))))))))))))))) -> 4(4(4(2(3(3(4(5(0(5(2(2(1(2(0(3(x1)))))))))))))))) 4(3(5(1(5(1(x1)))))) -> 4(0(2(4(5(4(x1)))))) 5(0(2(2(0(2(4(3(2(2(4(5(0(2(3(x1))))))))))))))) -> 5(4(1(1(5(4(5(0(2(3(0(3(3(3(x1)))))))))))))) 5(1(3(3(0(3(5(2(1(4(1(5(x1)))))))))))) -> 3(5(5(5(5(0(1(5(4(2(5(x1))))))))))) 5(2(1(2(2(4(5(2(2(3(3(3(1(0(3(4(1(0(0(3(2(x1))))))))))))))))))))) -> 5(2(3(2(4(0(2(2(3(1(4(3(2(1(2(1(2(5(5(2(4(x1))))))))))))))))))))) 5(3(3(5(3(4(0(5(0(2(4(0(x1)))))))))))) -> 5(5(3(2(5(4(4(2(1(1(1(3(x1)))))))))))) 5(4(5(3(0(3(3(3(1(2(0(0(2(3(3(2(0(x1))))))))))))))))) -> 5(2(0(1(4(2(4(1(2(0(0(4(2(3(1(2(2(x1))))))))))))))))) 5(5(0(2(4(4(2(4(2(2(0(3(4(x1))))))))))))) -> 5(3(5(2(0(0(4(4(5(5(5(2(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) -> 8 0_1(2) -> 8 0_1(4) -> 3 0_1(5) -> 4 0_1(13) -> 12 0_1(29) -> 28 0_1(32) -> 1 0_1(32) -> 8 0_1(32) -> 64 0_1(32) -> 155 0_1(32) -> 261 0_1(32) -> 262 0_1(32) -> 312 0_1(33) -> 32 0_1(39) -> 207 0_1(40) -> 173 0_1(43) -> 42 0_1(44) -> 43 0_1(46) -> 45 0_1(49) -> 207 0_1(55) -> 54 0_1(57) -> 56 0_1(64) -> 94 0_1(65) -> 2 0_1(75) -> 74 0_1(76) -> 75 0_1(84) -> 83 0_1(86) -> 85 0_1(91) -> 90
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144