TSTP Solution File: PUZ031+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ031+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:25 EDT 2022
% Result : Theorem 2.01s 2.18s
% Output : Refutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of clauses : 37 ( 19 unt; 5 nHn; 37 RR)
% Number of literals : 74 ( 0 equ; 35 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ wolf(A)
| animal(A) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ fox(A)
| animal(A) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ bird(A)
| animal(A) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ snail(A)
| animal(A) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ grain(A)
| plant(A) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ animal(A)
| ~ plant(B)
| eats(A,B)
| ~ animal(C)
| ~ much_smaller(C,A)
| ~ plant(D)
| ~ eats(C,D)
| eats(A,C) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ bird(A)
| ~ snail(B)
| much_smaller(B,A) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ bird(A)
| ~ fox(B)
| much_smaller(A,B) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ fox(A)
| ~ wolf(B)
| much_smaller(A,B) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ wolf(A)
| ~ grain(B)
| ~ eats(A,B) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ bird(A)
| ~ snail(B)
| ~ eats(A,B) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ snail(A)
| plant(dollar_f1(A)) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ snail(A)
| eats(A,dollar_f1(A)) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ animal(A)
| ~ animal(B)
| ~ grain(C)
| ~ eats(B,C)
| ~ eats(A,B) ),
file('PUZ031+1.p',unknown),
[] ).
cnf(22,plain,
( ~ animal(A)
| ~ plant(B)
| eats(A,B)
| ~ animal(C)
| ~ much_smaller(C,A)
| ~ eats(C,B)
| eats(A,C) ),
inference(factor,[status(thm)],[7]),
[iquote('factor,7.2.6')] ).
cnf(28,axiom,
wolf(dollar_c1),
file('PUZ031+1.p',unknown),
[] ).
cnf(29,axiom,
fox(dollar_c2),
file('PUZ031+1.p',unknown),
[] ).
cnf(30,axiom,
bird(dollar_c3),
file('PUZ031+1.p',unknown),
[] ).
cnf(32,axiom,
snail(dollar_c5),
file('PUZ031+1.p',unknown),
[] ).
cnf(33,axiom,
grain(dollar_c6),
file('PUZ031+1.p',unknown),
[] ).
cnf(34,plain,
animal(dollar_c1),
inference(hyper,[status(thm)],[28,1]),
[iquote('hyper,28,1')] ).
cnf(35,plain,
much_smaller(dollar_c2,dollar_c1),
inference(hyper,[status(thm)],[29,11,28]),
[iquote('hyper,29,11,28')] ).
cnf(36,plain,
animal(dollar_c2),
inference(hyper,[status(thm)],[29,2]),
[iquote('hyper,29,2')] ).
cnf(37,plain,
much_smaller(dollar_c3,dollar_c2),
inference(hyper,[status(thm)],[30,10,29]),
[iquote('hyper,30,10,29')] ).
cnf(38,plain,
animal(dollar_c3),
inference(hyper,[status(thm)],[30,3]),
[iquote('hyper,30,3')] ).
cnf(44,plain,
eats(dollar_c5,dollar_f1(dollar_c5)),
inference(hyper,[status(thm)],[32,19]),
[iquote('hyper,32,19')] ).
cnf(45,plain,
plant(dollar_f1(dollar_c5)),
inference(hyper,[status(thm)],[32,18]),
[iquote('hyper,32,18')] ).
cnf(46,plain,
much_smaller(dollar_c5,dollar_c3),
inference(hyper,[status(thm)],[32,8,30]),
[iquote('hyper,32,8,30')] ).
cnf(47,plain,
animal(dollar_c5),
inference(hyper,[status(thm)],[32,5]),
[iquote('hyper,32,5')] ).
cnf(48,plain,
plant(dollar_c6),
inference(hyper,[status(thm)],[33,6]),
[iquote('hyper,33,6')] ).
cnf(50,plain,
( eats(dollar_c3,dollar_c6)
| eats(dollar_c3,dollar_c5) ),
inference(hyper,[status(thm)],[44,7,38,48,47,46,45]),
[iquote('hyper,44,7,38,48,47,46,45')] ).
cnf(55,plain,
eats(dollar_c3,dollar_c6),
inference(hyper,[status(thm)],[50,15,30,32]),
[iquote('hyper,50,15,30,32')] ).
cnf(56,plain,
( eats(dollar_c2,dollar_c6)
| eats(dollar_c2,dollar_c3) ),
inference(hyper,[status(thm)],[55,22,36,48,38,37]),
[iquote('hyper,55,22,36,48,38,37')] ).
cnf(62,plain,
eats(dollar_c2,dollar_c6),
inference(hyper,[status(thm)],[56,20,36,38,33,55]),
[iquote('hyper,56,20,36,38,33,55')] ).
cnf(63,plain,
( eats(dollar_c1,dollar_c6)
| eats(dollar_c1,dollar_c2) ),
inference(hyper,[status(thm)],[62,22,34,48,36,35]),
[iquote('hyper,62,22,34,48,36,35')] ).
cnf(67,plain,
eats(dollar_c1,dollar_c2),
inference(hyper,[status(thm)],[63,13,28,33]),
[iquote('hyper,63,13,28,33')] ).
cnf(69,plain,
$false,
inference(hyper,[status(thm)],[67,20,34,36,33,62]),
[iquote('hyper,67,20,34,36,33,62')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ031+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 01:47:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.01/2.18 ----- Otter 3.3f, August 2004 -----
% 2.01/2.18 The process was started by sandbox2 on n006.cluster.edu,
% 2.01/2.18 Wed Jul 27 01:47:02 2022
% 2.01/2.18 The command was "./otter". The process ID is 18131.
% 2.01/2.18
% 2.01/2.18 set(prolog_style_variables).
% 2.01/2.18 set(auto).
% 2.01/2.18 dependent: set(auto1).
% 2.01/2.18 dependent: set(process_input).
% 2.01/2.18 dependent: clear(print_kept).
% 2.01/2.18 dependent: clear(print_new_demod).
% 2.01/2.18 dependent: clear(print_back_demod).
% 2.01/2.18 dependent: clear(print_back_sub).
% 2.01/2.18 dependent: set(control_memory).
% 2.01/2.18 dependent: assign(max_mem, 12000).
% 2.01/2.18 dependent: assign(pick_given_ratio, 4).
% 2.01/2.18 dependent: assign(stats_level, 1).
% 2.01/2.18 dependent: assign(max_seconds, 10800).
% 2.01/2.18 clear(print_given).
% 2.01/2.18
% 2.01/2.18 formula_list(usable).
% 2.01/2.18 all X (wolf(X)->animal(X)).
% 2.01/2.18 exists X1 wolf(X1).
% 2.01/2.18 all X (fox(X)->animal(X)).
% 2.01/2.18 exists X1 fox(X1).
% 2.01/2.18 all X (bird(X)->animal(X)).
% 2.01/2.18 exists X1 bird(X1).
% 2.01/2.18 all X (caterpillar(X)->animal(X)).
% 2.01/2.18 exists X1 caterpillar(X1).
% 2.01/2.18 all X (snail(X)->animal(X)).
% 2.01/2.18 exists X1 snail(X1).
% 2.01/2.18 exists X grain(X).
% 2.01/2.18 all X1 (grain(X1)->plant(X1)).
% 2.01/2.18 all X (animal(X)-> (all Y (plant(Y)->eats(X,Y)))| (all Y1 (animal(Y1)&much_smaller(Y1,X)& (exists Z (plant(Z)&eats(Y1,Z)))->eats(X,Y1)))).
% 2.01/2.18 all X Y (bird(Y)& (snail(X)|caterpillar(X))->much_smaller(X,Y)).
% 2.01/2.18 all X Y (bird(X)&fox(Y)->much_smaller(X,Y)).
% 2.01/2.18 all X Y (fox(X)&wolf(Y)->much_smaller(X,Y)).
% 2.01/2.18 all X Y (wolf(X)& (fox(Y)|grain(Y))-> -eats(X,Y)).
% 2.01/2.18 all X Y (bird(X)&caterpillar(Y)->eats(X,Y)).
% 2.01/2.18 all X Y (bird(X)&snail(Y)-> -eats(X,Y)).
% 2.01/2.18 all X (caterpillar(X)|snail(X)-> (exists Y (plant(Y)&eats(X,Y)))).
% 2.01/2.18 -(exists X Y (animal(X)&animal(Y)& (exists Z (grain(Z)&eats(Y,Z)&eats(X,Y))))).
% 2.01/2.18 end_of_list.
% 2.01/2.18
% 2.01/2.18 -------> usable clausifies to:
% 2.01/2.18
% 2.01/2.18 list(usable).
% 2.01/2.18 0 [] -wolf(X)|animal(X).
% 2.01/2.18 0 [] wolf($c1).
% 2.01/2.18 0 [] -fox(X)|animal(X).
% 2.01/2.18 0 [] fox($c2).
% 2.01/2.18 0 [] -bird(X)|animal(X).
% 2.01/2.18 0 [] bird($c3).
% 2.01/2.18 0 [] -caterpillar(X)|animal(X).
% 2.01/2.18 0 [] caterpillar($c4).
% 2.01/2.18 0 [] -snail(X)|animal(X).
% 2.01/2.18 0 [] snail($c5).
% 2.01/2.18 0 [] grain($c6).
% 2.01/2.18 0 [] -grain(X1)|plant(X1).
% 2.01/2.18 0 [] -animal(X)| -plant(Y)|eats(X,Y)| -animal(Y1)| -much_smaller(Y1,X)| -plant(Z)| -eats(Y1,Z)|eats(X,Y1).
% 2.01/2.18 0 [] -bird(Y)| -snail(X)|much_smaller(X,Y).
% 2.01/2.18 0 [] -bird(Y)| -caterpillar(X)|much_smaller(X,Y).
% 2.01/2.18 0 [] -bird(X)| -fox(Y)|much_smaller(X,Y).
% 2.01/2.18 0 [] -fox(X)| -wolf(Y)|much_smaller(X,Y).
% 2.01/2.18 0 [] -wolf(X)| -fox(Y)| -eats(X,Y).
% 2.01/2.18 0 [] -wolf(X)| -grain(Y)| -eats(X,Y).
% 2.01/2.18 0 [] -bird(X)| -caterpillar(Y)|eats(X,Y).
% 2.01/2.18 0 [] -bird(X)| -snail(Y)| -eats(X,Y).
% 2.01/2.18 0 [] -caterpillar(X)|plant($f1(X)).
% 2.01/2.18 0 [] -caterpillar(X)|eats(X,$f1(X)).
% 2.01/2.18 0 [] -snail(X)|plant($f1(X)).
% 2.01/2.18 0 [] -snail(X)|eats(X,$f1(X)).
% 2.01/2.18 0 [] -animal(X)| -animal(Y)| -grain(Z)| -eats(Y,Z)| -eats(X,Y).
% 2.01/2.18 end_of_list.
% 2.01/2.18
% 2.01/2.18 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=8.
% 2.01/2.18
% 2.01/2.18 This is a non-Horn set without equality. The strategy will
% 2.01/2.18 be ordered hyper_res, unit deletion, and factoring, with
% 2.01/2.18 satellites in sos and with nuclei in usable.
% 2.01/2.18
% 2.01/2.18 dependent: set(hyper_res).
% 2.01/2.18 dependent: set(factor).
% 2.01/2.18 dependent: set(unit_deletion).
% 2.01/2.18
% 2.01/2.18 ------------> process usable:
% 2.01/2.18 ** KEPT (pick-wt=4): 1 [] -wolf(A)|animal(A).
% 2.01/2.18 ** KEPT (pick-wt=4): 2 [] -fox(A)|animal(A).
% 2.01/2.18 ** KEPT (pick-wt=4): 3 [] -bird(A)|animal(A).
% 2.01/2.18 ** KEPT (pick-wt=4): 4 [] -caterpillar(A)|animal(A).
% 2.01/2.18 ** KEPT (pick-wt=4): 5 [] -snail(A)|animal(A).
% 2.01/2.18 ** KEPT (pick-wt=4): 6 [] -grain(A)|plant(A).
% 2.01/2.18 ** KEPT (pick-wt=20): 7 [] -animal(A)| -plant(B)|eats(A,B)| -animal(C)| -much_smaller(C,A)| -plant(D)| -eats(C,D)|eats(A,C).
% 2.01/2.18 ** KEPT (pick-wt=7): 8 [] -bird(A)| -snail(B)|much_smaller(B,A).
% 2.01/2.18 ** KEPT (pick-wt=7): 9 [] -bird(A)| -caterpillar(B)|much_smaller(B,A).
% 2.01/2.18 ** KEPT (pick-wt=7): 10 [] -bird(A)| -fox(B)|much_smaller(A,B).
% 2.01/2.18 ** KEPT (pick-wt=7): 11 [] -fox(A)| -wolf(B)|much_smaller(A,B).
% 2.01/2.18 ** KEPT (pick-wt=7): 12 [] -wolf(A)| -fox(B)| -eats(A,B).
% 2.01/2.18 ** KEPT (pick-wt=7): 13 [] -wolf(A)| -grain(B)| -eats(A,B).
% 2.01/2.18 ** KEPT (pick-wt=7): 14 [] -bird(A)| -caterpillar(B)|eats(A,B).
% 2.01/2.18 ** KEPT (pick-wt=7): 15 [] -bird(A)| -snail(B)| -eats(A,B).
% 2.01/2.18 ** KEPT (pick-wt=5): 16 [] -caterpillar(A)|plant($f1(A)).
% 2.01/2.18 ** KEPT (pick-wt=6): 17 [] -caterpillar(A)|eats(A,$f1(A)).
% 2.01/2.18 ** KEPT (pick-wt=5): 18 [] -snail(A)|plant($f1(A)).
% 2.01/2.18 ** KEPT (pick-wt=6): 19 [] -snail(A)|eats(A,$f1(A)).
% 2.01/2.18 ** KEPT (pick-wt=12): 20 [] -animal(A)| -animal(B)| -grain(C)| -eats(B,C)| -eats(A,B).
% 2.01/2.18
% 2.01/2.18 ------------> process sos:
% 2.01/2.18 ** KEPT (pick-wt=2): 28 [] wolf($c1).
% 2.01/2.18 ** KEPT (pick-wt=2): 29 [] fox($c2).
% 2.01/2.18 ** KEPT (pick-wt=2): 30 [] bird($c3).
% 2.01/2.18 ** KEPT (pick-wt=2): 31 [] caterpillar($c4).
% 2.01/2.18 ** KEPT (pick-wt=2): 32 [] snail($c5).
% 2.01/2.18 ** KEPT (pick-wt=2): 33 [] grain($c6).
% 2.01/2.18
% 2.01/2.18 ======= end of input processing =======
% 2.01/2.18
% 2.01/2.18 =========== start of search ===========
% 2.01/2.18
% 2.01/2.18 -------- PROOF --------
% 2.01/2.18
% 2.01/2.18 -----> EMPTY CLAUSE at 0.01 sec ----> 69 [hyper,67,20,34,36,33,62] $F.
% 2.01/2.18
% 2.01/2.18 Length of proof is 17. Level of proof is 7.
% 2.01/2.18
% 2.01/2.18 ---------------- PROOF ----------------
% 2.01/2.18 % SZS status Theorem
% 2.01/2.18 % SZS output start Refutation
% See solution above
% 2.01/2.18 ------------ end of proof -------------
% 2.01/2.18
% 2.01/2.18
% 2.01/2.18 Search stopped by max_proofs option.
% 2.01/2.18
% 2.01/2.18
% 2.01/2.18 Search stopped by max_proofs option.
% 2.01/2.18
% 2.01/2.18 ============ end of search ============
% 2.01/2.18
% 2.01/2.18 -------------- statistics -------------
% 2.01/2.18 clauses given 29
% 2.01/2.18 clauses generated 68
% 2.01/2.18 clauses kept 68
% 2.01/2.18 clauses forward subsumed 21
% 2.01/2.18 clauses back subsumed 12
% 2.01/2.18 Kbytes malloced 976
% 2.01/2.18
% 2.01/2.18 ----------- times (seconds) -----------
% 2.01/2.18 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.01/2.18 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.01/2.18 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.01/2.18
% 2.01/2.18 That finishes the proof of the theorem.
% 2.01/2.18
% 2.01/2.18 Process 18131 finished Wed Jul 27 01:47:03 2022
% 2.01/2.18 Otter interrupted
% 2.01/2.18 PROOF FOUND
%------------------------------------------------------------------------------