TSTP Solution File: SWV125+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV125+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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 : 600s
% DateTime : Wed Jul 20 21:10:36 EDT 2022
% Result : Timeout 300.02s 300.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV125+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 15 04:37:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.86/1.17 ============================== Prover9 ===============================
% 0.86/1.17 Prover9 (32) version 2009-11A, November 2009.
% 0.86/1.17 Process 20306 was started by sandbox2 on n018.cluster.edu,
% 0.86/1.17 Wed Jun 15 04:37:45 2022
% 0.86/1.17 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20153_n018.cluster.edu".
% 0.86/1.17 ============================== end of head ===========================
% 0.86/1.17
% 0.86/1.17 ============================== INPUT =================================
% 0.86/1.17
% 0.86/1.17 % Reading from file /tmp/Prover9_20153_n018.cluster.edu
% 0.86/1.17
% 0.86/1.17 set(prolog_style_variables).
% 0.86/1.17 set(auto2).
% 0.86/1.17 % set(auto2) -> set(auto).
% 0.86/1.17 % set(auto) -> set(auto_inference).
% 0.86/1.17 % set(auto) -> set(auto_setup).
% 0.86/1.17 % set(auto_setup) -> set(predicate_elim).
% 0.86/1.17 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.86/1.17 % set(auto) -> set(auto_limits).
% 0.86/1.17 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.86/1.17 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.86/1.17 % set(auto) -> set(auto_denials).
% 0.86/1.17 % set(auto) -> set(auto_process).
% 0.86/1.17 % set(auto2) -> assign(new_constants, 1).
% 0.86/1.17 % set(auto2) -> assign(fold_denial_max, 3).
% 0.86/1.17 % set(auto2) -> assign(max_weight, "200.000").
% 0.86/1.17 % set(auto2) -> assign(max_hours, 1).
% 0.86/1.17 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.86/1.17 % set(auto2) -> assign(max_seconds, 0).
% 0.86/1.17 % set(auto2) -> assign(max_minutes, 5).
% 0.86/1.17 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.86/1.17 % set(auto2) -> set(sort_initial_sos).
% 0.86/1.17 % set(auto2) -> assign(sos_limit, -1).
% 0.86/1.17 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.86/1.17 % set(auto2) -> assign(max_megs, 400).
% 0.86/1.17 % set(auto2) -> assign(stats, some).
% 0.86/1.17 % set(auto2) -> clear(echo_input).
% 0.86/1.17 % set(auto2) -> set(quiet).
% 0.86/1.17 % set(auto2) -> clear(print_initial_clauses).
% 0.86/1.17 % set(auto2) -> clear(print_given).
% 0.86/1.17 assign(lrs_ticks,-1).
% 0.86/1.17 assign(sos_limit,10000).
% 0.86/1.17 assign(order,kbo).
% 0.86/1.17 set(lex_order_vars).
% 0.86/1.17 clear(print_given).
% 0.86/1.17
% 0.86/1.17 % formulas(sos). % not echoed (121 formulas)
% 0.86/1.17
% 0.86/1.17 ============================== end of input ==========================
% 0.86/1.17
% 0.86/1.17 % From the command line: assign(max_seconds, 300).
% 0.86/1.17
% 0.86/1.17 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.86/1.17
% 0.86/1.17 % Formulas that are not ordinary clauses:
% 0.86/1.17 1 (all X all Y (gt(X,Y) | gt(Y,X) | X = Y)) # label(totality) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 2 (all X all Y all Z (gt(X,Y) & gt(Y,Z) -> gt(X,Z))) # label(transitivity_gt) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 3 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 4 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 5 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(transitivity_leq) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 6 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 7 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 8 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 9 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 10 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 11 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 12 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 13 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 14 (all X all C (leq(n0,X) -> leq(uniform_int_rnd(C,X),X))) # label(uniform_int_rand_ranges_hi) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 15 (all X all C (leq(n0,X) -> leq(n0,uniform_int_rnd(C,X)))) # label(uniform_int_rand_ranges_lo) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 16 (all I all L all U all Val (leq(L,I) & leq(I,U) -> a_select2(tptp_const_array1(dim(L,U),Val),I) = Val)) # label(const_array1_select) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 17 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L1,I) & leq(I,U1) & leq(L2,J) & leq(J,U2) -> a_select3(tptp_const_array2(dim(L1,U1),dim(L2,U2),Val),I,J) = Val)) # label(const_array2_select) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 18 (all A all N ((all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(trans(A),I,J) = a_select3(trans(A),J,I))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 19 (all A all N ((all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(inv(A),I,J) = a_select3(inv(A),J,I))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 20 (all A all N ((all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J all K all VAL (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,K) & leq(K,N) -> a_select3(tptp_update3(A,K,K,VAL),I,J) = a_select3(tptp_update3(A,K,K,VAL),J,I))))) # label(matrix_symm_update_diagonal) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 21 (all A all B all N ((all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(tptp_madd(A,B),I,J) = a_select3(tptp_madd(A,B),J,I))))) # label(matrix_symm_add) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 22 (all A all B all N ((all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(tptp_msub(A,B),I,J) = a_select3(tptp_msub(A,B),J,I))))) # label(matrix_symm_sub) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 23 (all A all B all N ((all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I))))) # label(matrix_symm_aba1) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 24 (all A all B all N all M ((all I all J (leq(n0,I) & leq(I,M) & leq(n0,J) & leq(J,M) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I))))) # label(matrix_symm_aba2) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 25 (all A all B all C all D all E all F all N all M ((all I all J (leq(n0,I) & leq(I,M) & leq(n0,J) & leq(J,M) -> a_select3(D,I,J) = a_select3(D,J,I))) & (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(F,I,J) = a_select3(F,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),I,J) = a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),J,I))))) # label(matrix_symm_joseph_update) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 26 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 27 (all Body tptp_float_0_0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base_float) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 28 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 29 (all X plus(n1,X) = succ(X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 30 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 31 (all X plus(n2,X) = succ(succ(X))) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 32 (all X plus(X,n3) = succ(succ(succ(X)))) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 33 (all X plus(n3,X) = succ(succ(succ(X)))) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 34 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 35 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 36 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 37 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 38 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 39 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 40 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 41 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 42 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 43 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 44 (all X all U all V all VAL a_select3(tptp_update3(X,U,V,VAL),U,V) = VAL) # label(sel3_update_1) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 45 (all I all J all U all V all X all VAL all VAL2 (I != U & J = V & a_select3(X,U,V) = VAL -> a_select3(tptp_update3(X,I,J,VAL2),U,V) = VAL)) # label(sel3_update_2) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 46 (all I all J all U all V all X all VAL ((all I0 all J0 (leq(n0,I0) & leq(n0,J0) & leq(I0,U) & leq(J0,V) -> a_select3(X,I0,J0) = VAL)) & leq(n0,I) & leq(I,U) & leq(n0,J) & leq(J,V) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 47 (all X all U all VAL a_select2(tptp_update2(X,U,VAL),U) = VAL) # label(sel2_update_1) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 48 (all I all U all X all VAL all VAL2 (I != U & a_select2(X,U) = VAL -> a_select2(tptp_update2(X,I,VAL2),U) = VAL)) # label(sel2_update_2) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 49 (all I all U all X all VAL ((all I0 (leq(n0,I0) & leq(I0,U) -> a_select2(X,I0) = VAL)) & leq(n0,I) & leq(I,U) -> a_select2(tptp_update2(X,U,VAL),I) = VAL)) # label(sel2_update_3) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 50 (all X (leq(n0,X) & leq(X,n4) -> X = n0 | X = n1 | X = n2 | X = n3 | X = n4)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 51 (all X (leq(n0,X) & leq(X,n5) -> X = n0 | X = n1 | X = n2 | X = n3 | X = n4 | X = n5)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 52 (all X (leq(n0,X) & leq(X,n6) -> X = n0 | X = n1 | X = n2 | X = n3 | X = n4 | X = n5 | X = n6)) # label(finite_domain_6) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 53 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 54 (all X (leq(n0,X) & leq(X,n1) -> X = n0 | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 55 (all X (leq(n0,X) & leq(X,n2) -> X = n0 | X = n1 | X = n2)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 56 (all X (leq(n0,X) & leq(X,n3) -> X = n0 | X = n1 | X = n2 | X = n3)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.25 57 -(geq(minus(n4,n1),n0) & geq(minus(n1000,n1),n0) -> (all A (geq(n7,n0) & geq(minus(n1000,n1),n0) -> (all B ((true -> true) & (true -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n0,minus(n1000,n1)) & leq(n1,n7) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n4,n1)) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7)) & (leq(n0,pv5) & leq(n0,pv21) & leq(pv5,n588) & leq(pv21,minus(n6,n1)) -> leq(n0,n0) & leq(n0,pv5) & leq(n0,pv21) & leq(pv5,n588) & leq(pv21,n5) & leq(pv21,minus(n6,n1))) & (leq(n0,pv5) & leq(n0,pv31) & leq(n0,pv32) & leq(pv5,n588) & leq(pv31,minus(n6,n1)) & leq(pv32,minus(n6,n1)) -> (pv31 != pv32 -> leq(n0,pv5) & leq(n0,pv31) & leq(n0,pv32) & leq(pv5,n588) & leq(pv31,minus(n6,n1)) & leq(pv32,minus(n6,n1))) & (pv31 = pv32 -> leq(n0,pv5) & leq(n0,pv31) & leq(n0,pv32) & leq(pv5,n588) & leq(pv31,minus(n6,n1)) & leq(pv32,minus(n6,n1)))) & (leq(n0,pv5) & leq(n0,pv31) & leq(pv5,n588) & leq(pv31,minus(n6,n1)) -> leq(n0,pv5) & leq(n0,pv31) & leq(pv5,n588) & leq(pv31,minus(n6,n1))) & (leq(n0,pv5) & leq(n0,pv31) & leq(pv5,n588) & leq(pv31,minus(n6,n1)) -> leq(n0,pv5) & leq(pv5,n588)) & (leq(n0,pv5) & leq(pv5,n588) -> true) & (leq(n0,pv5) & leq(pv5,n588) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,minus(n4,n1)) & leq(pv5,minus(n1000,n1)) & (-gt(pv5,n0) -> (-gt(pv5,n0) -> (-gt(pv5,n0) -> (-gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n4,n1)) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1)))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n1,minus(n4,n1)) & leq(n2,minus(n4,n1)) & leq(n3,minus(n4,n1)) & leq(pv5,minus(n1000,n1)) & (-gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n4,n1)) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n2,n7) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n5,n7) & leq(n6,n7) & leq(n7,n7) & leq(pv5,minus(n1000,n1)) & (-gt(pv5,n0) -> (-gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n4,n1)) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1)))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n1,minus(n4,n1)) & leq(n2,minus(n4,n1)) & leq(n3,minus(n4,n1)) & leq(pv5,minus(n1000,n1)) & (-gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n4,n1)) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1)))))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,minus(n1000,n1)) & (-gt(pv5,n0) -> (-gt(pv5,n0) -> (-gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n4,n1)) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1)))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n1,minus(n4,n1)) & leq(n2,minus(n4,n1)) & leq(n3,minus(n4,n1)) & leq(pv5,minus(n1000,n1)) & (-gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n4,n1)) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n2,n7) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n5,n7) & leq(n6,n7) & leq(n7,n7) & leq(pv5,minus(n1000,n1)) & (-gt(pv5,n0) -> (-gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n4,n1)) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1)))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n1,minus(n4,n1)) & leq(n2,minus(n4,n1)) & leq(n3,minus(n4,n1)) & leq(pv5,minus(n1000,n1)) & (-gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))) & (gt(pv5,n0) -> leq(n0,n0) & leq(n0,n1) & leq(n0,n2) & leq(n0,n3) & leq(n0,n4) & leq(n0,n5) & leq(n0,n6) & leq(n0,n7) & leq(n0,pv5) & leq(n0,minus(n4,n1)) & leq(n0,minus(n6,n1)) & leq(n1,n7) & leq(n1,minus(n4,n1)) & leq(n1,minus(n6,n1)) & leq(n2,n7) & leq(n2,minus(n4,n1)) & leq(n2,minus(n6,n1)) & leq(n3,n7) & leq(n3,minus(n4,n1)) & leq(n3,minus(n6,n1)) & leq(n4,n7) & leq(n4,minus(n6,n1)) & leq(n5,n7) & leq(n5,minus(n6,n1)) & leq(n6,n7) & leq(n7,n7) & leq(pv5,n588) & leq(pv5,minus(n1000,n1))))))) & (leq(n0,pv5) & leq(pv5,n588) -> leq(n0,pv5) & leq(pv5,n588)) & (leq(n0,pv23) & leq(pv23,minus(n6,n1)) -> (leq(n0,a_select2(sigma,pv23)) -> true)) & (geq(minus(n6,n1),n0) -> (geq(minus(n6,n1),n0) -> (geq(minus(n4,n1),n0) & geq(minus(n1000,n1),n0) -> true)))))))) # label(thruster_array_0001) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.86/1.27
% 0.86/1.27 ============================== end of process non-clausal formulas ===
% 0.86/1.27
% 0.86/1.27 ============================== PROCESS INITIAL CLAUSES ===============
% 0.86/1.27
% 0.86/1.27 ============================== PREDICATE ELIMINATION =================
% 0.86/1.27 58 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom). [clausify(6)].
% 0.86/1.27 59 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom). [clausify(6)].
% 0.86/1.27 60 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(7)].
% 0.86/1.27 61 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(7)].
% 0.86/1.27 62 geq(minus(n4,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.27 Derived: leq(n0,minus(n4,n1)). [resolve(62,a,61,a)].
% 0.86/1.27 63 geq(minus(n1000,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.27 Derived: leq(n0,minus(n1000,n1)). [resolve(63,a,61,a)].
% 0.86/1.27 64 geq(n7,n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.27 Derived: leq(n0,n7). [resolve(64,a,61,a)].
% 0.86/1.27 65 true | leq(n0,pv5) | leq(n0,pv23) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.27 Derived: true | leq(n0,pv5) | leq(n0,pv23) | leq(n0,minus(n6,n1)). [resolve(65,d,61,a)].
% 0.86/1.27 66 true | leq(n0,pv5) | leq(pv23,minus(n6,n1)) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.28 Derived: true | leq(n0,pv5) | leq(pv23,minus(n6,n1)) | leq(n0,minus(n6,n1)). [resolve(66,d,61,a)].
% 0.86/1.28 67 true | leq(n0,pv5) | leq(n0,a_select2(sigma,pv23)) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.28 Derived: true | leq(n0,pv5) | leq(n0,a_select2(sigma,pv23)) | leq(n0,minus(n6,n1)). [resolve(67,d,61,a)].
% 0.86/1.28 68 true | leq(pv5,n588) | leq(n0,pv23) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.28 Derived: true | leq(pv5,n588) | leq(n0,pv23) | leq(n0,minus(n6,n1)). [resolve(68,d,61,a)].
% 0.86/1.28 69 true | leq(pv5,n588) | leq(pv23,minus(n6,n1)) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.28 Derived: true | leq(pv5,n588) | leq(pv23,minus(n6,n1)) | leq(n0,minus(n6,n1)). [resolve(69,d,61,a)].
% 0.86/1.28 70 true | leq(pv5,n588) | leq(n0,a_select2(sigma,pv23)) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.28 Derived: true | leq(pv5,n588) | leq(n0,a_select2(sigma,pv23)) | leq(n0,minus(n6,n1)). [resolve(70,d,61,a)].
% 0.86/1.28 71 -leq(n0,n0) | -leq(n0,n1) | -leq(n0,n2) | -leq(n0,n3) | -leq(n0,n4) | -leq(n0,n5) | -leq(n0,n6) | -leq(n0,n7) | -leq(n0,minus(n4,n1)) | -leq(n0,minus(n6,n1)) | -leq(n0,minus(n1000,n1)) | -leq(n1,n7) | -leq(n1,minus(n4,n1)) | -leq(n1,minus(n6,n1)) | -leq(n2,n7) | -leq(n2,minus(n4,n1)) | -leq(n2,minus(n6,n1)) | -leq(n3,n7) | -leq(n3,minus(n4,n1)) | -leq(n3,minus(n6,n1)) | -leq(n4,n7) | -leq(n4,minus(n6,n1)) | -leq(n5,n7) | -leq(n5,minus(n6,n1)) | -leq(n6,n7) | -leq(n7,n7) | leq(n0,pv5) | leq(n0,pv23) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.28 72 -leq(n0,n0) | -leq(n0,n1) | -leq(n0,n2) | -leq(n0,n3) | -leq(n0,n4) | -leq(n0,n5) | -leq(n0,n6) | -leq(n0,n7) | -leq(n0,minus(n4,n1)) | -leq(n0,minus(n6,n1)) | -leq(n0,minus(n1000,n1)) | -leq(n1,n7) | -leq(n1,minus(n4,n1)) | -leq(n1,minus(n6,n1)) | -leq(n2,n7) | -leq(n2,minus(n4,n1)) | -leq(n2,minus(n6,n1)) | -leq(n3,n7) | -leq(n3,minus(n4,n1)) | -leq(n3,minus(n6,n1)) | -leq(n4,n7) | -leq(n4,minus(n6,n1)) | -leq(n5,n7) | -leq(n5,minus(n6,n1)) | -leq(n6,n7) | -leq(n7,n7) | leq(n0,pv5) | leq(pv23,minus(n6,n1)) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.28 73 -leq(n0,n0) | -leq(n0,n1) | -leq(n0,n2) | -leq(n0,n3) | -leq(n0,n4) | -leq(n0,n5) | -leq(n0,n6) | -leq(n0,n7) | -leq(n0,minus(n4,n1)) | -leq(n0,minus(n6,n1)) | -leq(n0,minus(n1000,n1)) | -leq(n1,n7) | -leq(n1,minus(n4,n1)) | -leq(n1,minus(n6,n1)) | -leq(n2,n7) | -leq(n2,minus(n4,n1)) | -leq(n2,minus(n6,n1)) | -leq(n3,n7) | -leq(n3,minus(n4,n1)) | -leq(n3,minus(n6,n1)) | -leq(n4,n7) | -leq(n4,minus(n6,n1)) | -leq(n5,n7) | -leq(n5,minus(n6,n1)) | -leq(n6,n7) | -leq(n7,n7) | leq(n0,pv5) | leq(n0,a_select2(sigma,pv23)) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.28 74 -leq(n0,n0) | -leq(n0,n1) | -leq(n0,n2) | -leq(n0,n3) | -leq(n0,n4) | -leq(n0,n5) | -leq(n0,n6) | -leq(n0,n7) | -leq(n0,minus(n4,n1)) | -leq(n0,minus(n6,n1)) | -leq(n0,minus(n1000,n1)) | -leq(n1,n7) | -leq(n1,minus(n4,n1)) | -leq(n1,minus(n6,n1)) | -leq(n2,n7) | -leq(n2,minus(n4,n1)) | -leq(n2,minus(n6,n1)) | -leq(n3,n7) | -leq(n3,minus(n4,n1)) | -leq(n3,minus(n6,n1)) | -leq(n4,n7) | -leq(n4,minus(n6,n1)) | -leq(n5,n7) | -leq(n5,minus(n6,n1)) | -leq(n6,n7) | -leq(n7,n7) | leq(pv5,n588) | leq(n0,pv23) | geq(minus(n6,n1),n0) # label(thruster_array_0001) # label(negated_conjecture). [clausify(57)].
% 0.86/1.28 75 -leq(n0,n0) | -leq(n0,n1) | -leq(n0,n2) | -leq(n0,n3) | -leq(n0,n4) | -leq(n0,n5) | -leq(n0,n6) | -leq(n0,n7) | -leq(n0,minus(n4,n1)) | -leq(n0,minus(n6,n1)) | -leq(n0,minus(n1000,n1)) | -leq(n1,n7) | -leq(n1,minus(n4,n1)) | -leq(n1,minus(n6,n1)) | -leq(n2,n7) | -leq(n2,minus(n4,n1)) | -leq(n2,minus(n6,n1)) | -leq(n3,n7) | -leq(n3,minus(n4,n1)) | -leq(n3,minus(n6,n1)) | -leq(n4,n7) | -leq(n4,minus(n6,n1)) | -leq(n5,n7) | -leq(n5,minus(n6,n1)) | -leq(n6,n7) | -leq(n7,n7) | leq(pv5,n588) | leq(pv23,minus(n6,n1)) | geq(miCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------