0.04/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.09 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.30 % Computer : n023.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % DateTime : Thu Jul 2 12:52:45 EDT 2020 0.09/0.30 % CPUTime : 0.78/1.09 ============================== Prover9 =============================== 0.78/1.09 Prover9 (32) version 2009-11A, November 2009. 0.78/1.09 Process 2689 was started by sandbox2 on n023.cluster.edu, 0.78/1.09 Thu Jul 2 12:52:46 2020 0.78/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_2516_n023.cluster.edu". 0.78/1.09 ============================== end of head =========================== 0.78/1.09 0.78/1.09 ============================== INPUT ================================= 0.78/1.09 0.78/1.09 % Reading from file /tmp/Prover9_2516_n023.cluster.edu 0.78/1.09 0.78/1.09 set(prolog_style_variables). 0.78/1.09 set(auto2). 0.78/1.09 % set(auto2) -> set(auto). 0.78/1.09 % set(auto) -> set(auto_inference). 0.78/1.09 % set(auto) -> set(auto_setup). 0.78/1.09 % set(auto_setup) -> set(predicate_elim). 0.78/1.09 % set(auto_setup) -> assign(eq_defs, unfold). 0.78/1.09 % set(auto) -> set(auto_limits). 0.78/1.09 % set(auto_limits) -> assign(max_weight, "100.000"). 0.78/1.09 % set(auto_limits) -> assign(sos_limit, 20000). 0.78/1.09 % set(auto) -> set(auto_denials). 0.78/1.09 % set(auto) -> set(auto_process). 0.78/1.09 % set(auto2) -> assign(new_constants, 1). 0.78/1.09 % set(auto2) -> assign(fold_denial_max, 3). 0.78/1.09 % set(auto2) -> assign(max_weight, "200.000"). 0.78/1.09 % set(auto2) -> assign(max_hours, 1). 0.78/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.78/1.09 % set(auto2) -> assign(max_seconds, 0). 0.78/1.09 % set(auto2) -> assign(max_minutes, 5). 0.78/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.78/1.09 % set(auto2) -> set(sort_initial_sos). 0.78/1.09 % set(auto2) -> assign(sos_limit, -1). 0.78/1.09 % set(auto2) -> assign(lrs_ticks, 3000). 0.78/1.09 % set(auto2) -> assign(max_megs, 400). 0.78/1.09 % set(auto2) -> assign(stats, some). 0.78/1.09 % set(auto2) -> clear(echo_input). 0.78/1.09 % set(auto2) -> set(quiet). 0.78/1.09 % set(auto2) -> clear(print_initial_clauses). 0.78/1.09 % set(auto2) -> clear(print_given). 0.78/1.09 assign(lrs_ticks,-1). 0.78/1.09 assign(sos_limit,10000). 0.78/1.09 assign(order,kbo). 0.78/1.09 set(lex_order_vars). 0.78/1.09 clear(print_given). 0.78/1.09 0.78/1.09 % formulas(sos). % not echoed (67 formulas) 0.78/1.09 0.78/1.09 ============================== end of input ========================== 0.78/1.09 0.78/1.09 % From the command line: assign(max_seconds, 960). 0.78/1.09 0.78/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.78/1.09 0.78/1.09 % Formulas that are not ordinary clauses: 0.78/1.09 1 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 2 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 3 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 4 (all X all Y (m_NormQ(X) != m_NormQ(Y) <-> Y != X)) # label(axiom_27) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 5 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 6 (all Q (q_nil = Q | cons(head(Q),tail(Q)) = Q)) # label(axiom_39) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 7 (all X all Q ((all Y (pidElem(X) & pidElem(Y) & elem(Y,Q) & host(pidMsg(X)) = host(pidMsg(Y)) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 8 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | X = m_Halt(Y))))) # label(axiom_48) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 11 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 12 (all Q all X all Y (host(Y) = host(X) & ordered(cons(m_Halt(X),Q)) & elem(m_Down(Y),Q) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 13 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 14 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 17 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 18 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 19 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 21 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 22 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 23 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 25 (all Pid all Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid))) -> setIn(Pid,pids) & setIn(Pid2,pids))) # label(axiom) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 26 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 27 (all X all Y all Q snoc(cons(X,Q),Y) = cons(X,snoc(Q,Y))) # label(axiom_44) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 28 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 29 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 30 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 31 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_31) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 32 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> X = Y | elem(X,Q))) # label(axiom_47) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 33 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 34 (all Q all X all Y (ordered(Q) -> ordered(snoc(Q,m_Ack(X,Y))))) # label(axiom_55) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 35 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 36 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 37 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 38 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 39 (all X all Q cons(X,Q) != q_nil) # label(axiom_41) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 40 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 41 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 42 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 44 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_32) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 45 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 46 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 47 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 48 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 49 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause). [assumption]. 0.78/1.09 51 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause). [assumption]. 0.78/1.10 52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption]. 0.78/1.10 53 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause). [assumption]. 0.78/1.10 54 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause). [assumption]. 0.78/1.10 55 (all X all Q (ordered(cons(X,Q)) <-> ordered(Q) & (all Y (pidElem(X) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & elem(Y,Q) -> leq(pidMsg(X),pidMsg(Y)))))) # label(axiom_53) # label(axiom) # label(non_clause). [assumption]. 0.78/1.10 56 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause). [assumption]. 0.78/1.10 57 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause). [assumption]. 0.78/1.10 58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (Z != Pid0 & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z (setIn(Z,alive) & (elec_2 = index(status,host(Z)) | index(status,host(Z)) = elec_1) -> index(elid,host(Z)) = Z)) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(index(elid,host(Pid0))) & index(status,host(Pid0)) = wait & host(Z) = host(Pid0) & host(Pid0) != host(Pid20) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Pid20,alive) & host(Pid20) != host(Z) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (index(status,host(Pid0)) = elec_1 & host(Pid30) = host(Pid0) & host(Pid0) = nbr_proc & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) & host(Pid20) != host(Z) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & host(Pid0) = host(Z) & index(ldr,host(Pid0)) = host(Pid20) & norm = index(status,host(Pid0)) & setIn(Pid0,alive) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid0 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(host(index(elid,host(X))) = host(Y) & wait = index(status,host(X)) | index(status,host(X)) = norm & host(Y) = index(ldr,host(X))) -> (-(elec_1 = index(status,host(X)) & (all Z (leq(s(zero),Z) & -leq(host(X),Z) -> host(Y) = Z | setIn(Z,index(down,host(X)))))) -> (all Z (host(X) != host(Z) -> (all W0 all X0 all Y0 (host(X) = host(Y0) -> ((all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(X))) | host(Y) = V0 | host(X0) = V0)) & host(Y0) = nbr_proc & elec_1 = index(status,host(Y0)) & host(Y0) = host(W0) & elem(m_Down(X0),V) -> -(setIn(Z,alive) & elem(m_Down(W0),queue(host(Z))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption]. 0.78/1.10 0.78/1.10 ============================== end of process non-clausal formulas === 0.78/1.10 0.78/1.10 ============================== PROCESS INITIAL CLAUSES =============== 0.78/1.10 0.78/1.10 ============================== PREDICATE ELIMINATION ================= 0.78/1.10 0.78/1.10 ============================== end predicate elimination ============= 0.78/1.10 0.78/1.10 Auto_denials: (non-Horn, no changes). 0.78/1.10 0.78/1.10 Term ordering decisions: 0.78/1.10 Function symbol KB weights: alive=1. q_nil=1. status=1. zero=1. elec_1=1. nbr_proc=1. elid=1. down=1. pids=1. elec_2=1. ldr=1. norm=1. wait=1. nil=1. setEmpty=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. cons=1. snoc=1. index=1. m_Ack=1. f1=1. f3=1. host=1. m_Down=1. pidMsg=1. s=1. queue=1. m_Halt=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1Alarm clock 119.75/120.05 Prover9 interrupted 119.75/120.05 EOF