TSTP Solution File: MSC008-1.002 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MSC008-1.002 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n001.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 : Mon May 22 16:35:06 EDT 2023
% Result : Unsatisfiable 1.92s 2.13s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 13 ( 4 unt; 6 nHn; 5 RR)
% Number of literals : 27 ( 0 equ; 9 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 30 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ e_q(p_1,p_2),
file('MSC008-1.002.p',unknown),
[] ).
cnf(3,axiom,
( ~ latin(A,B,C)
| ~ latin(A,B,D)
| e_q(C,D) ),
file('MSC008-1.002.p',unknown),
[] ).
cnf(6,axiom,
( ~ greek(A,B,C)
| ~ greek(A,B,D)
| e_q(C,D) ),
file('MSC008-1.002.p',unknown),
[] ).
cnf(10,axiom,
( ~ greek(A,B,C)
| ~ latin(A,B,D)
| ~ greek(E,F,C)
| ~ latin(E,F,D)
| e_q(A,E) ),
file('MSC008-1.002.p',unknown),
[] ).
cnf(19,axiom,
( latin(A,p_1,B)
| latin(A,p_2,B) ),
file('MSC008-1.002.p',unknown),
[] ).
cnf(20,axiom,
( latin(p_1,A,B)
| latin(p_2,A,B) ),
file('MSC008-1.002.p',unknown),
[] ).
cnf(22,axiom,
( greek(A,p_1,B)
| greek(A,p_2,B) ),
file('MSC008-1.002.p',unknown),
[] ).
cnf(23,axiom,
( greek(p_1,A,B)
| greek(p_2,A,B) ),
file('MSC008-1.002.p',unknown),
[] ).
cnf(752,plain,
( greek(p_2,p_2,A)
| latin(p_1,p_1,B) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[23,10,19,22,20]),1])])]),
[iquote('hyper,23,10,19,22,20,unit_del,1,factor_simp,factor_simp')] ).
cnf(1229,plain,
( greek(p_2,p_2,A)
| e_q(B,C) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[752,3,752])]),
[iquote('hyper,752,3,752,factor_simp')] ).
cnf(1230,plain,
greek(p_2,p_2,A),
inference(hyper,[status(thm)],[1229,1]),
[iquote('hyper,1229,1')] ).
cnf(1363,plain,
e_q(A,B),
inference(hyper,[status(thm)],[1230,6,1230]),
[iquote('hyper,1230,6,1230')] ).
cnf(1364,plain,
$false,
inference(binary,[status(thm)],[1363,1]),
[iquote('binary,1363.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MSC008-1.002 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.31 % Computer : n001.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Mon May 22 17:13:13 EDT 2023
% 0.12/0.32 % CPUTime :
% 1.92/2.12 ----- Otter 3.3f, August 2004 -----
% 1.92/2.12 The process was started by sandbox2 on n001.cluster.edu,
% 1.92/2.12 Mon May 22 17:13:13 2023
% 1.92/2.12 The command was "./otter". The process ID is 11749.
% 1.92/2.12
% 1.92/2.12 set(prolog_style_variables).
% 1.92/2.12 set(auto).
% 1.92/2.12 dependent: set(auto1).
% 1.92/2.12 dependent: set(process_input).
% 1.92/2.12 dependent: clear(print_kept).
% 1.92/2.12 dependent: clear(print_new_demod).
% 1.92/2.12 dependent: clear(print_back_demod).
% 1.92/2.12 dependent: clear(print_back_sub).
% 1.92/2.12 dependent: set(control_memory).
% 1.92/2.12 dependent: assign(max_mem, 12000).
% 1.92/2.12 dependent: assign(pick_given_ratio, 4).
% 1.92/2.12 dependent: assign(stats_level, 1).
% 1.92/2.12 dependent: assign(max_seconds, 10800).
% 1.92/2.12 clear(print_given).
% 1.92/2.12
% 1.92/2.12 list(usable).
% 1.92/2.12 0 [] -e_q(p_1,p_2).
% 1.92/2.12 0 [] e_q(X,X).
% 1.92/2.12 0 [] -e_q(X,Y)|e_q(Y,X).
% 1.92/2.12 0 [] -latin(Row,Column,Label1)| -latin(Row,Column,Label2)|e_q(Label1,Label2).
% 1.92/2.12 0 [] -latin(Row,Column1,Label)| -latin(Row,Column2,Label)|e_q(Column1,Column2).
% 1.92/2.12 0 [] -latin(Row1,Column,Label)| -latin(Row2,Column,Label)|e_q(Row1,Row2).
% 1.92/2.12 0 [] -greek(Row,Column,Label1)| -greek(Row,Column,Label2)|e_q(Label1,Label2).
% 1.92/2.12 0 [] -greek(Row,Column1,Label)| -greek(Row,Column2,Label)|e_q(Column1,Column2).
% 1.92/2.12 0 [] -greek(Row1,Column,Label)| -greek(Row2,Column,Label)|e_q(Row1,Row2).
% 1.92/2.12 0 [] latin(Row,Column,p_1)|latin(Row,Column,p_2).
% 1.92/2.12 0 [] latin(Row,p_1,Label)|latin(Row,p_2,Label).
% 1.92/2.12 0 [] latin(p_1,Column,Label)|latin(p_2,Column,Label).
% 1.92/2.12 0 [] greek(Row,Column,p_1)|greek(Row,Column,p_2).
% 1.92/2.12 0 [] greek(Row,p_1,Label)|greek(Row,p_2,Label).
% 1.92/2.12 0 [] greek(p_1,Column,Label)|greek(p_2,Column,Label).
% 1.92/2.12 0 [] -greek(Row1,Column1,Label1)| -latin(Row1,Column1,Label2)| -greek(Row2,Column2,Label1)| -latin(Row2,Column2,Label2)|e_q(Column1,Column2).
% 1.92/2.12 0 [] -greek(Row1,Column1,Label1)| -latin(Row1,Column1,Label2)| -greek(Row2,Column2,Label1)| -latin(Row2,Column2,Label2)|e_q(Row1,Row2).
% 1.92/2.12 end_of_list.
% 1.92/2.12
% 1.92/2.12 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.92/2.12
% 1.92/2.12 This is a non-Horn set without equality. The strategy will
% 1.92/2.12 be ordered hyper_res, unit deletion, and factoring, with
% 1.92/2.12 satellites in sos and with nuclei in usable.
% 1.92/2.12
% 1.92/2.12 dependent: set(hyper_res).
% 1.92/2.12 dependent: set(factor).
% 1.92/2.13 dependent: set(unit_deletion).
% 1.92/2.13
% 1.92/2.13 ------------> process usable:
% 1.92/2.13 ** KEPT (pick-wt=3): 1 [] -e_q(p_1,p_2).
% 1.92/2.13 ** KEPT (pick-wt=6): 2 [] -e_q(A,B)|e_q(B,A).
% 1.92/2.13 ** KEPT (pick-wt=11): 3 [] -latin(A,B,C)| -latin(A,B,D)|e_q(C,D).
% 1.92/2.13 ** KEPT (pick-wt=11): 4 [] -latin(A,B,C)| -latin(A,D,C)|e_q(B,D).
% 1.92/2.13 ** KEPT (pick-wt=11): 5 [] -latin(A,B,C)| -latin(D,B,C)|e_q(A,D).
% 1.92/2.13 ** KEPT (pick-wt=11): 6 [] -greek(A,B,C)| -greek(A,B,D)|e_q(C,D).
% 1.92/2.13 ** KEPT (pick-wt=11): 7 [] -greek(A,B,C)| -greek(A,D,C)|e_q(B,D).
% 1.92/2.13 ** KEPT (pick-wt=11): 8 [] -greek(A,B,C)| -greek(D,B,C)|e_q(A,D).
% 1.92/2.13 ** KEPT (pick-wt=19): 9 [] -greek(A,B,C)| -latin(A,B,D)| -greek(E,F,C)| -latin(E,F,D)|e_q(B,F).
% 1.92/2.13 ** KEPT (pick-wt=19): 10 [] -greek(A,B,C)| -latin(A,B,D)| -greek(E,F,C)| -latin(E,F,D)|e_q(A,E).
% 1.92/2.13
% 1.92/2.13 ------------> process sos:
% 1.92/2.13 ** KEPT (pick-wt=3): 17 [] e_q(A,A).
% 1.92/2.13 ** KEPT (pick-wt=8): 18 [] latin(A,B,p_1)|latin(A,B,p_2).
% 1.92/2.13 ** KEPT (pick-wt=8): 19 [] latin(A,p_1,B)|latin(A,p_2,B).
% 1.92/2.13 ** KEPT (pick-wt=8): 20 [] latin(p_1,A,B)|latin(p_2,A,B).
% 1.92/2.13 ** KEPT (pick-wt=8): 21 [] greek(A,B,p_1)|greek(A,B,p_2).
% 1.92/2.13 ** KEPT (pick-wt=8): 22 [] greek(A,p_1,B)|greek(A,p_2,B).
% 1.92/2.13 ** KEPT (pick-wt=8): 23 [] greek(p_1,A,B)|greek(p_2,A,B).
% 1.92/2.13 17 back subsumes 16.
% 1.92/2.13 17 back subsumes 15.
% 1.92/2.13 17 back subsumes 14.
% 1.92/2.13 17 back subsumes 13.
% 1.92/2.13 17 back subsumes 12.
% 1.92/2.13 17 back subsumes 11.
% 1.92/2.13
% 1.92/2.13 ======= end of input processing =======
% 1.92/2.13
% 1.92/2.13 =========== start of search ===========
% 1.92/2.13
% 1.92/2.13 -------- PROOF --------
% 1.92/2.13
% 1.92/2.13 ----> UNIT CONFLICT at 0.34 sec ----> 1364 [binary,1363.1,1.1] $F.
% 1.92/2.13
% 1.92/2.13 Length of proof is 4. Level of proof is 4.
% 1.92/2.13
% 1.92/2.13 ---------------- PROOF ----------------
% 1.92/2.13 % SZS status Unsatisfiable
% 1.92/2.13 % SZS output start Refutation
% See solution above
% 1.92/2.13 ------------ end of proof -------------
% 1.92/2.13
% 1.92/2.13
% 1.92/2.13 Search stopped by max_proofs option.
% 1.92/2.13
% 1.92/2.13
% 1.92/2.13 Search stopped by max_proofs option.
% 1.92/2.13
% 1.92/2.13 ============ end of search ============
% 1.92/2.13
% 1.92/2.13 -------------- statistics -------------
% 1.92/2.13 clauses given 10
% 1.92/2.13 clauses generated 4262
% 1.92/2.13 clauses kept 1363
% 1.92/2.13 clauses forward subsumed 2916
% 1.92/2.13 clauses back subsumed 488
% 1.92/2.13 Kbytes malloced 1953
% 1.92/2.13
% 1.92/2.13 ----------- times (seconds) -----------
% 1.92/2.13 user CPU time 0.34 (0 hr, 0 min, 0 sec)
% 1.92/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.13 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.92/2.13
% 1.92/2.13 That finishes the proof of the theorem.
% 1.92/2.13
% 1.92/2.13 Process 11749 finished Mon May 22 17:13:15 2023
% 1.92/2.13 Otter interrupted
% 1.92/2.13 PROOF FOUND
%------------------------------------------------------------------------------