Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922671
details
property
value
status
complete
benchmark
27213.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
295.165482998 seconds
cpu usage
1180.08081573
max memory
2.6785792E8
stage attributes
key
value
output-size
9018
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(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(x1)))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(x1))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))))))))))))))))))))) - Signature: {0/1} / {1/1,2/1} - Obligation: derivational complexity wrt. signature {0,1,2} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_1(6) -> 5 0_1(9) -> 8 0_2(26) -> 25 0_2(29) -> 28 0_2(32) -> 31 0_2(38) -> 37 0_3(50) -> 49 0_3(53) -> 52 0_3(56) -> 55 0_3(59) -> 58 0_3(62) -> 61 0_3(68) -> 67 0_3(71) -> 70 0_3(74) -> 73 0_3(77) -> 76 0_3(80) -> 79 0_3(83) -> 82 0_3(89) -> 88 0_3(92) -> 91 0_3(95) -> 94 0_3(98) -> 97 0_3(101) -> 100 0_3(104) -> 103 0_3(107) -> 106 0_3(113) -> 112 0_3(116) -> 115 0_3(119) -> 118 0_3(122) -> 121 0_3(125) -> 124 0_3(128) -> 127 0_3(131) -> 130 0_3(134) -> 133 1_0(1) -> 1 1_1(2) -> 1 1_1(2) -> 8 1_1(4) -> 3 1_1(5) -> 4 1_1(7) -> 6 1_1(10) -> 9 1_2(22) -> 5 1_2(22) -> 8 1_2(24) -> 23 1_2(25) -> 24 1_2(27) -> 26 1_2(28) -> 36 1_2(30) -> 29 1_2(33) -> 32 1_2(34) -> 5 1_2(34) -> 8 1_2(36) -> 35 1_2(37) -> 36 1_2(39) -> 38 1_3(46) -> 31 1_3(48) -> 47 1_3(49) -> 48 1_3(51) -> 50 1_3(52) -> 48
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144