TSTP Solution File: GRP001-5 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GRP001-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n003.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:55:48 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ product(A,B,C)
    | ~ product(B,D,E)
    | ~ product(C,D,F)
    | product(A,E,F) ),
    file('GRP001-5.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ product(A,B,C)
    | ~ product(B,D,E)
    | ~ product(A,E,F)
    | product(C,D,F) ),
    file('GRP001-5.p',unknown),
    [] ).

cnf(3,axiom,
    ~ product(b,a,c),
    file('GRP001-5.p',unknown),
    [] ).

cnf(4,axiom,
    product(identity,A,A),
    file('GRP001-5.p',unknown),
    [] ).

cnf(5,axiom,
    product(A,identity,A),
    file('GRP001-5.p',unknown),
    [] ).

cnf(6,axiom,
    product(A,A,identity),
    file('GRP001-5.p',unknown),
    [] ).

cnf(7,axiom,
    product(a,b,c),
    file('GRP001-5.p',unknown),
    [] ).

cnf(8,plain,
    product(c,b,a),
    inference(hyper,[status(thm)],[7,2,6,5]),
    [iquote('hyper,7,2,6,5')] ).

cnf(9,plain,
    product(a,c,b),
    inference(hyper,[status(thm)],[7,1,6,4]),
    [iquote('hyper,7,1,6,4')] ).

cnf(10,plain,
    product(c,a,b),
    inference(hyper,[status(thm)],[8,1,6,4]),
    [iquote('hyper,8,1,6,4')] ).

cnf(12,plain,
    product(b,a,c),
    inference(hyper,[status(thm)],[10,2,9,7]),
    [iquote('hyper,10,2,9,7')] ).

cnf(13,plain,
    $false,
    inference(binary,[status(thm)],[12,3]),
    [iquote('binary,12.1,3.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP001-5 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n003.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:06:11 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.65/1.86  ----- Otter 3.3f, August 2004 -----
% 1.65/1.86  The process was started by sandbox on n003.cluster.edu,
% 1.65/1.86  Wed Jul 27 05:06:11 2022
% 1.65/1.86  The command was "./otter".  The process ID is 18130.
% 1.65/1.86  
% 1.65/1.86  set(prolog_style_variables).
% 1.65/1.86  set(auto).
% 1.65/1.86     dependent: set(auto1).
% 1.65/1.86     dependent: set(process_input).
% 1.65/1.86     dependent: clear(print_kept).
% 1.65/1.86     dependent: clear(print_new_demod).
% 1.65/1.86     dependent: clear(print_back_demod).
% 1.65/1.86     dependent: clear(print_back_sub).
% 1.65/1.86     dependent: set(control_memory).
% 1.65/1.86     dependent: assign(max_mem, 12000).
% 1.65/1.86     dependent: assign(pick_given_ratio, 4).
% 1.65/1.86     dependent: assign(stats_level, 1).
% 1.65/1.86     dependent: assign(max_seconds, 10800).
% 1.65/1.86  clear(print_given).
% 1.65/1.86  
% 1.65/1.86  list(usable).
% 1.65/1.86  0 [] product(identity,X,X).
% 1.65/1.86  0 [] product(X,identity,X).
% 1.65/1.86  0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.65/1.86  0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.65/1.86  0 [] product(X,X,identity).
% 1.65/1.86  0 [] product(a,b,c).
% 1.65/1.86  0 [] -product(b,a,c).
% 1.65/1.86  end_of_list.
% 1.65/1.86  
% 1.65/1.86  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.65/1.86  
% 1.65/1.86  This is a Horn set without equality.  The strategy will
% 1.65/1.86  be hyperresolution, with satellites in sos and nuclei
% 1.65/1.86  in usable.
% 1.65/1.86  
% 1.65/1.86     dependent: set(hyper_res).
% 1.65/1.86     dependent: clear(order_hyper).
% 1.65/1.86  
% 1.65/1.86  ------------> process usable:
% 1.65/1.86  ** KEPT (pick-wt=16): 1 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.65/1.86  ** KEPT (pick-wt=16): 2 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.65/1.86  ** KEPT (pick-wt=4): 3 [] -product(b,a,c).
% 1.65/1.86  
% 1.65/1.86  ------------> process sos:
% 1.65/1.86  ** KEPT (pick-wt=4): 4 [] product(identity,A,A).
% 1.65/1.86  ** KEPT (pick-wt=4): 5 [] product(A,identity,A).
% 1.65/1.86  ** KEPT (pick-wt=4): 6 [] product(A,A,identity).
% 1.65/1.86  ** KEPT (pick-wt=4): 7 [] product(a,b,c).
% 1.65/1.86  
% 1.65/1.86  ======= end of input processing =======
% 1.65/1.86  
% 1.65/1.86  =========== start of search ===========
% 1.65/1.86  
% 1.65/1.86  -------- PROOF -------- 
% 1.65/1.86  
% 1.65/1.86  ----> UNIT CONFLICT at   0.00 sec ----> 13 [binary,12.1,3.1] $F.
% 1.65/1.86  
% 1.65/1.86  Length of proof is 4.  Level of proof is 3.
% 1.65/1.86  
% 1.65/1.86  ---------------- PROOF ----------------
% 1.65/1.86  % SZS status Unsatisfiable
% 1.65/1.86  % SZS output start Refutation
% See solution above
% 1.65/1.86  ------------ end of proof -------------
% 1.65/1.86  
% 1.65/1.86  
% 1.65/1.86  Search stopped by max_proofs option.
% 1.65/1.86  
% 1.65/1.86  
% 1.65/1.86  Search stopped by max_proofs option.
% 1.65/1.86  
% 1.65/1.86  ============ end of search ============
% 1.65/1.86  
% 1.65/1.86  -------------- statistics -------------
% 1.65/1.86  clauses given                  7
% 1.65/1.86  clauses generated            124
% 1.65/1.86  clauses kept                  12
% 1.65/1.86  clauses forward subsumed     119
% 1.65/1.86  clauses back subsumed          0
% 1.65/1.86  Kbytes malloced              976
% 1.65/1.86  
% 1.65/1.86  ----------- times (seconds) -----------
% 1.65/1.86  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.65/1.86  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.65/1.86  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.65/1.86  
% 1.65/1.86  That finishes the proof of the theorem.
% 1.65/1.86  
% 1.65/1.86  Process 18130 finished Wed Jul 27 05:06:13 2022
% 1.65/1.86  Otter interrupted
% 1.65/1.86  PROOF FOUND
%------------------------------------------------------------------------------