- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] app(app(lt,app(s,x)),app(s,y)) -> app(app(lt,x),y) [2] app(app(lt,0),app(s,y)) -> true [3] app(app(lt,y),0) -> false [4] app(app(eq,x),x) -> true [5] app(app(eq,app(s,x)),0) -> false [6] app(app(eq,0),app(s,x)) -> false [7] app(app(member,w),null) -> false [8] app(app(member,w),app(app(app(fork,x),y),z)) -> app(app(app(if,app(app(lt,w),y)),app(app(member,w),x)), app(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z))) 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(lt,app(s,x)),app(s,y)) >= app(app(lt,x),y) ; app(app(lt,0),app(s,y)) >= true ; app(app(lt,y),0) >= false ; app(app(eq,app(s,x)),0) >= false ; app(app(eq,0),app(s,x)) >= false ; app(app(eq,x),x) >= true ; app(app(member,w),app(app(app(fork,x),y),z)) >= app(app(app(if, app(app(lt,w),y)), app(app(member,w),x)), app(app(app(if, app(app(eq,w),y)), true), app(app(member,w),z))) ; app(app(member,w),null) >= false ; Marked_app(app(lt,app(s,x)),app(s,y)) >= Marked_app(app(lt,x),y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app(app( if, app( app( eq, w), y)), true), app(app(member,w),z))) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( app( if, app( app( eq, w), y)), true), app(app(member,w),z)) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app(lt,w), y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app(eq,w), y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), x) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), z) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( if, app( app( lt, w), y)), app(app(member,w),x)) ; } + Disjunctions:{ { Marked_app(app(lt,app(s,x)),app(s,y)) > Marked_app(app(lt,x),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app(app( if, app( app(eq,w), y)), true), app(app(member,w),z))) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( app( if, app( app( eq, w), y)), true), app(app(member,w),z)) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app(lt,w),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app(eq,w),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), x) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), z) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( if, app( app( lt, w), y)), app(app(member,w),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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: app(app(lt,app(s,x)),app(s,y)) >= app(app(lt,x),y) constraint: app(app(lt,0),app(s,y)) >= true constraint: app(app(lt,y),0) >= false constraint: app(app(eq,app(s,x)),0) >= false constraint: app(app(eq,0),app(s,x)) >= false constraint: app(app(eq,x),x) >= true constraint: app(app(member,w),app(app(app(fork,x),y),z)) >= app(app(app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app( app( if, app( app( eq, w), y)), true), app(app(member,w), z))) constraint: app(app(member,w),null) >= false constraint: Marked_app(app(lt,app(s,x)),app(s,y)) >= Marked_app(app(lt,x),y) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app( app( app( if, app( app( eq, w), y)), true), app( app( member, w), z))) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( app( if, app( app( eq, w), y)), true), app( app( member, w), z)) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( lt, w), y) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( eq, w), y) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( member, w), x) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( member, w), z) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( if, app( app( lt, w), y)), app( app( member, w), x)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { app(app(lt,app(s,x)),app(s,y)) >= app(app(lt,x),y) ; app(app(lt,0),app(s,y)) >= true ; app(app(lt,y),0) >= false ; app(app(eq,app(s,x)),0) >= false ; app(app(eq,0),app(s,x)) >= false ; app(app(eq,x),x) >= true ; app(app(member,w),app(app(app(fork,x),y),z)) >= app(app(app(if, app(app(lt,w),y)), app(app(member,w),x)), app(app(app(if, app(app(eq,w),y)), true), app(app(member,w),z))) ; app(app(member,w),null) >= false ; Marked_app(app(lt,app(s,x)),app(s,y)) >= Marked_app(app(lt,x),y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app(app( if, app( app( eq, w), y)), true), app(app(member,w),z))) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( app( if, app( app( eq, w), y)), true), app(app(member,w),z)) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app(lt,w), y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app(eq,w), y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), x) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), z) ; } + Disjunctions:{ { Marked_app(app(lt,app(s,x)),app(s,y)) > Marked_app(app(lt,x),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app(app( if, app( app(eq,w), y)), true), app(app(member,w),z))) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( app( if, app( app( eq, w), y)), true), app(app(member,w),z)) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app(lt,w),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app(eq,w),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), x) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), z) ; } } === 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: app(app(lt,app(s,x)),app(s,y)) >= app(app(lt,x),y) constraint: app(app(lt,0),app(s,y)) >= true constraint: app(app(lt,y),0) >= false constraint: app(app(eq,app(s,x)),0) >= false constraint: app(app(eq,0),app(s,x)) >= false constraint: app(app(eq,x),x) >= true constraint: app(app(member,w),app(app(app(fork,x),y),z)) >= app(app(app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app( app( if, app( app( eq, w), y)), true), app(app(member,w), z))) constraint: app(app(member,w),null) >= false constraint: Marked_app(app(lt,app(s,x)),app(s,y)) >= Marked_app(app(lt,x),y) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app( app( app( if, app( app( eq, w), y)), true), app( app( member, w), z))) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( app( if, app( app( eq, w), y)), true), app( app( member, w), z)) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( lt, w), y) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( eq, w), y) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( member, w), x) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( member, w), z) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { app(app(lt,app(s,x)),app(s,y)) >= app(app(lt,x),y) ; app(app(lt,0),app(s,y)) >= true ; app(app(lt,y),0) >= false ; app(app(eq,app(s,x)),0) >= false ; app(app(eq,0),app(s,x)) >= false ; app(app(eq,x),x) >= true ; app(app(member,w),app(app(app(fork,x),y),z)) >= app(app(app(if, app(app(lt,w),y)), app(app(member,w),x)), app(app(app(if, app(app(eq,w),y)), true), app(app(member,w),z))) ; app(app(member,w),null) >= false ; Marked_app(app(lt,app(s,x)),app(s,y)) >= Marked_app(app(lt,x),y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app(app( if, app( app( eq, w), y)), true), app(app(member,w),z))) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( app( if, app( app( eq, w), y)), true), app(app(member,w),z)) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app(lt,w), y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), x) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), z) ; } + Disjunctions:{ { Marked_app(app(lt,app(s,x)),app(s,y)) > Marked_app(app(lt,x),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app(app( if, app( app(eq,w), y)), true), app(app(member,w),z))) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( app( if, app( app( eq, w), y)), true), app(app(member,w),z)) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app(lt,w),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), x) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), z) ; } } === 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: app(app(lt,app(s,x)),app(s,y)) >= app(app(lt,x),y) constraint: app(app(lt,0),app(s,y)) >= true constraint: app(app(lt,y),0) >= false constraint: app(app(eq,app(s,x)),0) >= false constraint: app(app(eq,0),app(s,x)) >= false constraint: app(app(eq,x),x) >= true constraint: app(app(member,w),app(app(app(fork,x),y),z)) >= app(app(app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app( app( if, app( app( eq, w), y)), true), app(app(member,w), z))) constraint: app(app(member,w),null) >= false constraint: Marked_app(app(lt,app(s,x)),app(s,y)) >= Marked_app(app(lt,x),y) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app( app( app( if, app( app( eq, w), y)), true), app( app( member, w), z))) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( app( if, app( app( eq, w), y)), true), app( app( member, w), z)) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( lt, w), y) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( member, w), x) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( member, w), z) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { app(app(lt,app(s,x)),app(s,y)) >= app(app(lt,x),y) ; app(app(lt,0),app(s,y)) >= true ; app(app(lt,y),0) >= false ; app(app(eq,app(s,x)),0) >= false ; app(app(eq,0),app(s,x)) >= false ; app(app(eq,x),x) >= true ; app(app(member,w),app(app(app(fork,x),y),z)) >= app(app(app(if, app(app(lt,w),y)), app(app(member,w),x)), app(app(app(if, app(app(eq,w),y)), true), app(app(member,w),z))) ; app(app(member,w),null) >= false ; Marked_app(app(lt,app(s,x)),app(s,y)) >= Marked_app(app(lt,x),y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app(app( if, app( app( eq, w), y)), true), app(app(member,w),z))) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( app( if, app( app( eq, w), y)), true), app(app(member,w),z)) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), x) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), z) ; } + Disjunctions:{ { Marked_app(app(lt,app(s,x)),app(s,y)) > Marked_app(app(lt,x),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app(app( if, app( app(eq,w), y)), true), app(app(member,w),z))) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( app( if, app( app( eq, w), y)), true), app(app(member,w),z)) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), x) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), z) ; } } === 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: app(app(lt,app(s,x)),app(s,y)) >= app(app(lt,x),y) constraint: app(app(lt,0),app(s,y)) >= true constraint: app(app(lt,y),0) >= false constraint: app(app(eq,app(s,x)),0) >= false constraint: app(app(eq,0),app(s,x)) >= false constraint: app(app(eq,x),x) >= true constraint: app(app(member,w),app(app(app(fork,x),y),z)) >= app(app(app( if, app( app( lt, w), y)), app( app( member, w), x)), app(app( app( if, app( app( eq, w), y)), true), app(app(member,w), z))) constraint: app(app(member,w),null) >= false constraint: Marked_app(app(lt,app(s,x)),app(s,y)) >= Marked_app(app(lt,x),y) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( app( if, app( app( lt, w), y)), app( app( member, w), x)), app( app( app( if, app( app( eq, w), y)), true), app( app( member, w), z))) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( app( if, app( app( eq, w), y)), true), app( app( member, w), z)) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( member, w), x) constraint: Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app( app( member, w), z) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { app(app(lt,app(s,x)),app(s,y)) >= app(app(lt,x),y) ; app(app(lt,0),app(s,y)) >= true ; app(app(lt,y),0) >= false ; app(app(eq,app(s,x)),0) >= false ; app(app(eq,0),app(s,x)) >= false ; app(app(eq,x),x) >= true ; app(app(member,w),app(app(app(fork,x),y),z)) >= app(app(app(if, app(app(lt,w),y)), app(app(member,w),x)), app(app(app(if, app(app(eq,w),y)), true), app(app(member,w),z))) ; app(app(member,w),null) >= false ; Marked_app(app(lt,app(s,x)),app(s,y)) >= Marked_app(app(lt,x),y) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), x) ; Marked_app(app(member,w),app(app(app(fork,x),y),z)) >= Marked_app(app( member, w), z) ; } + Disjunctions:{ { Marked_app(app(lt,app(s,x)),app(s,y)) > Marked_app(app(lt,x),y) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), x) ; } { Marked_app(app(member,w),app(app(app(fork,x),y),z)) > Marked_app(app( member, w), z) ; } } === 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 : 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 (ID_CRIT) NOT SOLVED No proof found Cime worked for 96.861911 seconds (real time) Cime Exit Status: 0