TSTP Solution File: SWV452+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV452+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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 : Wed Jul 20 21:13:06 EDT 2022
% Result : Timeout 300.04s 300.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV452+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.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 : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 15 14:39:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.02 ============================== Prover9 ===============================
% 0.42/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.02 Process 25658 was started by sandbox on n022.cluster.edu,
% 0.42/1.02 Wed Jun 15 14:39:33 2022
% 0.42/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25504_n022.cluster.edu".
% 0.42/1.02 ============================== end of head ===========================
% 0.42/1.02
% 0.42/1.02 ============================== INPUT =================================
% 0.42/1.02
% 0.42/1.02 % Reading from file /tmp/Prover9_25504_n022.cluster.edu
% 0.42/1.02
% 0.42/1.02 set(prolog_style_variables).
% 0.42/1.02 set(auto2).
% 0.42/1.02 % set(auto2) -> set(auto).
% 0.42/1.02 % set(auto) -> set(auto_inference).
% 0.42/1.02 % set(auto) -> set(auto_setup).
% 0.42/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.02 % set(auto) -> set(auto_limits).
% 0.42/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.02 % set(auto) -> set(auto_denials).
% 0.42/1.02 % set(auto) -> set(auto_process).
% 0.42/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.02 % set(auto2) -> assign(stats, some).
% 0.42/1.02 % set(auto2) -> clear(echo_input).
% 0.42/1.02 % set(auto2) -> set(quiet).
% 0.42/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.02 % set(auto2) -> clear(print_given).
% 0.42/1.02 assign(lrs_ticks,-1).
% 0.42/1.02 assign(sos_limit,10000).
% 0.42/1.02 assign(order,kbo).
% 0.42/1.02 set(lex_order_vars).
% 0.42/1.02 clear(print_given).
% 0.42/1.02
% 0.42/1.02 % formulas(sos). % not echoed (67 formulas)
% 0.42/1.02
% 0.42/1.02 ============================== end of input ==========================
% 0.42/1.02
% 0.42/1.02 % From the command line: assign(max_seconds, 300).
% 0.42/1.02
% 0.42/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.02
% 0.42/1.02 % Formulas that are not ordinary clauses:
% 0.42/1.02 1 (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.42/1.02 2 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 4 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 5 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 6 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 7 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 8 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 9 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 10 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 11 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 13 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 14 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 15 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 17 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 18 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 19 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 20 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 21 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 22 (all X all Y (X != Y <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 23 (all X all Y (X != Y <-> m_Ldr(X) != m_Ldr(Y))) # label(axiom_29) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 24 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 25 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_31) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 26 (all X1 all X2 all Y1 all Y2 (Y1 != Y2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 27 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 28 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 29 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 30 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 31 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 32 (all Q (Q = q_nil | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 33 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 34 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 35 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 36 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 37 (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.42/1.02 38 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 40 (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.42/1.02 41 (all X (pidElem(X) <-> (exists Y (X = m_Halt(Y) | X = m_Down(Y))))) # label(axiom_48) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 42 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 43 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 44 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 45 (all X all Q (ordered(cons(X,Q)) <-> ordered(Q) & (all Y (elem(Y,Q) & pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) -> leq(pidMsg(X),pidMsg(Y)))))) # label(axiom_53) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 46 (all X all Q (ordered(snoc(Q,X)) <-> ordered(Q) & (all Y (elem(Y,Q) & pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) -> leq(pidMsg(Y),pidMsg(X)))))) # label(axiom_54) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 47 (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.42/1.02 48 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 49 (all Q all X all Y (ordered(cons(m_Halt(X),Q)) & host(X) = host(Y) & elem(m_Down(Y),Q) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause). [assumption].
% 162.82/163.14 50 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause). [assumption].
% 162.82/163.14 51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause). [assumption].
% 162.82/163.14 52 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause). [assumption].
% 162.82/163.14 53 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause). [assumption].
% 162.82/163.14 54 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause). [assumption].
% 162.82/163.14 55 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause). [assumption].
% 162.82/163.14 56 (all X all Y (leq(X,s(Y)) <-> X = s(Y) | leq(X,Y))) # label(axiom_64) # label(axiom) # label(non_clause). [assumption].
% 162.82/163.14 57 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause). [assumption].
% 162.82/163.14 58 -(all V all W all X all Y ((all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Pid0) = host(Z) -> -setIn(Pid0,alive))) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & queue(host(X)) = cons(m_Down(Y),V) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (index(ldr,host(X)) = host(Y) & index(status,host(X)) = norm | index(status,host(X)) = wait & host(Y) = host(index(elid,host(X))) -> ((all Z (host(X) = host(Z) -> leq(Z,W))) & -setIn(W,pids) & host(X) = host(W) -> (host(W) != s(zero) -> (all Z (host(X) = host(Z) -> (all X0 all Y0 (host(X) != host(Y0) -> (all Z0 ((Z != X & setIn(Z,alive) | Z = W) & (Y0 != X & setIn(Y0,alive) | Y0 = W) & host(Y0) != host(Z) & host(X0) = host(Z) & host(Z0) = host(Y0) -> -(elem(m_Down(Z0),V) & elem(m_Down(X0),queue(host(Y0))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 162.82/163.14
% 162.82/163.14 ============================== end of process non-clausal formulas ===
% 162.82/163.14
% 162.82/163.14 ============================== PROCESS INITIAL CLAUSES ===============
% 162.82/163.14
% 162.82/163.14 ============================== PREDICATE ELIMINATION =================
% 162.82/163.14
% 162.82/163.14 ============================== end predicate elimination =============
% 162.82/163.14
% 162.82/163.14 Auto_denials: (non-Horn, no changes).
% 162.82/163.14
% 162.82/163.14 Term ordering decisions:
% 162.82/163.14 Function symbol KB weights: alive=1. q_nil=1. status=1. elid=1. ldr=1. nbr_proc=1. norm=1. pids=1. wait=1. zero=1. elec_1=1. elec_2=1. nil=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. cons=1. snoc=1. index=1. m_Ack=1. f2=1. f3=1. host=1. pidMsg=1. m_Down=1. s=1. m_Halt=1. queue=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1.
% 162.82/163.14
% 162.82/163.14 ============================== end of process initial clauses ========
% 162.82/163.14
% 162.82/163.14 ============================== CLAUSES FOR SEARCH ====================
% 162.82/163.14
% 162.82/163.14 ============================== end of clauses for search =============
% 162.82/163.14
% 162.82/163.14 ============================== SEARCH ================================
% 162.82/163.14
% 162.82/163.14 % Starting search at 0.03 seconds.
% 162.82/163.14
% 162.82/163.14 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 118 (0.00 of 0.29 sec).
% 162.82/163.14
% 162.82/163.14 Low Water (keep): wt=16.000, iters=3340
% 162.82/163.14
% 162.82/163.14 Low Water (keep): wt=15.000, iters=4350
% 162.82/163.14
% 162.82/163.14 Low Water (keep): wt=14.000, iters=4447
% 162.82/163.14
% 162.82/163.14 Low Water (keep): wt=13.000, iters=3900
% 162.82/163.14
% 162.82/163.14 Low Water (displace): id=33472, wt=31.000
% 162.82/163.14
% 162.82/163.14 Low Water (displace): id=33393, wt=29.000
% 162.82/163.14
% 162.82/163.14 Low Water (displace): id=33474, wt=27.000
% 162.82/163.14
% 162.82/163.14 Low Water (displace): id=33257, wt=26.000
% 162.82/163.14
% 162.82/163.14 Low Water (displace): id=33499, wt=25.000
% 162.82/163.14
% 162.82/163.14 Low Water (displace): id=33256, wt=24.000
% 162.82/163.14
% 162.82/163.14 Low Water (displace): id=33470, wt=22.000
% 162.82/163.14
% 162.82/163.14 Low Water (displace): id=33392, wt=21.000
% 162.82/163.14
% 162.82/163.14 Low Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------