TSTP Solution File: SWV183+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV183+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:48 EDT 2022
% Result : Theorem 1.32s 1.61s
% Output : Refutation 1.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV183+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 18:19:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.79/1.08 ============================== Prover9 ===============================
% 0.79/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.08 Process 16296 was started by sandbox2 on n029.cluster.edu,
% 0.79/1.08 Wed Jun 15 18:19:42 2022
% 0.79/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16143_n029.cluster.edu".
% 0.79/1.08 ============================== end of head ===========================
% 0.79/1.08
% 0.79/1.08 ============================== INPUT =================================
% 0.79/1.08
% 0.79/1.08 % Reading from file /tmp/Prover9_16143_n029.cluster.edu
% 0.79/1.08
% 0.79/1.08 set(prolog_style_variables).
% 0.79/1.08 set(auto2).
% 0.79/1.08 % set(auto2) -> set(auto).
% 0.79/1.08 % set(auto) -> set(auto_inference).
% 0.79/1.08 % set(auto) -> set(auto_setup).
% 0.79/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.08 % set(auto) -> set(auto_limits).
% 0.79/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.08 % set(auto) -> set(auto_denials).
% 0.79/1.08 % set(auto) -> set(auto_process).
% 0.79/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.08 % set(auto2) -> assign(stats, some).
% 0.79/1.08 % set(auto2) -> clear(echo_input).
% 0.79/1.08 % set(auto2) -> set(quiet).
% 0.79/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.08 % set(auto2) -> clear(print_given).
% 0.79/1.08 assign(lrs_ticks,-1).
% 0.79/1.08 assign(sos_limit,10000).
% 0.79/1.08 assign(order,kbo).
% 0.79/1.08 set(lex_order_vars).
% 0.79/1.08 clear(print_given).
% 0.79/1.08
% 0.79/1.08 % formulas(sos). % not echoed (92 formulas)
% 0.79/1.08
% 0.79/1.08 ============================== end of input ==========================
% 0.79/1.08
% 0.79/1.08 % From the command line: assign(max_seconds, 300).
% 0.79/1.08
% 0.79/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.08
% 0.79/1.08 % Formulas that are not ordinary clauses:
% 0.79/1.08 1 (all X all Y (gt(X,Y) | gt(Y,X) | X = Y)) # label(totality) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 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.79/1.08 3 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 4 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 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.79/1.08 6 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 7 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 8 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 9 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 10 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 11 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 12 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 13 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.08 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.79/1.08 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.79/1.08 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.79/1.08 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.83/1.08 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.83/1.08 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.83/1.08 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.83/1.08 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.83/1.08 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.83/1.08 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.83/1.08 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.83/1.08 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.83/1.08 26 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 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.83/1.08 28 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 29 (all X plus(n1,X) = succ(X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 30 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 31 (all X plus(n2,X) = succ(succ(X))) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 32 (all X plus(X,n3) = succ(succ(succ(X)))) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 33 (all X plus(n3,X) = succ(succ(succ(X)))) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 34 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 35 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 36 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 37 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 38 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 39 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 40 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 41 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 42 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 43 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 52 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 53 (all X (leq(n0,X) & leq(X,n1) -> X = n0 | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 54 (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.83/1.09 55 (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.83/1.09 56 -(gt(loopcounter,n0) & (all A (leq(n0,A) & leq(A,n135299) -> (all B (leq(n0,B) & leq(B,n4) -> a_select3(q_init,A,B) = init)))) & (all C (leq(n0,C) & leq(C,n4) -> a_select2(rho_init,C) = init)) & (all D (leq(n0,D) & leq(D,n4) -> a_select2(mu_init,D) = init)) & (all E (leq(n0,E) & leq(E,n4) -> a_select2(sigma_init,E) = init)) & (all F (leq(n0,F) & leq(F,n4) -> a_select3(center_init,F,n0) = init)) & (gt(loopcounter,n1) -> (all G (leq(n0,G) & leq(G,n4) -> a_select2(muold_init,G) = init))) & (gt(loopcounter,n1) -> (all H (leq(n0,H) & leq(H,n4) -> a_select2(rhoold_init,H) = init))) & (gt(loopcounter,n1) -> (all I (leq(n0,I) & leq(I,n4) -> a_select2(sigmaold_init,I) = init))) & (all J (leq(n0,J) & leq(J,n4) -> a_select2(muold_init,J) = init)) & (all K (leq(n0,K) & leq(K,n4) -> a_select2(rhoold_init,K) = init)) & (all L (leq(n0,L) & leq(L,n4) -> a_select2(sigmaold_init,L) = init)) -> (all M (leq(n0,M) & leq(M,n4) -> a_select2(mu_init,M) = init))) # label(cl5_nebula_init_0091) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.32/1.61
% 1.32/1.61 ============================== end of process non-clausal formulas ===
% 1.32/1.61
% 1.32/1.61 ============================== PROCESS INITIAL CLAUSES ===============
% 1.32/1.61
% 1.32/1.61 ============================== PREDICATE ELIMINATION =================
% 1.32/1.61 57 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom). [clausify(6)].
% 1.32/1.61 58 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom). [clausify(6)].
% 1.32/1.61 59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(7)].
% 1.32/1.61 60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(7)].
% 1.32/1.61
% 1.32/1.61 ============================== end predicate elimination =============
% 1.32/1.61
% 1.32/1.61 Auto_denials: (non-Horn, no changes).
% 1.32/1.61
% 1.32/1.61 Term ordering decisions:
% 1.32/1.61 Function symbol KB weights: n0=1. n4=1. n1=1. n2=1. n3=1. n5=1. init=1. tptp_minus_1=1. n135299=1. loopcounter=1. muold_init=1. rhoold_init=1. sigmaold_init=1. center_init=1. mu_init=1. q_init=1. rho_init=1. sigma_init=1. tptp_float_0_0=1. def=1. use=1. c1=1. tptp_mmul=1. tptp_madd=1. tptp_msub=1. a_select2=1. plus=1. dim=1. minus=1. uniform_int_rnd=1. tptp_const_array1=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. trans=1. succ=1. inv=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. tptp_update3=1. f17=1. f18=1. f27=1. f25=1. f26=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1.
% 1.32/1.61
% 1.32/1.61 ============================== end of process initial clauses ========
% 1.32/1.61
% 1.32/1.61 ============================== CLAUSES FOR SEARCH ====================
% 1.32/1.61
% 1.32/1.61 ============================== end of clauses for search =============
% 1.32/1.61
% 1.32/1.61 ============================== SEARCH ================================
% 1.32/1.61
% 1.32/1.61 % Starting search at 0.25 seconds.
% 1.32/1.61
% 1.32/1.61 ============================== PROOF =================================
% 1.32/1.61 % SZS status Theorem
% 1.32/1.61 % SZS output start Refutation
% 1.32/1.61
% 1.32/1.61 % Proof 1 at 0.54 (+ 0.01) seconds.
% 1.32/1.61 % Length of proof is 6.
% 1.32/1.61 % Level of proof is 2.
% 1.32/1.61 % Maximum clause weight is 11.000.
% 1.32/1.61 % Given clauses 300.
% 1.32/1.61
% 1.32/1.61 56 -(gt(loopcounter,n0) & (all A (leq(n0,A) & leq(A,n135299) -> (all B (leq(n0,B) & leq(B,n4) -> a_select3(q_init,A,B) = init)))) & (all C (leq(n0,C) & leq(C,n4) -> a_select2(rho_init,C) = init)) & (all D (leq(n0,D) & leq(D,n4) -> a_select2(mu_init,D) = init)) & (all E (leq(n0,E) & leq(E,n4) -> a_select2(sigma_init,E) = init)) & (all F (leq(n0,F) & leq(F,n4) -> a_select3(center_init,F,n0) = init)) & (gt(loopcounter,n1) -> (all G (leq(n0,G) & leq(G,n4) -> a_select2(muold_init,G) = init))) & (gt(loopcounter,n1) -> (all H (leq(n0,H) & leq(H,n4) -> a_select2(rhoold_init,H) = init))) & (gt(loopcounter,n1) -> (all I (leq(n0,I) & leq(I,n4) -> a_select2(sigmaold_init,I) = init))) & (all J (leq(n0,J) & leq(J,n4) -> a_select2(muold_init,J) = init)) & (all K (leq(n0,K) & leq(K,n4) -> a_select2(rhoold_init,K) = init)) & (all L (leq(n0,L) & leq(L,n4) -> a_select2(sigmaold_init,L) = init)) -> (all M (leq(n0,M) & leq(M,n4) -> a_select2(mu_init,M) = init))) # label(cl5_nebula_init_0091) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.32/1.61 368 -leq(n0,A) | -leq(A,n4) | a_select2(mu_init,A) = init # label(cl5_nebula_init_0091) # label(negated_conjecture). [clausify(56)].
% 1.32/1.61 377 leq(n0,c1) # label(cl5_nebula_init_0091) # label(negated_conjecture). [clausify(56)].
% 1.32/1.61 378 leq(c1,n4) # label(cl5_nebula_init_0091) # label(negated_conjecture). [clausify(56)].
% 1.32/1.61 379 a_select2(mu_init,c1) != init # label(cl5_nebula_init_0091) # label(negated_conjecture). [clausify(56)].
% 1.32/1.61 1811 $F. [resolve(377,a,368,a),unit_del(a,378),unit_del(b,379)].
% 1.32/1.61
% 1.32/1.61 % SZS output end Refutation
% 1.32/1.61 ============================== end of proof ==========================
% 1.32/1.61
% 1.32/1.61 ============================== STATISTICS ============================
% 1.32/1.61
% 1.32/1.61 Given=300. Generated=5466. Kept=1736. proofs=1.
% 1.32/1.61 Usable=300. Sos=1404. Demods=69. Limbo=5, Disabled=336. Hints=0.
% 1.32/1.61 Megabytes=5.36.
% 1.32/1.61 User_CPU=0.54, System_CPU=0.01, Wall_clock=1.
% 1.32/1.61
% 1.32/1.61 ============================== end of statistics =====================
% 1.32/1.61
% 1.32/1.61 ============================== end of search =========================
% 1.32/1.61
% 1.32/1.61 THEOREM PROVED
% 1.32/1.61 % SZS status Theorem
% 1.32/1.61
% 1.32/1.61 Exiting with 1 proof.
% 1.32/1.61
% 1.32/1.61 Process 16296 exit (max_proofs) Wed Jun 15 18:19:43 2022
% 1.32/1.61 Prover9 interrupted
%------------------------------------------------------------------------------