%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : NUM862+1 : TPTP v8.1.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n025.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Jul 27 13:10:07 EDT 2022 % Result : Timeout 299.88s 300.06s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : NUM862+1 : TPTP v8.1.0. Released v4.1.0. % 0.12/0.13 % Command : otter-tptp-script %s % 0.12/0.34 % Computer : n025.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Wed Jul 27 10:05:15 EDT 2022 % 0.12/0.34 % CPUTime : % 1.99/2.19 ----- Otter 3.3f, August 2004 ----- % 1.99/2.19 The process was started by sandbox on n025.cluster.edu, % 1.99/2.19 Wed Jul 27 10:05:15 2022 % 1.99/2.19 The command was "./otter". The process ID is 10206. % 1.99/2.19 % 1.99/2.19 set(prolog_style_variables). % 1.99/2.19 set(auto). % 1.99/2.19 dependent: set(auto1). % 1.99/2.19 dependent: set(process_input). % 1.99/2.19 dependent: clear(print_kept). % 1.99/2.19 dependent: clear(print_new_demod). % 1.99/2.19 dependent: clear(print_back_demod). % 1.99/2.19 dependent: clear(print_back_sub). % 1.99/2.19 dependent: set(control_memory). % 1.99/2.19 dependent: assign(max_mem, 12000). % 1.99/2.19 dependent: assign(pick_given_ratio, 4). % 1.99/2.19 dependent: assign(stats_level, 1). % 1.99/2.19 dependent: assign(max_seconds, 10800). % 1.99/2.19 clear(print_given). % 1.99/2.19 % 1.99/2.19 formula_list(usable). % 1.99/2.19 all A (A=A). % 1.99/2.19 all X lesse_q(X,X). % 1.99/2.19 all X Y Z (lesse_q(X,Y)&lesse_q(Y,Z)->lesse_q(X,Z)). % 1.99/2.19 all X Y (lesse_q(X,Y)&lesse_q(Y,X)->X=Y). % 1.99/2.19 all X Y (lesse_q(X,Y)|lesse_q(Y,X)). % 1.99/2.19 all X Y Z (lesse_q(X,Y)<->lesse_q(sum(Z,X),sum(Z,Y))). % 1.99/2.19 all X Y (lesse_q(X,Y)<->lesse_q(summation(X),summation(Y))). % 1.99/2.19 all X Y (max(X,Y)=X| -lesse_q(Y,X)). % 1.99/2.19 all X Y (max(X,Y)=Y| -lesse_q(X,Y)). % 1.99/2.19 all X Y Z (ub(X,Y,Z)<->lesse_q(X,Z)&lesse_q(Y,Z)). % 1.99/2.19 all X Y N (model_max(X,Y,N)<->lesse_q(sum(c,summation(max(X,Y))),N)). % 1.99/2.19 all X Y N (model_ub(X,Y,N)<-> (exists Z (ub(X,Y,Z)&lesse_q(sum(c,summation(Z)),N)))). % 1.99/2.19 all X Y N (minsol_model_max(X,Y,N)<->model_max(X,Y,N)& (all Z (model_max(X,Y,Z)->lesse_q(N,Z)))). % 1.99/2.19 all X Y N (minsol_model_ub(X,Y,N)<->model_ub(X,Y,N)& (all Z (model_ub(X,Y,Z)->lesse_q(N,Z)))). % 1.99/2.19 -(all X Y Z (minsol_model_ub(X,Y,Z)<->minsol_model_max(X,Y,Z))). % 1.99/2.19 end_of_list. % 1.99/2.19 % 1.99/2.19 -------> usable clausifies to: % 1.99/2.19 % 1.99/2.19 list(usable). % 1.99/2.19 0 [] A=A. % 1.99/2.19 0 [] lesse_q(X,X). % 1.99/2.19 0 [] -lesse_q(X,Y)| -lesse_q(Y,Z)|lesse_q(X,Z). % 1.99/2.19 0 [] -lesse_q(X,Y)| -lesse_q(Y,X)|X=Y. % 1.99/2.19 0 [] lesse_q(X,Y)|lesse_q(Y,X). % 1.99/2.19 0 [] -lesse_q(X,Y)|lesse_q(sum(Z,X),sum(Z,Y)). % 1.99/2.19 0 [] lesse_q(X,Y)| -lesse_q(sum(Z,X),sum(Z,Y)). % 1.99/2.19 0 [] -lesse_q(X,Y)|lesse_q(summation(X),summation(Y)). % 1.99/2.19 0 [] lesse_q(X,Y)| -lesse_q(summation(X),summation(Y)). % 1.99/2.19 0 [] max(X,Y)=X| -lesse_q(Y,X). % 1.99/2.19 0 [] max(X,Y)=Y| -lesse_q(X,Y). % 1.99/2.19 0 [] -ub(X,Y,Z)|lesse_q(X,Z). % 1.99/2.19 0 [] -ub(X,Y,Z)|lesse_q(Y,Z). % 1.99/2.19 0 [] ub(X,Y,Z)| -lesse_q(X,Z)| -lesse_q(Y,Z). % 1.99/2.19 0 [] -model_max(X,Y,N)|lesse_q(sum(c,summation(max(X,Y))),N). % 1.99/2.19 0 [] model_max(X,Y,N)| -lesse_q(sum(c,summation(max(X,Y))),N). % 1.99/2.19 0 [] -model_ub(X,Y,N)|ub(X,Y,$f1(X,Y,N)). % 1.99/2.19 0 [] -model_ub(X,Y,N)|lesse_q(sum(c,summation($f1(X,Y,N))),N). % 1.99/2.19 0 [] model_ub(X,Y,N)| -ub(X,Y,Z)| -lesse_q(sum(c,summation(Z)),N). % 1.99/2.19 0 [] -minsol_model_max(X,Y,N)|model_max(X,Y,N). % 1.99/2.19 0 [] -minsol_model_max(X,Y,N)| -model_max(X,Y,Z)|lesse_q(N,Z). % 1.99/2.19 0 [] minsol_model_max(X,Y,N)| -model_max(X,Y,N)|model_max(X,Y,$f2(X,Y,N)). % 1.99/2.19 0 [] minsol_model_max(X,Y,N)| -model_max(X,Y,N)| -lesse_q(N,$f2(X,Y,N)). % 1.99/2.19 0 [] -minsol_model_ub(X,Y,N)|model_ub(X,Y,N). % 1.99/2.19 0 [] -minsol_model_ub(X,Y,N)| -model_ub(X,Y,Z)|lesse_q(N,Z). % 1.99/2.19 0 [] minsol_model_ub(X,Y,N)| -model_ub(X,Y,N)|model_ub(X,Y,$f3(X,Y,N)). % 1.99/2.19 0 [] minsol_model_ub(X,Y,N)| -model_ub(X,Y,N)| -lesse_q(N,$f3(X,Y,N)). % 1.99/2.19 0 [] minsol_model_ub($c3,$c2,$c1)|minsol_model_max($c3,$c2,$c1). % 1.99/2.19 0 [] -minsol_model_ub($c3,$c2,$c1)| -minsol_model_max($c3,$c2,$c1). % 1.99/2.19 end_of_list. % 1.99/2.19 % 1.99/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3. % 1.99/2.19 % 1.99/2.19 This ia a non-Horn set with equality. The strategy will be % 1.99/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit % 1.99/2.19 deletion, with positive clauses in sos and nonpositive % 1.99/2.19 clauses in usable. % 1.99/2.19 % 1.99/2.19 dependent: set(knuth_bendix). % 1.99/2.19 dependent: set(anl_eq). % 1.99/2.19 dependent: set(para_from). % 1.99/2.19 dependent: set(para_into). % 1.99/2.19 dependent: clear(para_from_right). % 1.99/2.19 dependent: clear(para_into_right). % 1.99/2.19 dependent: set(para_from_vars). % 1.99/2.19 dependent: set(eq_units_both_ways). % 1.99/2.19 dependent: set(dynamic_demod_all). % 1.99/2.19 dependent: set(dynamic_demod). % 1.99/2.19 dependent: set(order_eq). % 1.99/2.19 dependent: set(back_demod). % 1.99/2.19 dependent: set(lrpo). % 1.99/2.19 dependent: set(hyper_res). % 1.99/2.19 dependent: set(unit_deletion). % 1.99/2.19 dependent: set(factor). % 1.99/2.19 % 1.99/2.19 ------------> process usable: % 1.99/2.19 ** KEPT (pick-wt=9): 1 [] -lesse_q(A,B)| -lesse_q(B,C)|lesse_q(A,C). % 1.99/2.19 ** KEPT (pick-wt=9): 2 [] -lesse_q(A,B)| -lesse_q(B,A)|A=B. % 1.99/2.19 ** KEPT (pick-wt=10): 3 [] -lesse_q(A,B)|lesse_q(sum(C,A),sum(C,B)). % 1.99/2.19 ** KEPT (pick-wt=10): 4 [] lesse_q(A,B)| -lesse_q(sum(C,A),sum(C,B)). % 1.99/2.19 ** KEPT (picAlarm clock % 299.88/300.06 Otter interrupted % 299.88/300.06 PROOF NOT FOUND %------------------------------------------------------------------------------