0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : java -Xss128m -Xmx4g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar %s -t %d -p --atp cvc4=/export/starexec/sandbox2/solver/bin/externals/cvc4 --atp e=/export/starexec/sandbox2/solver/bin/externals/eprover --atp iprover=/export/starexec/sandbox2/solver/bin/externals/iprover 0.03/0.23 % Computer : n166.star.cs.uiowa.edu 0.03/0.23 % Model : x86_64 x86_64 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.23 % Memory : 32218.625MB 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.23 % CPULimit : 300 0.03/0.23 % DateTime : Sat Jul 14 05:26:40 CDT 2018 0.03/0.23 % CPUTime : 3.68/1.85 % [INFO] Running in sequential loop mode. 4.39/2.07 % [CONFIG] Using configuration: timeout(300) with strategy 4.68/2.15 % [INFO] iprover registered as external prover. 4.68/2.15 % [INFO] e registered as external prover. 4.68/2.16 % [INFO] cvc4 registered as external prover. 4.68/2.16 % [INFO] Parsing finished. Scanning for conjecture ... 5.44/2.36 % [INFO] Found a conjecture and 66 axioms. Running axiom selection ... 5.75/2.47 % [INFO] Axiom selection finished. Selected 66 axioms (removed 0 axioms). 6.06/2.52 % [INFO] Type checking passed. Searching for refutation ... 12.06/4.43 % [INFO] Killing All external provers ... 12.06/4.44 % Time passed: 4110ms 12.06/4.44 % Effective reasoning time: 2578ms 12.06/4.44 % Solved by strategy 12.06/4.44 % Axioms used in derivation (66): axiom_26, axiom_55, axiom_08, axiom_33, axiom_10, axiom_40, axiom_22, axiom_59, axiom_44, axiom_49, axiom_15, axiom_51, axiom_04, axiom_21, axiom_19, axiom_63, axiom_38, axiom_09, axiom_43, axiom_27, axiom_32, axiom_60, axiom_54, axiom_64, axiom_16, axiom_50, axiom_05, axiom_46, axiom_20, axiom_42, axiom_31, axiom_24, axiom_57, axiom_61, axiom_06, axiom_35, axiom_28, axiom_53, axiom, axiom_65, axiom_36, axiom_02, axiom_39, axiom_17, axiom_47, axiom_13, axiom_41, axiom_25, axiom_52, axiom_34, axiom_58, axiom_62, axiom_45, axiom_29, axiom_11, axiom_56, axiom_07, axiom_30, axiom_23, axiom_01, axiom_18, axiom_12, axiom_03, axiom_48, axiom_14, axiom_37 12.06/4.44 % No. of inferences in proof: 136 12.06/4.44 % No. of processed clauses: 12 12.06/4.44 % No. of generated clauses: 3 12.06/4.44 % No. of forward subsumed clauses: 0 12.06/4.44 % No. of backward subsumed clauses: 0 12.06/4.44 % No. of ground rewrite rules in store: 6 12.06/4.44 % No. of non-ground rewrite rules in store: 0 12.06/4.44 % No. of positive (non-rewrite) units in store: 0 12.06/4.44 % No. of negative (non-rewrite) units in store: 6 12.06/4.44 % No. of choice functions detected: 0 12.06/4.44 % No. of choice instantiations: 0 12.06/4.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4110 ms resp. 2578 ms w/o parsing 12.06/4.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p 12.06/4.55 thf(nbr_proc_type, type, nbr_proc: $i). 12.06/4.55 thf(pendack_type, type, pendack: $i). 12.06/4.55 thf(host_type, type, host: ($i > $i)). 12.06/4.55 thf(index_type, type, index: ($i > ($i > $i))). 12.06/4.55 thf(leq_type, type, leq: ($i > ($i > $o))). 12.06/4.55 thf(alive_type, type, alive: $i). 12.06/4.55 thf(setIn_type, type, setIn: ($i > ($i > $o))). 12.06/4.55 thf(m_Down_type, type, m_Down: ($i > $i)). 12.06/4.55 thf(queue_type, type, queue: ($i > $i)). 12.06/4.55 thf(m_Ldr_type, type, m_Ldr: ($i > $i)). 12.06/4.55 thf(snoc_type, type, snoc: ($i > ($i > $i))). 12.06/4.55 thf(elem_type, type, elem: ($i > ($i > $o))). 12.06/4.55 thf(s_type, type, s: ($i > $i)). 12.06/4.55 thf(elec_1_type, type, elec_1: $i). 12.06/4.55 thf(status_type, type, status: $i). 12.06/4.55 thf(down_type, type, down: $i). 12.06/4.55 thf(zero_type, type, zero: $i). 12.06/4.55 thf(acks_type, type, acks: $i). 12.06/4.55 thf(elid_type, type, elid: $i). 12.06/4.55 thf(elec_2_type, type, elec_2: $i). 12.06/4.55 thf(ldr_type, type, ldr: $i). 12.06/4.55 thf(norm_type, type, norm: $i). 12.06/4.55 thf(m_Ack_type, type, m_Ack: ($i > ($i > $i))). 12.06/4.55 thf(cons_type, type, cons: ($i > ($i > $i))). 12.06/4.55 thf(wait_type, type, wait: $i). 12.06/4.55 thf(m_Halt_type, type, m_Halt: ($i > $i)). 12.06/4.55 thf(pidMsg_type, type, pidMsg: ($i > $i)). 12.06/4.55 thf(m_NormQ_type, type, m_NormQ: ($i > $i)). 12.06/4.55 thf(q_nil_type, type, q_nil: $i). 12.06/4.55 thf(ordered_type, type, ordered: ($i > $o)). 12.06/4.55 thf(m_NotNorm_type, type, m_NotNorm: ($i > $i)). 12.06/4.55 thf(pidElem_type, type, pidElem: ($i > $o)). 12.06/4.55 thf(head_type, type, head: ($i > $i)). 12.06/4.55 thf(nil_type, type, nil: $i). 12.06/4.55 thf(setEmpty_type, type, setEmpty: $i). 12.06/4.55 thf(last_type, type, last: ($i > $i)). 12.06/4.55 thf(init_type, type, init: ($i > $i)). 12.06/4.55 thf(tail_type, type, tail: ($i > $i)). 12.06/4.55 thf(pids_type, type, pids: $i). 12.06/4.55 thf(1,conjecture,((! [A:$i,B:$i,C:$i,D:$i]: (((((leq @ nbr_proc @ (index @ pendack @ (host @ C))) => (! [E:$i]: ((! [F:$i]: (((host @ F) = (host @ C)) => (! [G:$i,H:$i,I:$i]: (((host @ I) = (host @ E)) => (((host @ I) != (host @ C)) => (((setIn @ I @ alive) & (elem @ (m_Down @ G) @ (snoc @ (queue @ (host @ I)) @ (m_Ldr @ C))) & (elem @ (m_Down @ H) @ (snoc @ (queue @ (host @ I)) @ (m_Ldr @ C))) & ((s @ (host @ I)) = (host @ G)) & (elec_1 = (index @ status @ (host @ I))) & (leq @ nbr_proc @ (s @ (host @ I))) & ! [J:$i]: ((((host @ H) = J) | (setIn @ J @ (index @ down @ (host @ I)))) <= ((leq @ (s @ zero) @ J) & ~ (leq @ (host @ I) @ J)))) => (~ (((host @ F) = (host @ C)) & (setIn @ F @ alive))))))))) <= ((setIn @ (host @ E) @ (index @ acks @ (host @ C))) | ((host @ E) = (host @ D)))))) <= (((index @ elid @ (host @ C)) = B) & ((index @ pendack @ (host @ C)) = (host @ D)) & (elec_2 = (index @ status @ (host @ C))))) <= (setIn @ C @ alive)) <= (! [E:$i,F:$i]: ((elem @ (m_Down @ F) @ (queue @ (host @ E))) => ((host @ F) != (host @ E))) & ! [E:$i,F:$i]: ((~ (setIn @ F @ alive) | ~ (setIn @ E @ alive)) <= (((host @ F) = (host @ E)) & (E != F))) & ! [E:$i]: (((setIn @ E @ alive) & (((index @ status @ (host @ E)) = elec_1) | (elec_2 = (index @ status @ (host @ E))))) => ((index @ elid @ (host @ E)) = E)) & ! [E:$i,F:$i]: ((((index @ status @ (host @ F)) = elec_2) & (setIn @ (host @ F) @ (index @ down @ (host @ E))) & (setIn @ F @ alive) & (setIn @ E @ alive)) => (leq @ (index @ pendack @ (host @ F)) @ (host @ E))) & ! [E:$i,F:$i,G:$i]: (((setIn @ E @ alive) & (setIn @ G @ alive) & ((index @ status @ (host @ G)) = elec_2) & ((host @ G) = (host @ F)) & (elem @ (m_Down @ F) @ (queue @ (host @ E)))) => (leq @ (index @ pendack @ (host @ G)) @ (host @ E))) & ! [E:$i,F:$i]: ((F = E) <= ((setIn @ E @ alive) & ((host @ E) = (index @ ldr @ (host @ E))) & (norm = (index @ status @ (host @ F))) & ((host @ F) = (index @ ldr @ (host @ F))) & (norm = (index @ status @ (host @ E))) & (setIn @ F @ alive))) & ! [E:$i,F:$i,G:$i,H:$i]: ((((host @ G) != (host @ E)) & (setIn @ E @ alive) & ((host @ E) = (host @ F)) & ((host @ G) = (host @ H)) & (setIn @ G @ alive)) => (~ ((elem @ (m_Down @ H) @ (queue @ (host @ E))) & (elem @ (m_Down @ F) @ (queue @ (host @ G)))))) & ! [E:$i,F:$i,G:$i,H:$i]: ((! [I:$i]: ((((host @ G) = I) | (setIn @ I @ (index @ down @ (host @ H)))) <= ((leq @ (s @ zero) @ I) & ~ (leq @ (host @ H) @ I))) & (elec_1 = (index @ status @ (host @ H))) & ((s @ (host @ H)) = (host @ F)) & (elem @ (m_Down @ F) @ (queue @ (host @ H))) & (elem @ (m_Down @ G) @ (queue @ (host @ H))) & (leq @ nbr_proc @ (s @ (host @ H))) & (setIn @ H @ alive)) => (~ (((host @ E) = (index @ ldr @ (host @ E))) & (norm = (index @ status @ (host @ E))) & (setIn @ E @ alive)))) & ((queue @ (host @ C)) = (cons @ (m_Ack @ B @ D) @ A)) & ! [E:$i,F:$i,G:$i,H:$i]: ((~ (elem @ (m_Ack @ E @ F) @ (queue @ (host @ E)))) <= (((index @ status @ (host @ H)) = elec_1) & ((index @ status @ (host @ E)) = elec_2) & ((host @ H) = (host @ F)) & (elem @ (m_Down @ G) @ (queue @ (host @ H))) & (leq @ (host @ E) @ (host @ H)) & (setIn @ E @ alive) & ! [I:$i]: (((I = (host @ G)) | (setIn @ I @ (index @ down @ (host @ H)))) <= (~ (leq @ (host @ H) @ I) & (leq @ (s @ zero) @ I))))) & ! [E:$i,F:$i,G:$i]: (((setIn @ G @ alive) & (elem @ (m_Down @ E) @ (queue @ (host @ G))) & ((host @ E) = (host @ F)) & ((index @ status @ (host @ G)) = wait) & ((host @ F) = (host @ (index @ elid @ (host @ G)))) & ((host @ G) != (host @ F))) => (~ ((setIn @ F @ alive) & ((index @ ldr @ (host @ F)) = (host @ F)) & ((index @ status @ (host @ F)) = norm)))) & ! [E:$i,F:$i,G:$i]: ((((host @ F) != (host @ G)) & (setIn @ G @ alive) & (elem @ (m_Down @ E) @ (queue @ (host @ G))) & (norm = (index @ status @ (host @ G))) & ((host @ F) = (index @ ldr @ (host @ G))) & ((host @ E) = (host @ F))) => (~ ((setIn @ F @ alive) & ((index @ ldr @ (host @ F)) = (host @ F)) & ((index @ status @ (host @ F)) = norm)))) & ! [E:$i,F:$i,G:$i,H:$i]: ((((host @ E) != (host @ G)) & (setIn @ E @ alive) & ((host @ F) = (host @ E)) & ((host @ G) = (host @ H)) & (setIn @ G @ alive)) => (~ ((elem @ (m_Down @ H) @ (queue @ (host @ E))) & (setIn @ (host @ F) @ (index @ down @ (host @ G)))))) & ! [E:$i,F:$i,G:$i]: ((~ (((host @ E) = (index @ ldr @ (host @ E))) & ((index @ status @ (host @ E)) = norm) & (setIn @ E @ alive))) <= (~ (leq @ (host @ F) @ (host @ G)) & (elem @ (m_Down @ F) @ (queue @ (host @ G))) & ((host @ E) = (host @ F)) & (setIn @ G @ alive))) & ! [E:$i,F:$i,G:$i]: (((setIn @ G @ alive) & ((index @ status @ (host @ G)) = norm) & ((host @ G) = (index @ ldr @ (host @ G))) & ((host @ F) = (host @ G))) => (~ ((elem @ (m_Down @ F) @ (queue @ (host @ E))) & (setIn @ E @ alive)))) & ! [E:$i,F:$i]: ((~ ((setIn @ (host @ F) @ (index @ down @ (host @ E))) & (setIn @ E @ alive))) <= ((setIn @ F @ alive) & ((index @ ldr @ (host @ F)) = (host @ F)) & ((index @ status @ (host @ F)) = norm))) & ! [E:$i,F:$i]: ((elem @ (m_Ldr @ F) @ (queue @ (host @ E))) => (~ (leq @ (host @ E) @ (host @ F)))))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)). 12.06/4.55 thf(2,negated_conjecture,((~ (! [A:$i,B:$i,C:$i,D:$i]: (((((leq @ nbr_proc @ (index @ pendack @ (host @ C))) => (! [E:$i]: ((! [F:$i]: (((host @ F) = (host @ C)) => (! [G:$i,H:$i,I:$i]: (((host @ I) = (host @ E)) => (((host @ I) != (host @ C)) => (((setIn @ I @ alive) & (elem @ (m_Down @ G) @ (snoc @ (queue @ (host @ I)) @ (m_Ldr @ C))) & (elem @ (m_Down @ H) @ (snoc @ (queue @ (host @ I)) @ (m_Ldr @ C))) & ((s @ (host @ I)) = (host @ G)) & (elec_1 = (index @ status @ (host @ I))) & (leq @ nbr_proc @ (s @ (host @ I))) & ! [J:$i]: ((((host @ H) = J) | (setIn @ J @ (index @ down @ (host @ I)))) <= ((leq @ (s @ zero) @ J) & ~ (leq @ (host @ I) @ J)))) => (~ (((host @ F) = (host @ C)) & (setIn @ F @ alive))))))))) <= ((setIn @ (host @ E) @ (index @ acks @ (host @ C))) | ((host @ E) = (host @ D)))))) <= (((index @ elid @ (host @ C)) = B) & ((index @ pendack @ (host @ C)) = (host @ D)) & (elec_2 = (index @ status @ (host @ C))))) <= (setIn @ C @ alive)) <= (! [E:$i,F:$i]: ((elem @ (m_Down @ F) @ (queue @ (host @ E))) => ((host @ F) != (host @ E))) & ! [E:$i,F:$i]: ((~ (setIn @ F @ alive) | ~ (setIn @ E @ alive)) <= (((host @ F) = (host @ E)) & (E != F))) & ! [E:$i]: (((setIn @ E @ alive) & (((index @ status @ (host @ E)) = elec_1) | (elec_2 = (index @ status @ (host @ E))))) => ((index @ elid @ (host @ E)) = E)) & ! [E:$i,F:$i]: ((((index @ status @ (host @ F)) = elec_2) & (setIn @ (host @ F) @ (index @ down @ (host @ E))) & (setIn @ F @ alive) & (setIn @ E @ alive)) => (leq @ (index @ pendack @ (host @ F)) @ (host @ E))) & ! [E:$i,F:$i,G:$i]: (((setIn @ E @ alive) & (setIn @ G @ alive) & ((index @ status @ (host @ G)) = elec_2) & ((host @ G) = (host @ F)) & (elem @ (m_Down @ F) @ (queue @ (host @ E)))) => (leq @ (index @ pendack @ (host @ G)) @ (host @ E))) & ! [E:$i,F:$i]: ((F = E) <= ((setIn @ E @ alive) & ((host @ E) = (index @ ldr @ (host @ E))) & (norm = (index @ status @ (host @ F))) & ((host @ F) = (index @ ldr @ (host @ F))) & (norm = (index @ status @ (host @ E))) & (setIn @ F @ alive))) & ! [E:$i,F:$i,G:$i,H:$i]: ((((host @ G) != (host @ E)) & (setIn @ E @ alive) & ((host @ E) = (host @ F)) & ((host @ G) = (host @ H)) & (setIn @ G @ alive)) => (~ ((elem @ (m_Down @ H) @ (queue @ (host @ E))) & (elem @ (m_Down @ F) @ (queue @ (host @ G)))))) & ! [E:$i,F:$i,G:$i,H:$i]: ((! [I:$i]: ((((host @ G) = I) | (setIn @ I @ (index @ down @ (host @ H)))) <= ((leq @ (s @ zero) @ I) & ~ (leq @ (host @ H) @ I))) & (elec_1 = (index @ status @ (host @ H))) & ((s @ (host @ H)) = (host @ F)) & (elem @ (m_Down @ F) @ (queue @ (host @ H))) & (elem @ (m_Down @ G) @ (queue @ (host @ H))) & (leq @ nbr_proc @ (s @ (host @ H))) & (setIn @ H @ alive)) => (~ (((host @ E) = (index @ ldr @ (host @ E))) & (norm = (index @ status @ (host @ E))) & (setIn @ E @ alive)))) & ((queue @ (host @ C)) = (cons @ (m_Ack @ B @ D) @ A)) & ! [E:$i,F:$i,G:$i,H:$i]: ((~ (elem @ (m_Ack @ E @ F) @ (queue @ (host @ E)))) <= (((index @ status @ (host @ H)) = elec_1) & ((index @ status @ (host @ E)) = elec_2) & ((host @ H) = (host @ F)) & (elem @ (m_Down @ G) @ (queue @ (host @ H))) & (leq @ (host @ E) @ (host @ H)) & (setIn @ E @ alive) & ! [I:$i]: (((I = (host @ G)) | (setIn @ I @ (index @ down @ (host @ H)))) <= (~ (leq @ (host @ H) @ I) & (leq @ (s @ zero) @ I))))) & ! [E:$i,F:$i,G:$i]: (((setIn @ G @ alive) & (elem @ (m_Down @ E) @ (queue @ (host @ G))) & ((host @ E) = (host @ F)) & ((index @ status @ (host @ G)) = wait) & ((host @ F) = (host @ (index @ elid @ (host @ G)))) & ((host @ G) != (host @ F))) => (~ ((setIn @ F @ alive) & ((index @ ldr @ (host @ F)) = (host @ F)) & ((index @ status @ (host @ F)) = norm)))) & ! [E:$i,F:$i,G:$i]: ((((host @ F) != (host @ G)) & (setIn @ G @ alive) & (elem @ (m_Down @ E) @ (queue @ (host @ G))) & (norm = (index @ status @ (host @ G))) & ((host @ F) = (index @ ldr @ (host @ G))) & ((host @ E) = (host @ F))) => (~ ((setIn @ F @ alive) & ((index @ ldr @ (host @ F)) = (host @ F)) & ((index @ status @ (host @ F)) = norm)))) & ! [E:$i,F:$i,G:$i,H:$i]: ((((host @ E) != (host @ G)) & (setIn @ E @ alive) & ((host @ F) = (host @ E)) & ((host @ G) = (host @ H)) & (setIn @ G @ alive)) => (~ ((elem @ (m_Down @ H) @ (queue @ (host @ E))) & (setIn @ (host @ F) @ (index @ down @ (host @ G)))))) & ! [E:$i,F:$i,G:$i]: ((~ (((host @ E) = (index @ ldr @ (host @ E))) & ((index @ status @ (host @ E)) = norm) & (setIn @ E @ alive))) <= (~ (leq @ (host @ F) @ (host @ G)) & (elem @ (m_Down @ F) @ (queue @ (host @ G))) & ((host @ E) = (host @ F)) & (setIn @ G @ alive))) & ! [E:$i,F:$i,G:$i]: (((setIn @ G @ alive) & ((index @ status @ (host @ G)) = norm) & ((host @ G) = (index @ ldr @ (host @ G))) & ((host @ F) = (host @ G))) => (~ ((elem @ (m_Down @ F) @ (queue @ (host @ E))) & (setIn @ E @ alive)))) & ! [E:$i,F:$i]: ((~ ((setIn @ (host @ F) @ (index @ down @ (host @ E))) & (setIn @ E @ alive))) <= ((setIn @ F @ alive) & ((index @ ldr @ (host @ F)) = (host @ F)) & ((index @ status @ (host @ F)) = norm))) & ! [E:$i,F:$i]: ((elem @ (m_Ldr @ F) @ (queue @ (host @ E))) => (~ (leq @ (host @ E) @ (host @ F))))))))),inference(neg_conjecture,[status(cth)],[1])). 12.06/4.55 thf(69,plain,((~ (! [A:$i,B:$i,C:$i,D:$i]: (((leq @ nbr_proc @ (index @ pendack @ (host @ C))) => (! [E:$i]: (! [F:$i]: (((host @ F) = (host @ C)) => (! [G:$i,H:$i,I:$i]: (((host @ I) = (host @ E)) => ((~ ((host @ I) = (host @ C))) => (((setIn @ I @ alive) & (elem @ (m_Down @ G) @ (snoc @ (queue @ (host @ I)) @ (m_Ldr @ C))) & (elem @ (m_Down @ H) @ (snoc @ (queue @ (host @ I)) @ (m_Ldr @ C))) & ((s @ (host @ I)) = (host @ G)) & (elec_1 = (index @ status @ (host @ I))) & (leq @ nbr_proc @ (s @ (host @ I))) & ! [J:$i]: (((host @ H) = J) | (setIn @ J @ (index @ down @ (host @ I))) | ~ ((leq @ (s @ zero) @ J) & ~ (leq @ (host @ I) @ J)))) => (~ (((host @ F) = (host @ C)) & (setIn @ F @ alive)))))))) | ~ ((setIn @ (host @ E) @ (index @ acks @ (host @ C))) | ((host @ E) = (host @ D)))))) | ~ (((index @ elid @ (host @ C)) = B) & ((index @ pendack @ (host @ C)) = (host @ D)) & (elec_2 = (index @ status @ (host @ C)))) | ~ (setIn @ C @ alive) | ~ (! [E:$i,F:$i]: ((elem @ (m_Down @ F) @ (queue @ (host @ E))) => (~ ((host @ F) = (host @ E)))) & ! [E:$i,F:$i]: (~ (setIn @ F @ alive) | ~ (setIn @ E @ alive) | ~ (((host @ F) = (host @ E)) & ~ (E = F))) & ! [E:$i]: (((setIn @ E @ alive) & (((index @ status @ (host @ E)) = elec_1) | (elec_2 = (index @ status @ (host @ E))))) => ((index @ elid @ (host @ E)) = E)) & ! [E:$i,F:$i]: ((((index @ status @ (host @ F)) = elec_2) & (setIn @ (host @ F) @ (index @ down @ (host @ E))) & (setIn @ F @ alive) & (setIn @ E @ alive)) => (leq @ (index @ pendack @ (host @ F)) @ (host @ E))) & ! [E:$i,F:$i,G:$i]: (((setIn @ E @ alive) & (setIn @ G @ alive) & ((index @ status @ (host @ G)) = elec_2) & ((host @ G) = (host @ F)) & (elem @ (m_Down @ F) @ (queue @ (host @ E)))) => (leq @ (index @ pendack @ (host @ G)) @ (host @ E))) & ! [E:$i,F:$i]: ((F = E) | ~ ((setIn @ E @ alive) & ((host @ E) = (index @ ldr @ (host @ E))) & (norm = (index @ status @ (host @ F))) & ((host @ F) = (index @ ldr @ (host @ F))) & (norm = (index @ status @ (host @ E))) & (setIn @ F @ alive))) & ! [E:$i,F:$i,G:$i,H:$i]: ((~ ((host @ G) = (host @ E)) & (setIn @ E @ alive) & ((host @ E) = (host @ F)) & ((host @ G) = (host @ H)) & (setIn @ G @ alive)) => (~ ((elem @ (m_Down @ H) @ (queue @ (host @ E))) & (elem @ (m_Down @ F) @ (queue @ (host @ G)))))) & ! [E:$i,F:$i,G:$i,H:$i]: ((! [I:$i]: (((host @ G) = I) | (setIn @ I @ (index @ down @ (host @ H))) | ~ ((leq @ (s @ zero) @ I) & ~ (leq @ (host @ H) @ I))) & (elec_1 = (index @ status @ (host @ H))) & ((s @ (host @ H)) = (host @ F)) & (elem @ (m_Down @ F) @ (queue @ (host @ H))) & (elem @ (m_Down @ G) @ (queue @ (host @ H))) & (leq @ nbr_proc @ (s @ (host @ H))) & (setIn @ H @ alive)) => (~ (((host @ E) = (index @ ldr @ (host @ E))) & (norm = (index @ status @ (host @ E))) & (setIn @ E @ alive)))) & ((queue @ (host @ C)) = (cons @ (m_Ack @ B @ D) @ A)) & ! [E:$i,F:$i,G:$i,H:$i]: (~ (elem @ (m_Ack @ E @ F) @ (queue @ (host @ E))) | ~ (((index @ status @ (host @ H)) = elec_1) & ((index @ status @ (host @ E)) = elec_2) & ((host @ H) = (host @ F)) & (elem @ (m_Down @ G) @ (queue @ (host @ H))) & (leq @ (host @ E) @ (host @ H)) & (setIn @ E @ alive) & ! [I:$i]: ((I = (host @ G)) | (setIn @ I @ (index @ down @ (host @ H))) | ~ (~ (leq @ (host @ H) @ I) & (leq @ (s @ zero) @ I))))) & ! [E:$i,F:$i,G:$i]: (((setIn @ G @ alive) & (elem @ (m_Down @ E) @ (queue @ (host @ G))) & ((host @ E) = (host @ F)) & ((index @ status @ (host @ G)) = wait) & ((host @ F) = (host @ (index @ elid @ (host @ G)))) & ~ ((host @ G) = (host @ F))) => (~ ((setIn @ F @ alive) & ((index @ ldr @ (host @ F)) = (host @ F)) & ((index @ status @ (host @ F)) = norm)))) & ! [E:$i,F:$i,G:$i]: ((~ ((host @ F) = (host @ G)) & (setIn @ G @ alive) & (elem @ (m_Down @ E) @ (queue @ (host @ G))) & (norm = (index @ status @ (host @ G))) & ((host @ F) = (index @ ldr @ (host @ G))) & ((host @ E) = (host @ F))) => (~ ((setIn @ F @ alive) & ((index @ ldr @ (host @ F)) = (host @ F)) & ((index @ status @ (host @ F)) = norm)))) & ! [E:$i,F:$i,G:$i,H:$i]: ((~ ((host @ E) = (host @ G)) & (setIn @ E @ alive) & ((host @ F) = (host @ E)) & ((host @ G) = (host @ H)) & (setIn @ G @ alive)) => (~ ((elem @ (m_Down @ H) @ (queue @ (host @ E))) & (setIn @ (host @ F) @ (index @ down @ (host @ G)))))) & ! [E:$i,F:$i,G:$i]: (~ (((host @ E) = (index @ ldr @ (host @ E))) & ((index @ status @ (host @ E)) = norm) & (setIn @ E @ alive)) | ~ (~ (leq @ (host @ F) @ (host @ G)) & (elem @ (m_Down @ F) @ (queue @ (host @ G))) & ((host @ E) = (host @ F)) & (setIn @ G @ alive))) & ! [E:$i,F:$i,G:$i]: (((setIn @ G @ alive) & ((index @ status @ (host @ G)) = norm) & ((host @ G) = (index @ ldr @ (host @ G))) & ((host @ F) = (host @ G))) => (~ ((elem @ (m_Down @ F) @ (queue @ (host @ E))) & (setIn @ E @ alive)))) & ! [E:$i,F:$i]: (~ ((setIn @ (host @ F) @ (index @ down @ (host @ E))) & (setIn @ E @ alive)) | ~ ((setIn @ F @ alive) & ((index @ ldr @ (host @ F)) = (host @ F)) & ((index @ status @ (host @ F)) = norm))) & ! [E:$i,F:$i]: ((elem @ (m_Ldr @ F) @ (queue @ (host @ E))) => (~ (leq @ (host @ E) @ (host @ F))))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])). 12.06/4.55 thf(41,axiom,((! [A:$i,B:$i,C:$i]: ((m_Ack @ A @ B) != (m_NotNorm @ C)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_13)). 12.06/4.55 thf(347,plain,((! [A:$i,B:$i,C:$i]: ~ ((m_Ack @ A @ B) = (m_NotNorm @ C)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[41])). 12.06/4.55 thf(18,axiom,((elec_1 != norm)),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_07)). 12.06/4.55 thf(249,plain,((~ (elec_1 = norm))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[18])). 12.06/4.55 thf(54,axiom,((! [A:$i,B:$i]: ((tail @ (cons @ A @ B)) = B))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_36)). 12.06/4.55 thf(408,plain,((! [A:$i,B:$i]: ((tail @ (cons @ A @ B)) = B))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[54])). 12.06/4.55 thf(31,axiom,((! [A:$i,B:$i]: ((init @ (snoc @ B @ A)) = B))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_38)). 12.06/4.55 thf(308,plain,((! [A:$i,B:$i]: ((init @ (snoc @ B @ A)) = B))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[31])). 12.06/4.55 thf(49,axiom,((elec_2 != elec_1)),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_05)). 12.06/4.55 thf(385,plain,((~ (elec_2 = elec_1))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[49])). 12.06/4.55 thf(53,axiom,((! [A:$i,B:$i]: ((m_Halt @ B) != (m_Ldr @ A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_22)). 12.06/4.55 thf(404,plain,((! [A:$i,B:$i]: ~ ((m_Halt @ B) = (m_Ldr @ A)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[53])). 12.06/4.55 thf(46,axiom,((! [A:$i,B:$i]: ((m_Down @ A) != (m_Halt @ B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_17)). 12.06/4.55 thf(372,plain,((! [A:$i,B:$i]: ~ ((m_Down @ A) = (m_Halt @ B)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[46])). 12.06/4.55 thf(36,axiom,((! [A:$i]: (leq @ (s @ zero) @ (host @ A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_02)). 12.06/4.55 thf(325,plain,((! [A:$i]: (leq @ (s @ zero) @ (host @ A)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[36])). 12.06/4.55 thf(61,axiom,((! [A:$i,B:$i]: (q_nil != (cons @ A @ B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_41)). 12.06/4.55 thf(443,plain,((! [A:$i,B:$i]: ~ (q_nil = (cons @ A @ B)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[61])). 12.06/4.55 thf(47,axiom,((! [A:$i,B:$i,C:$i]: ((m_Ack @ A @ B) != (m_Halt @ C)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11)). 12.06/4.55 thf(376,plain,((! [A:$i,B:$i,C:$i]: ~ ((m_Ack @ A @ B) = (m_Halt @ C)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[47])). 12.06/4.55 thf(64,axiom,((! [A:$i]: (leq @ (host @ A) @ nbr_proc))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_04)). 12.06/4.55 thf(453,plain,((! [A:$i]: (leq @ (host @ A) @ nbr_proc))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[64])). 12.06/4.55 thf(55,axiom,((leq @ (s @ zero) @ nbr_proc)),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_03)). 12.06/4.55 thf(411,plain,((leq @ (s @ zero) @ nbr_proc)),inference(defexp_and_simp_and_etaexpand,[status(thm)],[55])). 12.06/4.55 thf(25,axiom,((~ (setIn @ nil @ alive))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_34)). 12.06/4.55 thf(292,plain,((~ (setIn @ nil @ alive))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[25])). 12.06/4.55 thf(48,axiom,((! [A:$i,B:$i]: (((host @ B) != (host @ A)) => (B != A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_33)). 12.06/4.55 thf(380,plain,((! [A:$i,B:$i]: ((~ ((host @ B) = (host @ A))) => (~ (B = A))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[48])). 12.06/4.55 thf(8,axiom,((! [A:$i,B:$i]: ((m_NormQ @ A) != (m_NotNorm @ B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_25)). 12.06/4.55 thf(201,plain,((! [A:$i,B:$i]: ~ ((m_NormQ @ A) = (m_NotNorm @ B)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[8])). 12.06/4.55 thf(29,axiom,((! [A:$i,B:$i,C:$i]: ((cons @ A @ (snoc @ C @ B)) = (snoc @ (cons @ A @ C) @ B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_44)). 12.06/4.55 thf(302,plain,((! [A:$i,B:$i,C:$i]: ((cons @ A @ (snoc @ C @ B)) = (snoc @ (cons @ A @ C) @ B)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[29])). 12.06/4.55 thf(27,axiom,((! [A:$i,B:$i]: ((leq @ A @ B) | (leq @ B @ A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_60)). 12.06/4.55 thf(297,plain,((! [A:$i,B:$i]: ((leq @ A @ B) | (leq @ B @ A)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[27])). 12.06/4.55 thf(67,axiom,((! [A:$i]: ~ (leq @ (s @ A) @ A))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_58)). 12.06/4.55 thf(467,plain,((! [A:$i]: ~ (leq @ (s @ A) @ A))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[67])). 12.06/4.55 thf(12,axiom,((norm != elec_2)),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_09)). 12.06/4.55 thf(229,plain,((~ (norm = elec_2))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[12])). 12.06/4.55 thf(19,axiom,((! [A:$i,B:$i,C:$i]: ((ordered @ A) => (ordered @ (snoc @ A @ (m_Ack @ B @ C)))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_55)). 12.06/4.55 thf(252,plain,((! [A:$i,B:$i,C:$i]: ((ordered @ A) => (ordered @ (snoc @ A @ (m_Ack @ B @ C)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[19])). 12.06/4.55 thf(38,axiom,((! [A:$i]: ((q_nil = A) | (A = (cons @ (head @ A) @ (tail @ A)))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_39)). 12.06/4.55 thf(329,plain,((! [A:$i]: ((q_nil = A) | (A = (cons @ (head @ A) @ (tail @ A)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[38])). 12.06/4.55 thf(50,axiom,((! [A:$i]: ~ (elem @ A @ q_nil))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_45)). 12.06/4.55 thf(388,plain,((! [A:$i]: ~ (elem @ A @ q_nil))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[50])). 12.06/4.55 thf(58,axiom,((! [A:$i]: ((? [B:$i]: (((m_Down @ B) = A) | (A = (m_Halt @ B)))) <=> (pidElem @ A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_48)). 12.06/4.55 thf(420,plain,((! [A:$i]: (((? [B:$i]: (((m_Down @ B) = A) | (A = (m_Halt @ B)))) => (pidElem @ A)) & ((pidElem @ A) => (? [B:$i]: (((m_Down @ B) = A) | (A = (m_Halt @ B)))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[58])). 12.06/4.55 thf(9,axiom,((! [A:$i,B:$i]: ((m_Halt @ B) != (m_NotNorm @ A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_16)). 12.06/4.55 thf(205,plain,((! [A:$i,B:$i]: ~ ((m_Halt @ B) = (m_NotNorm @ A)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[9])). 12.06/4.55 thf(32,axiom,((elec_1 != wait)),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_06)). 12.06/4.55 thf(311,plain,((~ (elec_1 = wait))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[32])). 12.06/4.55 thf(56,axiom,((! [A:$i,B:$i]: (((setIn @ A @ pids) & (setIn @ B @ pids)) <= (elem @ (m_Ack @ A @ B) @ (queue @ (host @ A)))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom)). 12.06/4.55 thf(412,plain,((! [A:$i,B:$i]: (((setIn @ A @ pids) & (setIn @ B @ pids)) | ~ (elem @ (m_Ack @ A @ B) @ (queue @ (host @ A)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[56])). 12.06/4.55 thf(23,axiom,((! [A:$i,B:$i]: ((m_Ldr @ A) != (m_NormQ @ B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_23)). 12.06/4.55 thf(279,plain,((! [A:$i,B:$i]: ~ ((m_Ldr @ A) = (m_NormQ @ B)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[23])). 12.06/4.55 thf(7,axiom,((! [A:$i,B:$i]: (((m_NotNorm @ B) != (m_NotNorm @ A)) <=> (B != A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_28)). 12.06/4.55 thf(191,plain,((! [A:$i,B:$i]: (((~ ((m_NotNorm @ B) = (m_NotNorm @ A))) => (~ (B = A))) & ((~ (B = A)) => (~ ((m_NotNorm @ B) = (m_NotNorm @ A))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[7])). 12.06/4.55 thf(21,axiom,((! [A:$i,B:$i,C:$i]: ((m_Ack @ A @ B) != (m_NormQ @ C)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_15)). 12.06/4.56 thf(259,plain,((! [A:$i,B:$i,C:$i]: ~ ((m_Ack @ A @ B) = (m_NormQ @ C)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[21])). 12.06/4.56 thf(51,axiom,((! [A:$i,B:$i]: ((m_NormQ @ B) != (m_Down @ A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20)). 12.06/4.56 thf(391,plain,((! [A:$i,B:$i]: ~ ((m_NormQ @ B) = (m_Down @ A)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[51])). 12.06/4.56 thf(14,axiom,((! [A:$i,B:$i]: ((m_Down @ A) != (m_Ldr @ B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_18)). 12.06/4.56 thf(236,plain,((! [A:$i,B:$i]: ~ ((m_Down @ A) = (m_Ldr @ B)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[14])). 12.06/4.56 thf(5,axiom,((! [A:$i,B:$i]: ((A != B) <=> ((m_NormQ @ A) != (m_NormQ @ B))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_27)). 12.06/4.56 thf(181,plain,((! [A:$i,B:$i]: (((~ (A = B)) => (~ ((m_NormQ @ A) = (m_NormQ @ B)))) & ((~ ((m_NormQ @ A) = (m_NormQ @ B))) => (~ (A = B)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[5])). 12.06/4.56 thf(34,axiom,((! [A:$i,B:$i]: ((m_Down @ A) != (m_NotNorm @ B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_19)). 12.06/4.56 thf(318,plain,((! [A:$i,B:$i]: ~ ((m_Down @ A) = (m_NotNorm @ B)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[34])). 12.06/4.56 thf(60,axiom,((! [A:$i,B:$i]: ((B != A) <=> ((m_Ldr @ B) != (m_Ldr @ A))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_29)). 12.06/4.56 thf(434,plain,((! [A:$i,B:$i]: (((~ (B = A)) => (~ ((m_Ldr @ B) = (m_Ldr @ A)))) & ((~ ((m_Ldr @ B) = (m_Ldr @ A))) => (~ (B = A)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[60])). 12.06/4.56 thf(11,axiom,((! [A:$i,B:$i]: ((ordered @ (cons @ A @ B)) <=> (! [C:$i]: ((leq @ (pidMsg @ A) @ (pidMsg @ C)) <= ((elem @ C @ B) & (pidElem @ C) & ((host @ (pidMsg @ C)) = (host @ (pidMsg @ A))) & (pidElem @ A))) & (ordered @ B))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_53)). 12.06/4.56 thf(213,plain,((! [A:$i,B:$i]: (((ordered @ (cons @ A @ B)) => (! [C:$i]: ((leq @ (pidMsg @ A) @ (pidMsg @ C)) | ~ ((elem @ C @ B) & (pidElem @ C) & ((host @ (pidMsg @ C)) = (host @ (pidMsg @ A))) & (pidElem @ A))) & (ordered @ B))) & ((! [C:$i]: ((leq @ (pidMsg @ A) @ (pidMsg @ C)) | ~ ((elem @ C @ B) & (pidElem @ C) & ((host @ (pidMsg @ C)) = (host @ (pidMsg @ A))) & (pidElem @ A))) & (ordered @ B)) => (ordered @ (cons @ A @ B)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[11])). 12.06/4.56 thf(15,axiom,((! [A:$i]: (leq @ A @ A))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_59)). 12.06/4.56 thf(240,plain,((! [A:$i]: (leq @ A @ A))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[15])). 12.06/4.56 thf(65,axiom,((! [A:$i,B:$i]: ((A != B) <=> ((m_Down @ A) != (m_Down @ B))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_30)). 12.06/4.56 thf(455,plain,((! [A:$i,B:$i]: (((~ (A = B)) => (~ ((m_Down @ A) = (m_Down @ B)))) & ((~ ((m_Down @ A) = (m_Down @ B))) => (~ (A = B)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[65])). 12.06/4.56 thf(28,axiom,((elec_2 != wait)),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_08)). 12.06/4.56 thf(299,plain,((~ (elec_2 = wait))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[28])). 12.06/4.56 thf(59,axiom,((! [A:$i,B:$i]: (((host @ B) != (host @ A)) <= ((host @ B) = (s @ (host @ A)))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_01)). 12.06/4.56 thf(431,plain,((! [A:$i,B:$i]: (~ ((host @ B) = (host @ A)) | ~ ((host @ B) = (s @ (host @ A)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[59])). 12.06/4.56 thf(20,axiom,((! [A:$i,B:$i]: (q_nil != (snoc @ B @ A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_42)). 12.06/4.56 thf(255,plain,((! [A:$i,B:$i]: ~ (q_nil = (snoc @ B @ A)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[20])). 12.06/4.56 thf(10,axiom,((! [A:$i,B:$i]: ((m_NormQ @ A) != (m_Halt @ B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_21)). 12.06/4.56 thf(209,plain,((! [A:$i,B:$i]: ~ ((m_NormQ @ A) = (m_Halt @ B)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[10])). 12.06/4.56 thf(37,axiom,((! [A:$i,B:$i,C:$i]: ((leq @ A @ C) <= ((leq @ B @ C) & (leq @ A @ B))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_62)). 12.06/4.56 thf(327,plain,((! [A:$i,B:$i,C:$i]: ((leq @ A @ C) | ~ ((leq @ B @ C) & (leq @ A @ B))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[37])). 12.06/4.56 thf(22,axiom,((! [A:$i,B:$i]: ((ordered @ (snoc @ B @ A)) <=> (! [C:$i]: (((elem @ C @ B) & ((host @ (pidMsg @ C)) = (host @ (pidMsg @ A))) & (pidElem @ C) & (pidElem @ A)) => (leq @ (pidMsg @ C) @ (pidMsg @ A))) & (ordered @ B))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_54)). 12.06/4.56 thf(263,plain,((! [A:$i,B:$i]: (((ordered @ (snoc @ B @ A)) => (! [C:$i]: (((elem @ C @ B) & ((host @ (pidMsg @ C)) = (host @ (pidMsg @ A))) & (pidElem @ C) & (pidElem @ A)) => (leq @ (pidMsg @ C) @ (pidMsg @ A))) & (ordered @ B))) & ((! [C:$i]: (((elem @ C @ B) & ((host @ (pidMsg @ C)) = (host @ (pidMsg @ A))) & (pidElem @ C) & (pidElem @ A)) => (leq @ (pidMsg @ C) @ (pidMsg @ A))) & (ordered @ B)) => (ordered @ (snoc @ B @ A)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[22])). 12.06/4.56 thf(68,axiom,((! [A:$i]: (A = (pidMsg @ (m_Down @ A))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_50)). 12.06/4.56 thf(470,plain,((! [A:$i]: (A = (pidMsg @ (m_Down @ A))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[68])). 12.06/4.56 thf(33,axiom,((! [A:$i,B:$i,C:$i,D:$i]: (((m_Ack @ B @ D) != (m_Ack @ A @ C)) <= (C != D)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_32)). 12.06/4.56 thf(314,plain,((! [A:$i,B:$i,C:$i,D:$i]: (~ ((m_Ack @ B @ D) = (m_Ack @ A @ C)) | (C = D)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[33])). 12.06/4.56 thf(63,axiom,((! [A:$i]: ((snoc @ q_nil @ A) = (cons @ A @ q_nil)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_43)). 12.06/4.56 thf(450,plain,((! [A:$i]: ((snoc @ q_nil @ A) = (cons @ A @ q_nil)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[63])). 12.06/4.56 thf(44,axiom,((! [A:$i,B:$i,C:$i,D:$i]: (((m_Ack @ A @ C) != (m_Ack @ B @ D)) <= (A != B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_31)). 12.06/4.56 thf(363,plain,((! [A:$i,B:$i,C:$i,D:$i]: (~ ((m_Ack @ A @ C) = (m_Ack @ B @ D)) | (A = B)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[44])). 12.06/4.56 thf(45,axiom,((! [A:$i,B:$i,C:$i]: ((m_Ack @ A @ B) != (m_Ldr @ C)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14)). 12.06/4.56 thf(368,plain,((! [A:$i,B:$i,C:$i]: ~ ((m_Ack @ A @ B) = (m_Ldr @ C)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[45])). 12.06/4.56 thf(42,axiom,((wait != norm)),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10)). 12.06/4.56 thf(351,plain,((~ (wait = norm))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[42])). 12.06/4.56 thf(4,axiom,((! [A:$i,B:$i]: (((m_Halt @ A) != (m_Halt @ B)) <=> (A != B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_26)). 12.06/4.56 thf(171,plain,((! [A:$i,B:$i]: (((~ ((m_Halt @ A) = (m_Halt @ B))) => (~ (A = B))) & ((~ (A = B)) => (~ ((m_Halt @ A) = (m_Halt @ B))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[4])). 12.06/4.56 thf(17,axiom,((! [A:$i,B:$i]: (A = (head @ (cons @ A @ B))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_35)). 12.06/4.56 thf(246,plain,((! [A:$i,B:$i]: (A = (head @ (cons @ A @ B))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[17])). 12.06/4.56 thf(62,axiom,((! [A:$i]: (((snoc @ (init @ A) @ (last @ A)) = A) | (q_nil = A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_40)). 12.06/4.56 thf(447,plain,((! [A:$i]: (((snoc @ (init @ A) @ (last @ A)) = A) | (q_nil = A)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[62])). 12.06/4.56 thf(3,axiom,((! [A:$i]: ((pidMsg @ (m_Halt @ A)) = A))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_49)). 12.06/4.56 thf(168,plain,((! [A:$i]: ((pidMsg @ (m_Halt @ A)) = A))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[3])). 12.06/4.56 thf(6,axiom,((ordered @ q_nil)),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_51)). 12.06/4.56 thf(190,plain,((ordered @ q_nil)),inference(defexp_and_simp_and_etaexpand,[status(thm)],[6])). 12.06/4.56 thf(30,axiom,((! [A:$i,B:$i]: (A = (last @ (snoc @ B @ A))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_37)). 12.06/4.56 thf(305,plain,((! [A:$i,B:$i]: (A = (last @ (snoc @ B @ A))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[30])). 12.06/4.56 thf(16,axiom,((! [A:$i,B:$i]: ((m_NotNorm @ B) != (m_Ldr @ A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_24)). 12.06/4.56 thf(242,plain,((! [A:$i,B:$i]: ~ ((m_NotNorm @ B) = (m_Ldr @ A)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[16])). 12.06/4.56 thf(26,axiom,((! [A:$i]: ~ (setIn @ A @ setEmpty))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_65)). 12.06/4.56 thf(294,plain,((! [A:$i]: ~ (setIn @ A @ setEmpty))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[26])). 12.06/4.56 thf(24,axiom,((! [A:$i,B:$i,C:$i]: ((elem @ A @ (snoc @ C @ B)) <=> ((elem @ A @ C) | (B = A))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_47)). 12.06/4.56 thf(283,plain,((! [A:$i,B:$i,C:$i]: (((elem @ A @ (snoc @ C @ B)) => ((elem @ A @ C) | (B = A))) & (((elem @ A @ C) | (B = A)) => (elem @ A @ (snoc @ C @ B)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[24])). 12.06/4.56 thf(57,axiom,((! [A:$i,B:$i]: ((leq @ (s @ A) @ (s @ B)) <=> (leq @ A @ B)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_63)). 12.06/4.56 thf(415,plain,((! [A:$i,B:$i]: (((leq @ (s @ A) @ (s @ B)) => (leq @ A @ B)) & ((leq @ A @ B) => (leq @ (s @ A) @ (s @ B)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[57])). 12.06/4.56 thf(52,axiom,((! [A:$i,B:$i,C:$i]: ((elem @ A @ (cons @ B @ C)) <=> ((elem @ A @ C) | (A = B))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_46)). 12.06/4.56 thf(395,plain,((! [A:$i,B:$i,C:$i]: (((elem @ A @ (cons @ B @ C)) => ((elem @ A @ C) | (A = B))) & (((elem @ A @ C) | (A = B)) => (elem @ A @ (cons @ B @ C)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[52])). 12.06/4.56 thf(66,axiom,((! [A:$i,B:$i]: ((ordered @ A) => (ordered @ (snoc @ A @ (m_Ldr @ B)))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_56)). 12.06/4.56 thf(464,plain,((! [A:$i,B:$i]: ((ordered @ A) => (ordered @ (snoc @ A @ (m_Ldr @ B)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[66])). 12.06/4.56 thf(39,axiom,((! [A:$i]: ((ordered @ (snoc @ q_nil @ A)) & (ordered @ (cons @ A @ q_nil))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_52)). 12.06/4.56 thf(332,plain,((! [A:$i]: ((ordered @ (snoc @ q_nil @ A)) & (ordered @ (cons @ A @ q_nil))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[39])). 12.06/4.56 thf(35,axiom,((! [A:$i,B:$i,C:$i]: ((((host @ B) = (host @ C)) & (elem @ (m_Down @ C) @ A) & (ordered @ (cons @ (m_Halt @ B) @ A))) => (leq @ B @ C)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_57)). 12.06/4.56 thf(322,plain,((! [A:$i,B:$i,C:$i]: ((((host @ B) = (host @ C)) & (elem @ (m_Down @ C) @ A) & (ordered @ (cons @ (m_Halt @ B) @ A))) => (leq @ B @ C)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[35])). 12.06/4.56 thf(40,axiom,((! [A:$i,B:$i]: (((leq @ B @ A) & (leq @ A @ B)) <=> (B = A)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_61)). 12.06/4.56 thf(337,plain,((! [A:$i,B:$i]: ((((leq @ B @ A) & (leq @ A @ B)) => (B = A)) & ((B = A) => ((leq @ B @ A) & (leq @ A @ B)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[40])). 12.06/4.56 thf(43,axiom,((! [A:$i,B:$i]: ((((s @ B) = A) | (leq @ A @ B)) <=> (leq @ A @ (s @ B))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_64)). 12.06/4.56 thf(354,plain,((! [A:$i,B:$i]: (((((s @ B) = A) | (leq @ A @ B)) => (leq @ A @ (s @ B))) & ((leq @ A @ (s @ B)) => (((s @ B) = A) | (leq @ A @ B)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[43])). 12.06/4.56 thf(13,axiom,((! [A:$i,B:$i,C:$i]: ((m_Ack @ A @ B) != (m_Down @ C)))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12)). 12.06/4.56 thf(232,plain,((! [A:$i,B:$i,C:$i]: ~ ((m_Ack @ A @ B) = (m_Down @ C)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[13])). 12.06/4.56 thf(482,plain,($false),inference(e,[status(thm)],[69,347,249,408,308,385,404,372,325,443,376,453,411,292,380,201,302,297,467,229,252,329,388,420,205,311,412,279,191,259,391,236,181,318,434,213,240,455,299,431,255,209,327,263,470,314,450,363,368,351,171,246,447,168,190,305,242,294,283,415,395,464,332,322,337,354,232])). 12.06/4.56 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p 12.06/4.56 % [INFO] Killing All external provers ... 12.18/4.61 EOF