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

View Problem - Process Solution

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

% Computer : n020.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:29 EDT 2022

% Result   : Unsatisfiable 0.42s 0.99s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV281-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 : n020.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 05:42:34 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.42/0.99  ============================== Prover9 ===============================
% 0.42/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99  Process 16864 was started by sandbox on n020.cluster.edu,
% 0.42/0.99  Wed Jun 15 05:42:35 2022
% 0.42/0.99  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16711_n020.cluster.edu".
% 0.42/0.99  ============================== end of head ===========================
% 0.42/0.99  
% 0.42/0.99  ============================== INPUT =================================
% 0.42/0.99  
% 0.42/0.99  % Reading from file /tmp/Prover9_16711_n020.cluster.edu
% 0.42/0.99  
% 0.42/0.99  set(prolog_style_variables).
% 0.42/0.99  set(auto2).
% 0.42/0.99      % set(auto2) -> set(auto).
% 0.42/0.99      % set(auto) -> set(auto_inference).
% 0.42/0.99      % set(auto) -> set(auto_setup).
% 0.42/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99      % set(auto) -> set(auto_limits).
% 0.42/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99      % set(auto) -> set(auto_denials).
% 0.42/0.99      % set(auto) -> set(auto_process).
% 0.42/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99      % set(auto2) -> assign(stats, some).
% 0.42/0.99      % set(auto2) -> clear(echo_input).
% 0.42/0.99      % set(auto2) -> set(quiet).
% 0.42/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99      % set(auto2) -> clear(print_given).
% 0.42/0.99  assign(lrs_ticks,-1).
% 0.42/0.99  assign(sos_limit,10000).
% 0.42/0.99  assign(order,kbo).
% 0.42/0.99  set(lex_order_vars).
% 0.42/0.99  clear(print_given).
% 0.42/0.99  
% 0.42/0.99  % formulas(sos).  % not echoed (6 formulas)
% 0.42/0.99  
% 0.42/0.99  ============================== end of input ==========================
% 0.42/0.99  
% 0.42/0.99  % From the command line: assign(max_seconds, 300).
% 0.42/0.99  
% 0.42/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99  
% 0.42/0.99  % Formulas that are not ordinary clauses:
% 0.42/0.99  
% 0.42/0.99  ============================== end of process non-clausal formulas ===
% 0.42/0.99  
% 0.42/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99  
% 0.42/0.99  ============================== PREDICATE ELIMINATION =================
% 0.42/0.99  
% 0.42/0.99  ============================== end predicate elimination =============
% 0.42/0.99  
% 0.42/0.99  Auto_denials:  (non-Horn, no changes).
% 0.42/0.99  
% 0.42/0.99  Term ordering decisions:
% 0.42/0.99  Function symbol KB weights:  tc_nat=1. tc_Message_Omsg=1. c_0=1. v_evs=1. v_evs_H=1. c_List_Olist_ONil=1. c_Event_Oused=1. c_Message_Omsg_ONonce=1. v_sko__urX=1. c_plus=1. c_List_Olist_OCons=1.
% 0.42/0.99  
% 0.42/0.99  ============================== end of process initial clauses ========
% 0.42/0.99  
% 0.42/0.99  ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99  
% 0.42/0.99  ============================== end of clauses for search =============
% 0.42/0.99  
% 0.42/0.99  ============================== SEARCH ================================
% 0.42/0.99  
% 0.42/0.99  % Starting search at 0.01 seconds.
% 0.42/0.99  
% 0.42/0.99  ============================== PROOF =================================
% 0.42/0.99  % SZS status Unsatisfiable
% 0.42/0.99  % SZS output start Refutation
% 0.42/0.99  
% 0.42/0.99  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.42/0.99  % Length of proof is 18.
% 0.42/0.99  % Level of proof is 7.
% 0.42/0.99  % Maximum clause weight is 24.000.
% 0.42/0.99  % Given clauses 15.
% 0.42/0.99  
% 0.42/0.99  1 c_plus(c_0,A,tc_nat) = A # label(cls_Nat_Oop_A_L_Oadd__0_0) # label(axiom).  [assumption].
% 0.42/0.99  2 c_lessequals(A,c_plus(B,A,tc_nat),tc_nat) # label(cls_Nat_Ole__add2_0) # label(axiom).  [assumption].
% 0.42/0.99  3 A = B | c_in(c_Message_Omsg_ONonce(B),c_Event_Oused(v_evs_H),tc_Message_Omsg) | c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_evs),tc_Message_Omsg) # label(cls_conjecture_0) # label(negated_conjecture).  [assumption].
% 0.42/0.99  4 c_List_Olist_ONil != c_List_Olist_OCons(A,B,C) # label(cls_List_Olist_Odistinct__1_0) # label(axiom).  [assumption].
% 0.42/0.99  5 c_List_Olist_OCons(A,B,C) != c_List_Olist_ONil.  [copy(4),flip(a)].
% 0.42/0.99  6 -c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(B),tc_Message_Omsg) | -c_lessequals(v_sko__urX(B),A,tc_nat) # label(cls_Public_ONonce__supply__lemma_0) # label(axiom).  [assumption].
% 0.42/0.99  7 c_plus(A,B,tc_nat) != c_plus(C,B,tc_nat) | A = C # label(cls_Nat_Onat__add__right__cancel_0) # label(axiom).  [assumption].
% 0.42/0.99  8 c_lessequals(A,A,tc_nat).  [para(1(a,1),2(a,2))].
% 0.42/0.99  9 -c_in(c_Message_Omsg_ONonce(c_plus(A,v_sko__urX(B),tc_nat)),c_Event_Oused(B),tc_Message_Omsg).  [resolve(6,b,2,a)].
% 0.42/0.99  10 c_plus(c_List_Olist_OCons(A,B,C),D,tc_nat) != c_plus(c_List_Olist_ONil,D,tc_nat).  [ur(7,b,5,a)].
% 0.42/0.99  12 -c_in(c_Message_Omsg_ONonce(v_sko__urX(A)),c_Event_Oused(A),tc_Message_Omsg).  [resolve(8,a,6,b)].
% 0.42/0.99  13 v_sko__urX(v_evs) = A | c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_evs_H),tc_Message_Omsg).  [resolve(12,a,3,c)].
% 0.42/0.99  17 c_plus(c_plus(c_List_Olist_OCons(A,B,C),D,tc_nat),E,tc_nat) != c_plus(c_plus(c_List_Olist_ONil,D,tc_nat),E,tc_nat).  [ur(7,b,10,a)].
% 0.42/0.99  18 c_plus(c_plus(c_plus(c_List_Olist_OCons(A,B,C),D,tc_nat),E,tc_nat),F,tc_nat) != c_plus(c_plus(c_plus(c_List_Olist_ONil,D,tc_nat),E,tc_nat),F,tc_nat).  [ur(7,b,17,a)].
% 0.42/0.99  19 v_sko__urX(v_evs_H) = v_sko__urX(v_evs).  [resolve(13,b,12,a),flip(a)].
% 0.42/0.99  20 c_plus(A,v_sko__urX(v_evs),tc_nat) = v_sko__urX(v_evs).  [resolve(13,b,9,a),rewrite([19(4)]),flip(a)].
% 0.42/0.99  25 A = B.  [para(20(a,1),7(a,1)),rewrite([20(6)]),xx(a)].
% 0.42/0.99  26 $F.  [resolve(25,a,18,a)].
% 0.42/0.99  
% 0.42/0.99  % SZS output end Refutation
% 0.42/0.99  ============================== end of proof ==========================
% 0.42/0.99  
% 0.42/0.99  ============================== STATISTICS ============================
% 0.42/0.99  
% 0.42/0.99  Given=15. Generated=41. Kept=24. proofs=1.
% 0.42/0.99  Usable=15. Sos=4. Demods=3. Limbo=1, Disabled=9. Hints=0.
% 0.42/0.99  Megabytes=0.05.
% 0.42/0.99  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99  
% 0.42/0.99  ============================== end of statistics =====================
% 0.42/0.99  
% 0.42/0.99  ============================== end of search =========================
% 0.42/0.99  
% 0.42/0.99  THEOREM PROVED
% 0.42/0.99  % SZS status Unsatisfiable
% 0.42/0.99  
% 0.42/0.99  Exiting with 1 proof.
% 0.42/0.99  
% 0.42/0.99  Process 16864 exit (max_proofs) Wed Jun 15 05:42:35 2022
% 0.42/1.00  Prover9 interrupted
%------------------------------------------------------------------------------