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