0.08/0.15 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.15 % Command : tptp2X_and_run_prover9 %d %s 0.16/0.37 % Computer : n026.cluster.edu 0.16/0.37 % Model : x86_64 x86_64 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.16/0.37 % Memory : 8042.1875MB 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 0.16/0.37 % CPULimit : 960 0.16/0.37 % DateTime : Thu Jul 2 10:56:54 EDT 2020 0.16/0.38 % CPUTime : 0.81/1.08 ============================== Prover9 =============================== 0.81/1.08 Prover9 (32) version 2009-11A, November 2009. 0.81/1.08 Process 4289 was started by sandbox on n026.cluster.edu, 0.81/1.08 Thu Jul 2 10:56:55 2020 0.81/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_4101_n026.cluster.edu". 0.81/1.08 ============================== end of head =========================== 0.81/1.08 0.81/1.08 ============================== INPUT ================================= 0.81/1.08 0.81/1.08 % Reading from file /tmp/Prover9_4101_n026.cluster.edu 0.81/1.08 0.81/1.08 set(prolog_style_variables). 0.81/1.08 set(auto2). 0.81/1.08 % set(auto2) -> set(auto). 0.81/1.08 % set(auto) -> set(auto_inference). 0.81/1.08 % set(auto) -> set(auto_setup). 0.81/1.08 % set(auto_setup) -> set(predicate_elim). 0.81/1.08 % set(auto_setup) -> assign(eq_defs, unfold). 0.81/1.08 % set(auto) -> set(auto_limits). 0.81/1.08 % set(auto_limits) -> assign(max_weight, "100.000"). 0.81/1.08 % set(auto_limits) -> assign(sos_limit, 20000). 0.81/1.08 % set(auto) -> set(auto_denials). 0.81/1.08 % set(auto) -> set(auto_process). 0.81/1.08 % set(auto2) -> assign(new_constants, 1). 0.81/1.08 % set(auto2) -> assign(fold_denial_max, 3). 0.81/1.08 % set(auto2) -> assign(max_weight, "200.000"). 0.81/1.08 % set(auto2) -> assign(max_hours, 1). 0.81/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.81/1.08 % set(auto2) -> assign(max_seconds, 0). 0.81/1.08 % set(auto2) -> assign(max_minutes, 5). 0.81/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.81/1.08 % set(auto2) -> set(sort_initial_sos). 0.81/1.08 % set(auto2) -> assign(sos_limit, -1). 0.81/1.08 % set(auto2) -> assign(lrs_ticks, 3000). 0.81/1.08 % set(auto2) -> assign(max_megs, 400). 0.81/1.08 % set(auto2) -> assign(stats, some). 0.81/1.08 % set(auto2) -> clear(echo_input). 0.81/1.08 % set(auto2) -> set(quiet). 0.81/1.08 % set(auto2) -> clear(print_initial_clauses). 0.81/1.08 % set(auto2) -> clear(print_given). 0.81/1.08 assign(lrs_ticks,-1). 0.81/1.08 assign(sos_limit,10000). 0.81/1.08 assign(order,kbo). 0.81/1.08 set(lex_order_vars). 0.81/1.08 clear(print_given). 0.81/1.08 0.81/1.08 % formulas(sos). % not echoed (29 formulas) 0.81/1.08 0.81/1.08 ============================== end of input ========================== 0.81/1.08 0.81/1.08 % From the command line: assign(max_seconds, 960). 0.81/1.08 0.81/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.81/1.08 0.81/1.08 % Formulas that are not ordinary clauses: 0.81/1.08 1 (all A all X (mem(X,A) -> X = ap(i(A),X))) # label(ibeta) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 2 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> ((p(Q) <-> p(R)) -> R = Q))))) # label(boolext) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 3 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 4 (all A all B all F (mem(F,arr(A,B)) -> (all G (mem(G,arr(A,B)) -> ((all X (mem(X,A) -> ap(F,X) = ap(G,X))) -> F = G))))) # label(funcext) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 5 (all A all Y all X (mem(X,A) -> Y = ap(k(A,Y),X))) # label(kbeta) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 6 (all A all B all F (mem(F,arr(A,B)) -> (all X (mem(X,A) -> mem(ap(F,X),B))))) # label(ap_tp) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 7 (all A_27a (ne(A_27a) -> mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))))) # label(mem_c_2Emin_2E_3D) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 8 (all A_27a (ne(A_27a) -> mem(c_2Ebool_2Ethe__value(A_27a),ty_2Ebool_2Eitself(A_27a)))) # label(mem_c_2Ebool_2Ethe__value) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 9 (all A_27a (ne(A_27a) -> (all V0x (mem(V0x,A_27a) -> ($T <-> V0x = V0x))))) # label(conj_thm_2Ebool_2EREFL__CLAUSE) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 10 (all A0 (ne(A0) -> (all A1 (ne(A1) -> ne(ty_2Epair_2Eprod(A0,A1)))))) # label(ne_ty_2Epair_2Eprod) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 11 $T # label(conj_thm_2Ebool_2ETRUTH) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 12 (all A (ne(A) -> (all Q (mem(Q,arr(A,bool)) -> ((all X (mem(X,A) -> p(ap(Q,X)))) <-> p(ap(c_2Ebool_2E_21(A),Q))))))) # label(ax_all_p) # label(axiom) # label(non_clause). [assumption]. 0.81/1.08 13 (all A_27t (ne(A_27t) -> (all A_27w (ne(A_27w) -> mem(c_2Ebinary__ieee_2Efloat__negate(A_27t,A_27w),arr(ty_2Ebinary__ieee_2Efloat(A_27t,A_27w),ty_2Ebinary__ieee_2Efloat(A_27t,A_27w))))))) # label(mem_c_2Ebinary__ieee_2Efloat__negate) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 14 (all A_27t (ne(A_27t) -> (all A_27w (ne(A_27w) -> mem(c_2Ebinary__ieee_2Efloat__plus__min(A_27t,A_27w),arr(ty_2Ebool_2Eitself(ty_2Epair_2Eprod(A_27t,A_27w)),ty_2Ebinary__ieee_2Efloat(A_27t,A_27w))))))) # label(mem_c_2Ebinary__ieee_2Efloat__plus__min) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 15 (all A0 (ne(A0) -> ne(ty_2Ebool_2Eitself(A0)))) # label(ne_ty_2Ebool_2Eitself) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 16 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all V0x (mem(V0x,ty_2Ebinary__ieee_2Efloat(A_27a,A_27b)) -> ap(c_2Ebinary__ieee_2Efloat__to__real(A_27a,A_27b),ap(c_2Ebinary__ieee_2Efloat__negate(A_27a,A_27b),V0x)) = ap(c_2Erealax_2Ereal__neg,ap(c_2Ebinary__ieee_2Efloat__to__real(A_27a,A_27b),V0x)))))))) # label(conj_thm_2Ebinary__ieee_2Efloat__to__real__negate) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 17 (all A_27a (ne(A_27a) -> mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)))) # label(mem_c_2Ebool_2E_21) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 18 (all A0 (ne(A0) -> (all A1 (ne(A1) -> ne(ty_2Ebinary__ieee_2Efloat(A0,A1)))))) # label(ne_ty_2Ebinary__ieee_2Efloat) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 19 (all A_27t (ne(A_27t) -> (all A_27w (ne(A_27w) -> mem(c_2Ebinary__ieee_2Efloat__to__real(A_27t,A_27w),arr(ty_2Ebinary__ieee_2Efloat(A_27t,A_27w),ty_2Erealax_2Ereal)))))) # label(mem_c_2Ebinary__ieee_2Efloat__to__real) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 20 (all A_27t (ne(A_27t) -> (all A_27w (ne(A_27w) -> ap(c_2Ebinary__ieee_2Efloat__to__real(A_27t,A_27w),ap(c_2Ebinary__ieee_2Efloat__plus__min(A_27t,A_27w),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(A_27t,A_27w)))) = ap(c_2Ebinary__ieee_2Eulp(A_27t,A_27w),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(A_27t,A_27w))))))) # label(conj_thm_2Ebinary__ieee_2Eulp) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 21 (all A_27t (ne(A_27t) -> (all A_27w (ne(A_27w) -> mem(c_2Ebinary__ieee_2Eulp(A_27t,A_27w),arr(ty_2Ebool_2Eitself(ty_2Epair_2Eprod(A_27t,A_27w)),ty_2Erealax_2Ereal)))))) # label(mem_c_2Ebinary__ieee_2Eulp) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 22 (all A (ne(A) -> (all X (mem(X,A) -> (all Y (mem(Y,A) -> (p(ap(ap(c_2Emin_2E_3D(A),X),Y)) <-> X = Y))))))) # label(ax_eq_p) # label(axiom) # label(non_clause). [assumption]. 1.09/1.43 23 -(all A_27t (ne(A_27t) -> (all A_27w (ne(A_27w) -> ap(c_2Ebinary__ieee_2Efloat__to__real(A_27t,A_27w),ap(c_2Ebinary__ieee_2Efloat__negate(A_27t,A_27w),ap(c_2Ebinary__ieee_2Efloat__plus__min(A_27t,A_27w),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(A_27t,A_27w))))) = ap(c_2Erealax_2Ereal__neg,ap(c_2Ebinary__ieee_2Eulp(A_27t,A_27w),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(A_27t,A_27w)))))))) # label(conj_thm_2Ebinary__ieee_2Eneg__ulp) # label(negated_conjecture) # label(non_clause). [assumption]. 1.09/1.43 1.09/1.43 ============================== end of process non-clausal formulas === 1.09/1.43 1.09/1.43 ============================== PROCESS INITIAL CLAUSES =============== 1.09/1.43 1.09/1.43 ============================== PREDICATE ELIMINATION ================= 1.09/1.43 1.09/1.43 ============================== end predicate elimination ============= 1.09/1.43 1.09/1.43 Auto_denials: (non-Horn, no changes). 1.09/1.43 1.09/1.43 Term ordering decisions: 1.09/1.43 Function symbol KB weights: bool=1. ty_2Erealax_2Ereal=1. c_2Ebool_2ET=1. c_2Erealax_2Ereal__neg=1. ind=1. c1=1. c2=1. ap=1. arr=1. ty_2Ebinary__ieee_2Efloat=1. ty_2Epair_2Eprod=1. c_2Ebinary__ieee_2Efloat__to__real=1. c_2Ebinary__ieee_2Efloat__negate=1. c_2Ebinary__ieee_2Efloat__plus__min=1. c_2Ebinary__ieee_2Eulp=1. k=1. f2=1. c_2Ebool_2E_21=1. ty_2Ebool_2Eitself=1. c_2Ebool_2Ethe__value=1. c_2Emin_2E_3D=1. i=1. f1=1. 1.09/1.43 1.09/1.43 ============================== end of process initial clauses ======== 1.09/1.43 1.09/1.43 ============================== CLAUSES FOR SEARCH ==================== 1.09/1.43 1.09/1.43 ============================== end of clauses for search ============= 1.09/1.43 1.09/1.43 ============================== SEARCH ================================ 1.09/1.43 1.09/1.43 % Starting search at 0.02 seconds. 1.09/1.43 1.09/1.43 Low Water (keep): wt=41.000, iters=3356 1.09/1.43 1.09/1.43 Low Water (keep): wt=33.000, iters=3366 1.09/1.43 1.09/1.43 Low Water (keep): wtAlarm clock 119.77/120.04 Prover9 interrupted 119.77/120.04 EOF