- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) [2] app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { app(app(mapbt,f),app(app(app(branch,x),l),r)) >= app(app(app(branch,app(f,x)), app(app(mapbt,f),l)), app(app(mapbt,f),r)) ; app(app(mapbt,f),app(leaf,x)) >= app(leaf,app(f,x)) ; Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app( app(app(branch, app(f,x)), app(app(mapbt,f),l)), app(app(mapbt,f),r)) ; Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app( app(mapbt, f),l) ; Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app( app(mapbt, f),r) ; Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app( app(branch, app(f,x)), app(app(mapbt,f),l)) ; Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app(f,x) ; Marked_app(app(mapbt,f),app(leaf,x)) >= Marked_app(f,x) ; } + Disjunctions:{ { Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) > Marked_app(app( app( branch, app(f,x)), app( app( mapbt, f), l)), app(app(mapbt,f),r)) ; } { Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) > Marked_app(app( mapbt, f), l) ; } { Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) > Marked_app(app( mapbt, f), r) ; } { Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) > Marked_app(app( branch, app(f,x)), app(app(mapbt,f),l)) ; } { Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) > Marked_app(f,x) ; } { Marked_app(app(mapbt,f),app(leaf,x)) > Marked_app(f,x) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: app(app(mapbt,f),app(app(app(branch,x),l),r)) >= app(app( app( branch, app(f,x)), app( app( mapbt, f), l)), app(app(mapbt,f), r)) constraint: app(app(mapbt,f),app(leaf,x)) >= app(leaf,app(f,x)) constraint: Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app( app( app( branch, app(f,x)), app( app( mapbt, f), l)), app( app( mapbt, f), r)) constraint: Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app( app( mapbt, f), l) constraint: Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app( app( mapbt, f), r) constraint: Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app( app( branch, app(f,x)), app( app( mapbt, f), l)) constraint: Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)) >= Marked_app( f, x) constraint: Marked_app(app(mapbt,f),app(leaf,x)) >= Marked_app(f,x) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_app -> 2 APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) [2] app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ app ] (X0,X1) = 2*X1*X0 + 2*X0; [ Marked_app ] (X0,X1) = 1*X0; [ mapbt ] () = 2; [ leaf ] () = 0; [ branch ] () = 0; removing < Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)),Marked_app(app(branch, app(f,x)), app(app(mapbt,f),l))>< Marked_app(app(mapbt,f),app(app(app(branch,x),l),r)),Marked_app(f,x)> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} ]} ]} Cime worked for 15.601219 seconds (real time) Cime Exit Status: 0