TSTP Solution File: CAT019-1 by Otter---3.3

View Problem - Process Solution

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

% Computer : n007.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:47:50 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(14,axiom,
    ( c2 = A
    | c1 != A ),
    file('CAT019-1.p',unknown),
    [] ).

cnf(15,axiom,
    c2 != c1,
    file('CAT019-1.p',unknown),
    [] ).

cnf(16,axiom,
    A = A,
    file('CAT019-1.p',unknown),
    [] ).

cnf(23,plain,
    c2 = c1,
    inference(hyper,[status(thm)],[16,14]),
    [iquote('hyper,16,14')] ).

cnf(25,plain,
    $false,
    inference(binary,[status(thm)],[23,15]),
    [iquote('binary,23.1,15.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : CAT019-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n007.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 01:46:30 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.68/1.90  ----- Otter 3.3f, August 2004 -----
% 1.68/1.90  The process was started by sandbox on n007.cluster.edu,
% 1.68/1.90  Wed Jul 27 01:46:31 2022
% 1.68/1.90  The command was "./otter".  The process ID is 31860.
% 1.68/1.90  
% 1.68/1.90  set(prolog_style_variables).
% 1.68/1.90  set(auto).
% 1.68/1.90     dependent: set(auto1).
% 1.68/1.90     dependent: set(process_input).
% 1.68/1.90     dependent: clear(print_kept).
% 1.68/1.90     dependent: clear(print_new_demod).
% 1.68/1.90     dependent: clear(print_back_demod).
% 1.68/1.90     dependent: clear(print_back_sub).
% 1.68/1.90     dependent: set(control_memory).
% 1.68/1.90     dependent: assign(max_mem, 12000).
% 1.68/1.90     dependent: assign(pick_given_ratio, 4).
% 1.68/1.90     dependent: assign(stats_level, 1).
% 1.68/1.90     dependent: assign(max_seconds, 10800).
% 1.68/1.90  clear(print_given).
% 1.68/1.90  
% 1.68/1.90  list(usable).
% 1.68/1.90  0 [] A=A.
% 1.68/1.90  0 [] -defined(X,Y)|product(X,Y,compose(X,Y)).
% 1.68/1.90  0 [] -product(X,Y,Z)|defined(X,Y).
% 1.68/1.90  0 [] -product(X,Y,Xy)| -defined(Xy,Z)|defined(Y,Z).
% 1.68/1.90  0 [] -product(X,Y,Xy)| -product(Y,Z,Yz)| -defined(Xy,Z)|defined(X,Yz).
% 1.68/1.90  0 [] -product(X,Y,Xy)| -product(Xy,Z,Xyz)| -product(Y,Z,Yz)|product(X,Yz,Xyz).
% 1.68/1.90  0 [] -product(Y,Z,Yz)| -defined(X,Yz)|defined(X,Y).
% 1.68/1.90  0 [] -product(Y,Z,Yz)| -product(X,Y,Xy)| -defined(X,Yz)|defined(Xy,Z).
% 1.68/1.90  0 [] -product(Y,Z,Yz)| -product(X,Yz,Xyz)| -product(X,Y,Xy)|product(Xy,Z,Xyz).
% 1.68/1.90  0 [] -defined(X,Y)| -defined(Y,Z)| -identity_map(Y)|defined(X,Z).
% 1.68/1.90  0 [] identity_map(domain(X)).
% 1.68/1.90  0 [] identity_map(codomain(X)).
% 1.68/1.90  0 [] defined(X,domain(X)).
% 1.68/1.90  0 [] defined(codomain(X),X).
% 1.68/1.90  0 [] product(X,domain(X),X).
% 1.68/1.90  0 [] product(codomain(X),X,X).
% 1.68/1.90  0 [] -defined(X,Y)| -identity_map(X)|product(X,Y,Y).
% 1.68/1.90  0 [] -defined(X,Y)| -identity_map(Y)|product(X,Y,X).
% 1.68/1.90  0 [] -product(X,Y,Z)| -product(X,Y,W)|Z=W.
% 1.68/1.90  0 [] c2!=Z|c1=Z.
% 1.68/1.90  0 [] c2=Z|c1!=Z.
% 1.68/1.90  0 [] c2!=c1.
% 1.68/1.90  end_of_list.
% 1.68/1.90  
% 1.68/1.90  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.68/1.90  
% 1.68/1.90  This is a Horn set with equality.  The strategy will be
% 1.68/1.90  Knuth-Bendix and hyper_res, with positive clauses in
% 1.68/1.90  sos and nonpositive clauses in usable.
% 1.68/1.90  
% 1.68/1.90     dependent: set(knuth_bendix).
% 1.68/1.90     dependent: set(anl_eq).
% 1.68/1.90     dependent: set(para_from).
% 1.68/1.90     dependent: set(para_into).
% 1.68/1.90     dependent: clear(para_from_right).
% 1.68/1.90     dependent: clear(para_into_right).
% 1.68/1.90     dependent: set(para_from_vars).
% 1.68/1.90     dependent: set(eq_units_both_ways).
% 1.68/1.90     dependent: set(dynamic_demod_all).
% 1.68/1.90     dependent: set(dynamic_demod).
% 1.68/1.90     dependent: set(order_eq).
% 1.68/1.90     dependent: set(back_demod).
% 1.68/1.90     dependent: set(lrpo).
% 1.68/1.90     dependent: set(hyper_res).
% 1.68/1.90     dependent: clear(order_hyper).
% 1.68/1.90  
% 1.68/1.90  ------------> process usable:
% 1.68/1.90  ** KEPT (pick-wt=9): 1 [] -defined(A,B)|product(A,B,compose(A,B)).
% 1.68/1.90  ** KEPT (pick-wt=7): 2 [] -product(A,B,C)|defined(A,B).
% 1.68/1.90  ** KEPT (pick-wt=10): 3 [] -product(A,B,C)| -defined(C,D)|defined(B,D).
% 1.68/1.90  ** KEPT (pick-wt=14): 4 [] -product(A,B,C)| -product(B,D,E)| -defined(C,D)|defined(A,E).
% 1.68/1.90  ** KEPT (pick-wt=16): 5 [] -product(A,B,C)| -product(C,D,E)| -product(B,D,F)|product(A,F,E).
% 1.68/1.90  ** KEPT (pick-wt=10): 6 [] -product(A,B,C)| -defined(D,C)|defined(D,A).
% 1.68/1.90  ** KEPT (pick-wt=14): 7 [] -product(A,B,C)| -product(D,A,E)| -defined(D,C)|defined(E,B).
% 1.68/1.90  ** KEPT (pick-wt=16): 8 [] -product(A,B,C)| -product(D,C,E)| -product(D,A,F)|product(F,B,E).
% 1.68/1.90  ** KEPT (pick-wt=11): 9 [] -defined(A,B)| -defined(B,C)| -identity_map(B)|defined(A,C).
% 1.68/1.90  ** KEPT (pick-wt=9): 10 [] -defined(A,B)| -identity_map(A)|product(A,B,B).
% 1.68/1.90  ** KEPT (pick-wt=9): 11 [] -defined(A,B)| -identity_map(B)|product(A,B,A).
% 1.68/1.90  ** KEPT (pick-wt=11): 12 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.68/1.90  ** KEPT (pick-wt=6): 13 [] c2!=A|c1=A.
% 1.68/1.90  ** KEPT (pick-wt=6): 14 [] c2=A|c1!=A.
% 1.68/1.90  ** KEPT (pick-wt=3): 15 [] c2!=c1.
% 1.68/1.90  
% 1.68/1.90  ------------> process sos:
% 1.68/1.90  ** KEPT (pick-wt=3): 16 [] A=A.
% 1.68/1.90  ** KEPT (pick-wt=3): 17 [] identity_map(domain(A)).
% 1.68/1.90  ** KEPT (pick-wt=3): 18 [] identity_map(codomain(A)).
% 1.68/1.90  ** KEPT (pick-wt=4): 19 [] defined(A,domain(A)).
% 1.68/1.90  ** KEPT (pick-wt=4): 20 [] defined(codomain(A),A).
% 1.68/1.90  ** KEPT (pick-wt=5): 21 [] product(A,domain(A),A).
% 1.68/1.90  ** KEPT (pick-wt=5): 22 [] product(codomain(A),A,A).
% 1.68/1.90    Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] A=A.
% 1.68/1.90  
% 1.68/1.90  ======= end of input processing =======
% 1.68/1.90  
% 1.68/1.90  =========== start of search ===========
% 1.68/1.90  
% 1.68/1.90  -------- PROOF -------- 
% 1.68/1.90  
% 1.68/1.90  ----> UNIT CONFLICT at   0.00 sec ----> 25 [binary,23.1,15.1] $F.
% 1.68/1.90  
% 1.68/1.90  Length of proof is 1.  Level of proof is 1.
% 1.68/1.90  
% 1.68/1.90  ---------------- PROOF ----------------
% 1.68/1.90  % SZS status Unsatisfiable
% 1.68/1.90  % SZS output start Refutation
% See solution above
% 1.68/1.90  ------------ end of proof -------------
% 1.68/1.90  
% 1.68/1.90  
% 1.68/1.90  Search stopped by max_proofs option.
% 1.68/1.90  
% 1.68/1.90  
% 1.68/1.90  Search stopped by max_proofs option.
% 1.68/1.90  
% 1.68/1.90  ============ end of search ============
% 1.68/1.90  
% 1.68/1.90  -------------- statistics -------------
% 1.68/1.90  clauses given                  1
% 1.68/1.90  clauses generated              1
% 1.68/1.90  clauses kept                  23
% 1.68/1.90  clauses forward subsumed       1
% 1.68/1.90  clauses back subsumed          0
% 1.68/1.90  Kbytes malloced              976
% 1.68/1.90  
% 1.68/1.90  ----------- times (seconds) -----------
% 1.68/1.90  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.68/1.90  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.68/1.90  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.68/1.90  
% 1.68/1.90  That finishes the proof of the theorem.
% 1.68/1.90  
% 1.68/1.90  Process 31860 finished Wed Jul 27 01:46:32 2022
% 1.68/1.90  Otter interrupted
% 1.68/1.90  PROOF FOUND
%------------------------------------------------------------------------------