TSTP Solution File: MSC006-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MSC006-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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 13:06:18 EDT 2022
% Result : Unsatisfiable 1.79s 2.05s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 9 unt; 6 nHn; 8 RR)
% Number of literals : 31 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 25 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(A,B)
| ~ p(B,C)
| p(A,C) ),
file('MSC006-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ q(A,B)
| ~ q(B,C)
| q(A,C) ),
file('MSC006-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ q(A,B)
| q(B,A) ),
file('MSC006-1.p',unknown),
[] ).
cnf(4,axiom,
~ p(a,b),
file('MSC006-1.p',unknown),
[] ).
cnf(5,axiom,
~ q(c,d),
file('MSC006-1.p',unknown),
[] ).
cnf(6,axiom,
( p(A,B)
| q(A,B) ),
file('MSC006-1.p',unknown),
[] ).
cnf(7,plain,
p(c,d),
inference(hyper,[status(thm)],[6,5]),
[iquote('hyper,6,5')] ).
cnf(8,plain,
( p(A,B)
| q(B,A) ),
inference(hyper,[status(thm)],[6,3]),
[iquote('hyper,6,3')] ).
cnf(10,plain,
p(d,c),
inference(hyper,[status(thm)],[8,5]),
[iquote('hyper,8,5')] ).
cnf(12,plain,
( p(A,B)
| q(C,A)
| p(C,B) ),
inference(hyper,[status(thm)],[8,2,6]),
[iquote('hyper,8,2,6')] ).
cnf(13,plain,
( p(A,B)
| q(B,C)
| p(A,C) ),
inference(hyper,[status(thm)],[8,2,6]),
[iquote('hyper,8,2,6')] ).
cnf(36,plain,
( p(d,A)
| p(c,A) ),
inference(hyper,[status(thm)],[12,5]),
[iquote('hyper,12,5')] ).
cnf(44,plain,
( p(A,c)
| p(A,d) ),
inference(hyper,[status(thm)],[13,5]),
[iquote('hyper,13,5')] ).
cnf(54,plain,
p(c,A),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[36,1,7])]),
[iquote('hyper,36,1,7,factor_simp')] ).
cnf(56,plain,
p(d,A),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[36,1,10])]),
[iquote('hyper,36,1,10,factor_simp')] ).
cnf(57,plain,
p(A,d),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[44,1,54])]),
[iquote('hyper,44,1,54,factor_simp')] ).
cnf(70,plain,
p(A,B),
inference(hyper,[status(thm)],[57,1,56]),
[iquote('hyper,57,1,56')] ).
cnf(71,plain,
$false,
inference(binary,[status(thm)],[70,4]),
[iquote('binary,70.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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 09:01:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.79/2.05 ----- Otter 3.3f, August 2004 -----
% 1.79/2.05 The process was started by sandbox on n020.cluster.edu,
% 1.79/2.05 Wed Jul 27 09:01:38 2022
% 1.79/2.05 The command was "./otter". The process ID is 10537.
% 1.79/2.05
% 1.79/2.05 set(prolog_style_variables).
% 1.79/2.05 set(auto).
% 1.79/2.05 dependent: set(auto1).
% 1.79/2.05 dependent: set(process_input).
% 1.79/2.05 dependent: clear(print_kept).
% 1.79/2.05 dependent: clear(print_new_demod).
% 1.79/2.05 dependent: clear(print_back_demod).
% 1.79/2.05 dependent: clear(print_back_sub).
% 1.79/2.05 dependent: set(control_memory).
% 1.79/2.05 dependent: assign(max_mem, 12000).
% 1.79/2.05 dependent: assign(pick_given_ratio, 4).
% 1.79/2.05 dependent: assign(stats_level, 1).
% 1.79/2.05 dependent: assign(max_seconds, 10800).
% 1.79/2.05 clear(print_given).
% 1.79/2.05
% 1.79/2.05 list(usable).
% 1.79/2.05 0 [] -p(X,Y)| -p(Y,Z)|p(X,Z).
% 1.79/2.05 0 [] -q(X,Y)| -q(Y,Z)|q(X,Z).
% 1.79/2.05 0 [] -q(X,Y)|q(Y,X).
% 1.79/2.05 0 [] p(X,Y)|q(X,Y).
% 1.79/2.05 0 [] -p(a,b).
% 1.79/2.05 0 [] -q(c,d).
% 1.79/2.05 end_of_list.
% 1.79/2.05
% 1.79/2.05 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.79/2.05
% 1.79/2.05 This is a non-Horn set without equality. The strategy will
% 1.79/2.05 be ordered hyper_res, unit deletion, and factoring, with
% 1.79/2.05 satellites in sos and with nuclei in usable.
% 1.79/2.05
% 1.79/2.05 dependent: set(hyper_res).
% 1.79/2.05 dependent: set(factor).
% 1.79/2.05 dependent: set(unit_deletion).
% 1.79/2.05
% 1.79/2.05 ------------> process usable:
% 1.79/2.05 ** KEPT (pick-wt=9): 1 [] -p(A,B)| -p(B,C)|p(A,C).
% 1.79/2.05 ** KEPT (pick-wt=9): 2 [] -q(A,B)| -q(B,C)|q(A,C).
% 1.79/2.05 ** KEPT (pick-wt=6): 3 [] -q(A,B)|q(B,A).
% 1.79/2.05 ** KEPT (pick-wt=3): 4 [] -p(a,b).
% 1.79/2.05 ** KEPT (pick-wt=3): 5 [] -q(c,d).
% 1.79/2.05
% 1.79/2.05 ------------> process sos:
% 1.79/2.05 ** KEPT (pick-wt=6): 6 [] p(A,B)|q(A,B).
% 1.79/2.05
% 1.79/2.05 ======= end of input processing =======
% 1.79/2.05
% 1.79/2.05 =========== start of search ===========
% 1.79/2.05
% 1.79/2.05 -------- PROOF --------
% 1.79/2.05
% 1.79/2.05 ----> UNIT CONFLICT at 0.04 sec ----> 71 [binary,70.1,4.1] $F.
% 1.79/2.05
% 1.79/2.05 Length of proof is 11. Level of proof is 6.
% 1.79/2.05
% 1.79/2.05 ---------------- PROOF ----------------
% 1.79/2.05 % SZS status Unsatisfiable
% 1.79/2.05 % SZS output start Refutation
% See solution above
% 1.79/2.05 ------------ end of proof -------------
% 1.79/2.05
% 1.79/2.05
% 1.79/2.05 Search stopped by max_proofs option.
% 1.79/2.05
% 1.79/2.05
% 1.79/2.05 Search stopped by max_proofs option.
% 1.79/2.05
% 1.79/2.05 ============ end of search ============
% 1.79/2.05
% 1.79/2.05 -------------- statistics -------------
% 1.79/2.05 clauses given 22
% 1.79/2.05 clauses generated 618
% 1.79/2.05 clauses kept 70
% 1.79/2.05 clauses forward subsumed 552
% 1.79/2.05 clauses back subsumed 17
% 1.79/2.05 Kbytes malloced 976
% 1.79/2.05
% 1.79/2.05 ----------- times (seconds) -----------
% 1.79/2.05 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 1.79/2.05 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/2.05 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.79/2.05
% 1.79/2.05 That finishes the proof of the theorem.
% 1.79/2.05
% 1.79/2.05 Process 10537 finished Wed Jul 27 09:01:40 2022
% 1.79/2.05 Otter interrupted
% 1.79/2.05 PROOF FOUND
%------------------------------------------------------------------------------