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