- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] app(app(map_1,f),app(app(cons,h),t)) -> app(app(cons,app(f,h)),app(app(map_1,f),t)) [2] app(app(app(map_2,f),c),app(app(cons,h),t)) -> app(app(cons,app(app(f,h),c)),app(app(app(map_2,f),c),t)) [3] app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) -> app(app(cons,app(app(app(f,g),h),c)),app(app(app(app(map_3,f),g),c),t)) 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(app(app(map_3,f),g),c),app(app(cons,h),t)) >= app(app(cons, app(app( app(f,g), h), c)), app(app(app( app( map_3, f), g), c),t)) ; app(app(app(map_2,f),c),app(app(cons,h),t)) >= app(app(cons,app(app(f,h),c)), app(app(app(map_2,f),c),t)) ; app(app(map_1,f),app(app(cons,h),t)) >= app(app(cons,app(f,h)), app(app(map_1,f),t)) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) >= Marked_app( app(app( app( map_3, f), g), c),t) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) >= Marked_app( app(app(f,g), h),c) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) >= Marked_app( app(cons, app( app( app(f,g), h), c)), app(app( app( app( map_3, f), g), c), t)) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) >= Marked_app( app(f, g),h) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) >= Marked_app(app( app( map_2, f), c), t) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) >= Marked_app(app( cons, app( app( f, h), c)), app(app(app(map_2,f), c),t)) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) >= Marked_app(app(f,h),c) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) >= Marked_app(f,h) ; Marked_app(app(map_1,f),app(app(cons,h),t)) >= Marked_app(app(cons,app(f,h)), app(app(map_1,f),t)) ; Marked_app(app(map_1,f),app(app(cons,h),t)) >= Marked_app(app(map_1,f),t) ; Marked_app(app(map_1,f),app(app(cons,h),t)) >= Marked_app(f,h) ; } + Disjunctions:{ { Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(app( app( map_3, f), g), c),t) ; } { Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(app(f,g), h),c) ; } { Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(cons, app(app( app( f, g), h), c)), app(app( app( app( map_3, f), g), c), t)) ; } { Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(f, g),h) ; } { Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(app( app( map_2, f), c), t) ; } { Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(app( cons, app( app(f,h), c)), app(app(app(map_2,f),c), t)) ; } { Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(app(f,h),c) ; } { Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(f,h) ; } { Marked_app(app(map_1,f),app(app(cons,h),t)) > Marked_app(app(cons,app(f,h)), app(app(map_1,f),t)) ; } { Marked_app(app(map_1,f),app(app(cons,h),t)) > Marked_app(app(map_1,f),t) ; } { Marked_app(app(map_1,f),app(app(cons,h),t)) > Marked_app(f,h) ; } } === 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 : 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 === STOPING TIMER virtual === Time out for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat timeout reached === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (Simple graph) Found the following constraints: { app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) >= app(app(cons, app(app( app(f,g), h), c)), app(app(app( app( map_3, f), g), c),t)) ; app(app(app(map_2,f),c),app(app(cons,h),t)) >= app(app(cons,app(app(f,h),c)), app(app(app(map_2,f),c),t)) ; app(app(map_1,f),app(app(cons,h),t)) >= app(app(cons,app(f,h)), app(app(map_1,f),t)) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(app( app( map_3, f), g), c),t) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(app(f,g), h),c) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(cons, app(app( app( f, g), h), c)), app(app( app( app( map_3, f), g), c), t)) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(f, g),h) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(app( app( map_2, f), c), t) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(app( cons, app( app(f,h), c)), app(app(app(map_2,f),c), t)) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(app(f,h),c) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(f,h) ; Marked_app(app(map_1,f),app(app(cons,h),t)) > Marked_app(app(cons,app(f,h)), app(app(map_1,f),t)) ; Marked_app(app(map_1,f),app(app(cons,h),t)) > Marked_app(app(map_1,f),t) ; Marked_app(app(map_1,f),app(app(cons,h),t)) > Marked_app(f,h) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) >= app(app(cons, app(app( app(f,g), h), c)), app(app(app( app( map_3, f), g), c),t)) ; app(app(app(map_2,f),c),app(app(cons,h),t)) >= app(app(cons,app(app(f,h),c)), app(app(app(map_2,f),c),t)) ; app(app(map_1,f),app(app(cons,h),t)) >= app(app(cons,app(f,h)), app(app(map_1,f),t)) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(app( app( map_3, f), g), c),t) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(app(f,g), h),c) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(cons, app(app( app( f, g), h), c)), app(app( app( app( map_3, f), g), c), t)) ; Marked_app(app(app(app(map_3,f),g),c),app(app(cons,h),t)) > Marked_app( app(f, g),h) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(app( app( map_2, f), c), t) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(app( cons, app( app(f,h), c)), app(app(app(map_2,f),c), t)) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(app(f,h),c) ; Marked_app(app(app(map_2,f),c),app(app(cons,h),t)) > Marked_app(f,h) ; Marked_app(app(map_1,f),app(app(cons,h),t)) > Marked_app(app(cons,app(f,h)), app(app(map_1,f),t)) ; Marked_app(app(map_1,f),app(app(cons,h),t)) > Marked_app(app(map_1,f),t) ; Marked_app(app(map_1,f),app(app(cons,h),t)) > Marked_app(f,h) ; } + Disjunctions:{ } === 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 === No solution found for these parameters.(6 bt (0) [6]) === 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 timeout reached === STOPING TIMER virtual === Time out for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat timeout reached === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (ID_CRIT) NOT SOLVED No proof found Cime worked for 208.014522 seconds (real time) Cime Exit Status: 0