TSTP Solution File: SWV284-2 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SWV284-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n024.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  : 300s
% DateTime : Wed Jul 27 13:20:23 EDT 2022

% Result   : Unsatisfiable 1.60s 1.78s
% Output   : Refutation 1.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   12 (   7 unt;   1 nHn;   5 RR)
%            Number of literals    :   17 (   0 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-3 aty)
%            Number of variables   :   23 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_list),tc_Message_Omsg)
    | ~ c_lesse_quals(v_N,A,tc_nat) ),
    file('SWV284-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(A),c_Message_Oparts(c_insert(B,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | ~ c_lesse_quals(v_sko__upX(B),A,tc_nat) ),
    file('SWV284-2.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ c_lesse_quals(c_plus(A,B,tc_nat),C,tc_nat)
    | c_lesse_quals(B,C,tc_nat) ),
    file('SWV284-2.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ c_lesse_quals(c_plus(A,B,tc_nat),C,tc_nat)
    | c_lesse_quals(A,C,tc_nat) ),
    file('SWV284-2.p',unknown),
    [] ).

cnf(5,axiom,
    c_lesse_quals(A,v_x(A),tc_nat),
    file('SWV284-2.p',unknown),
    [] ).

cnf(6,axiom,
    ( c_in(c_Message_Omsg_ONonce(v_x(A)),c_Event_Oused(v_list),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_x(A)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
    file('SWV284-2.p',unknown),
    [] ).

cnf(7,plain,
    c_lesse_quals(A,v_x(c_plus(A,B,tc_nat)),tc_nat),
    inference(hyper,[status(thm)],[5,4]),
    [iquote('hyper,5,4')] ).

cnf(8,plain,
    c_lesse_quals(A,v_x(c_plus(B,A,tc_nat)),tc_nat),
    inference(hyper,[status(thm)],[5,3]),
    [iquote('hyper,5,3')] ).

cnf(9,plain,
    c_lesse_quals(A,v_x(c_plus(c_plus(A,B,tc_nat),C,tc_nat)),tc_nat),
    inference(hyper,[status(thm)],[7,4]),
    [iquote('hyper,7,4')] ).

cnf(13,plain,
    c_lesse_quals(A,v_x(c_plus(c_plus(c_plus(A,B,tc_nat),C,tc_nat),D,tc_nat)),tc_nat),
    inference(hyper,[status(thm)],[9,4]),
    [iquote('hyper,9,4')] ).

cnf(24,plain,
    c_in(c_Message_Omsg_ONonce(v_x(c_plus(A,v_sko__upX(v_msg),tc_nat))),c_Event_Oused(v_list),tc_Message_Omsg),
    inference(hyper,[status(thm)],[6,2,8]),
    [iquote('hyper,6,2,8')] ).

cnf(39,plain,
    $false,
    inference(hyper,[status(thm)],[24,1,13]),
    [iquote('hyper,24,1,13')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV284-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.14/0.34  % Computer : n024.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Jul 27 06:02:55 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 1.60/1.78  ----- Otter 3.3f, August 2004 -----
% 1.60/1.78  The process was started by sandbox on n024.cluster.edu,
% 1.60/1.78  Wed Jul 27 06:02:55 2022
% 1.60/1.78  The command was "./otter".  The process ID is 1579.
% 1.60/1.78  
% 1.60/1.78  set(prolog_style_variables).
% 1.60/1.78  set(auto).
% 1.60/1.78     dependent: set(auto1).
% 1.60/1.78     dependent: set(process_input).
% 1.60/1.78     dependent: clear(print_kept).
% 1.60/1.78     dependent: clear(print_new_demod).
% 1.60/1.78     dependent: clear(print_back_demod).
% 1.60/1.78     dependent: clear(print_back_sub).
% 1.60/1.78     dependent: set(control_memory).
% 1.60/1.78     dependent: assign(max_mem, 12000).
% 1.60/1.78     dependent: assign(pick_given_ratio, 4).
% 1.60/1.78     dependent: assign(stats_level, 1).
% 1.60/1.78     dependent: assign(max_seconds, 10800).
% 1.60/1.78  clear(print_given).
% 1.60/1.78  
% 1.60/1.78  list(usable).
% 1.60/1.78  0 [] c_lesse_quals(V_U,v_x(V_U),tc_nat).
% 1.60/1.78  0 [] -c_in(c_Message_Omsg_ONonce(V_U),c_Event_Oused(v_list),tc_Message_Omsg)| -c_lesse_quals(v_N,V_U,tc_nat).
% 1.60/1.78  0 [] c_in(c_Message_Omsg_ONonce(v_x(V_U)),c_Event_Oused(v_list),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(v_x(V_U)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg).
% 1.60/1.78  0 [] -c_in(c_Message_Omsg_ONonce(V_U),c_Message_Oparts(c_insert(V_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)| -c_lesse_quals(v_sko__upX(V_msg),V_U,tc_nat).
% 1.60/1.78  0 [] -c_lesse_quals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat)|c_lesse_quals(V_k,V_n,tc_nat).
% 1.60/1.78  0 [] -c_lesse_quals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat)|c_lesse_quals(V_m,V_n,tc_nat).
% 1.60/1.78  end_of_list.
% 1.60/1.78  
% 1.60/1.78  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.60/1.78  
% 1.60/1.78  This is a non-Horn set without equality.  The strategy will
% 1.60/1.78  be ordered hyper_res, unit deletion, and factoring, with
% 1.60/1.78  satellites in sos and with nuclei in usable.
% 1.60/1.78  
% 1.60/1.78     dependent: set(hyper_res).
% 1.60/1.78     dependent: set(factor).
% 1.60/1.78     dependent: set(unit_deletion).
% 1.60/1.78  
% 1.60/1.78  ------------> process usable:
% 1.60/1.78  ** KEPT (pick-wt=10): 1 [] -c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_list),tc_Message_Omsg)| -c_lesse_quals(v_N,A,tc_nat).
% 1.60/1.78  ** KEPT (pick-wt=14): 2 [] -c_in(c_Message_Omsg_ONonce(A),c_Message_Oparts(c_insert(B,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)| -c_lesse_quals(v_sko__upX(B),A,tc_nat).
% 1.60/1.78  ** KEPT (pick-wt=11): 3 [] -c_lesse_quals(c_plus(A,B,tc_nat),C,tc_nat)|c_lesse_quals(B,C,tc_nat).
% 1.60/1.78  ** KEPT (pick-wt=11): 4 [] -c_lesse_quals(c_plus(A,B,tc_nat),C,tc_nat)|c_lesse_quals(A,C,tc_nat).
% 1.60/1.78  
% 1.60/1.78  ------------> process sos:
% 1.60/1.78  ** KEPT (pick-wt=5): 5 [] c_lesse_quals(A,v_x(A),tc_nat).
% 1.60/1.78  ** KEPT (pick-wt=17): 6 [] c_in(c_Message_Omsg_ONonce(v_x(A)),c_Event_Oused(v_list),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(v_x(A)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg).
% 1.60/1.78  
% 1.60/1.78  ======= end of input processing =======
% 1.60/1.78  
% 1.60/1.78  =========== start of search ===========
% 1.60/1.78  
% 1.60/1.78  -------- PROOF -------- 
% 1.60/1.78  
% 1.60/1.78  -----> EMPTY CLAUSE at   0.00 sec ----> 39 [hyper,24,1,13] $F.
% 1.60/1.78  
% 1.60/1.78  Length of proof is 5.  Level of proof is 3.
% 1.60/1.78  
% 1.60/1.78  ---------------- PROOF ----------------
% 1.60/1.78  % SZS status Unsatisfiable
% 1.60/1.78  % SZS output start Refutation
% See solution above
% 1.60/1.78  ------------ end of proof -------------
% 1.60/1.78  
% 1.60/1.78  
% 1.60/1.78  Search stopped by max_proofs option.
% 1.60/1.78  
% 1.60/1.78  
% 1.60/1.78  Search stopped by max_proofs option.
% 1.60/1.78  
% 1.60/1.78  ============ end of search ============
% 1.60/1.78  
% 1.60/1.78  -------------- statistics -------------
% 1.60/1.78  clauses given                 12
% 1.60/1.78  clauses generated             33
% 1.60/1.78  clauses kept                  38
% 1.60/1.78  clauses forward subsumed       0
% 1.60/1.78  clauses back subsumed          0
% 1.60/1.78  Kbytes malloced              976
% 1.60/1.78  
% 1.60/1.78  ----------- times (seconds) -----------
% 1.60/1.78  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.60/1.78  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.60/1.78  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.60/1.78  
% 1.60/1.78  That finishes the proof of the theorem.
% 1.60/1.78  
% 1.60/1.78  Process 1579 finished Wed Jul 27 06:02:56 2022
% 1.60/1.78  Otter interrupted
% 1.60/1.78  PROOF FOUND
%------------------------------------------------------------------------------