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

View Problem - Process Solution

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

% Computer : n024.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:57 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ product(A,B,C)
    | ~ product(A,B,D)
    | e_qualish(C,D) ),
    file('GRP042-2.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ e_qualish(A,B)
    | ~ product(C,D,A)
    | product(C,D,B) ),
    file('GRP042-2.p',unknown),
    [] ).

cnf(5,axiom,
    ~ e_qualish(b,a),
    file('GRP042-2.p',unknown),
    [] ).

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

cnf(9,axiom,
    e_qualish(a,b),
    file('GRP042-2.p',unknown),
    [] ).

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

cnf(13,plain,
    e_qualish(b,a),
    inference(hyper,[status(thm)],[11,1,6]),
    [iquote('hyper,11,1,6')] ).

cnf(14,plain,
    $false,
    inference(binary,[status(thm)],[13,5]),
    [iquote('binary,13.1,5.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP042-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Jul 27 05:07:40 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.65/1.84  ----- Otter 3.3f, August 2004 -----
% 1.65/1.84  The process was started by sandbox2 on n024.cluster.edu,
% 1.65/1.84  Wed Jul 27 05:07:40 2022
% 1.65/1.84  The command was "./otter".  The process ID is 20849.
% 1.65/1.84  
% 1.65/1.84  set(prolog_style_variables).
% 1.65/1.84  set(auto).
% 1.65/1.84     dependent: set(auto1).
% 1.65/1.84     dependent: set(process_input).
% 1.65/1.84     dependent: clear(print_kept).
% 1.65/1.84     dependent: clear(print_new_demod).
% 1.65/1.84     dependent: clear(print_back_demod).
% 1.65/1.84     dependent: clear(print_back_sub).
% 1.65/1.84     dependent: set(control_memory).
% 1.65/1.84     dependent: assign(max_mem, 12000).
% 1.65/1.84     dependent: assign(pick_given_ratio, 4).
% 1.65/1.84     dependent: assign(stats_level, 1).
% 1.65/1.84     dependent: assign(max_seconds, 10800).
% 1.65/1.84  clear(print_given).
% 1.65/1.84  
% 1.65/1.84  list(usable).
% 1.65/1.84  0 [] product(identity,X,X).
% 1.65/1.84  0 [] product(inverse(X),X,identity).
% 1.65/1.84  0 [] product(X,Y,multiply(X,Y)).
% 1.65/1.84  0 [] -product(X,Y,Z)| -product(X,Y,W)|e_qualish(Z,W).
% 1.65/1.84  0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.65/1.84  0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.65/1.84  0 [] -e_qualish(X,Y)| -product(W,Z,X)|product(W,Z,Y).
% 1.65/1.84  0 [] e_qualish(a,b).
% 1.65/1.84  0 [] -e_qualish(b,a).
% 1.65/1.84  end_of_list.
% 1.65/1.84  
% 1.65/1.84  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.65/1.84  
% 1.65/1.84  This is a Horn set without equality.  The strategy will
% 1.65/1.84  be hyperresolution, with satellites in sos and nuclei
% 1.65/1.84  in usable.
% 1.65/1.84  
% 1.65/1.84     dependent: set(hyper_res).
% 1.65/1.84     dependent: clear(order_hyper).
% 1.65/1.84  
% 1.65/1.84  ------------> process usable:
% 1.65/1.84  ** KEPT (pick-wt=11): 1 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.65/1.84  ** KEPT (pick-wt=16): 2 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.65/1.84  ** KEPT (pick-wt=16): 3 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.65/1.84  ** KEPT (pick-wt=11): 4 [] -e_qualish(A,B)| -product(C,D,A)|product(C,D,B).
% 1.65/1.84  ** KEPT (pick-wt=3): 5 [] -e_qualish(b,a).
% 1.65/1.84  
% 1.65/1.84  ------------> process sos:
% 1.65/1.84  ** KEPT (pick-wt=4): 6 [] product(identity,A,A).
% 1.65/1.84  ** KEPT (pick-wt=5): 7 [] product(inverse(A),A,identity).
% 1.65/1.84  ** KEPT (pick-wt=6): 8 [] product(A,B,multiply(A,B)).
% 1.65/1.84  ** KEPT (pick-wt=3): 9 [] e_qualish(a,b).
% 1.65/1.84  
% 1.65/1.84  ======= end of input processing =======
% 1.65/1.84  
% 1.65/1.84  =========== start of search ===========
% 1.65/1.84  
% 1.65/1.84  -------- PROOF -------- 
% 1.65/1.84  
% 1.65/1.84  ----> UNIT CONFLICT at   0.00 sec ----> 14 [binary,13.1,5.1] $F.
% 1.65/1.84  
% 1.65/1.84  Length of proof is 2.  Level of proof is 2.
% 1.65/1.84  
% 1.65/1.84  ---------------- PROOF ----------------
% 1.65/1.84  % SZS status Unsatisfiable
% 1.65/1.84  % SZS output start Refutation
% See solution above
% 1.65/1.84  ------------ end of proof -------------
% 1.65/1.84  
% 1.65/1.84  
% 1.65/1.84  Search stopped by max_proofs option.
% 1.65/1.84  
% 1.65/1.84  
% 1.65/1.84  Search stopped by max_proofs option.
% 1.65/1.84  
% 1.65/1.84  ============ end of search ============
% 1.65/1.84  
% 1.65/1.84  -------------- statistics -------------
% 1.65/1.84  clauses given                  4
% 1.65/1.84  clauses generated             21
% 1.65/1.84  clauses kept                  13
% 1.65/1.84  clauses forward subsumed      17
% 1.65/1.84  clauses back subsumed          0
% 1.65/1.84  Kbytes malloced              976
% 1.65/1.84  
% 1.65/1.84  ----------- times (seconds) -----------
% 1.65/1.84  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.65/1.84  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.65/1.84  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.65/1.84  
% 1.65/1.84  That finishes the proof of the theorem.
% 1.65/1.84  
% 1.65/1.84  Process 20849 finished Wed Jul 27 05:07:41 2022
% 1.65/1.84  Otter interrupted
% 1.65/1.84  PROOF FOUND
%------------------------------------------------------------------------------