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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : COL119-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 12:48:17 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ c_in(c_Pair(v_y_H,A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
    | ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x_H),v_w),A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
    file('COL119-2.p',unknown),
    [] ).

cnf(2,axiom,
    c_in(c_Pair(v_y_H,v_x_H,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
    file('COL119-2.p',unknown),
    [] ).

cnf(3,axiom,
    c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,A),B),A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
    file('COL119-2.p',unknown),
    [] ).

cnf(4,plain,
    $false,
    inference(hyper,[status(thm)],[3,1,2]),
    [iquote('hyper,3,1,2')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COL119-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/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 02:23:54 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.66/1.83  ----- Otter 3.3f, August 2004 -----
% 1.66/1.83  The process was started by sandbox2 on n014.cluster.edu,
% 1.66/1.83  Wed Jul 27 02:23:54 2022
% 1.66/1.83  The command was "./otter".  The process ID is 25261.
% 1.66/1.83  
% 1.66/1.83  set(prolog_style_variables).
% 1.66/1.83  set(auto).
% 1.66/1.83     dependent: set(auto1).
% 1.66/1.83     dependent: set(process_input).
% 1.66/1.83     dependent: clear(print_kept).
% 1.66/1.83     dependent: clear(print_new_demod).
% 1.66/1.83     dependent: clear(print_back_demod).
% 1.66/1.83     dependent: clear(print_back_sub).
% 1.66/1.83     dependent: set(control_memory).
% 1.66/1.83     dependent: assign(max_mem, 12000).
% 1.66/1.83     dependent: assign(pick_given_ratio, 4).
% 1.66/1.83     dependent: assign(stats_level, 1).
% 1.66/1.83     dependent: assign(max_seconds, 10800).
% 1.66/1.83  clear(print_given).
% 1.66/1.83  
% 1.66/1.83  list(usable).
% 1.66/1.83  0 [] c_in(c_Pair(v_y_H,v_x_H,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.66/1.83  0 [] -c_in(c_Pair(v_y_H,V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))| -c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x_H),v_w),V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.66/1.83  0 [] c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,V_x),V_y),V_x,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.66/1.83  end_of_list.
% 1.66/1.83  
% 1.66/1.83  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.66/1.83  
% 1.66/1.83  This is a Horn set without equality.  The strategy will
% 1.66/1.83  be hyperresolution, with satellites in sos and nuclei
% 1.66/1.83  in usable.
% 1.66/1.83  
% 1.66/1.83     dependent: set(hyper_res).
% 1.66/1.83     dependent: clear(order_hyper).
% 1.66/1.83  
% 1.66/1.83  ------------> process usable:
% 1.66/1.83  ** KEPT (pick-wt=24): 1 [] -c_in(c_Pair(v_y_H,A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))| -c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x_H),v_w),A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.66/1.83  
% 1.66/1.83  ------------> process sos:
% 1.66/1.83  ** KEPT (pick-wt=10): 2 [] c_in(c_Pair(v_y_H,v_x_H,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.66/1.83  ** KEPT (pick-wt=14): 3 [] c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,A),B),A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.66/1.83  
% 1.66/1.83  ======= end of input processing =======
% 1.66/1.83  
% 1.66/1.83  =========== start of search ===========
% 1.66/1.83  
% 1.66/1.83  -------- PROOF -------- 
% 1.66/1.83  
% 1.66/1.83  -----> EMPTY CLAUSE at   0.00 sec ----> 4 [hyper,3,1,2] $F.
% 1.66/1.83  
% 1.66/1.83  Length of proof is 0.  Level of proof is 0.
% 1.66/1.83  
% 1.66/1.83  ---------------- PROOF ----------------
% 1.66/1.83  % SZS status Unsatisfiable
% 1.66/1.83  % SZS output start Refutation
% See solution above
% 1.66/1.84  ------------ end of proof -------------
% 1.66/1.84  
% 1.66/1.84  
% 1.66/1.84  Search stopped by max_proofs option.
% 1.66/1.84  
% 1.66/1.84  
% 1.66/1.84  Search stopped by max_proofs option.
% 1.66/1.84  
% 1.66/1.84  ============ end of search ============
% 1.66/1.84  
% 1.66/1.84  -------------- statistics -------------
% 1.66/1.84  clauses given                  2
% 1.66/1.84  clauses generated              1
% 1.66/1.84  clauses kept                   3
% 1.66/1.84  clauses forward subsumed       0
% 1.66/1.84  clauses back subsumed          0
% 1.66/1.84  Kbytes malloced              976
% 1.66/1.84  
% 1.66/1.84  ----------- times (seconds) -----------
% 1.66/1.84  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.66/1.84  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.66/1.84  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.66/1.84  
% 1.66/1.84  That finishes the proof of the theorem.
% 1.66/1.84  
% 1.66/1.84  Process 25261 finished Wed Jul 27 02:23:56 2022
% 1.66/1.84  Otter interrupted
% 1.66/1.84  PROOF FOUND
%------------------------------------------------------------------------------