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

View Problem - Process Solution

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

% Computer : n014.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:18 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ c_lesse_quals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    file('SWV258-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ c_lesse_quals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg))
    | c_lesse_quals(A,c_Message_Oparts(B),tc_set(tc_Message_Omsg)) ),
    file('SWV258-2.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ c_lesse_quals(A,c_Message_Oparts(B),tc_set(tc_Message_Omsg))
    | c_lesse_quals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg)) ),
    file('SWV258-2.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ c_in(A,B,C)
    | ~ c_lesse_quals(D,B,tc_set(C))
    | c_lesse_quals(c_insert(A,D,C),B,tc_set(C)) ),
    file('SWV258-2.p',unknown),
    [] ).

cnf(5,axiom,
    c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
    file('SWV258-2.p',unknown),
    [] ).

cnf(6,axiom,
    c_lesse_quals(A,A,tc_set(B)),
    file('SWV258-2.p',unknown),
    [] ).

cnf(9,plain,
    c_lesse_quals(A,c_Message_Oparts(A),tc_set(tc_Message_Omsg)),
    inference(hyper,[status(thm)],[6,2]),
    [iquote('hyper,6,2')] ).

cnf(10,plain,
    c_lesse_quals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(hyper,[status(thm)],[9,4,5]),
    [iquote('hyper,9,4,5')] ).

cnf(19,plain,
    c_lesse_quals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(hyper,[status(thm)],[10,3]),
    [iquote('hyper,10,3')] ).

cnf(20,plain,
    $false,
    inference(binary,[status(thm)],[19,1]),
    [iquote('binary,19.1,1.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWV258-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 05:41:09 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.61/1.80  ----- Otter 3.3f, August 2004 -----
% 1.61/1.80  The process was started by sandbox on n014.cluster.edu,
% 1.61/1.80  Wed Jul 27 05:41:09 2022
% 1.61/1.80  The command was "./otter".  The process ID is 25831.
% 1.61/1.80  
% 1.61/1.80  set(prolog_style_variables).
% 1.61/1.80  set(auto).
% 1.61/1.80     dependent: set(auto1).
% 1.61/1.80     dependent: set(process_input).
% 1.61/1.80     dependent: clear(print_kept).
% 1.61/1.80     dependent: clear(print_new_demod).
% 1.61/1.80     dependent: clear(print_back_demod).
% 1.61/1.80     dependent: clear(print_back_sub).
% 1.61/1.80     dependent: set(control_memory).
% 1.61/1.80     dependent: assign(max_mem, 12000).
% 1.61/1.80     dependent: assign(pick_given_ratio, 4).
% 1.61/1.80     dependent: assign(stats_level, 1).
% 1.61/1.80     dependent: assign(max_seconds, 10800).
% 1.61/1.80  clear(print_given).
% 1.61/1.80  
% 1.61/1.80  list(usable).
% 1.61/1.80  0 [] c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg).
% 1.61/1.80  0 [] -c_lesse_quals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)).
% 1.61/1.80  0 [] -c_lesse_quals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg))|c_lesse_quals(V_G,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)).
% 1.61/1.80  0 [] -c_lesse_quals(V_G,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)).
% 1.61/1.80  0 [] -c_in(V_x,V_B,T_a)| -c_lesse_quals(V_A,V_B,tc_set(T_a))|c_lesse_quals(c_insert(V_x,V_A,T_a),V_B,tc_set(T_a)).
% 1.61/1.80  0 [] c_lesse_quals(V_A,V_A,tc_set(T_a)).
% 1.61/1.80  end_of_list.
% 1.61/1.80  
% 1.61/1.80  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.61/1.80  
% 1.61/1.80  This is a Horn set without equality.  The strategy will
% 1.61/1.80  be hyperresolution, with satellites in sos and nuclei
% 1.61/1.80  in usable.
% 1.61/1.80  
% 1.61/1.80     dependent: set(hyper_res).
% 1.61/1.80     dependent: clear(order_hyper).
% 1.61/1.80  
% 1.61/1.80  ------------> process usable:
% 1.61/1.80  ** KEPT (pick-wt=10): 1 [] -c_lesse_quals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)).
% 1.61/1.80  ** KEPT (pick-wt=13): 2 [] -c_lesse_quals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg))|c_lesse_quals(A,c_Message_Oparts(B),tc_set(tc_Message_Omsg)).
% 1.61/1.80  ** KEPT (pick-wt=13): 3 [] -c_lesse_quals(A,c_Message_Oparts(B),tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg)).
% 1.61/1.80  ** KEPT (pick-wt=17): 4 [] -c_in(A,B,C)| -c_lesse_quals(D,B,tc_set(C))|c_lesse_quals(c_insert(A,D,C),B,tc_set(C)).
% 1.61/1.80  
% 1.61/1.80  ------------> process sos:
% 1.61/1.80  ** KEPT (pick-wt=5): 5 [] c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg).
% 1.61/1.80  ** KEPT (pick-wt=5): 6 [] c_lesse_quals(A,A,tc_set(B)).
% 1.61/1.80  
% 1.61/1.80  ======= end of input processing =======
% 1.61/1.80  
% 1.61/1.80  =========== start of search ===========
% 1.61/1.80  
% 1.61/1.80  -------- PROOF -------- 
% 1.61/1.80  
% 1.61/1.80  ----> UNIT CONFLICT at   0.00 sec ----> 20 [binary,19.1,1.1] $F.
% 1.61/1.80  
% 1.61/1.80  Length of proof is 3.  Level of proof is 3.
% 1.61/1.80  
% 1.61/1.80  ---------------- PROOF ----------------
% 1.61/1.80  % SZS status Unsatisfiable
% 1.61/1.80  % SZS output start Refutation
% See solution above
% 1.61/1.80  ------------ end of proof -------------
% 1.61/1.80  
% 1.61/1.80  
% 1.61/1.80  Search stopped by max_proofs option.
% 1.61/1.80  
% 1.61/1.80  
% 1.61/1.80  Search stopped by max_proofs option.
% 1.61/1.80  
% 1.61/1.80  ============ end of search ============
% 1.61/1.80  
% 1.61/1.80  -------------- statistics -------------
% 1.61/1.80  clauses given                  8
% 1.61/1.80  clauses generated             17
% 1.61/1.80  clauses kept                  19
% 1.61/1.80  clauses forward subsumed       4
% 1.61/1.80  clauses back subsumed          0
% 1.61/1.80  Kbytes malloced              976
% 1.61/1.80  
% 1.61/1.80  ----------- times (seconds) -----------
% 1.61/1.80  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.61/1.80  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.61/1.80  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.61/1.80  
% 1.61/1.80  That finishes the proof of the theorem.
% 1.61/1.80  
% 1.61/1.80  Process 25831 finished Wed Jul 27 05:41:10 2022
% 1.61/1.80  Otter interrupted
% 1.61/1.80  PROOF FOUND
%------------------------------------------------------------------------------