0.04/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.34 % Computer : n019.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 960 0.14/0.34 % DateTime : Thu Jul 2 12:46:56 EDT 2020 0.14/0.34 % CPUTime : 0.78/1.07 ============================== Prover9 =============================== 0.78/1.07 Prover9 (32) version 2009-11A, November 2009. 0.78/1.07 Process 17782 was started by sandbox2 on n019.cluster.edu, 0.78/1.07 Thu Jul 2 12:46:57 2020 0.78/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_17606_n019.cluster.edu". 0.78/1.07 ============================== end of head =========================== 0.78/1.07 0.78/1.07 ============================== INPUT ================================= 0.78/1.07 0.78/1.07 % Reading from file /tmp/Prover9_17606_n019.cluster.edu 0.78/1.07 0.78/1.07 set(prolog_style_variables). 0.78/1.07 set(auto2). 0.78/1.07 % set(auto2) -> set(auto). 0.78/1.07 % set(auto) -> set(auto_inference). 0.78/1.07 % set(auto) -> set(auto_setup). 0.78/1.07 % set(auto_setup) -> set(predicate_elim). 0.78/1.07 % set(auto_setup) -> assign(eq_defs, unfold). 0.78/1.07 % set(auto) -> set(auto_limits). 0.78/1.07 % set(auto_limits) -> assign(max_weight, "100.000"). 0.78/1.07 % set(auto_limits) -> assign(sos_limit, 20000). 0.78/1.07 % set(auto) -> set(auto_denials). 0.78/1.07 % set(auto) -> set(auto_process). 0.78/1.07 % set(auto2) -> assign(new_constants, 1). 0.78/1.07 % set(auto2) -> assign(fold_denial_max, 3). 0.78/1.07 % set(auto2) -> assign(max_weight, "200.000"). 0.78/1.07 % set(auto2) -> assign(max_hours, 1). 0.78/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.78/1.07 % set(auto2) -> assign(max_seconds, 0). 0.78/1.07 % set(auto2) -> assign(max_minutes, 5). 0.78/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.78/1.07 % set(auto2) -> set(sort_initial_sos). 0.78/1.07 % set(auto2) -> assign(sos_limit, -1). 0.78/1.07 % set(auto2) -> assign(lrs_ticks, 3000). 0.78/1.07 % set(auto2) -> assign(max_megs, 400). 0.78/1.07 % set(auto2) -> assign(stats, some). 0.78/1.07 % set(auto2) -> clear(echo_input). 0.78/1.07 % set(auto2) -> set(quiet). 0.78/1.07 % set(auto2) -> clear(print_initial_clauses). 0.78/1.07 % set(auto2) -> clear(print_given). 0.78/1.07 assign(lrs_ticks,-1). 0.78/1.07 assign(sos_limit,10000). 0.78/1.07 assign(order,kbo). 0.78/1.07 set(lex_order_vars). 0.78/1.07 clear(print_given). 0.78/1.07 0.78/1.07 % formulas(sos). % not echoed (54 formulas) 0.78/1.07 0.78/1.07 ============================== end of input ========================== 0.78/1.07 0.78/1.07 % From the command line: assign(max_seconds, 960). 0.78/1.07 0.78/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.78/1.07 0.78/1.07 % Formulas that are not ordinary clauses: 0.78/1.07 1 (all A all X (mem(X,A) -> X = ap(i(A),X))) # label(ibeta) # label(axiom) # label(non_clause). [assumption]. 0.78/1.07 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.78/1.07 3 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause). [assumption]. 0.78/1.07 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.78/1.07 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.78/1.07 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.78/1.07 7 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__EXISTS__GAP) # label(axiom) # label(non_clause). [assumption]. 0.78/1.07 8 (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.78/1.07 9 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(ap(ap(c_2Ebool_2E_5C_2F,Q),R)) <-> p(R) | p(Q)))))) # label(ax_or_p) # label(axiom) # label(non_clause). [assumption]. 0.78/1.07 10 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((p(V1q) | p(V2r) <-> p(V0p)) <-> (p(V1q) | p(V2r) | -p(V0p)) & (-p(V2r) | p(V0p)) & (p(V0p) | -p(V1q))))))))) # label(conj_thm_2Esat_2Edc__disj) # label(axiom) # label(non_clause). [assumption]. 0.78/1.07 11 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (-(p(V0p) -> p(V1q)) -> p(V0p)))))) # label(conj_thm_2Esat_2Epth__ni1) # label(axiom) # label(non_clause). [assumption]. 0.78/1.07 12 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> ((-p(V1q) <-> p(V0p)) <-> (p(V0p) | p(V1q)) & (-p(V1q) | -p(V0p))))))) # label(conj_thm_2Esat_2Edc__neg) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 13 (all V0A (mem(V0A,bool) -> (p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV__IMP) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 14 (all V0x (mem(V0x,bool) -> (all V1x_27 (mem(V1x_27,bool) -> (all V2y (mem(V2y,bool) -> (all V3y_27 (mem(V3y_27,bool) -> ((p(V0x) <-> p(V1x_27)) & (p(V1x_27) -> (p(V3y_27) <-> p(V2y))) -> ((p(V1x_27) -> p(V3y_27)) <-> (p(V0x) -> p(V2y)))))))))))) # label(conj_thm_2Ebool_2EIMP__CONG) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 15 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__FORALL__POINT) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 16 (all V0t (mem(V0t,bool) -> (--p(V0t) <-> p(V0t)))) # label(conj_thm_2Esat_2ENOT__NOT) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 17 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__FORALL) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 18 (all A (ne(A) -> (all Q (mem(Q,arr(A,bool)) -> ((exists X (mem(X,A) & p(ap(Q,X)))) <-> p(ap(c_2Ebool_2E_3F(A),Q))))))) # label(ax_ex_p) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 19 (all A (ne(A) -> (all X (mem(X,A) -> (all Y (mem(Y,A) -> (p(ap(ap(c_2Emin_2E_3D(A),X),Y)) <-> Y = X))))))) # label(ax_eq_p) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 20 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> (((p(V1q) -> p(V2r)) <-> p(V0p)) <-> (p(V0p) | p(V1q)) & (p(V0p) | -p(V2r)) & (p(V2r) | -p(V0p) | -p(V1q))))))))) # label(conj_thm_2Esat_2Edc__imp) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 21 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all V0i (mem(V0i,arr(A_27a,A_27b)) -> (all V1P (mem(V1P,arr(A_27b,bool)) -> (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),V0i),V1P)) <-> (all V2v (mem(V2v,A_27b) -> (p(ap(V1P,V2v)) -> (exists V3fv (p(ap(V1P,ap(V0i,V3fv))) & mem(V3fv,A_27a))))))) & ((all V4v (mem(V4v,A_27b) -> (-p(ap(V1P,V4v)) -> (exists V5fv (-p(ap(V1P,ap(V0i,V5fv))) & mem(V5fv,A_27a)))))) <-> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),V0i),V1P))) & (all V6i (mem(V6i,arr(A_27a,A_27b)) -> (all V7P (mem(V7P,arr(A_27b,bool)) -> ((all V8fv (mem(V8fv,A_27a) -> p(ap(V7P,ap(V6i,V8fv))))) <-> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),V6i),V7P))))))) & (all V9i (mem(V9i,arr(A_27a,A_27b)) -> (all V10P (mem(V10P,arr(A_27b,bool)) -> (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),V9i),V10P)) <-> (all V11fv (mem(V11fv,A_27a) -> -p(ap(V10P,ap(V9i,V11fv)))))))))) & (all V16i (mem(V16i,arr(A_27a,A_27b)) -> (all V17P (mem(V17P,arr(A_27b,bool)) -> (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),V16i),V17P)) <-> (all V18v (mem(V18v,A_27b) -> (-p(ap(V17P,V18v)) -> (exists V19fv (mem(V19fv,A_27a) & V18v = ap(V16i,V19fv))))))))))) & (all V12i (mem(V12i,arr(A_27a,A_27b)) -> (all V13P (mem(V13P,arr(A_27b,bool)) -> (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),V12i),V13P)) <-> (all V14v (mem(V14v,A_27b) -> (p(ap(V13P,V14v)) -> (exists V15fv (mem(V15fv,A_27a) & ap(V12i,V15fv) = V14v)))))))))))))))))) # label(conj_thm_2EquantHeuristics_2EGUESS__REWRITES) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 22 (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.78/1.08 23 (all A_27a (ne(A_27a) -> mem(c_2Ebool_2E_3F(A_27a),arr(arr(A_27a,bool),bool)))) # label(mem_c_2Ebool_2E_3F) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 24 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (-(p(V0p) -> p(V1q)) -> -p(V1q)))))) # label(conj_thm_2Esat_2Epth__ni2) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 25 (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]. 0.78/1.08 26 (all V0A (mem(V0A,bool) -> (--p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV2) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 27 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (--(p(V1B) | p(V0A)) <-> (-p(V0A) -> --p(V1B))))))) # label(conj_thm_2Esat_2EOR__DUAL2) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 28 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(Q) & p(R) <-> p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))))))) # label(ax_and_p) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 29 $T # label(conj_thm_2Ebool_2ETRUTH) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 30 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__EXISTS__POINT) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 31 $F <-> -$T # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndLHS) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 32 $T <-> -$F # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndLHS) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 33 (all V0t (mem(V0t,bool) -> (p(V0t) <-> --p(V0t)))) # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndRHS) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 34 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__EXISTS) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 35 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (--(p(V1B) | -p(V0A)) <-> (p(V0A) -> --p(V1B))))))) # label(conj_thm_2Esat_2EOR__DUAL3) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 36 (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.78/1.08 37 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__FORALL__GAP) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 38 (all A_27a (ne(A_27a) -> (all V0x (mem(V0x,A_27a) -> (all V1y (mem(V1y,A_27a) -> (V1y = V0x <-> V0x = V1y))))))) # label(conj_thm_2Ebool_2EEQ__SYM__EQ) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 39 (all V0t (mem(V0t,bool) -> (-p(V0t) <-> ($F <-> p(V0t))) & ((p(V0t) <-> $F) <-> -p(V0t)) & ((p(V0t) <-> $T) <-> p(V0t)) & (p(V0t) <-> (p(V0t) <-> $T)))) # label(conj_thm_2Ebool_2EEQ__CLAUSES) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 40 (all V0t (mem(V0t,bool) -> (p(V0t) <-> p(V0t)) & ($T <-> (p(V0t) -> $T)) & ($T <-> ($F -> p(V0t))) & (-p(V0t) <-> -p(V0t)) & ((p(V0t) -> p(V0t)) <-> $T))) # label(conj_thm_2Ebool_2EIMP__CLAUSES) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 41 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((p(V0p) | -p(V2r) | -p(V1q)) & (p(V1q) | -p(V0p) | -p(V2r)) & (p(V2r) | -p(V1q) | -p(V0p)) & (p(V1q) | p(V2r) | p(V0p)) <-> (p(V0p) <-> (p(V1q) <-> p(V2r)))))))))) # label(conj_thm_2Esat_2Edc__eq) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 42 (all V0t1 (mem(V0t1,bool) -> (all V1t2 (mem(V1t2,bool) -> (all V2t3 (mem(V2t3,bool) -> ((p(V0t1) -> (p(V1t2) -> p(V2t3))) <-> (p(V1t2) & p(V0t1) -> p(V2t3))))))))) # label(conj_thm_2Ebool_2EAND__IMP__INTRO) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 43 (all Q (mem(Q,bool) -> (p(ap(c_2Ebool_2E_7E,Q)) <-> -p(Q)))) # label(ax_neg_p) # label(axiom) # label(non_clause). [assumption]. 0.78/1.08 44 -(all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all V0i (mem(V0i,arr(A_27b,A_27a)) -> (all V1P (mem(V1P,arr(A_27a,bool)) -> (all V2Q (mem(V2Q,arr(A_27a,bool)) -> ((all V3x (mem(V3x,A_27a) -> (p(ap(V2Q,V3x)) -> p(ap(V1P,V3x))))) -> (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27b,A_27a),V0i),V1P)) -> p(ap(ap(c_2EquantHAlarm clock 119.78/120.07 Prover9 interrupted 119.78/120.07 EOF