- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] a__f(a,b,X) -> a__f(X,X,mark(X)) [2] a__c -> a [3] a__c -> b [4] mark(f(X1,X2,X3)) -> a__f(X1,X2,mark(X3)) [5] mark(c) -> a__c [6] mark(a) -> a [7] mark(b) -> b [8] a__f(X1,X2,X3) -> f(X1,X2,X3) [9] a__c -> c 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: { a__f(a,b,X) >= a__f(X,X,mark(X)) ; a__f(X1,X2,X3) >= f(X1,X2,X3) ; mark(a) >= a ; mark(b) >= b ; mark(f(X1,X2,X3)) >= a__f(X1,X2,mark(X3)) ; mark(c) >= a__c ; a__c >= a ; a__c >= b ; a__c >= c ; Marked_a__f(a,b,X) >= Marked_a__f(X,X,mark(X)) ; Marked_a__f(a,b,X) >= Marked_mark(X) ; Marked_mark(f(X1,X2,X3)) >= Marked_a__f(X1,X2,mark(X3)) ; Marked_mark(f(X1,X2,X3)) >= Marked_mark(X3) ; } + Disjunctions:{ { Marked_a__f(a,b,X) > Marked_a__f(X,X,mark(X)) ; } { Marked_a__f(a,b,X) > Marked_mark(X) ; } { Marked_mark(f(X1,X2,X3)) > Marked_a__f(X1,X2,mark(X3)) ; } { Marked_mark(f(X1,X2,X3)) > Marked_mark(X3) ; } } === 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: a__f(a,b,X) >= a__f(X,X,mark(X)) constraint: a__f(X1,X2,X3) >= f(X1,X2,X3) constraint: mark(a) >= a constraint: mark(b) >= b constraint: mark(f(X1,X2,X3)) >= a__f(X1,X2,mark(X3)) constraint: mark(c) >= a__c constraint: a__c >= a constraint: a__c >= b constraint: a__c >= c constraint: Marked_a__f(a,b,X) >= Marked_a__f(X,X,mark(X)) constraint: Marked_a__f(a,b,X) >= Marked_mark(X) constraint: Marked_mark(f(X1,X2,X3)) >= Marked_a__f(X1,X2,mark(X3)) constraint: Marked_mark(f(X1,X2,X3)) >= Marked_mark(X3) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__f(a,b,X) >= a__f(X,X,mark(X)) ; a__f(X1,X2,X3) >= f(X1,X2,X3) ; mark(a) >= a ; mark(b) >= b ; mark(f(X1,X2,X3)) >= a__f(X1,X2,mark(X3)) ; mark(c) >= a__c ; a__c >= a ; a__c >= b ; a__c >= c ; Marked_a__f(a,b,X) >= Marked_a__f(X,X,mark(X)) ; } + Disjunctions:{ { Marked_a__f(a,b,X) > Marked_a__f(X,X,mark(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 : 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 (Simple graph) Found the following constraints: { a__f(a,b,X) >= a__f(X,X,mark(X)) ; a__f(X1,X2,X3) >= f(X1,X2,X3) ; mark(a) >= a ; mark(b) >= b ; mark(f(X1,X2,X3)) >= a__f(X1,X2,mark(X3)) ; mark(c) >= a__c ; a__c >= a ; a__c >= b ; a__c >= c ; Marked_a__f(a,b,X) > Marked_a__f(X,X,mark(X)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { a__f(a,b,X) >= a__f(X,X,mark(X)) ; a__f(X1,X2,X3) >= f(X1,X2,X3) ; mark(a) >= a ; mark(b) >= b ; mark(f(X1,X2,X3)) >= a__f(X1,X2,mark(X3)) ; mark(c) >= a__c ; a__c >= a ; a__c >= b ; a__c >= c ; Marked_a__f(a,b,X) > Marked_a__f(X,X,mark(X)) ; } + 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.(136 bt (112) [16]) === 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 0.414682 seconds (real time) Cime Exit Status: 0