TSTP Solution File: ITP015+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ITP015+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 00:21:31 EDT 2022
% Result : Timeout 300.02s 300.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP015+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 3 14:19:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.04 ============================== Prover9 ===============================
% 0.44/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.04 Process 31697 was started by sandbox on n025.cluster.edu,
% 0.44/1.04 Fri Jun 3 14:19:46 2022
% 0.44/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31544_n025.cluster.edu".
% 0.44/1.04 ============================== end of head ===========================
% 0.44/1.04
% 0.44/1.04 ============================== INPUT =================================
% 0.44/1.04
% 0.44/1.04 % Reading from file /tmp/Prover9_31544_n025.cluster.edu
% 0.44/1.04
% 0.44/1.04 set(prolog_style_variables).
% 0.44/1.04 set(auto2).
% 0.44/1.04 % set(auto2) -> set(auto).
% 0.44/1.04 % set(auto) -> set(auto_inference).
% 0.44/1.04 % set(auto) -> set(auto_setup).
% 0.44/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.04 % set(auto) -> set(auto_limits).
% 0.44/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.04 % set(auto) -> set(auto_denials).
% 0.44/1.04 % set(auto) -> set(auto_process).
% 0.44/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.04 % set(auto2) -> assign(stats, some).
% 0.44/1.04 % set(auto2) -> clear(echo_input).
% 0.44/1.04 % set(auto2) -> set(quiet).
% 0.44/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.04 % set(auto2) -> clear(print_given).
% 0.44/1.04 assign(lrs_ticks,-1).
% 0.44/1.04 assign(sos_limit,10000).
% 0.44/1.04 assign(order,kbo).
% 0.44/1.04 set(lex_order_vars).
% 0.44/1.04 clear(print_given).
% 0.44/1.04
% 0.44/1.04 % formulas(sos). % not echoed (57 formulas)
% 0.44/1.04
% 0.44/1.04 ============================== end of input ==========================
% 0.44/1.04
% 0.44/1.04 % From the command line: assign(max_seconds, 300).
% 0.44/1.04
% 0.44/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.04
% 0.44/1.04 % Formulas that are not ordinary clauses:
% 0.44/1.04 1 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 2 (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.44/1.04 3 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> ((p(Q) <-> p(R)) -> Q = R))))) # label(boolext) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 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.44/1.04 5 (all A all Y all X (mem(X,A) -> ap(k(A,Y),X) = Y)) # label(kbeta) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 6 (all A all X (mem(X,A) -> ap(i(A),X) = X)) # label(ibeta) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 7 (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.44/1.04 8 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(ap(ap(c_2Ebool_2E_5C_2F,Q),R)) <-> p(Q) | p(R)))))) # label(ax_or_p) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 9 (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.44/1.04 10 (all A_27a (ne(A_27a) -> mem(c_2Ebool_2ECOND(A_27a),arr(bool,arr(A_27a,arr(A_27a,A_27a)))))) # label(mem_c_2Ebool_2ECOND) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 11 (all A0 (ne(A0) -> (all A1 (ne(A1) -> ne(ty_2Efcp_2Ecart(A0,A1)))))) # label(ne_ty_2Efcp_2Ecart) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 12 (all A_27a (ne(A_27a) -> mem(c_2Einteger__word_2Ei2w(A_27a),arr(ty_2Einteger_2Eint,ty_2Efcp_2Ecart(bool,A_27a))))) # label(mem_c_2Einteger__word_2Ei2w) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 13 (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.44/1.04 14 (all A0 (ne(A0) -> ne(ty_2Ebool_2Eitself(A0)))) # label(ne_ty_2Ebool_2Eitself) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 15 (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.44/1.04 16 (all A_27a (ne(A_27a) -> mem(c_2Ewords_2Edimword(A_27a),arr(ty_2Ebool_2Eitself(A_27a),ty_2Enum_2Enum)))) # label(mem_c_2Ewords_2Edimword) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 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].
% 0.44/1.04 18 (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.44/1.04 19 (all A_27a (ne(A_27a) -> mem(c_2Ewords_2En2w(A_27a),arr(ty_2Enum_2Enum,ty_2Efcp_2Ecart(bool,A_27a))))) # label(mem_c_2Ewords_2En2w) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 20 (all A_27a (ne(A_27a) -> mem(c_2Ewords_2Eword__2comp(A_27a),arr(ty_2Efcp_2Ecart(bool,A_27a),ty_2Efcp_2Ecart(bool,A_27a))))) # label(mem_c_2Ewords_2Eword__2comp) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 21 (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.44/1.04 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].
% 0.44/1.04 23 $T # label(conj_thm_2Ebool_2ETRUTH) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 24 (all V0t1 (mem(V0t1,bool) -> (all V1t2 (mem(V1t2,bool) -> ((p(V0t1) -> p(V1t2)) -> ((p(V1t2) -> p(V0t1)) -> (p(V0t1) <-> p(V1t2)))))))) # label(conj_thm_2Ebool_2EIMP__ANTISYM__AX) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 25 (all V0t (mem(V0t,bool) -> ($F -> p(V0t)))) # label(conj_thm_2Ebool_2EFALSITY) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 26 (all A_27a (ne(A_27a) -> (all V0x (mem(V0x,A_27a) -> (V0x = V0x <-> $T))))) # label(conj_thm_2Ebool_2EREFL__CLAUSE) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 27 (all A_27a (ne(A_27a) -> (all V0x (mem(V0x,A_27a) -> (all V1y (mem(V1y,A_27a) -> (V0x = V1y <-> V1y = V0x))))))) # label(conj_thm_2Ebool_2EEQ__SYM__EQ) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 28 (all V0t1 (mem(V0t1,bool) -> (all V1t2 (mem(V1t2,bool) -> (all V2t3 (mem(V2t3,bool) -> ((p(V0t1) -> (p(V1t2) -> p(V2t3))) <-> (p(V0t1) & p(V1t2) -> p(V2t3))))))))) # label(conj_thm_2Ebool_2EAND__IMP__INTRO) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 29 (all A_27a (ne(A_27a) -> (all V0P (mem(V0P,bool) -> (all V1Q (mem(V1Q,bool) -> (all V2x (mem(V2x,A_27a) -> (all V3x_27 (mem(V3x_27,A_27a) -> (all V4y (mem(V4y,A_27a) -> (all V5y_27 (mem(V5y_27,A_27a) -> ((p(V0P) <-> p(V1Q)) & (p(V1Q) -> V2x = V3x_27) & (-p(V1Q) -> V4y = V5y_27) -> ap(ap(ap(c_2Ebool_2ECOND(A_27a),V0P),V2x),V4y) = ap(ap(ap(c_2Ebool_2ECOND(A_27a),V1Q),V3x_27),V5y_27)))))))))))))))) # label(conj_thm_2Ebool_2ECOND__CONG) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 30 (all A_27a (ne(A_27a) -> (all V0t1 (mem(V0t1,A_27a) -> (all V1t2 (mem(V1t2,A_27a) -> ap(ap(ap(c_2Ebool_2ECOND(A_27a),c_2Ebool_2ET),V0t1),V1t2) = V0t1)))) & (all V2t1 (mem(V2t1,A_27a) -> (all V3t2 (mem(V3t2,A_27a) -> ap(ap(ap(c_2Ebool_2ECOND(A_27a),c_2Ebool_2EF),V2t1),V3t2) = V3t2)))))) # label(conj_thm_2Ebool_2Ebool__case__thm) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 31 (all V0n (mem(V0n,ty_2Enum_2Enum) -> (all V1m (mem(V1m,ty_2Enum_2Enum) -> (p(ap(ap(c_2Einteger_2Eint__lt,ap(c_2Einteger_2Eint__of__num,V0n)),ap(c_2Einteger_2Eint__of__num,V1m))) <-> p(ap(ap(c_2Eprim__rec_2E_3C,V0n),V1m))) & (p(ap(ap(c_2Einteger_2Eint__lt,ap(c_2Einteger_2Eint__neg,ap(c_2Einteger_2Eint__of__num,V0n))),ap(c_2Einteger_2Eint__neg,ap(c_2Einteger_2Eint__of__num,V1m)))) <-> p(ap(ap(c_2Eprim__rec_2E_3C,V1m),V0n))) & (p(ap(ap(c_2Einteger_2Eint__lt,ap(c_2Einteger_2Eint__neg,ap(c_2Einteger_2Eint__of__num,V0n))),ap(c_2Einteger_2Eint__of__num,V1m))) <-> V0n != c_2Enum_2E0 | V1m != c_2Enum_2E0) & (p(ap(ap(c_2Einteger_2Eint__lt,ap(c_2Einteger_2Eint__of__num,V0n)),ap(c_2Einteger_2Eint__neg,ap(c_2Einteger_2Eint__of__num,V1m)))) <-> $F))))) # label(conj_thm_2Einteger_2EINT__LT__CALCULATE) # label(axiom) # label(non_clause). [assumption].
% 56.99/57.27 32 (all V0n (mem(V0n,ty_2Enum_2Enum) -> ap(c_2Einteger_2ENum,ap(c_2Einteger_2Eint__of__num,V0n)) = V0n)) # label(conj_thm_2Einteger_2ENUM__OF__INT) # label(axiom) # label(non_clause). [assumption].
% 56.99/57.27 33 (all A_27a (ne(A_27a) -> (all V0i (mem(V0i,ty_2Einteger_2Eint) -> ap(c_2Einteger__word_2Ei2w(A_27a),V0i) = ap(ap(ap(c_2Ebool_2ECOND(ty_2Efcp_2Ecart(bool,A_27a)),ap(ap(c_2Einteger_2Eint__lt,V0i),ap(c_2Einteger_2Eint__of__num,c_2Enum_2E0))),ap(c_2Ewords_2Eword__2comp(A_27a),ap(c_2Ewords_2En2w(A_27a),ap(c_2Einteger_2ENum,ap(c_2Einteger_2Eint__neg,V0i))))),ap(c_2Ewords_2En2w(A_27a),ap(c_2Einteger_2ENum,V0i))))))) # label(ax_thm_2Einteger__word_2Ei2w__def) # label(axiom) # label(non_clause). [assumption].
% 56.99/57.27 34 (all V0n (mem(V0n,ty_2Enum_2Enum) -> -p(ap(ap(c_2Eprim__rec_2E_3C,V0n),c_2Enum_2E0)))) # label(conj_thm_2Eprim__rec_2ENOT__LESS__0) # label(axiom) # label(non_clause). [assumption].
% 56.99/57.27 35 (all A_27a (ne(A_27a) -> (all V0m (mem(V0m,ty_2Enum_2Enum) -> (all V1n (mem(V1n,ty_2Enum_2Enum) -> (ap(c_2Ewords_2En2w(A_27a),V0m) = ap(c_2Ewords_2En2w(A_27a),V1n) <-> ap(ap(c_2Earithmetic_2EMOD,V0m),ap(c_2Ewords_2Edimword(A_27a),c_2Ebool_2Ethe__value(A_27a))) = ap(ap(c_2Earithmetic_2EMOD,V1n),ap(c_2Ewords_2Edimword(A_27a),c_2Ebool_2Ethe__value(A_27a)))))))))) # label(conj_thm_2Ewords_2En2w__11) # label(axiom) # label(non_clause). [assumption].
% 56.99/57.27 36 (all A_27a (ne(A_27a) -> ap(c_2Ewords_2Eword__2comp(A_27a),ap(c_2Ewords_2En2w(A_27a),c_2Enum_2E0)) = ap(c_2Ewords_2En2w(A_27a),c_2Enum_2E0))) # label(conj_thm_2Ewords_2EWORD__NEG__0) # label(axiom) # label(non_clause). [assumption].
% 56.99/57.27 37 -(all A_27a (ne(A_27a) -> ap(c_2Einteger__word_2Ei2w(A_27a),ap(c_2Einteger_2Eint__of__num,c_2Enum_2E0)) = ap(c_2Ewords_2En2w(A_27a),c_2Enum_2E0))) # label(conj_thm_2Einteger__word_2Ei2w__0) # label(negated_conjecture) # label(non_clause). [assumption].
% 56.99/57.27
% 56.99/57.27 ============================== end of process non-clausal formulas ===
% 56.99/57.27
% 56.99/57.27 ============================== PROCESS INITIAL CLAUSES ===============
% 56.99/57.27
% 56.99/57.27 ============================== PREDICATE ELIMINATION =================
% 56.99/57.27
% 56.99/57.27 ============================== end predicate elimination =============
% 56.99/57.27
% 56.99/57.27 Auto_denials: (non-Horn, no changes).
% 56.99/57.27
% 56.99/57.27 Term ordering decisions:
% 56.99/57.27 Function symbol KB weights: bool=1. ty_2Enum_2Enum=1. c_2Einteger_2Eint__of__num=1. c_2Einteger_2Eint__neg=1. ty_2Einteger_2Eint=1. c_2Einteger_2Eint__lt=1. c_2Enum_2E0=1. c_2Earithmetic_2EMOD=1. c_2Eprim__rec_2E_3C=1. c_2Ebool_2E_2F_5C=1. c_2Ebool_2E_5C_2F=1. c_2Einteger_2ENum=1. c_2Emin_2E_3D_3D_3E=1. c_2Ebool_2ET=1. c_2Ebool_2EF=1. c_2Ebool_2E_7E=1. ind=1. c1=1. ap=1. arr=1. ty_2Efcp_2Ecart=1. k=1. f2=1. c_2Ewords_2En2w=1. c_2Ebool_2ECOND=1. c_2Ebool_2Ethe__value=1. c_2Ewords_2Edimword=1. c_2Ebool_2E_21=1. c_2Emin_2E_3D=1. c_2Ewords_2Eword__2comp=1. ty_2Ebool_2Eitself=1. c_2Einteger__word_2Ei2w=1. i=1. f1=1.
% 56.99/57.27
% 56.99/57.27 ============================== end of process initial clauses ========
% 56.99/57.27
% 56.99/57.27 ============================== CLAUSES FOR SEARCH ====================
% 56.99/57.27
% 56.99/57.27 ============================== end of clauses for search =============
% 56.99/57.27
% 56.99/57.27 ============================== SEARCH ================================
% 56.99/57.27
% 56.99/57.27 % Starting search at 1.04 seconds.
% 56.99/57.27
% 56.99/57.27 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 848 (0.00 of 7.44 sec).
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=37.000, iters=3598
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=36.000, iters=3649
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=35.000, iters=3361
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=22.000, iters=3351
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=21.000, iters=3348
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=19.000, iters=3341
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=17.000, iters=3346
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=16.000, iters=3341
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=14.000, iters=3340
% 56.99/57.27
% 56.99/57.27 Low Water (displace): id=5412, wt=59.000
% 56.99/57.27
% 56.99/57.27 Low Water (keep): wt=13.000, iters=3338
% 56.99/57.27
% 56.99/57.27 Low Water (displace): id=5403, wt=54Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------