%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CAT019-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:47:50 EDT 2022
% Result : Unsatisfiable 1.72s 1.91s
% Output : Refutation 1.72s
% 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(6,axiom,
( c2 = A
| c1 != A ),
file('CAT019-2.p',unknown),
[] ).
cnf(7,axiom,
c2 != c1,
file('CAT019-2.p',unknown),
[] ).
cnf(8,axiom,
A = A,
file('CAT019-2.p',unknown),
[] ).
cnf(17,plain,
c2 = c1,
inference(hyper,[status(thm)],[8,6]),
[iquote('hyper,8,6')] ).
cnf(19,plain,
$false,
inference(binary,[status(thm)],[17,7]),
[iquote('binary,17.1,7.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CAT019-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/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 02:05:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.72/1.91 ----- Otter 3.3f, August 2004 -----
% 1.72/1.91 The process was started by sandbox2 on n024.cluster.edu,
% 1.72/1.91 Wed Jul 27 02:05:25 2022
% 1.72/1.91 The command was "./otter". The process ID is 1133.
% 1.72/1.91
% 1.72/1.91 set(prolog_style_variables).
% 1.72/1.91 set(auto).
% 1.72/1.91 dependent: set(auto1).
% 1.72/1.91 dependent: set(process_input).
% 1.72/1.91 dependent: clear(print_kept).
% 1.72/1.91 dependent: clear(print_new_demod).
% 1.72/1.91 dependent: clear(print_back_demod).
% 1.72/1.91 dependent: clear(print_back_sub).
% 1.72/1.91 dependent: set(control_memory).
% 1.72/1.91 dependent: assign(max_mem, 12000).
% 1.72/1.91 dependent: assign(pick_given_ratio, 4).
% 1.72/1.91 dependent: assign(stats_level, 1).
% 1.72/1.91 dependent: assign(max_seconds, 10800).
% 1.72/1.91 clear(print_given).
% 1.72/1.91
% 1.72/1.91 list(usable).
% 1.72/1.91 0 [] A=A.
% 1.72/1.91 0 [] codomain(domain(X))=domain(X).
% 1.72/1.91 0 [] domain(codomain(X))=codomain(X).
% 1.72/1.91 0 [] compose(domain(X),X)=X.
% 1.72/1.91 0 [] compose(X,codomain(X))=X.
% 1.72/1.91 0 [] codomain(X)!=domain(Y)|domain(compose(X,Y))=domain(X).
% 1.72/1.91 0 [] codomain(X)!=domain(Y)|codomain(compose(X,Y))=codomain(Y).
% 1.72/1.91 0 [] codomain(X)!=domain(Y)|codomain(Y)!=domain(Z)|compose(X,compose(Y,Z))=compose(compose(X,Y),Z).
% 1.72/1.91 0 [] c2!=Z|c1=Z.
% 1.72/1.91 0 [] c2=Z|c1!=Z.
% 1.72/1.91 0 [] c2!=c1.
% 1.72/1.91 end_of_list.
% 1.72/1.91
% 1.72/1.91 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.72/1.91
% 1.72/1.91 This is a Horn set with equality. The strategy will be
% 1.72/1.91 Knuth-Bendix and hyper_res, with positive clauses in
% 1.72/1.91 sos and nonpositive clauses in usable.
% 1.72/1.91
% 1.72/1.91 dependent: set(knuth_bendix).
% 1.72/1.91 dependent: set(anl_eq).
% 1.72/1.91 dependent: set(para_from).
% 1.72/1.91 dependent: set(para_into).
% 1.72/1.91 dependent: clear(para_from_right).
% 1.72/1.91 dependent: clear(para_into_right).
% 1.72/1.91 dependent: set(para_from_vars).
% 1.72/1.91 dependent: set(eq_units_both_ways).
% 1.72/1.91 dependent: set(dynamic_demod_all).
% 1.72/1.91 dependent: set(dynamic_demod).
% 1.72/1.91 dependent: set(order_eq).
% 1.72/1.91 dependent: set(back_demod).
% 1.72/1.91 dependent: set(lrpo).
% 1.72/1.91 dependent: set(hyper_res).
% 1.72/1.91 dependent: clear(order_hyper).
% 1.72/1.91
% 1.72/1.91 ------------> process usable:
% 1.72/1.91 ** KEPT (pick-wt=12): 1 [] codomain(A)!=domain(B)|domain(compose(A,B))=domain(A).
% 1.72/1.91 ** KEPT (pick-wt=12): 2 [] codomain(A)!=domain(B)|codomain(compose(A,B))=codomain(B).
% 1.72/1.91 ** KEPT (pick-wt=21): 4 [copy,3,flip.3] codomain(A)!=domain(B)|codomain(B)!=domain(C)|compose(compose(A,B),C)=compose(A,compose(B,C)).
% 1.72/1.91 ** KEPT (pick-wt=6): 5 [] c2!=A|c1=A.
% 1.72/1.91 ** KEPT (pick-wt=6): 6 [] c2=A|c1!=A.
% 1.72/1.91 ** KEPT (pick-wt=3): 7 [] c2!=c1.
% 1.72/1.91
% 1.72/1.91 ------------> process sos:
% 1.72/1.91 ** KEPT (pick-wt=3): 8 [] A=A.
% 1.72/1.91 ** KEPT (pick-wt=6): 9 [] codomain(domain(A))=domain(A).
% 1.72/1.91 ---> New Demodulator: 10 [new_demod,9] codomain(domain(A))=domain(A).
% 1.72/1.91 ** KEPT (pick-wt=6): 11 [] domain(codomain(A))=codomain(A).
% 1.72/1.91 ---> New Demodulator: 12 [new_demod,11] domain(codomain(A))=codomain(A).
% 1.72/1.91 ** KEPT (pick-wt=6): 13 [] compose(domain(A),A)=A.
% 1.72/1.91 ---> New Demodulator: 14 [new_demod,13] compose(domain(A),A)=A.
% 1.72/1.91 ** KEPT (pick-wt=6): 15 [] compose(A,codomain(A))=A.
% 1.72/1.91 ---> New Demodulator: 16 [new_demod,15] compose(A,codomain(A))=A.
% 1.72/1.91 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] A=A.
% 1.72/1.91 >>>> Starting back demodulation with 10.
% 1.72/1.91 >>>> Starting back demodulation with 12.
% 1.72/1.91 >>>> Starting back demodulation with 14.
% 1.72/1.91 >>>> Starting back demodulation with 16.
% 1.72/1.91
% 1.72/1.91 ======= end of input processing =======
% 1.72/1.91
% 1.72/1.91 =========== start of search ===========
% 1.72/1.91
% 1.72/1.91 -------- PROOF --------
% 1.72/1.91
% 1.72/1.91 ----> UNIT CONFLICT at 0.00 sec ----> 19 [binary,17.1,7.1] $F.
% 1.72/1.91
% 1.72/1.91 Length of proof is 1. Level of proof is 1.
% 1.72/1.91
% 1.72/1.91 ---------------- PROOF ----------------
% 1.72/1.91 % SZS status Unsatisfiable
% 1.72/1.91 % SZS output start Refutation
% See solution above
% 1.72/1.91 ------------ end of proof -------------
% 1.72/1.91
% 1.72/1.91
% 1.72/1.91 Search stopped by max_proofs option.
% 1.72/1.91
% 1.72/1.91
% 1.72/1.91 Search stopped by max_proofs option.
% 1.72/1.91
% 1.72/1.91 ============ end of search ============
% 1.72/1.91
% 1.72/1.91 -------------- statistics -------------
% 1.72/1.91 clauses given 1
% 1.72/1.91 clauses generated 1
% 1.72/1.91 clauses kept 12
% 1.72/1.91 clauses forward subsumed 1
% 1.72/1.91 clauses back subsumed 0
% 1.72/1.91 Kbytes malloced 976
% 1.72/1.91
% 1.72/1.91 ----------- times (seconds) -----------
% 1.72/1.91 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.91 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.72/1.91
% 1.72/1.91 That finishes the proof of the theorem.
% 1.72/1.91
% 1.72/1.91 Process 1133 finished Wed Jul 27 02:05:26 2022
% 1.72/1.91 Otter interrupted
% 1.72/1.91 PROOF FOUND
%------------------------------------------------------------------------------