- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] app(app(plus,0),y) -> y [2] app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) [3] app(app(times,0),y) -> 0 [4] app(app(times,app(s,x)),y) -> app(app(plus,app(app(times,x),y)),y) [5] app(app(map,f),nil) -> nil [6] app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) [7] inc -> app(map,app(plus,app(s,0))) [8] double -> app(map,app(times,app(s,app(s,0)))) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { app(app(plus,app(s,x)),y) >= app(s,app(app(plus,x),y)) ; app(app(plus,0),y) >= y ; app(app(times,app(s,x)),y) >= app(app(plus,app(app(times,x),y)),y) ; app(app(times,0),y) >= 0 ; app(app(map,f),app(app(cons,x),xs)) >= app(app(cons,app(f,x)), app(app(map,f),xs)) ; app(app(map,f),nil) >= nil ; inc >= app(map,app(plus,app(s,0))) ; double >= app(map,app(times,app(s,app(s,0)))) ; Marked_app(app(plus,app(s,x)),y) >= Marked_app(app(plus,x),y) ; Marked_app(app(times,app(s,x)),y) >= Marked_app(app(plus,app(app(times,x),y)), y) ; Marked_app(app(times,app(s,x)),y) >= Marked_app(app(times,x),y) ; Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(app(map,f),xs) ; Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(app(cons,app(f,x)), app(app(map,f),xs)) ; Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(f,x) ; } + Disjunctions:{ { Marked_app(app(plus,app(s,x)),y) > Marked_app(app(plus,x),y) ; } { Marked_app(app(times,app(s,x)),y) > Marked_app(app(plus,app(app(times,x),y)), y) ; } { Marked_app(app(times,app(s,x)),y) > Marked_app(app(times,x),y) ; } { Marked_app(app(map,f),app(app(cons,x),xs)) > Marked_app(app(map,f),xs) ; } { Marked_app(app(map,f),app(app(cons,x),xs)) > Marked_app(app(cons,app(f,x)), app(app(map,f),xs)) ; } { Marked_app(app(map,f),app(app(cons,x),xs)) > 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(plus,app(s,x)),y) >= app(s,app(app(plus,x),y)) constraint: app(app(plus,0),y) >= y constraint: app(app(times,app(s,x)),y) >= app(app(plus,app(app(times,x),y)),y) constraint: app(app(times,0),y) >= 0 constraint: app(app(map,f),app(app(cons,x),xs)) >= app(app(cons,app(f,x)), app(app(map,f),xs)) constraint: app(app(map,f),nil) >= nil constraint: inc >= app(map,app(plus,app(s,0))) constraint: double >= app(map,app(times,app(s,app(s,0)))) constraint: Marked_app(app(plus,app(s,x)),y) >= Marked_app(app(plus,x),y) constraint: Marked_app(app(times,app(s,x)),y) >= Marked_app(app(plus, app(app(times,x), y)),y) constraint: Marked_app(app(times,app(s,x)),y) >= Marked_app(app(times,x),y) constraint: Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app( app(map,f), xs) constraint: Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app( app(cons,app(f,x)), app(app(map,f),xs)) constraint: Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(f,x) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { app(app(plus,app(s,x)),y) >= app(s,app(app(plus,x),y)) ; app(app(plus,0),y) >= y ; app(app(times,app(s,x)),y) >= app(app(plus,app(app(times,x),y)),y) ; app(app(times,0),y) >= 0 ; app(app(map,f),app(app(cons,x),xs)) >= app(app(cons,app(f,x)), app(app(map,f),xs)) ; app(app(map,f),nil) >= nil ; inc >= app(map,app(plus,app(s,0))) ; double >= app(map,app(times,app(s,app(s,0)))) ; Marked_app(app(plus,app(s,x)),y) >= Marked_app(app(plus,x),y) ; Marked_app(app(times,app(s,x)),y) >= Marked_app(app(plus,app(app(times,x),y)), y) ; Marked_app(app(times,app(s,x)),y) >= Marked_app(app(times,x),y) ; Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(app(map,f),xs) ; Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(app(cons,app(f,x)), app(app(map,f),xs)) ; } + Disjunctions:{ { Marked_app(app(plus,app(s,x)),y) > Marked_app(app(plus,x),y) ; } { Marked_app(app(times,app(s,x)),y) > Marked_app(app(plus,app(app(times,x),y)), y) ; } { Marked_app(app(times,app(s,x)),y) > Marked_app(app(times,x),y) ; } { Marked_app(app(map,f),app(app(cons,x),xs)) > Marked_app(app(map,f),xs) ; } { Marked_app(app(map,f),app(app(cons,x),xs)) > Marked_app(app(cons,app(f,x)), app(app(map,f),xs)) ; } } === 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 : 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(plus,app(s,x)),y) >= app(s,app(app(plus,x),y)) constraint: app(app(plus,0),y) >= y constraint: app(app(times,app(s,x)),y) >= app(app(plus,app(app(times,x),y)),y) constraint: app(app(times,0),y) >= 0 constraint: app(app(map,f),app(app(cons,x),xs)) >= app(app(cons,app(f,x)), app(app(map,f),xs)) constraint: app(app(map,f),nil) >= nil constraint: inc >= app(map,app(plus,app(s,0))) constraint: double >= app(map,app(times,app(s,app(s,0)))) constraint: Marked_app(app(plus,app(s,x)),y) >= Marked_app(app(plus,x),y) constraint: Marked_app(app(times,app(s,x)),y) >= Marked_app(app(plus, app(app(times,x), y)),y) constraint: Marked_app(app(times,app(s,x)),y) >= Marked_app(app(times,x),y) constraint: Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app( app(map,f), xs) constraint: Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app( app(cons,app(f,x)), app(app(map,f),xs)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { app(app(plus,app(s,x)),y) >= app(s,app(app(plus,x),y)) ; app(app(plus,0),y) >= y ; app(app(times,app(s,x)),y) >= app(app(plus,app(app(times,x),y)),y) ; app(app(times,0),y) >= 0 ; app(app(map,f),app(app(cons,x),xs)) >= app(app(cons,app(f,x)), app(app(map,f),xs)) ; app(app(map,f),nil) >= nil ; inc >= app(map,app(plus,app(s,0))) ; double >= app(map,app(times,app(s,app(s,0)))) ; Marked_app(app(plus,app(s,x)),y) >= Marked_app(app(plus,x),y) ; Marked_app(app(times,app(s,x)),y) >= Marked_app(app(plus,app(app(times,x),y)), y) ; Marked_app(app(times,app(s,x)),y) >= Marked_app(app(times,x),y) ; Marked_app(app(map,f),app(app(cons,x),xs)) >= Marked_app(app(cons,app(f,x)), app(app(map,f),xs)) ; } + Disjunctions:{ { Marked_app(app(plus,app(s,x)),y) > Marked_app(app(plus,x),y) ; } { Marked_app(app(times,app(s,x)),y) > Marked_app(app(plus,app(app(times,x),y)), y) ; } { Marked_app(app(times,app(s,x)),y) > Marked_app(app(times,x),y) ; } { Marked_app(app(map,f),app(app(cons,x),xs)) > Marked_app(app(cons,app(f,x)), app(app(map,f),xs)) ; } } === 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 : 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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found 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 solver returned === STOPING TIMER real === === 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 12.555412 seconds (real time) Cime Exit Status: 0