0.00/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n010.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 : 960 0.12/0.33 % DateTime : Thu Jul 2 11:26:58 EDT 2020 0.12/0.33 % CPUTime : 0.75/1.02 ============================== Prover9 =============================== 0.75/1.02 Prover9 (32) version 2009-11A, November 2009. 0.75/1.02 Process 17669 was started by sandbox2 on n010.cluster.edu, 0.75/1.02 Thu Jul 2 11:26:58 2020 0.75/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_17510_n010.cluster.edu". 0.75/1.02 ============================== end of head =========================== 0.75/1.02 0.75/1.02 ============================== INPUT ================================= 0.75/1.02 0.75/1.02 % Reading from file /tmp/Prover9_17510_n010.cluster.edu 0.75/1.02 0.75/1.02 set(prolog_style_variables). 0.75/1.02 set(auto2). 0.75/1.02 % set(auto2) -> set(auto). 0.75/1.02 % set(auto) -> set(auto_inference). 0.75/1.02 % set(auto) -> set(auto_setup). 0.75/1.02 % set(auto_setup) -> set(predicate_elim). 0.75/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.75/1.02 % set(auto) -> set(auto_limits). 0.75/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.75/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.75/1.02 % set(auto) -> set(auto_denials). 0.75/1.02 % set(auto) -> set(auto_process). 0.75/1.02 % set(auto2) -> assign(new_constants, 1). 0.75/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.75/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.75/1.02 % set(auto2) -> assign(max_hours, 1). 0.75/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.75/1.02 % set(auto2) -> assign(max_seconds, 0). 0.75/1.02 % set(auto2) -> assign(max_minutes, 5). 0.75/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.75/1.02 % set(auto2) -> set(sort_initial_sos). 0.75/1.02 % set(auto2) -> assign(sos_limit, -1). 0.75/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.75/1.02 % set(auto2) -> assign(max_megs, 400). 0.75/1.02 % set(auto2) -> assign(stats, some). 0.75/1.02 % set(auto2) -> clear(echo_input). 0.75/1.02 % set(auto2) -> set(quiet). 0.75/1.02 % set(auto2) -> clear(print_initial_clauses). 0.75/1.02 % set(auto2) -> clear(print_given). 0.75/1.02 assign(lrs_ticks,-1). 0.75/1.02 assign(sos_limit,10000). 0.75/1.02 assign(order,kbo). 0.75/1.02 set(lex_order_vars). 0.75/1.02 clear(print_given). 0.75/1.02 0.75/1.02 % formulas(sos). % not echoed (100 formulas) 0.75/1.02 0.75/1.02 ============================== end of input ========================== 0.75/1.02 0.75/1.02 % From the command line: assign(max_seconds, 960). 0.75/1.02 0.75/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.75/1.02 0.75/1.02 % Formulas that are not ordinary clauses: 0.75/1.02 1 (all X all U all VAL VAL = a_select2(tptp_update2(X,U,VAL),U)) # label(sel2_update_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 2 (all I all L all U all Val (leq(I,U) & leq(L,I) -> Val = a_select2(tptp_const_array1(dim(L,U),Val),I))) # label(const_array1_select) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 3 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 5 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 8 (all X all Y all Z (gt(Y,Z) & gt(X,Y) -> gt(X,Z))) # label(transitivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 9 (all A all B all N all M ((all I all J (leq(n0,I) & leq(I,M) & leq(J,M) & leq(n0,J) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(I,N) & leq(n0,J) -> 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.75/1.02 10 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 11 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 12 (all I all U all X all VAL (leq(I,U) & leq(n0,I) & (all I0 (leq(n0,I0) & leq(I0,U) -> VAL = a_select2(X,I0))) -> a_select2(tptp_update2(X,U,VAL),I) = VAL)) # label(sel2_update_3) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 13 (all A all N ((all I all J (leq(n0,J) & leq(J,N) & leq(I,N) & leq(n0,I) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(inv(A),J,I) = a_select3(inv(A),I,J))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 14 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 15 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 16 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 17 (all I all U all X all VAL all VAL2 (VAL = a_select2(X,U) & U != I -> VAL = a_select2(tptp_update2(X,I,VAL2),U))) # label(sel2_update_2) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 18 (all A all N ((all I all J (leq(n0,J) & leq(n0,I) & leq(J,N) & leq(I,N) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J all K all VAL (leq(n0,K) & leq(K,N) & leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> 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.75/1.03 19 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 20 (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.75/1.03 21 (all A all B all C all D all E all F all N all M ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,M) & leq(I,M) -> a_select3(D,J,I) = a_select3(D,I,J))) & (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(A,J,I) = a_select3(A,I,J))) & (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(F,I,J) = a_select3(F,J,I))) -> (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,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)))),J,I) = 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))))) # label(matrix_symm_joseph_update) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 22 (all A all B all N ((all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,J) & leq(J,N) & leq(n0,I) & leq(I,N) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(tptp_msub(A,B),J,I) = a_select3(tptp_msub(A,B),I,J))))) # label(matrix_symm_sub) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 23 (all A all B all N ((all I all J (leq(n0,J) & leq(I,N) & leq(n0,I) & leq(J,N) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,J) & leq(J,N) & leq(I,N) & leq(n0,I) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(tptp_madd(A,B),J,I) = a_select3(tptp_madd(A,B),I,J))))) # label(matrix_symm_add) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 24 (all A all N ((all I all J (leq(n0,J) & leq(n0,I) & leq(J,N) & leq(I,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(trans(A),I,J) = a_select3(trans(A),J,I))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 25 (all A all B all N ((all I all J (leq(J,N) & leq(n0,I) & leq(I,N) & leq(n0,J) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J))))) # label(matrix_symm_aba1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 26 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 27 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 28 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 29 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 30 (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.75/1.03 31 (all X all U all V all VAL VAL = a_select3(tptp_update3(X,U,V,VAL),U,V)) # label(sel3_update_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 32 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 33 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 34 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 35 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 36 (all I all J all U all V all X all VAL (leq(I,U) & (all I0 all J0 (leq(n0,I0) & leq(n0,J0) & leq(I0,U) & leq(J0,V) -> a_select3(X,I0,J0) = VAL)) & leq(J,V) & leq(n0,J) & leq(n0,I) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 37 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 39 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 40 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 41 (all I all J all U all V all X all VAL all VAL2 (I != U & a_select3(X,U,V) = VAL & J = V -> VAL = a_select3(tptp_update3(X,I,J,VAL2),U,V))) # label(sel3_update_2) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 42 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 43 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 44 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L2,J) & leq(J,U2) & leq(I,U1) & leq(L1,I) -> 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.75/1.03 45 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 46 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 47 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 48 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 49 (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.75/1.03 50 (all X (leq(X,n0) & leq(n0,X) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 51 (all X (leq(n0,X) & leq(X,n5) -> n0 = X | n1 = X | X = n2 | n5 = X | n4 = X | X = n3)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 52 (all X (leq(X,n1) & leq(n0,X) -> n0 = X | n1 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 53 (all X (leq(n0,X) & leq(X,n2) -> n1 = X | X = n2 | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 54 (all X (leq(X,n4) & leq(n0,X) -> n2 = X | X = n4 | n3 = X | n1 = X | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 55 (all X (leq(n0,X) & leq(X,n3) -> X = n0 | X = n1 | X = n3 | n2 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 56 -(leq(n0,pv10) & (all C (leq(C,n3) & leq(n0,C) -> init = a_select2(s_values7_init,C))) & (all A (leq(n0,A) & leq(A,n2) -> (all B (leq(B,n3) & leq(n0,B) -> init = a_select3(simplex7_init,B,A))))) & leq(pv10,minus(n330,n1)) & leq(pv9,minus(n410,n1)) & leq(n0,pv9) & init = init -> a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pvAlarm clock 119.69/120.03 Prover9 interrupted 119.69/120.03 EOF