- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] f(a,f(a,x)) -> f(c,f(b,x)) [2] f(b,f(b,x)) -> f(a,f(c,x)) [3] f(c,f(c,x)) -> f(b,f(a,x)) 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: { f(c,f(c,x)) >= f(b,f(a,x)) ; f(b,f(b,x)) >= f(a,f(c,x)) ; f(a,f(a,x)) >= f(c,f(b,x)) ; Marked_f(c,f(c,x)) >= Marked_f(b,f(a,x)) ; Marked_f(c,f(c,x)) >= Marked_f(a,x) ; Marked_f(b,f(b,x)) >= Marked_f(c,x) ; Marked_f(b,f(b,x)) >= Marked_f(a,f(c,x)) ; Marked_f(a,f(a,x)) >= Marked_f(c,f(b,x)) ; Marked_f(a,f(a,x)) >= Marked_f(b,x) ; } + Disjunctions:{ { Marked_f(c,f(c,x)) > Marked_f(b,f(a,x)) ; } { Marked_f(c,f(c,x)) > Marked_f(a,x) ; } { Marked_f(b,f(b,x)) > Marked_f(c,x) ; } { Marked_f(b,f(b,x)) > Marked_f(a,f(c,x)) ; } { Marked_f(a,f(a,x)) > Marked_f(c,f(b,x)) ; } { Marked_f(a,f(a,x)) > Marked_f(b,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: f(c,f(c,x)) >= f(b,f(a,x)) constraint: f(b,f(b,x)) >= f(a,f(c,x)) constraint: f(a,f(a,x)) >= f(c,f(b,x)) constraint: Marked_f(c,f(c,x)) >= Marked_f(b,f(a,x)) constraint: Marked_f(c,f(c,x)) >= Marked_f(a,x) constraint: Marked_f(b,f(b,x)) >= Marked_f(c,x) constraint: Marked_f(b,f(b,x)) >= Marked_f(a,f(c,x)) constraint: Marked_f(a,f(a,x)) >= Marked_f(c,f(b,x)) constraint: Marked_f(a,f(a,x)) >= Marked_f(b,x) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { f(c,f(c,x)) >= f(b,f(a,x)) ; f(b,f(b,x)) >= f(a,f(c,x)) ; f(a,f(a,x)) >= f(c,f(b,x)) ; Marked_f(c,f(c,x)) >= Marked_f(b,f(a,x)) ; Marked_f(b,f(b,x)) >= Marked_f(a,f(c,x)) ; Marked_f(a,f(a,x)) >= Marked_f(c,f(b,x)) ; } + Disjunctions:{ { Marked_f(c,f(c,x)) > Marked_f(b,f(a,x)) ; } { Marked_f(b,f(b,x)) > Marked_f(a,f(c,x)) ; } { Marked_f(a,f(a,x)) > Marked_f(c,f(b,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 : 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: { f(c,f(c,x)) >= f(b,f(a,x)) ; f(b,f(b,x)) >= f(a,f(c,x)) ; f(a,f(a,x)) >= f(c,f(b,x)) ; Marked_f(c,f(c,x)) >= Marked_f(b,f(a,x)) ; Marked_f(b,f(b,x)) >= Marked_f(a,f(c,x)) ; Marked_f(a,f(a,x)) > Marked_f(c,f(b,x)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { f(c,f(c,x)) >= f(b,f(a,x)) ; f(b,f(b,x)) >= f(a,f(c,x)) ; f(a,f(a,x)) >= f(c,f(b,x)) ; Marked_f(c,f(c,x)) >= Marked_f(b,f(a,x)) ; Marked_f(b,f(b,x)) >= Marked_f(a,f(c,x)) ; Marked_f(a,f(a,x)) > Marked_f(c,f(b,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.(10 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 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 1.544254 seconds (real time) Cime Exit Status: 0