/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE * Step 1: Sum. MAYBE + Considered Problem: - Strict TRS: f(X) -> g(h(f(X))) - Signature: {f/1} / {g/1,h/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {g,h} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Sum. MAYBE + Considered Problem: - Strict TRS: f(X) -> g(h(f(X))) - Signature: {f/1} / {g/1,h/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {g,h} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 3: Ara. MAYBE + Considered Problem: - Strict TRS: f(X) -> g(h(f(X))) - Signature: {f/1} / {g/1,h/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {g,h} + Applied Processor: Ara {minDegree = 1, maxDegree = 3, araTimeout = 15, araRuleShifting = Just 1, isBestCase = True, mkCompletelyDefined = False, verboseOutput = False} + Details: Signatures used: ---------------- F (TrsFun "f") :: ["A"(0, 0, 1)] -(1)-> "A"(0, 0, 0) F (TrsFun "g") :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0) F (TrsFun "h") :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0) F (TrsFun "main") :: ["A"(0, 0, 1)] -(1)-> "A"(0, 0, 0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- Following Still Strict Rules were Typed as: ------------------------------------------- 1. Strict: f(X) -> g(h(f(X))) main(x1) -> f(x1) 2. Weak: MAYBE