0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n026.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 : 1200 0.12/0.33 % DateTime : Tue Jul 13 15:48:14 EDT 2021 0.12/0.33 % CPUTime : 0.80/1.11 ============================== Prover9 =============================== 0.80/1.11 Prover9 (32) version 2009-11A, November 2009. 0.80/1.11 Process 2539 was started by sandbox2 on n026.cluster.edu, 0.80/1.11 Tue Jul 13 15:48:15 2021 0.80/1.11 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_2386_n026.cluster.edu". 0.80/1.11 ============================== end of head =========================== 0.80/1.11 0.80/1.11 ============================== INPUT ================================= 0.80/1.11 0.80/1.11 % Reading from file /tmp/Prover9_2386_n026.cluster.edu 0.80/1.11 0.80/1.11 set(prolog_style_variables). 0.80/1.11 set(auto2). 0.80/1.11 % set(auto2) -> set(auto). 0.80/1.11 % set(auto) -> set(auto_inference). 0.80/1.11 % set(auto) -> set(auto_setup). 0.80/1.11 % set(auto_setup) -> set(predicate_elim). 0.80/1.11 % set(auto_setup) -> assign(eq_defs, unfold). 0.80/1.11 % set(auto) -> set(auto_limits). 0.80/1.11 % set(auto_limits) -> assign(max_weight, "100.000"). 0.80/1.11 % set(auto_limits) -> assign(sos_limit, 20000). 0.80/1.11 % set(auto) -> set(auto_denials). 0.80/1.11 % set(auto) -> set(auto_process). 0.80/1.11 % set(auto2) -> assign(new_constants, 1). 0.80/1.11 % set(auto2) -> assign(fold_denial_max, 3). 0.80/1.11 % set(auto2) -> assign(max_weight, "200.000"). 0.80/1.11 % set(auto2) -> assign(max_hours, 1). 0.80/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.80/1.11 % set(auto2) -> assign(max_seconds, 0). 0.80/1.11 % set(auto2) -> assign(max_minutes, 5). 0.80/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.80/1.11 % set(auto2) -> set(sort_initial_sos). 0.80/1.11 % set(auto2) -> assign(sos_limit, -1). 0.80/1.11 % set(auto2) -> assign(lrs_ticks, 3000). 0.80/1.11 % set(auto2) -> assign(max_megs, 400). 0.80/1.11 % set(auto2) -> assign(stats, some). 0.80/1.11 % set(auto2) -> clear(echo_input). 0.80/1.11 % set(auto2) -> set(quiet). 0.80/1.11 % set(auto2) -> clear(print_initial_clauses). 0.80/1.11 % set(auto2) -> clear(print_given). 0.80/1.11 assign(lrs_ticks,-1). 0.80/1.11 assign(sos_limit,10000). 0.80/1.11 assign(order,kbo). 0.80/1.11 set(lex_order_vars). 0.80/1.11 clear(print_given). 0.80/1.11 0.80/1.11 % formulas(sos). % not echoed (37 formulas) 0.80/1.11 0.80/1.11 ============================== end of input ========================== 0.80/1.11 0.80/1.11 % From the command line: assign(max_seconds, 1200). 0.80/1.11 0.80/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.80/1.11 0.80/1.11 % Formulas that are not ordinary clauses: 0.80/1.11 1 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> ((p(R) <-> p(Q)) -> Q = R))))) # label(boolext) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 2 (all A all B all F (mem(F,arr(A,B)) -> (all G (mem(G,arr(A,B)) -> ((all X (mem(X,A) -> ap(G,X) = ap(F,X))) -> F = G))))) # label(funcext) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 3 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 4 (all A all X (mem(X,A) -> ap(i(A),X) = X)) # label(ibeta) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 5 (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.80/1.11 6 (all A all Y all X (mem(X,A) -> ap(k(A,Y),X) = Y)) # label(kbeta) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 7 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all V0R (mem(V0R,arr(A_27a,arr(A_27a,bool))) -> (all V1abs (mem(V1abs,arr(A_27a,A_27b)) -> (all V2rep (mem(V2rep,arr(A_27b,A_27a)) -> (p(ap(ap(ap(c_2Equotient_2EQUOTIENT(A_27a,A_27b),V0R),V1abs),V2rep)) -> (all V3r (mem(V3r,A_27a) -> (all V4s (mem(V4s,A_27a) -> (p(ap(ap(V0R,V3r),V4s)) <-> p(ap(ap(V0R,V4s),V4s)) & ap(V1abs,V3r) = ap(V1abs,V4s) & p(ap(ap(V0R,V3r),V3r)))))))))))))))))) # label(conj_thm_2Equotient_2EQUOTIENT__REL) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 8 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(ap(ap(c_2Ebool_2E_2F_5C,Q),R)) <-> p(Q) & p(R)))))) # label(ax_and_p) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 9 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all A_27c (ne(A_27c) -> (all A_27d (ne(A_27d) -> mem(c_2Equotient_2E_2D_2D_3E(A_27a,A_27b,A_27c,A_27d),arr(arr(A_27a,A_27c),arr(arr(A_27b,A_27d),arr(arr(A_27c,A_27b),arr(A_27a,A_27d))))))))))))) # label(mem_c_2Equotient_2E_2D_2D_3E) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 10 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2Ecombin_2EW(A_27a,A_27b),arr(arr(A_27a,arr(A_27a,A_27b)),arr(A_27a,A_27b))))))) # label(mem_c_2Ecombin_2EW) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 11 (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]. 0.80/1.11 12 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2Equotient_2EQUOTIENT(A_27a,A_27b),arr(arr(A_27a,arr(A_27a,bool)),arr(arr(A_27a,A_27b),arr(arr(A_27b,A_27a),bool)))))))) # label(mem_c_2Equotient_2EQUOTIENT) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 13 (all A (ne(A) -> (all Q (mem(Q,arr(A,bool)) -> (p(ap(c_2Ebool_2E_21(A),Q)) <-> (all X (mem(X,A) -> p(ap(Q,X))))))))) # label(ax_all_p) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 14 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2Equotient_2Erespects(A_27a,A_27b),arr(arr(A_27a,arr(A_27a,A_27b)),arr(A_27a,A_27b))))))) # label(mem_c_2Equotient_2Erespects) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 15 (all V0t1 (mem(V0t1,bool) -> (all V1t2 (mem(V1t2,bool) -> ((p(V0t1) -> p(V1t2)) -> ((p(V1t2) -> p(V0t1)) -> (p(V1t2) <-> p(V0t1)))))))) # label(conj_thm_2Ebool_2EIMP__ANTISYM__AX) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 16 $T # label(conj_thm_2Ebool_2ETRUTH) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 17 (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.80/1.11 18 (all V0t (mem(V0t,bool) -> (p(V0t) <-> p(V0t)) & (p(V0t) <-> p(V0t) & p(V0t)) & ($F <-> $F & p(V0t)) & ($F & p(V0t) <-> $F) & (p(V0t) <-> p(V0t)))) # label(conj_thm_2Ebool_2EAND__CLAUSES) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 19 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2Equotient_2E_3D_3D_3D_3E(A_27a,A_27b),arr(arr(A_27a,arr(A_27a,bool)),arr(arr(A_27b,arr(A_27b,bool)),arr(arr(A_27a,A_27b),arr(arr(A_27a,A_27b),bool))))))))) # label(mem_c_2Equotient_2E_3D_3D_3D_3E) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 20 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> c_2Ecombin_2EW(A_27a,A_27b) = c_2Equotient_2Erespects(A_27a,A_27b))))) # label(ax_thm_2Equotient_2Erespects__def) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 21 (all Q (mem(Q,bool) -> (-p(Q) <-> p(ap(c_2Ebool_2E_7E,Q))))) # label(ax_neg_p) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 22 (all V0t (mem(V0t,bool) -> (($F <-> p(V0t)) <-> -p(V0t)) & ((p(V0t) <-> $F) <-> -p(V0t)) & (p(V0t) <-> (p(V0t) <-> $T)) & (($T <-> p(V0t)) <-> p(V0t)))) # label(conj_thm_2Ebool_2EEQ__CLAUSES) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 23 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R)) <-> (p(Q) -> p(R))))))) # label(ax_imp_p) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 24 (all V0t1 (mem(V0t1,bool) -> (all V1t2 (mem(V1t2,bool) -> (all V2t3 (mem(V2t3,bool) -> ((p(V1t2) & p(V0t1) -> p(V2t3)) <-> (p(V0t1) -> (p(V1t2) -> p(V2t3)))))))))) # label(conj_thm_2Ebool_2EAND__IMP__INTRO) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 25 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all V0f (mem(V0f,arr(A_27a,arr(A_27a,A_27b))) -> (all V1x (mem(V1x,A_27a) -> ap(ap(V0f,V1x),V1x) = ap(ap(c_2Ecombin_2EW(A_27a,A_27b),V0f),V1x))))))))) # label(conj_thm_2Ecombin_2EW__THM) # label(axiom) # label(non_clause). [assumption]. 0.80/1.11 26 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all A_27c (ne(A_27c) -> (all A_27d (ne(A_27d) -> (all V0R1 (mem(V0R1,arr(A_27a,arr(A_27a,bool))) -> (all V1abs1 (mem(V1abs1,arr(A_27a,A_27c)) -> (all V2rep1 (mem(V2rep1,arr(A_27c,A_27a)) -> (p(ap(ap(ap(c_2Equotient_2EQUOTIENT(A_27a,A_27c),V0R1),V1abs1),V2rep1)) -> (all V3R2 (mem(V3R2,arr(A_27b,arr(A_27b,bool))) -> (all V4abs2 (mem(V4abs2,arr(A_27b,A_27d)) -> (all V5rep2 (mem(V5rep2,arr(A_27d,A_27b)) -> (p(ap(ap(ap(c_2Equotient_2EQUOTIENT(A_27b,A_27d),V3R2),V4abs2),V5rep2)) -> p(ap(ap(ap(c_2Equotient_2EQUOTIENT(arr(A_27a,A_27b),arr(A_27c,A_27d)),ap(ap(c_2Equotient_2E_3D_3D_3D_3E(A_27a,A_27b),V0R1),V3R2)),ap(ap(c_2Equotient_2E_2D_2D_3E(A_27c,A_27b,A_27a,A_27d),V2reAlarm clock 119.22/120.04 Prover9 interrupted 119.22/120.04 EOF