TSTP Solution File: SWV110+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV110+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:34 EDT 2022
% Result : Timeout 300.04s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SWV110+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.09/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 05:40:47 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.51/1.13 ============================== Prover9 ===============================
% 0.51/1.13 Prover9 (32) version 2009-11A, November 2009.
% 0.51/1.13 Process 6457 was started by sandbox2 on n022.cluster.edu,
% 0.51/1.13 Thu Jun 16 05:40:48 2022
% 0.51/1.13 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6303_n022.cluster.edu".
% 0.51/1.13 ============================== end of head ===========================
% 0.51/1.13
% 0.51/1.13 ============================== INPUT =================================
% 0.51/1.13
% 0.51/1.13 % Reading from file /tmp/Prover9_6303_n022.cluster.edu
% 0.51/1.13
% 0.51/1.13 set(prolog_style_variables).
% 0.51/1.13 set(auto2).
% 0.51/1.13 % set(auto2) -> set(auto).
% 0.51/1.13 % set(auto) -> set(auto_inference).
% 0.51/1.13 % set(auto) -> set(auto_setup).
% 0.51/1.13 % set(auto_setup) -> set(predicate_elim).
% 0.51/1.13 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.51/1.13 % set(auto) -> set(auto_limits).
% 0.51/1.13 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.51/1.13 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.51/1.13 % set(auto) -> set(auto_denials).
% 0.51/1.13 % set(auto) -> set(auto_process).
% 0.51/1.13 % set(auto2) -> assign(new_constants, 1).
% 0.51/1.13 % set(auto2) -> assign(fold_denial_max, 3).
% 0.51/1.13 % set(auto2) -> assign(max_weight, "200.000").
% 0.51/1.13 % set(auto2) -> assign(max_hours, 1).
% 0.51/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.51/1.13 % set(auto2) -> assign(max_seconds, 0).
% 0.51/1.13 % set(auto2) -> assign(max_minutes, 5).
% 0.51/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.51/1.13 % set(auto2) -> set(sort_initial_sos).
% 0.51/1.13 % set(auto2) -> assign(sos_limit, -1).
% 0.51/1.13 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.51/1.13 % set(auto2) -> assign(max_megs, 400).
% 0.51/1.13 % set(auto2) -> assign(stats, some).
% 0.51/1.13 % set(auto2) -> clear(echo_input).
% 0.51/1.13 % set(auto2) -> set(quiet).
% 0.51/1.13 % set(auto2) -> clear(print_initial_clauses).
% 0.51/1.13 % set(auto2) -> clear(print_given).
% 0.51/1.13 assign(lrs_ticks,-1).
% 0.51/1.13 assign(sos_limit,10000).
% 0.51/1.13 assign(order,kbo).
% 0.51/1.13 set(lex_order_vars).
% 0.51/1.13 clear(print_given).
% 0.51/1.13
% 0.51/1.13 % formulas(sos). % not echoed (102 formulas)
% 0.51/1.13
% 0.51/1.13 ============================== end of input ==========================
% 0.51/1.13
% 0.51/1.13 % From the command line: assign(max_seconds, 300).
% 0.51/1.13
% 0.51/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.51/1.13
% 0.51/1.13 % Formulas that are not ordinary clauses:
% 0.51/1.13 1 (all X all Y (gt(X,Y) | gt(Y,X) | X = Y)) # label(totality) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 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.51/1.13 3 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 4 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 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.51/1.13 6 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 7 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 8 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 9 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 10 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 11 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 12 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 13 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.13 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.51/1.13 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.51/1.13 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.51/1.13 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.51/1.14 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.51/1.14 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.51/1.14 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.51/1.14 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.51/1.14 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.51/1.14 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.51/1.14 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.51/1.14 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.51/1.14 26 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.14 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.51/1.14 28 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.14 29 (all X plus(n1,X) = succ(X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption].
% 0.51/1.14 30 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 31 (all X plus(n2,X) = succ(succ(X))) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 32 (all X plus(X,n3) = succ(succ(succ(X)))) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 33 (all X plus(n3,X) = succ(succ(succ(X)))) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 34 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 35 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 36 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 37 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 38 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 39 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 40 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 41 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 42 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 43 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 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].
% 6.08/6.32 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].
% 6.08/6.32 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].
% 6.08/6.32 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].
% 6.08/6.32 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].
% 6.08/6.32 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].
% 6.08/6.32 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].
% 6.08/6.32 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].
% 6.08/6.32 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].
% 6.08/6.32 53 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 54 (all X (leq(n0,X) & leq(X,n1) -> X = n0 | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption].
% 6.08/6.32 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].
% 6.08/6.32 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].
% 6.08/6.32 57 -(leq(n0,pv5) & leq(n0,pv57) & leq(plus(n1,pv57),pv58) & leq(pv5,minus(n999,n1)) & leq(pv57,minus(n6,n1)) & leq(pv58,minus(n6,n1)) & (all A all B (leq(n0,A) & leq(n0,B) & leq(A,minus(n6,n1)) & leq(B,minus(n6,n1)) -> a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A))) & (all C all D (leq(n0,C) & leq(n0,D) & leq(C,minus(n3,n1)) & leq(D,minus(n3,n1)) -> a_select3(r_ds1_filter,C,D) = a_select3(r_ds1_filter,D,C))) & (all E all F (leq(n0,E) & leq(n0,F) & leq(E,minus(n6,n1)) & leq(F,minus(n6,n1)) -> a_select3(pminus_ds1_filter,E,F) = a_select3(pminus_ds1_filter,F,E))) & (all G all H (leq(n0,G) & leq(n0,H) & leq(G,minus(n6,n1)) & leq(H,minus(n6,n1)) -> (lt(H,pv58) & G = pv57 -> a_select3(id_ds1_filter,G,H) = a_select3(id_ds1_filter,H,G)) & (lt(G,pv57) -> a_select3(id_ds1_filter,G,H) = a_select3(id_ds1_filter,H,G)))) & (all I (leq(n0,I) & leq(I,minus(pv57,n1)) -> (all J (leq(n0,J) & leq(J,minus(n6,n1)) -> a_select3(id_ds1_filter,I,J) = a_select3(id_ds1_filter,J,I))))) -> leq(n0,pv5) & leq(n0,pv57) & leq(pv5,minus(n999,n1)) & leq(pv57,minus(n6,n1)) & (all K all L (leq(n0,K) & leq(n0,L) & leq(K,minus(n6,n1)) & leq(L,minus(n6,n1)) -> a_select3(q_ds1_filter,K,L) = a_select3(q_ds1_filter,L,K))) & (all M all N (leq(n0,M) & leq(n0,N) & leq(M,minus(n3,n1)) & leq(N,minus(n3,n1)) -> a_select3(r_ds1_filter,M,N) = a_select3(r_ds1_filter,N,M))) & (all O all P (leq(n0,O) & leq(n0,P) & leq(O,minus(n6,n1)) & leq(P,minus(n6,n1)) -> a_select3(pminus_ds1_filter,O,P) = a_select3(pminus_ds1_filter,P,O))) & (all Q all R (leq(n0,Q) & leq(n0,R) & leq(Q,minus(n6,n1)) & leq(R,minus(n6,n1)) -> (lt(R,plus(n1,pv58)) & Q = pv57 -> a_select3(tptp_update3(tptp_update3(id_ds1_filter,pv57,pv58,n0),pv58,pv57,n0),Q,R) = a_select3(tptp_update3(tptp_update3(id_ds1_filter,pv57,pv58,n0),pv58,pv57,n0),R,Q)) & (lt(Q,pv57) -> a_select3(tptp_update3(tptp_update3(id_ds1_filter,pv57,pv58,n0),pv58,pv57,n0),Q,R) = a_select3(tptp_update3(tptp_update3(id_ds1_filter,pv57,pv58,n0),pv58,pv57,n0),R,Q)))) & (all S (leq(n0,S) & leq(S,minus(pv57,n1)) -> (all T (leq(n0,T) & leq(T,minus(n6,n1)) -> a_select3(tptp_update3(tptp_update3(id_ds1_filter,pv57,T,n0),T,pv57,n0),S,T) = a_select3(tptp_update3(tptp_update3(id_ds1_filter,pv57,T,n0),T,pv57,n0),T,S)))))) # label(quaternion_ds1_symm_0003) # label(negated_conjecture) # label(non_clause). [assumption].
% 17.28/17.57
% 17.28/17.57 ============================== end of process non-clausal formulas ===
% 17.28/17.57
% 17.28/17.57 ============================== PROCESS INITIAL CLAUSES ===============
% 17.28/17.57
% 17.28/17.57 ============================== PREDICATE ELIMINATION =================
% 17.28/17.57 58 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(7)].
% 17.28/17.57 59 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(7)].
% 17.28/17.57
% 17.28/17.57 ============================== end predicate elimination =============
% 17.28/17.57
% 17.28/17.57 Auto_denials: (non-Horn, no changes).
% 17.28/17.57
% 17.28/17.57 Term ordering decisions:
% 17.28/17.57 Function symbol KB weights: n0=1. n1=1. pv57=1. n6=1. pv5=1. n999=1. pv58=1. id_ds1_filter=1. n3=1. pminus_ds1_filter=1. q_ds1_filter=1. r_ds1_filter=1. n2=1. n4=1. n5=1. tptp_minus_1=1. tptp_float_0_0=1. def=1. use=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. minus=1. tptp_mmul=1. plus=1. tptp_madd=1. tptp_msub=1. a_select2=1. dim=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.
% 17.28/17.57
% 17.28/17.57 ============================== end of process initial clauses ========
% 17.28/17.57
% 17.28/17.57 ============================== CLAUSES FOR SEARCH ====================
% 17.28/17.57
% 17.28/17.57 ============================== end of clauses for search =============
% 17.28/17.57
% 17.28/17.57 ============================== SEARCH ================================
% 17.28/17.57
% 17.28/17.57 % Starting search at 8.22 seconds.
% 17.28/17.57
% 17.28/17.57 Low Water (keep): wt=12.000, iters=2147483647
% 17.28/17.57
% 17.28/17.57 Low Water (keep): wt=9.000, iters=2147483647
% 17.28/17.57
% 17.28/17.57 Low Water (keep): wt=4.000, iters=2147483647
% 17.28/17.57
% 17.28/17.57 Low Water (keep): wt=3.000, iters=2147483647
% 17.28/17.57
% 17.28/17.57 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 9.30 sec).
% 17.28/17.57
% 17.28/17.57 Low Water (displace): id=11806, wt=173.000
% 17.28/17.57
% 17.28/17.57 Low Water (displace): id=11891, wt=172.000
% 17.28/17.57
% 17.28/17.57 Low Water (displace): id=16656, wt=37.000
% 17.28/17.57
% 17.28/17.57 Low Water (displace): id=1666Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------