TSTP Solution File: SWV326-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV326-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:11:55 EDT 2022
% Result : Unsatisfiable 0.66s 0.96s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV326-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 01:32:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.66/0.96 ============================== Prover9 ===============================
% 0.66/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.96 Process 747 was started by sandbox2 on n004.cluster.edu,
% 0.66/0.96 Wed Jun 15 01:32:54 2022
% 0.66/0.96 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_452_n004.cluster.edu".
% 0.66/0.96 ============================== end of head ===========================
% 0.66/0.96
% 0.66/0.96 ============================== INPUT =================================
% 0.66/0.96
% 0.66/0.96 % Reading from file /tmp/Prover9_452_n004.cluster.edu
% 0.66/0.96
% 0.66/0.96 set(prolog_style_variables).
% 0.66/0.96 set(auto2).
% 0.66/0.96 % set(auto2) -> set(auto).
% 0.66/0.96 % set(auto) -> set(auto_inference).
% 0.66/0.96 % set(auto) -> set(auto_setup).
% 0.66/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.96 % set(auto) -> set(auto_limits).
% 0.66/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.96 % set(auto) -> set(auto_denials).
% 0.66/0.96 % set(auto) -> set(auto_process).
% 0.66/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.96 % set(auto2) -> assign(stats, some).
% 0.66/0.96 % set(auto2) -> clear(echo_input).
% 0.66/0.96 % set(auto2) -> set(quiet).
% 0.66/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.96 % set(auto2) -> clear(print_given).
% 0.66/0.96 assign(lrs_ticks,-1).
% 0.66/0.96 assign(sos_limit,10000).
% 0.66/0.96 assign(order,kbo).
% 0.66/0.96 set(lex_order_vars).
% 0.66/0.96 clear(print_given).
% 0.66/0.96
% 0.66/0.96 % formulas(sos). % not echoed (8 formulas)
% 0.66/0.96
% 0.66/0.96 ============================== end of input ==========================
% 0.66/0.96
% 0.66/0.96 % From the command line: assign(max_seconds, 300).
% 0.66/0.96
% 0.66/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.96
% 0.66/0.96 % Formulas that are not ordinary clauses:
% 0.66/0.96
% 0.66/0.96 ============================== end of process non-clausal formulas ===
% 0.66/0.96
% 0.66/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.96
% 0.66/0.96 ============================== PREDICATE ELIMINATION =================
% 0.66/0.96
% 0.66/0.96 ============================== end predicate elimination =============
% 0.66/0.96
% 0.66/0.96 Auto_denials: (non-Horn, no changes).
% 0.66/0.96
% 0.66/0.96 Term ordering decisions:
% 0.66/0.96 Function symbol KB weights: tc_Message_Omsg=1. c_Message_Oagent_OSpy=1. v_A=1. v_Aa=1. v_C=1. v_Ba=1. v_NA=1. v_NAa=1. v_evs1=1. v_B=1. c_Message_Omsg_OMPair=1. c_Event_Oknows=1. c_Message_Omsg_OCrypt=1. c_Message_Oparts=1. c_Message_Omsg_OAgent=1. c_Message_Omsg_ONonce=1. c_Public_OshrK=1. c_Event_Oused=1.
% 0.66/0.96
% 0.66/0.96 ============================== end of process initial clauses ========
% 0.66/0.96
% 0.66/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.66/0.96
% 0.66/0.96 ============================== end of clauses for search =============
% 0.66/0.96
% 0.66/0.96 ============================== SEARCH ================================
% 0.66/0.96
% 0.66/0.96 % Starting search at 0.01 seconds.
% 0.66/0.96
% 0.66/0.96 ============================== PROOF =================================
% 0.66/0.96 % SZS status Unsatisfiable
% 0.66/0.96 % SZS output start Refutation
% 0.66/0.96
% 0.66/0.96 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.66/0.96 % Length of proof is 20.
% 0.66/0.96 % Level of proof is 7.
% 0.66/0.96 % Maximum clause weight is 19.000.
% 0.66/0.96 % Given clauses 12.
% 0.66/0.96
% 0.66/0.96 1 v_A = v_Aa # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.66/0.96 2 v_Aa = v_A. [copy(1),flip(a)].
% 0.66/0.96 3 v_NA = c_Message_Omsg_ONonce(v_NAa) # label(cls_conjecture_5) # label(negated_conjecture). [assumption].
% 0.66/0.96 4 c_Message_Omsg_ONonce(v_NAa) = v_NA. [copy(3),flip(a)].
% 0.66/0.96 5 c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_C)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg) | v_C = v_Ba # label(cls_conjecture_21) # label(negated_conjecture). [assumption].
% 0.66/0.96 6 c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_C)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg) | v_Ba = v_C. [copy(5),flip(b)].
% 0.66/0.96 7 -c_in(c_Message_Omsg_ONonce(v_NAa),c_Event_Oused(v_evs1),tc_Message_Omsg) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.66/0.96 8 -c_in(v_NA,c_Event_Oused(v_evs1),tc_Message_Omsg). [copy(7),rewrite([4(2)])].
% 0.66/0.96 9 -c_in(A,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,B)),tc_Message_Omsg) | c_in(A,c_Event_Oused(B),tc_Message_Omsg) # label(cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0) # label(axiom). [assumption].
% 0.66/0.96 10 -c_in(c_Message_Omsg_OMPair(A,B),c_Message_Oparts(C),tc_Message_Omsg) | c_in(A,c_Message_Oparts(C),tc_Message_Omsg) # label(cls_Message_OMPair__parts_1) # label(axiom). [assumption].
% 0.66/0.96 11 -c_in(c_Message_Omsg_OCrypt(A,B),c_Message_Oparts(C),tc_Message_Omsg) | c_in(B,c_Message_Oparts(C),tc_Message_Omsg) # label(cls_Message_Oparts_OBody__dest_0) # label(axiom). [assumption].
% 0.66/0.96 12 v_Ba != v_C | c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_Aa),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NAa),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Aa),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg) # label(cls_conjecture_32) # label(negated_conjecture). [assumption].
% 0.66/0.96 13 v_Ba != v_C | c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg). [copy(12),rewrite([2(4),4(7),2(7)])].
% 0.66/0.96 15 -c_in(v_NA,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg). [ur(9,b,8,a)].
% 0.66/0.96 16 c_in(c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_C))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg) | v_Ba = v_C. [resolve(11,a,6,a)].
% 0.66/0.96 18 -c_in(c_Message_Omsg_OMPair(v_NA,A),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg). [ur(10,b,15,a)].
% 0.66/0.96 19 v_Ba = v_C. [back_unit_del(16),unit_del(a,18)].
% 0.66/0.96 20 c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg). [back_rewrite(13),rewrite([19(1)]),xx(a)].
% 0.66/0.96 23 -c_in(c_Message_Omsg_OCrypt(A,c_Message_Omsg_OMPair(v_NA,B)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg). [ur(11,b,18,a)].
% 0.66/0.96 24 $F. [resolve(23,a,20,a)].
% 0.66/0.96
% 0.66/0.96 % SZS output end Refutation
% 0.66/0.96 ============================== end of proof ==========================
% 0.66/0.96
% 0.66/0.96 ============================== STATISTICS ============================
% 0.66/0.96
% 0.66/0.96 Given=12. Generated=20. Kept=18. proofs=1.
% 0.66/0.96 Usable=9. Sos=4. Demods=3. Limbo=0, Disabled=12. Hints=0.
% 0.66/0.96 Megabytes=0.05.
% 0.66/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.66/0.96
% 0.66/0.96 ============================== end of statistics =====================
% 0.66/0.96
% 0.66/0.96 ============================== end of search =========================
% 0.66/0.96
% 0.66/0.96 THEOREM PROVED
% 0.66/0.96 % SZS status Unsatisfiable
% 0.66/0.96
% 0.66/0.96 Exiting with 1 proof.
% 0.66/0.96
% 0.66/0.96 Process 747 exit (max_proofs) Wed Jun 15 01:32:54 2022
% 0.66/0.96 Prover9 interrupted
%------------------------------------------------------------------------------