TSTP Solution File: SWV247-2 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SWV247-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n009.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:04 EDT 2022

% Result   : Unsatisfiable 0.89s 1.16s
% Output   : Refutation 0.89s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV247-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n009.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 18:12:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.89/1.16  ============================== Prover9 ===============================
% 0.89/1.16  Prover9 (32) version 2009-11A, November 2009.
% 0.89/1.16  Process 32702 was started by sandbox on n009.cluster.edu,
% 0.89/1.16  Wed Jun 15 18:12:23 2022
% 0.89/1.16  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32549_n009.cluster.edu".
% 0.89/1.16  ============================== end of head ===========================
% 0.89/1.16  
% 0.89/1.16  ============================== INPUT =================================
% 0.89/1.16  
% 0.89/1.16  % Reading from file /tmp/Prover9_32549_n009.cluster.edu
% 0.89/1.16  
% 0.89/1.16  set(prolog_style_variables).
% 0.89/1.16  set(auto2).
% 0.89/1.16      % set(auto2) -> set(auto).
% 0.89/1.16      % set(auto) -> set(auto_inference).
% 0.89/1.16      % set(auto) -> set(auto_setup).
% 0.89/1.16      % set(auto_setup) -> set(predicate_elim).
% 0.89/1.16      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.89/1.16      % set(auto) -> set(auto_limits).
% 0.89/1.16      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.89/1.16      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.89/1.16      % set(auto) -> set(auto_denials).
% 0.89/1.16      % set(auto) -> set(auto_process).
% 0.89/1.16      % set(auto2) -> assign(new_constants, 1).
% 0.89/1.16      % set(auto2) -> assign(fold_denial_max, 3).
% 0.89/1.16      % set(auto2) -> assign(max_weight, "200.000").
% 0.89/1.16      % set(auto2) -> assign(max_hours, 1).
% 0.89/1.16      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.89/1.16      % set(auto2) -> assign(max_seconds, 0).
% 0.89/1.16      % set(auto2) -> assign(max_minutes, 5).
% 0.89/1.16      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.89/1.16      % set(auto2) -> set(sort_initial_sos).
% 0.89/1.16      % set(auto2) -> assign(sos_limit, -1).
% 0.89/1.16      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.89/1.16      % set(auto2) -> assign(max_megs, 400).
% 0.89/1.16      % set(auto2) -> assign(stats, some).
% 0.89/1.16      % set(auto2) -> clear(echo_input).
% 0.89/1.16      % set(auto2) -> set(quiet).
% 0.89/1.16      % set(auto2) -> clear(print_initial_clauses).
% 0.89/1.16      % set(auto2) -> clear(print_given).
% 0.89/1.16  assign(lrs_ticks,-1).
% 0.89/1.16  assign(sos_limit,10000).
% 0.89/1.16  assign(order,kbo).
% 0.89/1.16  set(lex_order_vars).
% 0.89/1.16  clear(print_given).
% 0.89/1.16  
% 0.89/1.16  % formulas(sos).  % not echoed (10 formulas)
% 0.89/1.16  
% 0.89/1.16  ============================== end of input ==========================
% 0.89/1.16  
% 0.89/1.16  % From the command line: assign(max_seconds, 300).
% 0.89/1.16  
% 0.89/1.16  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.89/1.16  
% 0.89/1.16  % Formulas that are not ordinary clauses:
% 0.89/1.16  
% 0.89/1.16  ============================== end of process non-clausal formulas ===
% 0.89/1.16  
% 0.89/1.16  ============================== PROCESS INITIAL CLAUSES ===============
% 0.89/1.16  
% 0.89/1.16  ============================== PREDICATE ELIMINATION =================
% 0.89/1.16  
% 0.89/1.16  ============================== end predicate elimination =============
% 0.89/1.16  
% 0.89/1.16  Auto_denials:  (non-Horn, no changes).
% 0.89/1.16  
% 0.89/1.16  Term ordering decisions:
% 0.89/1.16  Function symbol KB weights:  tc_Message_Omsg=1. v_G=1. v_H=1. v_K=1. v_X=1. c_Message_Omsg_OCrypt=1. c_Message_Oanalz=1. c_Message_Osynth=1. c_Message_Omsg_OKey=1. c_Message_OinvKey=1. c_union=1.
% 0.89/1.16  
% 0.89/1.16  ============================== end of process initial clauses ========
% 0.89/1.16  
% 0.89/1.16  ============================== CLAUSES FOR SEARCH ====================
% 0.89/1.16  
% 0.89/1.16  ============================== end of clauses for search =============
% 0.89/1.16  
% 0.89/1.16  ============================== SEARCH ================================
% 0.89/1.16  
% 0.89/1.16  % Starting search at 0.01 seconds.
% 0.89/1.16  
% 0.89/1.16  ============================== PROOF =================================
% 0.89/1.16  % SZS status Unsatisfiable
% 0.89/1.16  % SZS output start Refutation
% 0.89/1.16  
% 0.89/1.16  % Proof 1 at 0.19 (+ 0.01) seconds.
% 0.89/1.16  % Length of proof is 29.
% 0.89/1.16  % Level of proof is 15.
% 0.89/1.16  % Maximum clause weight is 19.000.
% 0.89/1.16  % Given clauses 122.
% 0.89/1.16  
% 0.89/1.16  1 c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg) # label(cls_conjecture_1) # label(negated_conjecture).  [assumption].
% 0.89/1.16  2 c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg) # label(cls_conjecture_3) # label(negated_conjecture).  [assumption].
% 0.89/1.16  3 -c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg) # label(cls_conjecture_4) # label(negated_conjecture).  [assumption].
% 0.89/1.16  4 -c_in(A,B,tc_Message_Omsg) | c_in(A,c_Message_Oanalz(B),tc_Message_Omsg) # label(cls_Message_Oanalz_OInj_0) # label(axiom).  [assumption].
% 0.89/1.16  5 -c_in(c_Message_Omsg_OKey(A),c_Message_Osynth(B),tc_Message_Omsg) | c_in(c_Message_Omsg_OKey(A),B,tc_Message_Omsg) # label(cls_Message_OKey__synth_0) # label(axiom).  [assumption].
% 0.89/1.16  6 -c_in(A,B,C) | c_in(A,c_union(D,B,C),C) # label(cls_Set_OUnCI_0) # label(axiom).  [assumption].
% 0.89/1.16  7 -c_in(A,B,C) | c_in(A,c_union(B,D,C),C) # label(cls_Set_OUnCI_1) # label(axiom).  [assumption].
% 0.89/1.16  8 -c_in(A,c_union(B,C,D),D) | c_in(A,C,D) | c_in(A,B,D) # label(cls_Set_OUnE_0) # label(axiom).  [assumption].
% 0.89/1.16  9 -c_in(c_Message_Omsg_OCrypt(A,B),c_Message_Osynth(C),tc_Message_Omsg) | c_in(B,c_Message_Osynth(C),tc_Message_Omsg) | c_in(c_Message_Omsg_OCrypt(A,B),C,tc_Message_Omsg) # label(cls_Message_OCrypt__synth_1) # label(axiom).  [assumption].
% 0.89/1.16  10 -c_in(c_Message_Omsg_OCrypt(A,B),c_Message_Oanalz(C),tc_Message_Omsg) | -c_in(c_Message_Omsg_OKey(c_Message_OinvKey(A)),c_Message_Oanalz(C),tc_Message_Omsg) | c_in(B,c_Message_Oanalz(C),tc_Message_Omsg) # label(cls_Message_Oanalz_ODecrypt__dest_0) # label(axiom).  [assumption].
% 0.89/1.16  16 -c_in(v_X,c_Message_Osynth(v_G),tc_Message_Omsg).  [ur(6,b,3,a)].
% 0.89/1.16  19 -c_in(v_X,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg).  [ur(7,b,3,a)].
% 0.89/1.16  20 c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Osynth(v_G),tc_Message_Omsg) | c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg).  [resolve(8,a,2,a)].
% 0.89/1.16  21 c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg) | c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg).  [resolve(8,a,1,a)].
% 0.89/1.16  241 c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg) | -c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg).  [resolve(21,b,10,a),unit_del(c,19)].
% 0.89/1.16  582 c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg) | c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Osynth(v_G),tc_Message_Omsg).  [resolve(241,b,20,b)].
% 0.89/1.16  777 c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg) | c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),v_G,tc_Message_Omsg).  [resolve(582,b,5,a)].
% 0.89/1.16  779 c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),v_G,tc_Message_Omsg) | c_in(c_Message_Omsg_OCrypt(v_K,v_X),v_G,tc_Message_Omsg).  [resolve(777,a,9,a),unit_del(b,16)].
% 0.89/1.16  783 c_in(c_Message_Omsg_OCrypt(v_K,v_X),v_G,tc_Message_Omsg) | c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_union(v_G,A,tc_Message_Omsg),tc_Message_Omsg).  [resolve(779,a,7,a)].
% 0.89/1.16  1031 c_in(c_Message_Omsg_OCrypt(v_K,v_X),v_G,tc_Message_Omsg) | c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oanalz(c_union(v_G,A,tc_Message_Omsg)),tc_Message_Omsg).  [resolve(783,b,4,a)].
% 0.89/1.16  2098 c_in(c_Message_Omsg_OCrypt(v_K,v_X),v_G,tc_Message_Omsg) | c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg).  [resolve(1031,b,241,b)].
% 0.89/1.16  2103 c_in(c_Message_Omsg_OCrypt(v_K,v_X),v_G,tc_Message_Omsg).  [resolve(2098,b,9,a),merge(c),unit_del(b,16)].
% 0.89/1.16  2104 c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_union(v_G,A,tc_Message_Omsg),tc_Message_Omsg).  [resolve(2103,a,7,a)].
% 0.89/1.16  2582 c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Oanalz(c_union(v_G,A,tc_Message_Omsg)),tc_Message_Omsg).  [resolve(2104,a,4,a)].
% 0.89/1.16  3115 -c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg).  [ur(10,a,2582,a,c,19,a)].
% 0.89/1.16  3116 c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Osynth(v_G),tc_Message_Omsg).  [back_unit_del(20),unit_del(b,3115)].
% 0.89/1.16  3119 c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),v_G,tc_Message_Omsg).  [resolve(3116,a,5,a)].
% 0.89/1.16  3232 -c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg).  [ur(4,b,3115,a)].
% 0.89/1.16  3236 $F.  [ur(7,b,3232,a),unit_del(a,3119)].
% 0.89/1.16  
% 0.89/1.16  % SZS output end Refutation
% 0.89/1.16  ============================== end of proof ==========================
% 0.89/1.16  
% 0.89/1.16  ============================== STATISTICS ============================
% 0.89/1.16  
% 0.89/1.16  Given=122. Generated=3495. Kept=3235. proofs=1.
% 0.89/1.16  Usable=100. Sos=3065. Demods=0. Limbo=3, Disabled=77. Hints=0.
% 0.89/1.16  Megabytes=3.35.
% 0.89/1.16  User_CPU=0.19, System_CPU=0.01, Wall_clock=0.
% 0.89/1.16  
% 0.89/1.16  ============================== end of statistics =====================
% 0.89/1.16  
% 0.89/1.16  ============================== end of search =========================
% 0.89/1.16  
% 0.89/1.16  THEOREM PROVED
% 0.89/1.16  % SZS status Unsatisfiable
% 0.89/1.16  
% 0.89/1.16  Exiting with 1 proof.
% 0.89/1.16  
% 0.89/1.16  Process 32702 exit (max_proofs) Wed Jun 15 18:12:23 2022
% 0.89/1.16  Prover9 interrupted
%------------------------------------------------------------------------------