0.00/0.12	% 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 : n028.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 : 1440
0.12/0.33	% WCLimit  : 180
0.12/0.33	% DateTime : Mon Jul  3 05:48:13 EDT 2023
0.12/0.33	% CPUTime  : 
0.42/1.05	============================== Prover9 ===============================
0.42/1.05	Prover9 (32) version 2009-11A, November 2009.
0.42/1.05	Process 29654 was started by sandbox on n028.cluster.edu,
0.42/1.05	Mon Jul  3 05:48:14 2023
0.42/1.05	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_29501_n028.cluster.edu".
0.42/1.05	============================== end of head ===========================
0.42/1.05	
0.42/1.05	============================== INPUT =================================
0.42/1.05	
0.42/1.05	% Reading from file /tmp/Prover9_29501_n028.cluster.edu
0.42/1.05	
0.42/1.05	set(prolog_style_variables).
0.42/1.05	set(auto2).
0.42/1.05	    % set(auto2) -> set(auto).
0.42/1.05	    % set(auto) -> set(auto_inference).
0.42/1.05	    % set(auto) -> set(auto_setup).
0.42/1.05	    % set(auto_setup) -> set(predicate_elim).
0.42/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.05	    % set(auto) -> set(auto_limits).
0.42/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.05	    % set(auto) -> set(auto_denials).
0.42/1.05	    % set(auto) -> set(auto_process).
0.42/1.05	    % set(auto2) -> assign(new_constants, 1).
0.42/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.05	    % set(auto2) -> assign(max_hours, 1).
0.42/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.05	    % set(auto2) -> set(sort_initial_sos).
0.42/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.05	    % set(auto2) -> assign(max_megs, 400).
0.42/1.05	    % set(auto2) -> assign(stats, some).
0.42/1.05	    % set(auto2) -> clear(echo_input).
0.42/1.05	    % set(auto2) -> set(quiet).
0.42/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.05	    % set(auto2) -> clear(print_given).
0.42/1.05	assign(lrs_ticks,-1).
0.42/1.05	assign(sos_limit,10000).
0.42/1.05	assign(order,kbo).
0.42/1.05	set(lex_order_vars).
0.42/1.05	clear(print_given).
0.42/1.05	
0.42/1.05	% formulas(sos).  % not echoed (102 formulas)
0.42/1.05	
0.42/1.05	============================== end of input ==========================
0.42/1.05	
0.42/1.05	% From the command line: assign(max_seconds, 1440).
0.42/1.05	
0.42/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.05	
0.42/1.05	% Formulas that are not ordinary clauses:
0.42/1.05	1 (all A all N ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(inv(A),I,J) = a_select3(inv(A),J,I))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	2 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	3 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	4 (all I all J all U all V all X all VAL ((all I0 all J0 (leq(J0,V) & leq(I0,U) & leq(n0,J0) & leq(n0,I0) -> a_select3(X,I0,J0) = VAL)) & leq(n0,I) & leq(I,U) & leq(J,V) & leq(n0,J) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	5 (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.42/1.05	6 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	8 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	10 (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.42/1.05	11 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	12 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	13 (all I all J all U all V all X all VAL all VAL2 (U != I & 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.42/1.05	14 (all A all B all N ((all I all J (leq(n0,J) & leq(J,N) & leq(I,N) & leq(n0,I) -> a_select3(B,I,J) = a_select3(B,J,I))) & (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> 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.42/1.05	15 (all A all B all N all M ((all I all J (leq(J,M) & leq(n0,J) & leq(I,M) & leq(n0,I) -> 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_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.42/1.05	16 (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 all K all VAL (leq(n0,I) & leq(n0,K) & leq(K,N) & leq(J,N) & leq(n0,J) & leq(I,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.42/1.05	17 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L1,I) & leq(J,U2) & leq(L2,J) & leq(I,U1) -> 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.42/1.05	18 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	19 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	20 (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.42/1.05	21 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	22 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	23 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	24 (all X all Y (gt(Y,X) | Y = X | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	25 (all A all B all N ((all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & 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(A,J,I) = a_select3(A,I,J))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> 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.42/1.05	26 (all A all B all N ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> 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.42/1.05	27 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	28 (all I all U all X all VAL all VAL2 (I != U & VAL = a_select2(X,U) -> a_select2(tptp_update2(X,I,VAL2),U) = VAL)) # label(sel2_update_2) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	29 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	30 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	31 (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.42/1.05	32 (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.42/1.05	33 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	34 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	35 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	36 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	37 (all I all U all X all VAL (leq(n0,I) & leq(I,U) & (all I0 (leq(n0,I0) & leq(I0,U) -> a_select2(X,I0) = VAL)) -> a_select2(tptp_update2(X,U,VAL),I) = VAL)) # label(sel2_update_3) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	38 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	39 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	40 (all A all B all C all D all E all F all N all M ((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,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(I,M) & leq(n0,J) & leq(J,M) & leq(n0,I) -> a_select3(D,J,I) = a_select3(D,I,J))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,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)))),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.42/1.06	41 (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.42/1.06	42 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	43 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	44 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	45 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	46 (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.42/1.06	47 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	48 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	49 (all A 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(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(trans(A),J,I) = a_select3(trans(A),I,J))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	50 (all X (leq(X,n3) & leq(n0,X) -> n0 = X | n3 = X | X = n2 | n1 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	51 (all X (leq(X,n1) & leq(n0,X) -> X = n1 | X = n0)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	52 (all X (leq(n0,X) & leq(X,n6) -> X = n3 | X = n6 | n5 = X | n4 = X | X = n2 | n1 = X | X = n0)) # label(finite_domain_6) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	53 (all X (leq(n0,X) & leq(X,n2) -> X = n1 | X = n2 | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	54 (all X (leq(X,n0) & leq(n0,X) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	55 (all X (leq(n0,X) & leq(X,n4) -> n1 = X | n2 = X | n4 = X | n3 = X | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	56 (all X (leq(n0,X) & leq(X,n5) -> n2 = X | X = n3 | X = n5 | n4 = X | n1 = X | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.42/1.06	57 -(a_select2(rho_defuse,n0) = use & use = a_select2(rho_defuse,n1) & use = a_select2(sigma_defuse,n1) & use = a_select2(sigma_defuse,n2) & a_select2(xinit_defuse,n4) = use & use = a_select2(xinit_defuse,n5) & use = a_select2(xinit_mean_defuse,n0) & use = a_select2(xinit_mean_defuse,n1) & a_select2(xinit_mean_defuse,n2) = use & use = a_select2(xinit_mean_defuse,n3) & a_select2(xinit_mean_defuse,n4) = use & a_select2(xinit_noise_defuse,n0) = use & a_select2(xinit_noise_defuse,n1) = use & a_select2(xinit_noise_defuse,n2) = use & a_select2(xinit_noise_defuse,n4) = use & leq(n0,pv52) & leq(pv5,minus(n999,n1)) & (all A all B (leq(n0,A) & leq(n0,B) & leq(B,minus(pv5,n1)) & leq(A,n2) -> use = a_select3(z_defuse,A,B) & use = a_select3(u_defuse,A,B))) & leq(pv52,minus(n6,n1)) & leq(pv51,minus(n6,n1)) & leq(n0,pv51) & leq(n0,pv5) & a_select2(xinit_noise_defuse,n5) = use & use = a_select2(xinit_noise_defuse,n3) & a_select2(xinit_mean_defuse,n5) = use & use = a_select2(xinit_defuse,n3) & use = a_select3(u_defuse,n2,n0) & use = a_select3(u_defuse,n1,n0) & use = a_select3(u_defuse,n0,n0) & use = a_select2(sigma_defuse,n5) & a_select2(sigma_defuse,n4) = use & a_select2(sigma_defuse,n3) = use & a_select2(sigma_defuse,n0) = use & use = a_select2(rho_defuse,n2) -> (pv51 = pv52 -> use = a_select2(rho_defuse,n0) & a_select2(rho_defuse,n1) = use & use = a_select2(sigma_defuse,n2) & use = a_select2(sigma_defuse,n4) & a_select2(sigma_defuse,n5) = use & use = a_select2(xinit_defuse,n4) & a_select2(xinit_mean_defuse,n1) = use & a_select2(xinit_mean_defuse,n2) = use & a_select2(xinit_noise_defuse,n0) = use & use = a_select2(xinit_noise_defuse,n2) & use = a_select2(xinit_noise_defuse,n5) & leq(n0,pv5) & (all E all F (leq(n0,E) & leq(n0,F) & leq(E,n2) & leq(F,minus(pv5,n1)) -> use = a_select3(z_defuse,E,F) & a_select3(u_defuse,E,F) = use)) & leq(pv51,minus(n6,n1)) & leq(pv5,minus(n999,n1)) & leq(n0,pv51) & a_select2(xinit_noise_defuse,n4) = use & use = a_select2(xinit_noise_defuse,n3) & a_select2(xinit_noise_defuse,n1) = use & a_select2(xinit_mean_defuse,n5) = use & use = a_select2(xinit_mean_defuse,n4) & a_select2(xinit_mean_defuse,n3) = use & use = a_select2(xinit_mean_defuse,n0) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_defuse,n3) = use & use = a_select3(u_defuse,n2,n0) & use = a_select3(u_defuse,n1,n0) & use = a_select3(u_defuse,n0,n0) & a_select2(sigma_defuse,n3) = use & a_select2(sigma_defuse,n1) = use & a_select2(sigma_defuse,n0) = use & a_select2(rho_defuse,n2) = use) & (pv52 != pv51 -> use = a_select2(rho_defuse,n1) & use = a_select2(rho_defuse,n2) & use = a_select2(sigma_defuse,n0) & a_select3(u_defuse,n0,n0) = use & a_select3(u_defuse,n2,n0) = use & a_select2(xinit_defuse,n4) = use & a_select2(xinit_mean_defuse,n0) = use & a_select2(xinit_mean_defuse,n3) = use & use = a_select2(xinit_noise_defuse,n1) & leq(pv5,minus(n999,n1)) & leq(pv51,minus(n6,n1)) & (all C all D (leq(n0,C) & leq(D,minus(pv5,n1)) & leq(C,n2) & leq(n0,D) -> use = a_select3(z_defuse,C,D) & a_select3(u_defuse,C,D) = use)) & leq(n0,pv51) & leq(n0,pv5) & a_select2(xinit_noise_defuse,n5) = use & use = a_select2(xinit_noise_defuse,n4) & use = a_select2(xinit_noise_defuse,n3) & use = a_select2(xinit_noise_defuse,n2) & use = a_select2(xinit_noise_defuse,n0) & use = a_select2(xinit_mean_defuse,n5) & use = a_select2(xinit_mean_defuse,n4) & a_select2(xinit_mean_defuse,n2) = use & a_select2(xinit_mean_defuse,n1) = use & use = a_select2(xinit_defuse,n5) & a_select2(xinit_defuse,n3) = use & use = a_select3(u_defuse,n1,n0) & a_select2(sigma_defuse,n5) = use & use = a_select2(sigma_defuse,n4) & use = a_select2(sigma_defuse,n3) & a_select2(sigma_defuse,n2) = use & use = a_select2(sigma_defuse,n1) & a_select2(rho_defuse,n0) = use)) # label(quaternion_ds1_inuse_0006) # label(negated_conjecture) # label(non_clause).  [assumption].
0.82/1.10	
0.82/1.10	============================== end of process non-clausal formulas ===
0.82/1.10	
0.82/1.10	============================== PROCESS INITIAL CLAUSES ===============
0.82/1.10	
0.82/1.10	============================== PREDICATE ELIMINATION =================
0.82/1.10	58 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom).  [clausify(8)].
0.82/1.10	59 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom).  [clausify(8)].
0.82/1.10	60 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(22)].
0.82/1.10	61 -geq(A,B)Alarm clock 
179.71/180.02	Prover9 interrupted
179.71/180.02	EOF