TSTP Solution File: PUZ047+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ047+1 : TPTP v8.1.0. Released v2.5.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 13:11:28 EDT 2022
% Result : Theorem 1.94s 2.11s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 22 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-5 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 11 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ p(north,north,south,north,A)
| p(south,north,south,north,go_alone(A)) ),
file('PUZ047+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ p(north,south,north,south,A)
| p(south,south,north,south,go_alone(A)) ),
file('PUZ047+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ p(south,south,south,north,A)
| p(north,north,south,north,take_wolf(A)) ),
file('PUZ047+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ p(south,A,south,B,C)
| p(north,A,north,B,take_goat(C)) ),
file('PUZ047+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ p(north,A,north,B,C)
| p(south,A,south,B,take_goat(C)) ),
file('PUZ047+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ p(south,south,north,south,A)
| p(north,south,north,north,take_cabbage(A)) ),
file('PUZ047+1.p',unknown),
[] ).
cnf(15,axiom,
~ p(north,north,north,north,A),
file('PUZ047+1.p',unknown),
[] ).
cnf(16,axiom,
p(south,south,south,south,start),
file('PUZ047+1.p',unknown),
[] ).
cnf(17,plain,
p(north,south,north,south,take_goat(start)),
inference(hyper,[status(thm)],[16,9]),
[iquote('hyper,16,9')] ).
cnf(19,plain,
p(south,south,north,south,go_alone(take_goat(start))),
inference(hyper,[status(thm)],[17,4]),
[iquote('hyper,17,4')] ).
cnf(21,plain,
p(north,south,north,north,take_cabbage(go_alone(take_goat(start)))),
inference(hyper,[status(thm)],[19,13]),
[iquote('hyper,19,13')] ).
cnf(27,plain,
p(south,south,south,north,take_goat(take_cabbage(go_alone(take_goat(start))))),
inference(hyper,[status(thm)],[21,10]),
[iquote('hyper,21,10')] ).
cnf(40,plain,
p(north,north,south,north,take_wolf(take_goat(take_cabbage(go_alone(take_goat(start)))))),
inference(hyper,[status(thm)],[27,5]),
[iquote('hyper,27,5')] ).
cnf(68,plain,
p(south,north,south,north,go_alone(take_wolf(take_goat(take_cabbage(go_alone(take_goat(start))))))),
inference(hyper,[status(thm)],[40,2]),
[iquote('hyper,40,2')] ).
cnf(129,plain,
p(north,north,north,north,take_goat(go_alone(take_wolf(take_goat(take_cabbage(go_alone(take_goat(start)))))))),
inference(hyper,[status(thm)],[68,9]),
[iquote('hyper,68,9')] ).
cnf(130,plain,
$false,
inference(binary,[status(thm)],[129,15]),
[iquote('binary,129.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ047+1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/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:09:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.94/2.11 ----- Otter 3.3f, August 2004 -----
% 1.94/2.11 The process was started by sandbox on n023.cluster.edu,
% 1.94/2.11 Wed Jul 27 02:09:03 2022
% 1.94/2.11 The command was "./otter". The process ID is 19024.
% 1.94/2.11
% 1.94/2.11 set(prolog_style_variables).
% 1.94/2.11 set(auto).
% 1.94/2.11 dependent: set(auto1).
% 1.94/2.11 dependent: set(process_input).
% 1.94/2.11 dependent: clear(print_kept).
% 1.94/2.11 dependent: clear(print_new_demod).
% 1.94/2.11 dependent: clear(print_back_demod).
% 1.94/2.11 dependent: clear(print_back_sub).
% 1.94/2.11 dependent: set(control_memory).
% 1.94/2.11 dependent: assign(max_mem, 12000).
% 1.94/2.11 dependent: assign(pick_given_ratio, 4).
% 1.94/2.11 dependent: assign(stats_level, 1).
% 1.94/2.11 dependent: assign(max_seconds, 10800).
% 1.94/2.11 clear(print_given).
% 1.94/2.11
% 1.94/2.11 formula_list(usable).
% 1.94/2.11 -(p(south,south,south,south,start)& (all T (p(south,north,south,north,T)->p(north,north,south,north,go_alone(T))))& (all T1 (p(north,north,south,north,T1)->p(south,north,south,north,go_alone(T1))))& (all T2 (p(south,south,north,south,T2)->p(north,south,north,south,go_alone(T2))))& (all T3 (p(north,south,north,south,T3)->p(south,south,north,south,go_alone(T3))))& (all T4 (p(south,south,south,north,T4)->p(north,north,south,north,take_wolf(T4))))& (all T5 (p(north,north,south,north,T5)->p(south,south,south,north,take_wolf(T5))))& (all T6 (p(south,south,north,south,T6)->p(north,north,north,south,take_wolf(T6))))& (all T7 (p(north,north,north,south,T7)->p(south,south,north,south,take_wolf(T7))))& (all X Y U (p(south,X,south,Y,U)->p(north,X,north,Y,take_goat(U))))& (all X1 Y1 V (p(north,X1,north,Y1,V)->p(south,X1,south,Y1,take_goat(V))))& (all T8 (p(south,north,south,south,T8)->p(north,north,south,north,take_cabbage(T8))))& (all T9 (p(north,north,south,north,T9)->p(south,north,south,south,take_cabbage(T9))))& (all U1 (p(south,south,north,south,U1)->p(north,south,north,north,take_cabbage(U1))))& (all V1 (p(north,south,north,north,V1)->p(south,south,north,south,take_cabbage(V1))))-> (exists Z p(north,north,north,north,Z))).
% 1.94/2.11 end_of_list.
% 1.94/2.11
% 1.94/2.11 -------> usable clausifies to:
% 1.94/2.11
% 1.94/2.11 list(usable).
% 1.94/2.11 0 [] p(south,south,south,south,start).
% 1.94/2.11 0 [] -p(south,north,south,north,T)|p(north,north,south,north,go_alone(T)).
% 1.94/2.11 0 [] -p(north,north,south,north,T1)|p(south,north,south,north,go_alone(T1)).
% 1.94/2.11 0 [] -p(south,south,north,south,T2)|p(north,south,north,south,go_alone(T2)).
% 1.94/2.11 0 [] -p(north,south,north,south,T3)|p(south,south,north,south,go_alone(T3)).
% 1.94/2.11 0 [] -p(south,south,south,north,T4)|p(north,north,south,north,take_wolf(T4)).
% 1.94/2.11 0 [] -p(north,north,south,north,T5)|p(south,south,south,north,take_wolf(T5)).
% 1.94/2.11 0 [] -p(south,south,north,south,T6)|p(north,north,north,south,take_wolf(T6)).
% 1.94/2.11 0 [] -p(north,north,north,south,T7)|p(south,south,north,south,take_wolf(T7)).
% 1.94/2.11 0 [] -p(south,X,south,Y,U)|p(north,X,north,Y,take_goat(U)).
% 1.94/2.11 0 [] -p(north,X1,north,Y1,V)|p(south,X1,south,Y1,take_goat(V)).
% 1.94/2.11 0 [] -p(south,north,south,south,T8)|p(north,north,south,north,take_cabbage(T8)).
% 1.94/2.11 0 [] -p(north,north,south,north,T9)|p(south,north,south,south,take_cabbage(T9)).
% 1.94/2.11 0 [] -p(south,south,north,south,U1)|p(north,south,north,north,take_cabbage(U1)).
% 1.94/2.11 0 [] -p(north,south,north,north,V1)|p(south,south,north,south,take_cabbage(V1)).
% 1.94/2.11 0 [] -p(north,north,north,north,Z).
% 1.94/2.11 end_of_list.
% 1.94/2.11
% 1.94/2.11 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.94/2.11
% 1.94/2.11 This is a Horn set without equality. The strategy will
% 1.94/2.11 be hyperresolution, with satellites in sos and nuclei
% 1.94/2.11 in usable.
% 1.94/2.11
% 1.94/2.11 dependent: set(hyper_res).
% 1.94/2.11 dependent: clear(order_hyper).
% 1.94/2.11
% 1.94/2.11 ------------> process usable:
% 1.94/2.11 ** KEPT (pick-wt=13): 1 [] -p(south,north,south,north,A)|p(north,north,south,north,go_alone(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 2 [] -p(north,north,south,north,A)|p(south,north,south,north,go_alone(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 3 [] -p(south,south,north,south,A)|p(north,south,north,south,go_alone(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 4 [] -p(north,south,north,south,A)|p(south,south,north,south,go_alone(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 5 [] -p(south,south,south,north,A)|p(north,north,south,north,take_wolf(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 6 [] -p(north,north,south,north,A)|p(south,south,south,north,take_wolf(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 7 [] -p(south,south,north,south,A)|p(north,north,north,south,take_wolf(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 8 [] -p(north,north,north,south,A)|p(south,south,north,south,take_wolf(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 9 [] -p(south,A,south,B,C)|p(north,A,north,B,take_goat(C)).
% 1.94/2.11 ** KEPT (pick-wt=13): 10 [] -p(north,A,north,B,C)|p(south,A,south,B,take_goat(C)).
% 1.94/2.11 ** KEPT (pick-wt=13): 11 [] -p(south,north,south,south,A)|p(north,north,south,north,take_cabbage(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 12 [] -p(north,north,south,north,A)|p(south,north,south,south,take_cabbage(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 13 [] -p(south,south,north,south,A)|p(north,south,north,north,take_cabbage(A)).
% 1.94/2.11 ** KEPT (pick-wt=13): 14 [] -p(north,south,north,north,A)|p(south,south,north,south,take_cabbage(A)).
% 1.94/2.11 ** KEPT (pick-wt=6): 15 [] -p(north,north,north,north,A).
% 1.94/2.11
% 1.94/2.11 ------------> process sos:
% 1.94/2.11 ** KEPT (pick-wt=6): 16 [] p(south,south,south,south,start).
% 1.94/2.11
% 1.94/2.11 ======= end of input processing =======
% 1.94/2.11
% 1.94/2.11 =========== start of search ===========
% 1.94/2.11
% 1.94/2.11 -------- PROOF --------
% 1.94/2.11
% 1.94/2.11 ----> UNIT CONFLICT at 0.00 sec ----> 130 [binary,129.1,15.1] $F.
% 1.94/2.11
% 1.94/2.11 Length of proof is 7. Level of proof is 7.
% 1.94/2.11
% 1.94/2.11 ---------------- PROOF ----------------
% 1.94/2.11 % SZS status Theorem
% 1.94/2.11 % SZS output start Refutation
% See solution above
% 1.94/2.11 ------------ end of proof -------------
% 1.94/2.11
% 1.94/2.11
% 1.94/2.11 Search stopped by max_proofs option.
% 1.94/2.11
% 1.94/2.11
% 1.94/2.11 Search stopped by max_proofs option.
% 1.94/2.11
% 1.94/2.11 ============ end of search ============
% 1.94/2.11
% 1.94/2.11 -------------- statistics -------------
% 1.94/2.11 clauses given 53
% 1.94/2.11 clauses generated 113
% 1.94/2.11 clauses kept 129
% 1.94/2.11 clauses forward subsumed 0
% 1.94/2.11 clauses back subsumed 0
% 1.94/2.11 Kbytes malloced 1953
% 1.94/2.11
% 1.94/2.11 ----------- times (seconds) -----------
% 1.94/2.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.11 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.94/2.11
% 1.94/2.11 That finishes the proof of the theorem.
% 1.94/2.11
% 1.94/2.11 Process 19024 finished Wed Jul 27 02:09:05 2022
% 1.94/2.11 Otter interrupted
% 1.94/2.11 PROOF FOUND
%------------------------------------------------------------------------------