TSTP Solution File: GRP128-4.003 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GRP128-4.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n023.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:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( product(A,B,C)
    | ~ product(A,C,D)
    | ~ product(C,B,D) ),
    file('GRP128-4.003.p',unknown),
    [] ).

cnf(5,axiom,
    ~ e_qualish(e_1,e_2),
    file('GRP128-4.003.p',unknown),
    [] ).

cnf(7,axiom,
    ~ e_qualish(e_2,e_1),
    file('GRP128-4.003.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ group_element(A)
    | ~ group_element(B)
    | product(A,B,e_1)
    | product(A,B,e_2)
    | product(A,B,e_3) ),
    file('GRP128-4.003.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ product(A,B,C)
    | ~ product(A,B,D)
    | e_qualish(C,D) ),
    file('GRP128-4.003.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ product(A,B,C)
    | ~ product(A,D,C)
    | e_qualish(B,D) ),
    file('GRP128-4.003.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ product(A,B,C)
    | ~ product(D,B,C)
    | e_qualish(A,D) ),
    file('GRP128-4.003.p',unknown),
    [] ).

cnf(18,plain,
    ( product(A,A,A)
    | ~ product(A,A,B) ),
    inference(factor,[status(thm)],[3]),
    [iquote('factor,3.2.3')] ).

cnf(20,plain,
    ( ~ group_element(A)
    | product(A,A,e_1)
    | product(A,A,e_2)
    | product(A,A,e_3) ),
    inference(factor,[status(thm)],[11]),
    [iquote('factor,11.1.2')] ).

cnf(25,axiom,
    group_element(e_1),
    file('GRP128-4.003.p',unknown),
    [] ).

cnf(26,axiom,
    group_element(e_2),
    file('GRP128-4.003.p',unknown),
    [] ).

cnf(28,plain,
    ( product(e_1,e_1,e_1)
    | product(e_1,e_1,e_2)
    | product(e_1,e_1,e_3) ),
    inference(hyper,[status(thm)],[25,20]),
    [iquote('hyper,25,20')] ).

cnf(31,plain,
    ( product(e_2,e_2,e_1)
    | product(e_2,e_2,e_2)
    | product(e_2,e_2,e_3) ),
    inference(hyper,[status(thm)],[26,20]),
    [iquote('hyper,26,20')] ).

cnf(34,plain,
    ( product(e_1,e_2,e_1)
    | product(e_1,e_2,e_2)
    | product(e_1,e_2,e_3) ),
    inference(hyper,[status(thm)],[26,11,25]),
    [iquote('hyper,26,11,25')] ).

cnf(35,plain,
    ( product(e_2,e_1,e_1)
    | product(e_2,e_1,e_2)
    | product(e_2,e_1,e_3) ),
    inference(hyper,[status(thm)],[26,11,25]),
    [iquote('hyper,26,11,25')] ).

cnf(58,plain,
    ( product(e_1,e_1,e_1)
    | product(e_1,e_1,e_3) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[28,18])]),
    [iquote('hyper,28,18,factor_simp')] ).

cnf(65,plain,
    product(e_1,e_1,e_1),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[58,18])]),
    [iquote('hyper,58,18,factor_simp')] ).

cnf(68,plain,
    ( product(e_2,e_2,e_2)
    | product(e_2,e_2,e_3) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[31,18])]),
    [iquote('hyper,31,18,factor_simp')] ).

cnf(77,plain,
    product(e_2,e_2,e_2),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[68,18])]),
    [iquote('hyper,68,18,factor_simp')] ).

cnf(79,plain,
    ( product(e_1,e_2,e_2)
    | product(e_1,e_2,e_3) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[34,13,65]),5]),
    [iquote('hyper,34,13,65,unit_del,5')] ).

cnf(82,plain,
    product(e_1,e_2,e_3),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[79,14,77]),7]),
    [iquote('hyper,79,14,77,unit_del,7')] ).

cnf(85,plain,
    ( product(e_2,e_1,e_2)
    | product(e_2,e_1,e_3) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[35,14,65]),5]),
    [iquote('hyper,35,14,65,unit_del,5')] ).

cnf(89,plain,
    product(e_2,e_1,e_3),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[85,13,77]),7]),
    [iquote('hyper,85,13,77,unit_del,7')] ).

cnf(92,plain,
    product(e_1,e_1,e_2),
    inference(hyper,[status(thm)],[89,3,82]),
    [iquote('hyper,89,3,82')] ).

cnf(94,plain,
    e_qualish(e_1,e_2),
    inference(hyper,[status(thm)],[92,12,65]),
    [iquote('hyper,92,12,65')] ).

cnf(95,plain,
    $false,
    inference(binary,[status(thm)],[94,5]),
    [iquote('binary,94.1,5.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : GRP128-4.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n023.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  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 05:54:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.92/2.08  ----- Otter 3.3f, August 2004 -----
% 1.92/2.08  The process was started by sandbox on n023.cluster.edu,
% 1.92/2.08  Wed Jul 27 05:54:03 2022
% 1.92/2.08  The command was "./otter".  The process ID is 3762.
% 1.92/2.08  
% 1.92/2.08  set(prolog_style_variables).
% 1.92/2.08  set(auto).
% 1.92/2.08     dependent: set(auto1).
% 1.92/2.08     dependent: set(process_input).
% 1.92/2.08     dependent: clear(print_kept).
% 1.92/2.08     dependent: clear(print_new_demod).
% 1.92/2.08     dependent: clear(print_back_demod).
% 1.92/2.08     dependent: clear(print_back_sub).
% 1.92/2.08     dependent: set(control_memory).
% 1.92/2.08     dependent: assign(max_mem, 12000).
% 1.92/2.08     dependent: assign(pick_given_ratio, 4).
% 1.92/2.08     dependent: assign(stats_level, 1).
% 1.92/2.08     dependent: assign(max_seconds, 10800).
% 1.92/2.08  clear(print_given).
% 1.92/2.08  
% 1.92/2.08  list(usable).
% 1.92/2.08  0 [] -group_element(X)| -group_element(Y)|product(e_1,X,Y)|product(e_2,X,Y)|product(e_3,X,Y).
% 1.92/2.08  0 [] -group_element(X)| -group_element(Y)|product(X,e_1,Y)|product(X,e_2,Y)|product(X,e_3,Y).
% 1.92/2.08  0 [] product(X,Y,Z1)| -product(X,Z1,Z2)| -product(Z1,Y,Z2).
% 1.92/2.08  0 [] product(Z1,Y,Z2)| -product(X,Z1,Z2)| -product(X,Y,Z1).
% 1.92/2.08  0 [] group_element(e_1).
% 1.92/2.08  0 [] group_element(e_2).
% 1.92/2.08  0 [] group_element(e_3).
% 1.92/2.08  0 [] -e_qualish(e_1,e_2).
% 1.92/2.08  0 [] -e_qualish(e_1,e_3).
% 1.92/2.08  0 [] -e_qualish(e_2,e_1).
% 1.92/2.08  0 [] -e_qualish(e_2,e_3).
% 1.92/2.08  0 [] -e_qualish(e_3,e_1).
% 1.92/2.08  0 [] -e_qualish(e_3,e_2).
% 1.92/2.08  0 [] -group_element(X)| -group_element(Y)|product(X,Y,e_1)|product(X,Y,e_2)|product(X,Y,e_3).
% 1.92/2.08  0 [] -product(X,Y,W)| -product(X,Y,Z)|e_qualish(W,Z).
% 1.92/2.08  0 [] -product(X,W,Y)| -product(X,Z,Y)|e_qualish(W,Z).
% 1.92/2.08  0 [] -product(W,Y,X)| -product(Z,Y,X)|e_qualish(W,Z).
% 1.92/2.08  0 [] -product(X,Y,Z1)| -product(Z1,Y,Z2)|product(X,Z1,Z2).
% 1.92/2.08  end_of_list.
% 1.92/2.08  
% 1.92/2.08  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.92/2.08  
% 1.92/2.08  This is a non-Horn set without equality.  The strategy will
% 1.92/2.08  be ordered hyper_res, unit deletion, and factoring, with
% 1.92/2.08  satellites in sos and with nuclei in usable.
% 1.92/2.08  
% 1.92/2.08     dependent: set(hyper_res).
% 1.92/2.08     dependent: set(factor).
% 1.92/2.08     dependent: set(unit_deletion).
% 1.92/2.08  
% 1.92/2.08  ------------> process usable:
% 1.92/2.08  ** KEPT (pick-wt=16): 1 [] -group_element(A)| -group_element(B)|product(e_1,A,B)|product(e_2,A,B)|product(e_3,A,B).
% 1.92/2.08  ** KEPT (pick-wt=16): 2 [] -group_element(A)| -group_element(B)|product(A,e_1,B)|product(A,e_2,B)|product(A,e_3,B).
% 1.92/2.08  ** KEPT (pick-wt=12): 3 [] product(A,B,C)| -product(A,C,D)| -product(C,B,D).
% 1.92/2.08  ** KEPT (pick-wt=12): 4 [] product(A,B,C)| -product(D,A,C)| -product(D,B,A).
% 1.92/2.08  ** KEPT (pick-wt=3): 5 [] -e_qualish(e_1,e_2).
% 1.92/2.08  ** KEPT (pick-wt=3): 6 [] -e_qualish(e_1,e_3).
% 1.92/2.08  ** KEPT (pick-wt=3): 7 [] -e_qualish(e_2,e_1).
% 1.92/2.08  ** KEPT (pick-wt=3): 8 [] -e_qualish(e_2,e_3).
% 1.92/2.08  ** KEPT (pick-wt=3): 9 [] -e_qualish(e_3,e_1).
% 1.92/2.08  ** KEPT (pick-wt=3): 10 [] -e_qualish(e_3,e_2).
% 1.92/2.08  ** KEPT (pick-wt=16): 11 [] -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 1.92/2.08  ** KEPT (pick-wt=11): 12 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.92/2.08  ** KEPT (pick-wt=11): 13 [] -product(A,B,C)| -product(A,D,C)|e_qualish(B,D).
% 1.92/2.08  ** KEPT (pick-wt=11): 14 [] -product(A,B,C)| -product(D,B,C)|e_qualish(A,D).
% 1.92/2.08  ** KEPT (pick-wt=12): 15 [] -product(A,B,C)| -product(C,B,D)|product(A,C,D).
% 1.92/2.08  
% 1.92/2.08  ------------> process sos:
% 1.92/2.08  ** KEPT (pick-wt=2): 25 [] group_element(e_1).
% 1.92/2.08  ** KEPT (pick-wt=2): 26 [] group_element(e_2).
% 1.92/2.08  ** KEPT (pick-wt=2): 27 [] group_element(e_3).
% 1.92/2.08  
% 1.92/2.08  ======= end of input processing =======
% 1.92/2.08  
% 1.92/2.08  =========== start of search ===========
% 1.92/2.08  
% 1.92/2.08  -------- PROOF -------- 
% 1.92/2.08  
% 1.92/2.08  ----> UNIT CONFLICT at   0.01 sec ----> 95 [binary,94.1,5.1] $F.
% 1.92/2.08  
% 1.92/2.08  Length of proof is 16.  Level of proof is 8.
% 1.92/2.08  
% 1.92/2.08  ---------------- PROOF ----------------
% 1.92/2.08  % SZS status Unsatisfiable
% 1.92/2.08  % SZS output start Refutation
% See solution above
% 1.92/2.08  ------------ end of proof -------------
% 1.92/2.08  
% 1.92/2.08  
% 1.92/2.08  Search stopped by max_proofs option.
% 1.92/2.08  
% 1.92/2.08  
% 1.92/2.08  Search stopped by max_proofs option.
% 1.92/2.08  
% 1.92/2.08  ============ end of search ============
% 1.92/2.08  
% 1.92/2.08  -------------- statistics -------------
% 1.92/2.08  clauses given                 19
% 1.92/2.08  clauses generated            510
% 1.92/2.08  clauses kept                  94
% 1.92/2.08  clauses forward subsumed     434
% 1.92/2.08  clauses back subsumed         46
% 1.92/2.08  Kbytes malloced              976
% 1.92/2.08  
% 1.92/2.08  ----------- times (seconds) -----------
% 1.92/2.08  user CPU time          0.01          (0 hr, 0 min, 0 sec)
% 1.92/2.08  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.92/2.08  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.92/2.08  
% 1.92/2.08  That finishes the proof of the theorem.
% 1.92/2.08  
% 1.92/2.08  Process 3762 finished Wed Jul 27 05:54:05 2022
% 1.92/2.08  Otter interrupted
% 1.92/2.08  PROOF FOUND
%------------------------------------------------------------------------------