TSTP Solution File: PUZ008-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ008-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:11:01 EDT 2022
% Result : Unsatisfiable 2.01s 2.19s
% Output : Refutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 3 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( ~ achievable(west(m(s(A)),c(B)),boatonwest,east(m(C),c(D)))
| achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(D))) ),
file('PUZ008-1.p',unknown),
[] ).
cnf(11,axiom,
~ achievable(west(m(n0),c(n0)),A,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('PUZ008-1.p',unknown),
[] ).
cnf(14,axiom,
achievable(west(A,B),C,east(m(s(D)),c(s(s(D))))),
file('PUZ008-1.p',unknown),
[] ).
cnf(29,plain,
achievable(west(m(A),c(B)),boatoneast,east(m(s(s(C))),c(s(s(C))))),
inference(hyper,[status(thm)],[14,5]),
[iquote('hyper,14,5')] ).
cnf(30,plain,
$false,
inference(binary,[status(thm)],[29,11]),
[iquote('binary,29.1,11.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 01:49:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.01/2.19 ----- Otter 3.3f, August 2004 -----
% 2.01/2.19 The process was started by sandbox2 on n020.cluster.edu,
% 2.01/2.19 Wed Jul 27 01:49:39 2022
% 2.01/2.19 The command was "./otter". The process ID is 9888.
% 2.01/2.19
% 2.01/2.19 set(prolog_style_variables).
% 2.01/2.19 set(auto).
% 2.01/2.19 dependent: set(auto1).
% 2.01/2.19 dependent: set(process_input).
% 2.01/2.19 dependent: clear(print_kept).
% 2.01/2.19 dependent: clear(print_new_demod).
% 2.01/2.19 dependent: clear(print_back_demod).
% 2.01/2.19 dependent: clear(print_back_sub).
% 2.01/2.19 dependent: set(control_memory).
% 2.01/2.19 dependent: assign(max_mem, 12000).
% 2.01/2.19 dependent: assign(pick_given_ratio, 4).
% 2.01/2.19 dependent: assign(stats_level, 1).
% 2.01/2.19 dependent: assign(max_seconds, 10800).
% 2.01/2.19 clear(print_given).
% 2.01/2.19
% 2.01/2.19 list(usable).
% 2.01/2.19 0 [] -achievable(west(m(X),c(s(Y))),boatonwest,east(m(Z),c(W)))|achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(W)))).
% 2.01/2.19 0 [] -achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(W))))|achievable(west(m(X),c(s(Y))),boatonwest,east(m(Z),c(W))).
% 2.01/2.19 0 [] -achievable(west(m(X),c(s(s(Y)))),boatonwest,east(m(Z),c(W)))|achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(s(W))))).
% 2.01/2.19 0 [] -achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(s(W)))))|achievable(west(m(X),c(s(s(Y)))),boatonwest,east(m(Z),c(W))).
% 2.01/2.19 0 [] -achievable(west(m(s(X)),c(Y)),boatonwest,east(m(Z),c(W)))|achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(W))).
% 2.01/2.19 0 [] -achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(W)))|achievable(west(m(s(X)),c(Y)),boatonwest,east(m(Z),c(W))).
% 2.01/2.19 0 [] -achievable(west(m(s(s(X))),c(Y)),boatonwest,east(m(Z),c(W)))|achievable(west(m(X),c(Y)),boatoneast,east(m(s(s(Z))),c(W))).
% 2.01/2.19 0 [] -achievable(west(m(X),c(Y)),boatoneast,east(m(s(s(Z))),c(W)))|achievable(west(m(s(s(X))),c(Y)),boatonwest,east(m(Z),c(W))).
% 2.01/2.19 0 [] -achievable(west(m(s(X)),c(s(Y))),boatonwest,east(m(Z),c(W)))|achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(s(W)))).
% 2.01/2.19 0 [] -achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(s(W))))|achievable(west(m(s(X)),c(s(Y))),boatonwest,east(m(Z),c(W))).
% 2.01/2.19 0 [] achievable(west(m(s(X)),c(s(s(X)))),Y,east(Z,W)).
% 2.01/2.19 0 [] achievable(west(m(s(X)),c(s(s(s(X))))),Y,east(Z,W)).
% 2.01/2.19 0 [] achievable(west(X,Y),Z,east(m(s(W)),c(s(s(W))))).
% 2.01/2.19 0 [] achievable(west(X,Y),Z,east(m(s(W)),c(s(s(s(W)))))).
% 2.01/2.19 0 [] achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))).
% 2.01/2.19 0 [] -achievable(west(m(n0),c(n0)),X,east(m(s(s(s(n0)))),c(s(s(s(n0)))))).
% 2.01/2.19 end_of_list.
% 2.01/2.19
% 2.01/2.19 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 2.01/2.19
% 2.01/2.19 This is a Horn set without equality. The strategy will
% 2.01/2.19 be hyperresolution, with satellites in sos and nuclei
% 2.01/2.19 in usable.
% 2.01/2.19
% 2.01/2.19 dependent: set(hyper_res).
% 2.01/2.19 dependent: clear(order_hyper).
% 2.01/2.19
% 2.01/2.19 ------------> process usable:
% 2.01/2.19 ** KEPT (pick-wt=26): 1 [] -achievable(west(m(A),c(s(B))),boatonwest,east(m(C),c(D)))|achievable(west(m(A),c(B)),boatoneast,east(m(C),c(s(D)))).
% 2.01/2.19 ** KEPT (pick-wt=26): 2 [] -achievable(west(m(A),c(B)),boatoneast,east(m(C),c(s(D))))|achievable(west(m(A),c(s(B))),boatonwest,east(m(C),c(D))).
% 2.01/2.19 ** KEPT (pick-wt=28): 3 [] -achievable(west(m(A),c(s(s(B)))),boatonwest,east(m(C),c(D)))|achievable(west(m(A),c(B)),boatoneast,east(m(C),c(s(s(D))))).
% 2.01/2.19 ** KEPT (pick-wt=28): 4 [] -achievable(west(m(A),c(B)),boatoneast,east(m(C),c(s(s(D)))))|achievable(west(m(A),c(s(s(B)))),boatonwest,east(m(C),c(D))).
% 2.01/2.19 ** KEPT (pick-wt=26): 5 [] -achievable(west(m(s(A)),c(B)),boatonwest,east(m(C),c(D)))|achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(D))).
% 2.01/2.19 ** KEPT (pick-wt=26): 6 [] -achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(D)))|achievable(west(m(s(A)),c(B)),boatonwest,east(m(C),c(D))).
% 2.01/2.19 ** KEPT (pick-wt=28): 7 [] -achievable(west(m(s(s(A))),c(B)),boatonwest,east(m(C),c(D)))|achievable(west(m(A),c(B)),boatoneast,east(m(s(s(C))),c(D))).
% 2.01/2.19 ** KEPT (pick-wt=28): 8 [] -achievable(west(m(A),c(B)),boatoneast,east(m(s(s(C))),c(D)))|achievable(west(m(s(s(A))),c(B)),boatonwest,east(m(C),c(D))).
% 2.01/2.19 ** KEPT (pick-wt=28): 9 [] -achievable(west(m(s(A)),c(s(B))),boatonwest,east(m(C),c(D)))|achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(s(D)))).
% 2.01/2.19 ** KEPT (pick-wt=28): 10 [] -achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(s(D))))|achievable(west(m(s(A)),c(s(B))),boatonwest,east(m(C),c(D))).
% 2.01/2.19 ** KEPT (pick-wt=18): 11 [] -achievable(west(m(n0),c(n0)),A,east(m(s(s(s(n0)))),c(s(s(s(n0)))))).
% 2.01/2.19
% 2.01/2.19 ------------> process sos:
% 2.01/2.19 ** KEPT (pick-wt=13): 12 [] achievable(west(m(s(A)),c(s(s(A)))),B,east(C,D)).
% 2.01/2.19 ** KEPT (pick-wt=14): 13 [] achievable(west(m(s(A)),c(s(s(s(A))))),B,east(C,D)).
% 2.01/2.19 ** KEPT (pick-wt=13): 14 [] achievable(west(A,B),C,east(m(s(D)),c(s(s(D))))).
% 2.01/2.19 ** KEPT (pick-wt=14): 15 [] achievable(west(A,B),C,east(m(s(D)),c(s(s(s(D)))))).
% 2.01/2.19 ** KEPT (pick-wt=18): 16 [] achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))).
% 2.01/2.19
% 2.01/2.19 ======= end of input processing =======
% 2.01/2.19
% 2.01/2.19 =========== start of search ===========
% 2.01/2.19
% 2.01/2.19 -------- PROOF --------
% 2.01/2.19
% 2.01/2.19 ----> UNIT CONFLICT at 0.00 sec ----> 30 [binary,29.1,11.1] $F.
% 2.01/2.19
% 2.01/2.19 Length of proof is 1. Level of proof is 1.
% 2.01/2.19
% 2.01/2.19 ---------------- PROOF ----------------
% 2.01/2.19 % SZS status Unsatisfiable
% 2.01/2.19 % SZS output start Refutation
% See solution above
% 2.01/2.19 ------------ end of proof -------------
% 2.01/2.19
% 2.01/2.19
% 2.01/2.19 Search stopped by max_proofs option.
% 2.01/2.19
% 2.01/2.19
% 2.01/2.19 Search stopped by max_proofs option.
% 2.01/2.19
% 2.01/2.19 ============ end of search ============
% 2.01/2.19
% 2.01/2.19 -------------- statistics -------------
% 2.01/2.19 clauses given 2
% 2.01/2.19 clauses generated 16
% 2.01/2.19 clauses kept 29
% 2.01/2.19 clauses forward subsumed 3
% 2.01/2.19 clauses back subsumed 1
% 2.01/2.19 Kbytes malloced 976
% 2.01/2.19
% 2.01/2.19 ----------- times (seconds) -----------
% 2.01/2.19 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.01/2.19 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.01/2.19 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.01/2.19
% 2.01/2.19 That finishes the proof of the theorem.
% 2.01/2.19
% 2.01/2.19 Process 9888 finished Wed Jul 27 01:49:40 2022
% 2.01/2.19 Otter interrupted
% 2.01/2.19 PROOF FOUND
%------------------------------------------------------------------------------