TSTP Solution File: GRP135-1.002 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GRP135-1.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n008.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:56:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ e_qualish(e_1,e_2),
    file('GRP135-1.002.p',unknown),
    [] ).

cnf(2,axiom,
    ~ e_qualish(e_2,e_1),
    file('GRP135-1.002.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ group_element(A)
    | ~ group_element(B)
    | product(A,B,e_1)
    | product(A,B,e_2) ),
    file('GRP135-1.002.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ product(A,B,C)
    | ~ product(A,D,C)
    | e_qualish(B,D) ),
    file('GRP135-1.002.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ product(A,B,C)
    | ~ product(D,B,C)
    | e_qualish(A,D) ),
    file('GRP135-1.002.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ product(A,B,C)
    | ~ product(C,A,D)
    | product(D,A,B) ),
    file('GRP135-1.002.p',unknown),
    [] ).

cnf(8,plain,
    ( ~ group_element(A)
    | product(A,A,e_1)
    | product(A,A,e_2) ),
    inference(factor,[status(thm)],[3]),
    [iquote('factor,3.1.2')] ).

cnf(12,axiom,
    group_element(e_1),
    file('GRP135-1.002.p',unknown),
    [] ).

cnf(13,axiom,
    group_element(e_2),
    file('GRP135-1.002.p',unknown),
    [] ).

cnf(14,plain,
    ( product(e_1,e_1,e_1)
    | product(e_1,e_1,e_2) ),
    inference(hyper,[status(thm)],[12,8]),
    [iquote('hyper,12,8')] ).

cnf(15,plain,
    ( product(e_2,e_2,e_1)
    | product(e_2,e_2,e_2) ),
    inference(hyper,[status(thm)],[13,8]),
    [iquote('hyper,13,8')] ).

cnf(16,plain,
    ( product(e_1,e_2,e_1)
    | product(e_1,e_2,e_2) ),
    inference(hyper,[status(thm)],[13,3,12]),
    [iquote('hyper,13,3,12')] ).

cnf(17,plain,
    ( product(e_2,e_1,e_1)
    | product(e_2,e_1,e_2) ),
    inference(hyper,[status(thm)],[13,3,12]),
    [iquote('hyper,13,3,12')] ).

cnf(26,plain,
    ( product(e_1,e_2,e_2)
    | product(e_2,e_2,e_2) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[16,7,15])]),
    [iquote('hyper,16,7,15,factor_simp')] ).

cnf(37,plain,
    ( product(e_2,e_1,e_2)
    | product(e_1,e_1,e_1) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[17,7,14])]),
    [iquote('hyper,17,7,14,factor_simp')] ).

cnf(44,plain,
    product(e_2,e_2,e_2),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[26,7,15])])]),
    [iquote('hyper,26,7,15,factor_simp,factor_simp')] ).

cnf(48,plain,
    product(e_2,e_1,e_1),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[44,5,17]),1]),
    [iquote('hyper,44,5,17,unit_del,1')] ).

cnf(52,plain,
    product(e_1,e_1,e_1),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[37,5,44]),2]),
    [iquote('hyper,37,5,44,unit_del,2')] ).

cnf(54,plain,
    e_qualish(e_2,e_1),
    inference(hyper,[status(thm)],[52,6,48]),
    [iquote('hyper,52,6,48')] ).

cnf(55,plain,
    $false,
    inference(binary,[status(thm)],[54,2]),
    [iquote('binary,54.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP135-1.002 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Jul 27 05:17:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.62/1.82  ----- Otter 3.3f, August 2004 -----
% 1.62/1.82  The process was started by sandbox2 on n008.cluster.edu,
% 1.62/1.82  Wed Jul 27 05:17:53 2022
% 1.62/1.82  The command was "./otter".  The process ID is 15360.
% 1.62/1.82  
% 1.62/1.82  set(prolog_style_variables).
% 1.62/1.82  set(auto).
% 1.62/1.82     dependent: set(auto1).
% 1.62/1.82     dependent: set(process_input).
% 1.62/1.82     dependent: clear(print_kept).
% 1.62/1.82     dependent: clear(print_new_demod).
% 1.62/1.82     dependent: clear(print_back_demod).
% 1.62/1.82     dependent: clear(print_back_sub).
% 1.62/1.82     dependent: set(control_memory).
% 1.62/1.82     dependent: assign(max_mem, 12000).
% 1.62/1.82     dependent: assign(pick_given_ratio, 4).
% 1.62/1.82     dependent: assign(stats_level, 1).
% 1.62/1.82     dependent: assign(max_seconds, 10800).
% 1.62/1.82  clear(print_given).
% 1.62/1.82  
% 1.62/1.82  list(usable).
% 1.62/1.82  0 [] group_element(e_1).
% 1.62/1.82  0 [] group_element(e_2).
% 1.62/1.82  0 [] -e_qualish(e_1,e_2).
% 1.62/1.82  0 [] -e_qualish(e_2,e_1).
% 1.62/1.82  0 [] -group_element(X)| -group_element(Y)|product(X,Y,e_1)|product(X,Y,e_2).
% 1.62/1.82  0 [] -product(X,Y,W)| -product(X,Y,Z)|e_qualish(W,Z).
% 1.62/1.82  0 [] -product(X,W,Y)| -product(X,Z,Y)|e_qualish(W,Z).
% 1.62/1.82  0 [] -product(W,Y,X)| -product(Z,Y,X)|e_qualish(W,Z).
% 1.62/1.82  0 [] -product(Y,X,Z1)| -product(Z1,Y,Z2)|product(Z2,Y,X).
% 1.62/1.82  end_of_list.
% 1.62/1.82  
% 1.62/1.82  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.62/1.82  
% 1.62/1.82  This is a non-Horn set without equality.  The strategy will
% 1.62/1.82  be ordered hyper_res, unit deletion, and factoring, with
% 1.62/1.82  satellites in sos and with nuclei in usable.
% 1.62/1.82  
% 1.62/1.82     dependent: set(hyper_res).
% 1.62/1.82     dependent: set(factor).
% 1.62/1.82     dependent: set(unit_deletion).
% 1.62/1.82  
% 1.62/1.82  ------------> process usable:
% 1.62/1.82  ** KEPT (pick-wt=3): 1 [] -e_qualish(e_1,e_2).
% 1.62/1.82  ** KEPT (pick-wt=3): 2 [] -e_qualish(e_2,e_1).
% 1.62/1.82  ** KEPT (pick-wt=12): 3 [] -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2).
% 1.62/1.82  ** KEPT (pick-wt=11): 4 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.62/1.82  ** KEPT (pick-wt=11): 5 [] -product(A,B,C)| -product(A,D,C)|e_qualish(B,D).
% 1.62/1.82  ** KEPT (pick-wt=11): 6 [] -product(A,B,C)| -product(D,B,C)|e_qualish(A,D).
% 1.62/1.82  ** KEPT (pick-wt=12): 7 [] -product(A,B,C)| -product(C,A,D)|product(D,A,B).
% 1.62/1.82  
% 1.62/1.82  ------------> process sos:
% 1.62/1.82  ** KEPT (pick-wt=2): 12 [] group_element(e_1).
% 1.62/1.82  ** KEPT (pick-wt=2): 13 [] group_element(e_2).
% 1.62/1.82  
% 1.62/1.82  ======= end of input processing =======
% 1.62/1.82  
% 1.62/1.82  =========== start of search ===========
% 1.62/1.82  
% 1.62/1.82  -------- PROOF -------- 
% 1.62/1.82  
% 1.62/1.82  ----> UNIT CONFLICT at   0.00 sec ----> 55 [binary,54.1,2.1] $F.
% 1.62/1.82  
% 1.62/1.82  Length of proof is 11.  Level of proof is 6.
% 1.62/1.82  
% 1.62/1.82  ---------------- PROOF ----------------
% 1.62/1.82  % SZS status Unsatisfiable
% 1.62/1.82  % SZS output start Refutation
% See solution above
% 1.62/1.82  ------------ end of proof -------------
% 1.62/1.82  
% 1.62/1.82  
% 1.62/1.82  Search stopped by max_proofs option.
% 1.62/1.82  
% 1.62/1.82  
% 1.62/1.82  Search stopped by max_proofs option.
% 1.62/1.82  
% 1.62/1.82  ============ end of search ============
% 1.62/1.82  
% 1.62/1.82  -------------- statistics -------------
% 1.62/1.82  clauses given                 29
% 1.62/1.82  clauses generated            278
% 1.62/1.82  clauses kept                  54
% 1.62/1.82  clauses forward subsumed     232
% 1.62/1.82  clauses back subsumed         32
% 1.62/1.82  Kbytes malloced              976
% 1.62/1.82  
% 1.62/1.82  ----------- times (seconds) -----------
% 1.62/1.82  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.62/1.82  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.62/1.82  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.62/1.82  
% 1.62/1.82  That finishes the proof of the theorem.
% 1.62/1.82  
% 1.62/1.82  Process 15360 finished Wed Jul 27 05:17:55 2022
% 1.67/1.82  Otter interrupted
% 1.67/1.82  PROOF FOUND
%------------------------------------------------------------------------------