%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CAT012-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:48 EDT 2022
% Result : Unsatisfiable 2.00s 2.15s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 4 RR)
% Number of literals : 13 ( 3 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 11 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(11,axiom,
( ~ defined(A,B)
| ~ identity_map(B)
| product(A,B,A) ),
file('CAT012-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| C = D ),
file('CAT012-1.p',unknown),
[] ).
cnf(13,axiom,
codomain(domain(a)) != domain(a),
file('CAT012-1.p',unknown),
[] ).
cnf(15,axiom,
identity_map(domain(A)),
file('CAT012-1.p',unknown),
[] ).
cnf(18,axiom,
defined(codomain(A),A),
file('CAT012-1.p',unknown),
[] ).
cnf(20,axiom,
product(codomain(A),A,A),
file('CAT012-1.p',unknown),
[] ).
cnf(29,plain,
product(codomain(domain(A)),domain(A),codomain(domain(A))),
inference(hyper,[status(thm)],[18,11,15]),
[iquote('hyper,18,11,15')] ).
cnf(301,plain,
codomain(domain(A)) = domain(A),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[29,12,20])]),
[iquote('hyper,29,12,20,flip.1')] ).
cnf(303,plain,
$false,
inference(binary,[status(thm)],[301,13]),
[iquote('binary,301.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : CAT012-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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 02:16:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.00/2.14 ----- Otter 3.3f, August 2004 -----
% 2.00/2.14 The process was started by sandbox2 on n026.cluster.edu,
% 2.00/2.14 Wed Jul 27 02:16:24 2022
% 2.00/2.14 The command was "./otter". The process ID is 5444.
% 2.00/2.14
% 2.00/2.14 set(prolog_style_variables).
% 2.00/2.14 set(auto).
% 2.00/2.14 dependent: set(auto1).
% 2.00/2.14 dependent: set(process_input).
% 2.00/2.14 dependent: clear(print_kept).
% 2.00/2.14 dependent: clear(print_new_demod).
% 2.00/2.14 dependent: clear(print_back_demod).
% 2.00/2.14 dependent: clear(print_back_sub).
% 2.00/2.14 dependent: set(control_memory).
% 2.00/2.14 dependent: assign(max_mem, 12000).
% 2.00/2.14 dependent: assign(pick_given_ratio, 4).
% 2.00/2.14 dependent: assign(stats_level, 1).
% 2.00/2.14 dependent: assign(max_seconds, 10800).
% 2.00/2.14 clear(print_given).
% 2.00/2.14
% 2.00/2.14 list(usable).
% 2.00/2.14 0 [] A=A.
% 2.00/2.14 0 [] -defined(X,Y)|product(X,Y,compose(X,Y)).
% 2.00/2.14 0 [] -product(X,Y,Z)|defined(X,Y).
% 2.00/2.14 0 [] -product(X,Y,Xy)| -defined(Xy,Z)|defined(Y,Z).
% 2.00/2.14 0 [] -product(X,Y,Xy)| -product(Y,Z,Yz)| -defined(Xy,Z)|defined(X,Yz).
% 2.00/2.14 0 [] -product(X,Y,Xy)| -product(Xy,Z,Xyz)| -product(Y,Z,Yz)|product(X,Yz,Xyz).
% 2.00/2.14 0 [] -product(Y,Z,Yz)| -defined(X,Yz)|defined(X,Y).
% 2.00/2.14 0 [] -product(Y,Z,Yz)| -product(X,Y,Xy)| -defined(X,Yz)|defined(Xy,Z).
% 2.00/2.14 0 [] -product(Y,Z,Yz)| -product(X,Yz,Xyz)| -product(X,Y,Xy)|product(Xy,Z,Xyz).
% 2.00/2.14 0 [] -defined(X,Y)| -defined(Y,Z)| -identity_map(Y)|defined(X,Z).
% 2.00/2.14 0 [] identity_map(domain(X)).
% 2.00/2.14 0 [] identity_map(codomain(X)).
% 2.00/2.14 0 [] defined(X,domain(X)).
% 2.00/2.14 0 [] defined(codomain(X),X).
% 2.00/2.14 0 [] product(X,domain(X),X).
% 2.00/2.14 0 [] product(codomain(X),X,X).
% 2.00/2.14 0 [] -defined(X,Y)| -identity_map(X)|product(X,Y,Y).
% 2.00/2.14 0 [] -defined(X,Y)| -identity_map(Y)|product(X,Y,X).
% 2.00/2.14 0 [] -product(X,Y,Z)| -product(X,Y,W)|Z=W.
% 2.00/2.14 0 [] codomain(domain(a))!=domain(a).
% 2.00/2.14 end_of_list.
% 2.00/2.14
% 2.00/2.14 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 2.00/2.14
% 2.00/2.14 This is a Horn set with equality. The strategy will be
% 2.00/2.14 Knuth-Bendix and hyper_res, with positive clauses in
% 2.00/2.14 sos and nonpositive clauses in usable.
% 2.00/2.14
% 2.00/2.14 dependent: set(knuth_bendix).
% 2.00/2.14 dependent: set(anl_eq).
% 2.00/2.14 dependent: set(para_from).
% 2.00/2.14 dependent: set(para_into).
% 2.00/2.14 dependent: clear(para_from_right).
% 2.00/2.14 dependent: clear(para_into_right).
% 2.00/2.14 dependent: set(para_from_vars).
% 2.00/2.14 dependent: set(eq_units_both_ways).
% 2.00/2.15 dependent: set(dynamic_demod_all).
% 2.00/2.15 dependent: set(dynamic_demod).
% 2.00/2.15 dependent: set(order_eq).
% 2.00/2.15 dependent: set(back_demod).
% 2.00/2.15 dependent: set(lrpo).
% 2.00/2.15 dependent: set(hyper_res).
% 2.00/2.15 dependent: clear(order_hyper).
% 2.00/2.15
% 2.00/2.15 ------------> process usable:
% 2.00/2.15 ** KEPT (pick-wt=9): 1 [] -defined(A,B)|product(A,B,compose(A,B)).
% 2.00/2.15 ** KEPT (pick-wt=7): 2 [] -product(A,B,C)|defined(A,B).
% 2.00/2.15 ** KEPT (pick-wt=10): 3 [] -product(A,B,C)| -defined(C,D)|defined(B,D).
% 2.00/2.15 ** KEPT (pick-wt=14): 4 [] -product(A,B,C)| -product(B,D,E)| -defined(C,D)|defined(A,E).
% 2.00/2.15 ** KEPT (pick-wt=16): 5 [] -product(A,B,C)| -product(C,D,E)| -product(B,D,F)|product(A,F,E).
% 2.00/2.15 ** KEPT (pick-wt=10): 6 [] -product(A,B,C)| -defined(D,C)|defined(D,A).
% 2.00/2.15 ** KEPT (pick-wt=14): 7 [] -product(A,B,C)| -product(D,A,E)| -defined(D,C)|defined(E,B).
% 2.00/2.15 ** KEPT (pick-wt=16): 8 [] -product(A,B,C)| -product(D,C,E)| -product(D,A,F)|product(F,B,E).
% 2.00/2.15 ** KEPT (pick-wt=11): 9 [] -defined(A,B)| -defined(B,C)| -identity_map(B)|defined(A,C).
% 2.00/2.15 ** KEPT (pick-wt=9): 10 [] -defined(A,B)| -identity_map(A)|product(A,B,B).
% 2.00/2.15 ** KEPT (pick-wt=9): 11 [] -defined(A,B)| -identity_map(B)|product(A,B,A).
% 2.00/2.15 ** KEPT (pick-wt=11): 12 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 2.00/2.15 ** KEPT (pick-wt=6): 13 [] codomain(domain(a))!=domain(a).
% 2.00/2.15
% 2.00/2.15 ------------> process sos:
% 2.00/2.15 ** KEPT (pick-wt=3): 14 [] A=A.
% 2.00/2.15 ** KEPT (pick-wt=3): 15 [] identity_map(domain(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 16 [] identity_map(codomain(A)).
% 2.00/2.15 ** KEPT (pick-wt=4): 17 [] defined(A,domain(A)).
% 2.00/2.15 ** KEPT (pick-wt=4): 18 [] defined(codomain(A),A).
% 2.00/2.15 ** KEPT (pick-wt=5): 19 [] product(A,domain(A),A).
% 2.00/2.15 ** KEPT (pick-wt=5): 20 [] product(codomain(A),A,A).
% 2.00/2.15 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] A=A.
% 2.00/2.15
% 2.00/2.15 ======= end of input processing =======
% 2.00/2.15
% 2.00/2.15 =========== start of search ===========
% 2.00/2.15
% 2.00/2.15 -------- PROOF --------
% 2.00/2.15
% 2.00/2.15 ----> UNIT CONFLICT at 0.02 sec ----> 303 [binary,301.1,13.1] $F.
% 2.00/2.15
% 2.00/2.15 Length of proof is 2. Level of proof is 2.
% 2.00/2.15
% 2.00/2.15 ---------------- PROOF ----------------
% 2.00/2.15 % SZS status Unsatisfiable
% 2.00/2.15 % SZS output start Refutation
% See solution above
% 2.00/2.15 ------------ end of proof -------------
% 2.00/2.15
% 2.00/2.15
% 2.00/2.15 Search stopped by max_proofs option.
% 2.00/2.15
% 2.00/2.15
% 2.00/2.15 Search stopped by max_proofs option.
% 2.00/2.15
% 2.00/2.15 ============ end of search ============
% 2.00/2.15
% 2.00/2.15 -------------- statistics -------------
% 2.00/2.15 clauses given 46
% 2.00/2.15 clauses generated 1413
% 2.00/2.15 clauses kept 294
% 2.00/2.15 clauses forward subsumed 1348
% 2.00/2.15 clauses back subsumed 3
% 2.00/2.15 Kbytes malloced 1953
% 2.00/2.15
% 2.00/2.15 ----------- times (seconds) -----------
% 2.00/2.15 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 2.00/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.15 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.00/2.15
% 2.00/2.15 That finishes the proof of the theorem.
% 2.00/2.15
% 2.00/2.15 Process 5444 finished Wed Jul 27 02:16:25 2022
% 2.00/2.15 Otter interrupted
% 2.00/2.15 PROOF FOUND
%------------------------------------------------------------------------------