%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CAT003-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:45 EDT 2022
% Result : Unsatisfiable 2.00s 2.21s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 10 unt; 0 nHn; 7 RR)
% Number of literals : 16 ( 15 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
( compose(A,compose(a,b)) != B
| compose(C,compose(a,b)) != B
| A = C ),
file('CAT003-4.p',unknown),
[] ).
cnf(10,axiom,
g != h,
file('CAT003-4.p',unknown),
[] ).
cnf(11,plain,
h != g,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(13,axiom,
compose(A,compose(B,C)) = compose(compose(A,B),C),
file('CAT003-4.p',unknown),
[] ).
cnf(15,plain,
compose(compose(A,B),C) = compose(A,compose(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[13])]),
[iquote('copy,13,flip.1')] ).
cnf(19,axiom,
compose(codomain(A),A) = A,
file('CAT003-4.p',unknown),
[] ).
cnf(22,axiom,
compose(h,a) = compose(g,a),
file('CAT003-4.p',unknown),
[] ).
cnf(50,plain,
( compose(A,compose(a,b)) != B
| compose(C,compose(D,compose(a,b))) != B
| A = compose(C,D) ),
inference(para_from,[status(thm),theory(equality)],[15,9]),
[iquote('para_from,14.1.1,9.2.1')] ).
cnf(99,plain,
compose(codomain(A),compose(A,B)) = compose(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[19,15])]),
[iquote('para_from,18.1.1,14.1.1.1,flip.1')] ).
cnf(132,plain,
compose(h,compose(a,A)) = compose(g,compose(a,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[22,15]),15])]),
[iquote('para_from,22.1.1,14.1.1.1,demod,15,flip.1')] ).
cnf(2050,plain,
h = g,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[132,50,99]),19]),
[iquote('hyper,132,50,99,demod,19')] ).
cnf(2052,plain,
$false,
inference(binary,[status(thm)],[2050,11]),
[iquote('binary,2050.1,11.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CAT003-4 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n019.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:02:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.00/2.21 ----- Otter 3.3f, August 2004 -----
% 2.00/2.21 The process was started by sandbox2 on n019.cluster.edu,
% 2.00/2.21 Wed Jul 27 02:02:52 2022
% 2.00/2.21 The command was "./otter". The process ID is 32457.
% 2.00/2.21
% 2.00/2.21 set(prolog_style_variables).
% 2.00/2.21 set(auto).
% 2.00/2.21 dependent: set(auto1).
% 2.00/2.21 dependent: set(process_input).
% 2.00/2.21 dependent: clear(print_kept).
% 2.00/2.21 dependent: clear(print_new_demod).
% 2.00/2.21 dependent: clear(print_back_demod).
% 2.00/2.21 dependent: clear(print_back_sub).
% 2.00/2.21 dependent: set(control_memory).
% 2.00/2.21 dependent: assign(max_mem, 12000).
% 2.00/2.21 dependent: assign(pick_given_ratio, 4).
% 2.00/2.21 dependent: assign(stats_level, 1).
% 2.00/2.21 dependent: assign(max_seconds, 10800).
% 2.00/2.21 clear(print_given).
% 2.00/2.21
% 2.00/2.21 list(usable).
% 2.00/2.21 0 [] A=A.
% 2.00/2.21 0 [] -e_quivalent(X,Y)|there_exists(X).
% 2.00/2.21 0 [] -e_quivalent(X,Y)|X=Y.
% 2.00/2.21 0 [] -there_exists(X)|X!=Y|e_quivalent(X,Y).
% 2.00/2.21 0 [] -there_exists(domain(X))|there_exists(X).
% 2.00/2.21 0 [] -there_exists(codomain(X))|there_exists(X).
% 2.00/2.21 0 [] -there_exists(compose(X,Y))|there_exists(domain(X)).
% 2.00/2.21 0 [] -there_exists(compose(X,Y))|domain(X)=codomain(Y).
% 2.00/2.21 0 [] -there_exists(domain(X))|domain(X)!=codomain(Y)|there_exists(compose(X,Y)).
% 2.00/2.21 0 [] compose(X,compose(Y,Z))=compose(compose(X,Y),Z).
% 2.00/2.21 0 [] compose(X,domain(X))=X.
% 2.00/2.21 0 [] compose(codomain(X),X)=X.
% 2.00/2.21 0 [] there_exists(compose(a,b)).
% 2.00/2.21 0 [] compose(X,compose(a,b))!=Y|compose(Z,compose(a,b))!=Y|X=Z.
% 2.00/2.21 0 [] there_exists(h).
% 2.00/2.21 0 [] compose(h,a)=compose(g,a).
% 2.00/2.21 0 [] g!=h.
% 2.00/2.21 end_of_list.
% 2.00/2.21
% 2.00/2.21 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 2.00/2.21
% 2.00/2.21 This is a Horn set with equality. The strategy will be
% 2.00/2.21 Knuth-Bendix and hyper_res, with positive clauses in
% 2.00/2.21 sos and nonpositive clauses in usable.
% 2.00/2.21
% 2.00/2.21 dependent: set(knuth_bendix).
% 2.00/2.21 dependent: set(anl_eq).
% 2.00/2.21 dependent: set(para_from).
% 2.00/2.21 dependent: set(para_into).
% 2.00/2.21 dependent: clear(para_from_right).
% 2.00/2.21 dependent: clear(para_into_right).
% 2.00/2.21 dependent: set(para_from_vars).
% 2.00/2.21 dependent: set(eq_units_both_ways).
% 2.00/2.21 dependent: set(dynamic_demod_all).
% 2.00/2.21 dependent: set(dynamic_demod).
% 2.00/2.21 dependent: set(order_eq).
% 2.00/2.21 dependent: set(back_demod).
% 2.00/2.21 dependent: set(lrpo).
% 2.00/2.21 dependent: set(hyper_res).
% 2.00/2.21 dependent: clear(order_hyper).
% 2.00/2.21
% 2.00/2.21 ------------> process usable:
% 2.00/2.21 ** KEPT (pick-wt=5): 1 [] -e_quivalent(A,B)|there_exists(A).
% 2.00/2.21 ** KEPT (pick-wt=6): 2 [] -e_quivalent(A,B)|A=B.
% 2.00/2.21 ** KEPT (pick-wt=8): 3 [] -there_exists(A)|A!=B|e_quivalent(A,B).
% 2.00/2.21 ** KEPT (pick-wt=5): 4 [] -there_exists(domain(A))|there_exists(A).
% 2.00/2.21 ** KEPT (pick-wt=5): 5 [] -there_exists(codomain(A))|there_exists(A).
% 2.00/2.21 ** KEPT (pick-wt=7): 6 [] -there_exists(compose(A,B))|there_exists(domain(A)).
% 2.00/2.21 ** KEPT (pick-wt=9): 7 [] -there_exists(compose(A,B))|domain(A)=codomain(B).
% 2.00/2.21 ** KEPT (pick-wt=12): 8 [] -there_exists(domain(A))|domain(A)!=codomain(B)|there_exists(compose(A,B)).
% 2.00/2.21 ** KEPT (pick-wt=17): 9 [] compose(A,compose(a,b))!=B|compose(C,compose(a,b))!=B|A=C.
% 2.00/2.21 ** KEPT (pick-wt=3): 11 [copy,10,flip.1] h!=g.
% 2.00/2.21
% 2.00/2.21 ------------> process sos:
% 2.00/2.21 ** KEPT (pick-wt=3): 12 [] A=A.
% 2.00/2.21 ** KEPT (pick-wt=11): 14 [copy,13,flip.1] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 2.00/2.21 ---> New Demodulator: 15 [new_demod,14] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 2.00/2.21 ** KEPT (pick-wt=6): 16 [] compose(A,domain(A))=A.
% 2.00/2.21 ---> New Demodulator: 17 [new_demod,16] compose(A,domain(A))=A.
% 2.00/2.21 ** KEPT (pick-wt=6): 18 [] compose(codomain(A),A)=A.
% 2.00/2.21 ---> New Demodulator: 19 [new_demod,18] compose(codomain(A),A)=A.
% 2.00/2.21 ** KEPT (pick-wt=4): 20 [] there_exists(compose(a,b)).
% 2.00/2.21 ** KEPT (pick-wt=2): 21 [] there_exists(h).
% 2.00/2.21 ** KEPT (pick-wt=7): 22 [] compose(h,a)=compose(g,a).
% 2.00/2.21 ---> New Demodulator: 23 [new_demod,22] compose(h,a)=compose(g,a).
% 2.00/2.21 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 2.00/2.21 >>>> Starting back demodulation with 15.
% 2.00/2.21 >>>> Starting back demodulation with 17.
% 2.00/2.21 >>>> Starting back demodulation with 19.
% 2.00/2.21 >>>> Starting back demodulation with 23.
% 2.00/2.21
% 2.00/2.21 ======= end of input processing =======
% 2.00/2.21
% 2.00/2.21 =========== start of search ===========
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Resetting weight limit to 7.
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Resetting weight limit to 7.
% 2.00/2.21
% 2.00/2.21 sos_size=1825
% 2.00/2.21
% 2.00/2.21 -------- PROOF --------
% 2.00/2.21
% 2.00/2.21 ----> UNIT CONFLICT at 0.41 sec ----> 2052 [binary,2050.1,11.1] $F.
% 2.00/2.21
% 2.00/2.21 Length of proof is 6. Level of proof is 3.
% 2.00/2.21
% 2.00/2.21 ---------------- PROOF ----------------
% 2.00/2.21 % SZS status Unsatisfiable
% 2.00/2.21 % SZS output start Refutation
% See solution above
% 2.00/2.21 ------------ end of proof -------------
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21 ============ end of search ============
% 2.00/2.21
% 2.00/2.21 -------------- statistics -------------
% 2.00/2.21 clauses given 326
% 2.00/2.21 clauses generated 13314
% 2.00/2.21 clauses kept 2021
% 2.00/2.21 clauses forward subsumed 1265
% 2.00/2.21 clauses back subsumed 17
% 2.00/2.21 Kbytes malloced 4882
% 2.00/2.21
% 2.00/2.21 ----------- times (seconds) -----------
% 2.00/2.21 user CPU time 0.41 (0 hr, 0 min, 0 sec)
% 2.00/2.21 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.00/2.21 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.00/2.21
% 2.00/2.21 That finishes the proof of the theorem.
% 2.00/2.21
% 2.00/2.21 Process 32457 finished Wed Jul 27 02:02:53 2022
% 2.00/2.21 Otter interrupted
% 2.00/2.21 PROOF FOUND
%------------------------------------------------------------------------------