TSTP Solution File: PUZ061+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:29 EDT 2022
% Result : Theorem 1.64s 1.83s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 14 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 6 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ food(A)
| likes(dollar_c5,A) ),
file('PUZ061+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ eats(A,B)
| ~ not_killed_by(A,B)
| food(B) ),
file('PUZ061+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ alive(A)
| not_killed_by(A,B) ),
file('PUZ061+1.p',unknown),
[] ).
cnf(6,axiom,
~ likes(dollar_c5,dollar_c6),
file('PUZ061+1.p',unknown),
[] ).
cnf(9,axiom,
eats(dollar_c4,dollar_c6),
file('PUZ061+1.p',unknown),
[] ).
cnf(10,axiom,
alive(dollar_c4),
file('PUZ061+1.p',unknown),
[] ).
cnf(13,plain,
not_killed_by(dollar_c4,A),
inference(hyper,[status(thm)],[10,5]),
[iquote('hyper,10,5')] ).
cnf(15,plain,
food(dollar_c6),
inference(hyper,[status(thm)],[13,3,9]),
[iquote('hyper,13,3,9')] ).
cnf(16,plain,
likes(dollar_c5,dollar_c6),
inference(hyper,[status(thm)],[15,2]),
[iquote('hyper,15,2')] ).
cnf(17,plain,
$false,
inference(binary,[status(thm)],[16,6]),
[iquote('binary,16.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n016.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 02:08:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.64/1.83 ----- Otter 3.3f, August 2004 -----
% 1.64/1.83 The process was started by sandbox on n016.cluster.edu,
% 1.64/1.83 Wed Jul 27 02:08:52 2022
% 1.64/1.83 The command was "./otter". The process ID is 16906.
% 1.64/1.83
% 1.64/1.83 set(prolog_style_variables).
% 1.64/1.83 set(auto).
% 1.64/1.83 dependent: set(auto1).
% 1.64/1.83 dependent: set(process_input).
% 1.64/1.83 dependent: clear(print_kept).
% 1.64/1.83 dependent: clear(print_new_demod).
% 1.64/1.83 dependent: clear(print_back_demod).
% 1.64/1.83 dependent: clear(print_back_sub).
% 1.64/1.83 dependent: set(control_memory).
% 1.64/1.83 dependent: assign(max_mem, 12000).
% 1.64/1.83 dependent: assign(pick_given_ratio, 4).
% 1.64/1.83 dependent: assign(stats_level, 1).
% 1.64/1.83 dependent: assign(max_seconds, 10800).
% 1.64/1.83 clear(print_given).
% 1.64/1.83
% 1.64/1.83 formula_list(usable).
% 1.64/1.83 -(all Peanuts John Bill Sue Apples Chicken ((all X Y (alive(Y)&eats(Y,Chicken)->likes(Y,X)))& (all X (food(X)->likes(John,X)))&food(Apples)&food(Chicken)& (all X ((exists Y (eats(Y,X)¬_killed_by(Y,X)))->food(X)))&eats(Bill,Peanuts)&alive(Bill)& (all X (eats(Bill,X)->eats(Sue,X)))& (all Y (alive(Y)-> (all X not_killed_by(Y,X))))->likes(John,Peanuts))).
% 1.64/1.83 end_of_list.
% 1.64/1.83
% 1.64/1.83 -------> usable clausifies to:
% 1.64/1.83
% 1.64/1.83 list(usable).
% 1.64/1.83 0 [] -alive(Y)| -eats(Y,$c1)|likes(Y,X).
% 1.64/1.83 0 [] -food(X1)|likes($c5,X1).
% 1.64/1.83 0 [] food($c2).
% 1.64/1.83 0 [] food($c1).
% 1.64/1.83 0 [] -eats(X3,X2)| -not_killed_by(X3,X2)|food(X2).
% 1.64/1.83 0 [] eats($c4,$c6).
% 1.64/1.83 0 [] alive($c4).
% 1.64/1.83 0 [] -eats($c4,X4)|eats($c3,X4).
% 1.64/1.83 0 [] -alive(X5)|not_killed_by(X5,X6).
% 1.64/1.83 0 [] -likes($c5,$c6).
% 1.64/1.83 end_of_list.
% 1.64/1.83
% 1.64/1.83 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.64/1.83
% 1.64/1.83 This is a Horn set without equality. The strategy will
% 1.64/1.83 be hyperresolution, with satellites in sos and nuclei
% 1.64/1.83 in usable.
% 1.64/1.83
% 1.64/1.83 dependent: set(hyper_res).
% 1.64/1.83 dependent: clear(order_hyper).
% 1.64/1.83
% 1.64/1.83 ------------> process usable:
% 1.64/1.83 ** KEPT (pick-wt=8): 1 [] -alive(A)| -eats(A,$c1)|likes(A,B).
% 1.64/1.83 ** KEPT (pick-wt=5): 2 [] -food(A)|likes($c5,A).
% 1.64/1.83 ** KEPT (pick-wt=8): 3 [] -eats(A,B)| -not_killed_by(A,B)|food(B).
% 1.64/1.83 ** KEPT (pick-wt=6): 4 [] -eats($c4,A)|eats($c3,A).
% 1.64/1.83 ** KEPT (pick-wt=5): 5 [] -alive(A)|not_killed_by(A,B).
% 1.64/1.83 ** KEPT (pick-wt=3): 6 [] -likes($c5,$c6).
% 1.64/1.83
% 1.64/1.83 ------------> process sos:
% 1.64/1.83 ** KEPT (pick-wt=2): 7 [] food($c2).
% 1.64/1.83 ** KEPT (pick-wt=2): 8 [] food($c1).
% 1.64/1.83 ** KEPT (pick-wt=3): 9 [] eats($c4,$c6).
% 1.64/1.83 ** KEPT (pick-wt=2): 10 [] alive($c4).
% 1.64/1.83
% 1.64/1.83 ======= end of input processing =======
% 1.64/1.83
% 1.64/1.83 =========== start of search ===========
% 1.64/1.83
% 1.64/1.83 -------- PROOF --------
% 1.64/1.83
% 1.64/1.83 ----> UNIT CONFLICT at 0.00 sec ----> 17 [binary,16.1,6.1] $F.
% 1.64/1.83
% 1.64/1.83 Length of proof is 3. Level of proof is 3.
% 1.64/1.83
% 1.64/1.83 ---------------- PROOF ----------------
% 1.64/1.83 % SZS status Theorem
% 1.64/1.83 % SZS output start Refutation
% See solution above
% 1.64/1.83 ------------ end of proof -------------
% 1.64/1.83
% 1.64/1.83
% 1.64/1.83 Search stopped by max_proofs option.
% 1.64/1.83
% 1.64/1.83
% 1.64/1.83 Search stopped by max_proofs option.
% 1.64/1.83
% 1.64/1.83 ============ end of search ============
% 1.64/1.83
% 1.64/1.83 -------------- statistics -------------
% 1.64/1.83 clauses given 8
% 1.64/1.83 clauses generated 6
% 1.64/1.83 clauses kept 16
% 1.64/1.83 clauses forward subsumed 0
% 1.64/1.83 clauses back subsumed 0
% 1.64/1.83 Kbytes malloced 976
% 1.64/1.83
% 1.64/1.83 ----------- times (seconds) -----------
% 1.64/1.83 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.83 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.83 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.64/1.83
% 1.64/1.83 That finishes the proof of the theorem.
% 1.64/1.83
% 1.64/1.83 Process 16906 finished Wed Jul 27 02:08:53 2022
% 1.64/1.83 Otter interrupted
% 1.64/1.83 PROOF FOUND
%------------------------------------------------------------------------------