TSTP Solution File: PUZ031+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ031+3 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : 600s
% DateTime : Mon Jul 18 18:23:53 EDT 2022
% Result : Theorem 0.69s 0.99s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ031+3 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n021.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 : 600
% 0.12/0.33 % DateTime : Sat May 28 20:33:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.98 ============================== Prover9 ===============================
% 0.69/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.98 Process 12981 was started by sandbox on n021.cluster.edu,
% 0.69/0.98 Sat May 28 20:33:27 2022
% 0.69/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12828_n021.cluster.edu".
% 0.69/0.98 ============================== end of head ===========================
% 0.69/0.98
% 0.69/0.98 ============================== INPUT =================================
% 0.69/0.98
% 0.69/0.98 % Reading from file /tmp/Prover9_12828_n021.cluster.edu
% 0.69/0.98
% 0.69/0.98 set(prolog_style_variables).
% 0.69/0.98 set(auto2).
% 0.69/0.98 % set(auto2) -> set(auto).
% 0.69/0.98 % set(auto) -> set(auto_inference).
% 0.69/0.98 % set(auto) -> set(auto_setup).
% 0.69/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.98 % set(auto) -> set(auto_limits).
% 0.69/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.98 % set(auto) -> set(auto_denials).
% 0.69/0.98 % set(auto) -> set(auto_process).
% 0.69/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.98 % set(auto2) -> assign(stats, some).
% 0.69/0.98 % set(auto2) -> clear(echo_input).
% 0.69/0.98 % set(auto2) -> set(quiet).
% 0.69/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.98 % set(auto2) -> clear(print_given).
% 0.69/0.98 assign(lrs_ticks,-1).
% 0.69/0.98 assign(sos_limit,10000).
% 0.69/0.98 assign(order,kbo).
% 0.69/0.98 set(lex_order_vars).
% 0.69/0.98 clear(print_given).
% 0.69/0.98
% 0.69/0.98 % formulas(sos). % not echoed (29 formulas)
% 0.69/0.98
% 0.69/0.98 ============================== end of input ==========================
% 0.69/0.98
% 0.69/0.98 % From the command line: assign(max_seconds, 300).
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.98
% 0.69/0.98 % Formulas that are not ordinary clauses:
% 0.69/0.98 1 (exists A edible(A)) # label(edible_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 2 (exists A animal(A)) # label(animal_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 3 (all A (animal(A) -> edible(A))) # label(animal_is_edible) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 4 (exists A wolf(A)) # label(wolf_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 5 (all A (wolf(A) -> animal(A))) # label(wolf_is_animal) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 6 (exists A fox(A)) # label(fox_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 7 (all A (fox(A) -> animal(A))) # label(fox_is_animal) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 8 (exists A bird(A)) # label(bird_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 9 (all A (bird(A) -> animal(A))) # label(bird_is_animal) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 10 (exists A caterpillar(A)) # label(caterpillar_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 11 (all A (caterpillar(A) -> animal(A))) # label(caterpillar_is_animal) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 12 (exists A snail(A)) # label(snail_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 13 (all A (snail(A) -> animal(A))) # label(snail_is_animal) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 14 (exists A plant(A)) # label(plant_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 15 (all A (plant(A) -> edible(A))) # label(plant_is_edible) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 16 (exists A grain(A)) # label(grain_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 17 (all A (grain(A) -> plant(A))) # label(grain_is_plant) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 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)))))) # label(pel47_7) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 19 (all Y all X (bird(Y) & snail(X) -> much_smaller(X,Y))) # label(pel47_8) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 20 (all Y all X (bird(Y) & caterpillar(X) -> much_smaller(X,Y))) # label(pel47_8a) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 21 (all X all Y (bird(X) & fox(Y) -> much_smaller(X,Y))) # label(pel47_9) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 22 (all X all Y (fox(X) & wolf(Y) -> much_smaller(X,Y))) # label(pel47_10) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 23 (all X all Y (wolf(X) & fox(Y) -> -eats(X,Y))) # label(pel47_11) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 24 (all X all Y (wolf(X) & grain(Y) -> -eats(X,Y))) # label(pel47_11a) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 25 (all X all Y (bird(X) & caterpillar(Y) -> eats(X,Y))) # label(pel47_12) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 26 (all X all Y (bird(X) & snail(Y) -> -eats(X,Y))) # label(pel47_13) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 27 (all X (caterpillar(X) -> (exists Y (plant(Y) & eats(X,Y))))) # label(pel47_14) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 28 (all X (snail(X) -> (exists Y (plant(Y) & eats(X,Y))))) # label(pel47_14a) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 29 -(exists X exists Y exists Z (animal(X) & animal(Y) & grain(Z) & eats(Y,Z) & eats(X,Y))) # label(pel47) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/0.99
% 0.69/0.99 ============================== end of process non-clausal formulas ===
% 0.69/0.99
% 0.69/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.99
% 0.69/0.99 ============================== PREDICATE ELIMINATION =================
% 0.69/0.99 30 -wolf(A) | -fox(B) | -eats(A,B) # label(pel47_11) # label(axiom). [clausify(23)].
% 0.69/0.99 31 wolf(c3) # label(wolf_type) # label(axiom). [clausify(4)].
% 0.69/0.99 Derived: -fox(A) | -eats(c3,A). [resolve(30,a,31,a)].
% 0.69/0.99 32 -wolf(A) | -grain(B) | -eats(A,B) # label(pel47_11a) # label(axiom). [clausify(24)].
% 0.69/0.99 Derived: -grain(A) | -eats(c3,A). [resolve(32,a,31,a)].
% 0.69/0.99 33 -wolf(A) | animal(A) # label(wolf_is_animal) # label(axiom). [clausify(5)].
% 0.69/0.99 Derived: animal(c3). [resolve(33,a,31,a)].
% 0.69/0.99 34 -fox(A) | -wolf(B) | much_smaller(A,B) # label(pel47_10) # label(axiom). [clausify(22)].
% 0.69/0.99 Derived: -fox(A) | much_smaller(A,c3). [resolve(34,b,31,a)].
% 0.69/0.99 35 -fox(A) | animal(A) # label(fox_is_animal) # label(axiom). [clausify(7)].
% 0.69/0.99 36 fox(c4) # label(fox_type) # label(axiom). [clausify(6)].
% 0.69/0.99 Derived: animal(c4). [resolve(35,a,36,a)].
% 0.69/0.99 37 -bird(A) | -fox(B) | much_smaller(A,B) # label(pel47_9) # label(axiom). [clausify(21)].
% 0.69/0.99 Derived: -bird(A) | much_smaller(A,c4). [resolve(37,b,36,a)].
% 0.69/0.99 38 -fox(A) | -eats(c3,A). [resolve(30,a,31,a)].
% 0.69/0.99 Derived: -eats(c3,c4). [resolve(38,a,36,a)].
% 0.69/0.99 39 -fox(A) | much_smaller(A,c3). [resolve(34,b,31,a)].
% 0.69/0.99 Derived: much_smaller(c4,c3). [resolve(39,a,36,a)].
% 0.69/0.99 40 -bird(A) | -snail(B) | -eats(A,B) # label(pel47_13) # label(axiom). [clausify(26)].
% 0.69/0.99 41 bird(c5) # label(bird_type) # label(axiom). [clausify(8)].
% 0.69/0.99 Derived: -snail(A) | -eats(c5,A). [resolve(40,a,41,a)].
% 0.69/0.99 42 -bird(A) | animal(A) # label(bird_is_animal) # label(axiom). [clausify(9)].
% 0.69/0.99 Derived: animal(c5). [resolve(42,a,41,a)].
% 0.69/0.99 43 -bird(A) | -snail(B) | much_smaller(B,A) # label(pel47_8) # label(axiom). [clausify(19)].
% 0.69/0.99 Derived: -snail(A) | much_smaller(A,c5). [resolve(43,a,41,a)].
% 0.69/0.99 44 -bird(A) | -caterpillar(B) | much_smaller(B,A) # label(pel47_8a) # label(axiom). [clausify(20)].
% 0.69/0.99 Derived: -caterpillar(A) | much_smaller(A,c5). [resolve(44,a,41,a)].
% 0.69/0.99 45 -bird(A) | -caterpillar(B) | eats(A,B) # label(pel47_12) # label(axiom). [clausify(25)].
% 0.69/0.99 Derived: -caterpillar(A) | eats(c5,A). [resolve(45,a,41,a)].
% 0.69/0.99 46 -bird(A) | much_smaller(A,c4). [resolve(37,b,36,a)].
% 0.69/0.99 Derived: much_smaller(c5,c4). [resolve(46,a,41,a)].
% 0.69/0.99 47 -caterpillar(A) | animal(A) # label(caterpillar_is_animal) # label(axiom). [clausify(11)].
% 0.69/0.99 48 caterpillar(c6) # label(caterpillar_type) # label(axiom). [clausify(10)].
% 0.69/0.99 Derived: animal(c6). [resolve(47,a,48,a)].
% 0.69/0.99 49 -caterpillar(A) | plant(f1(A)) # label(pel47_14) # label(axiom). [clausify(27)].
% 0.69/0.99 Derived: plant(f1(c6)). [resolve(49,a,48,a)].
% 0.69/0.99 50 -caterpillar(A) | eats(A,f1(A)) # label(pel47_14) # label(axiom). [clausify(27)].
% 0.69/0.99 Derived: eats(c6,f1(c6)). [resolve(50,a,48,a)].
% 0.69/0.99 51 -caterpillar(A) | much_smaller(A,c5). [resolve(44,a,41,a)].
% 0.69/0.99 Derived: much_smaller(c6,c5). [resolve(51,a,48,a)].
% 0.69/0.99 52 -caterpillar(A) | eats(c5,A). [resolve(45,a,41,a)].
% 0.69/0.99 Derived: eats(c5,c6). [resolve(52,a,48,a)].
% 0.69/0.99 53 -snail(A) | animal(A) # label(snail_is_animal) # label(axiom). [clausify(13)].
% 0.69/0.99 54 snail(c7) # label(snail_type) # label(axiom). [clausify(12)].
% 0.69/0.99 Derived: animal(c7). [resolve(53,a,54,a)].
% 0.69/0.99 55 -snail(A) | plant(f2(A)) # label(pel47_14a) # label(axiom). [clausify(28)].
% 0.69/0.99 Derived: plant(f2(c7)). [resolve(55,a,54,a)].
% 0.69/0.99 56 -snail(A) | eats(A,f2(A)) # label(pel47_14a) # label(axiom). [clausify(28)].
% 0.69/0.99 Derived: eats(c7,f2(c7)). [resolve(56,a,54,a)].
% 0.69/0.99 57 -snail(A) | -eats(c5,A). [resolve(40,a,41,a)].
% 0.69/0.99 Derived: -eats(c5,c7). [resolve(57,a,54,a)].
% 0.69/0.99 58 -snail(A) | much_smaller(A,c5). [resolve(43,a,41,a)].
% 0.69/0.99 Derived: much_smaller(c7,c5). [resolve(58,a,54,a)].
% 0.69/0.99 59 -animal(A) | -animal(B) | -grain(C) | -eats(B,C) | -eats(A,B) # label(pel47) # label(negated_conjecture). [clausify(29)].
% 0.69/0.99 60 grain(c9) # label(grain_type) # label(axiom). [clausify(16)].
% 0.69/0.99 Derived: -animal(A) | -animal(B) | -eats(B,c9) | -eats(A,B). [resolve(59,c,60,a)].
% 0.69/0.99 61 -grain(A) | plant(A) # label(grain_is_plant) # label(axiom). [clausify(17)].
% 0.69/0.99 Derived: plant(c9). [resolve(61,a,60,a)].
% 0.69/0.99 62 -grain(A) | -eats(c3,A). [resolve(32,a,31,a)].
% 0.69/0.99 Derived: -eats(c3,c9). [resolve(62,a,60,a)].
% 0.69/0.99 63 much_smaller(c4,c3). [resolve(39,a,36,a)].
% 0.69/0.99 64 -animal(A) | -plant(B) | eats(A,B) | -animal(C) | -much_smaller(C,A) | -plant(D) | -eats(C,D) | eats(A,C) # label(pel47_7) # label(axiom). [clausify(18)].
% 0.69/0.99 Derived: -animal(c3) | -plant(A) | eats(c3,A) | -animal(c4) | -plant(B) | -eats(c4,B) | eats(c3,c4). [resolve(63,a,64,e)].
% 0.69/0.99 65 much_smaller(c5,c4). [resolve(46,a,41,a)].
% 0.69/0.99 Derived: -animal(c4) | -plant(A) | eats(c4,A) | -animal(c5) | -plant(B) | -eats(c5,B) | eats(c4,c5). [resolve(65,a,64,e)].
% 0.69/0.99 66 much_smaller(c6,c5). [resolve(51,a,48,a)].
% 0.69/0.99 67 much_smaller(c7,c5). [resolve(58,a,54,a)].
% 0.69/0.99 Derived: -animal(c5) | -plant(A) | eats(c5,A) | -animal(c7) | -plant(B) | -eats(c7,B) | eats(c5,c7). [resolve(67,a,64,e)].
% 0.69/0.99
% 0.69/0.99 ============================== end predicate elimination =============
% 0.69/0.99
% 0.69/0.99 Auto_denials: (non-Horn, no changes).
% 0.69/0.99
% 0.69/0.99 Term ordering decisions:
% 0.69/0.99 Function symbol KB weights: c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. f1=1. f2=1.
% 0.69/0.99
% 0.69/0.99 ============================== end of process initial clauses ========
% 0.69/0.99
% 0.69/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.99
% 0.69/0.99 ============================== end of clauses for search =============
% 0.69/0.99
% 0.69/0.99 ============================== SEARCH ================================
% 0.69/0.99
% 0.69/0.99 % Starting search at 0.01 seconds.
% 0.69/0.99
% 0.69/0.99 ============================== PROOF =================================
% 0.69/0.99 % SZS status Theorem
% 0.69/0.99 % SZS output start Refutation
% 0.69/0.99
% 0.69/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.69/0.99 % Length of proof is 71.
% 0.69/0.99 % Level of proof is 9.
% 0.69/0.99 % Maximum clause weight is 13.000.
% 0.69/0.99 % Given clauses 33.
% 0.69/0.99
% 0.69/0.99 4 (exists A wolf(A)) # label(wolf_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 5 (all A (wolf(A) -> animal(A))) # label(wolf_is_animal) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 6 (exists A fox(A)) # label(fox_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 7 (all A (fox(A) -> animal(A))) # label(fox_is_animal) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 8 (exists A bird(A)) # label(bird_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 9 (all A (bird(A) -> animal(A))) # label(bird_is_animal) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 12 (exists A snail(A)) # label(snail_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 13 (all A (snail(A) -> animal(A))) # label(snail_is_animal) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 16 (exists A grain(A)) # label(grain_type) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 17 (all A (grain(A) -> plant(A))) # label(grain_is_plant) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 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)))))) # label(pel47_7) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 19 (all Y all X (bird(Y) & snail(X) -> much_smaller(X,Y))) # label(pel47_8) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 21 (all X all Y (bird(X) & fox(Y) -> much_smaller(X,Y))) # label(pel47_9) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 22 (all X all Y (fox(X) & wolf(Y) -> much_smaller(X,Y))) # label(pel47_10) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 23 (all X all Y (wolf(X) & fox(Y) -> -eats(X,Y))) # label(pel47_11) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 24 (all X all Y (wolf(X) & grain(Y) -> -eats(X,Y))) # label(pel47_11a) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 26 (all X all Y (bird(X) & snail(Y) -> -eats(X,Y))) # label(pel47_13) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 28 (all X (snail(X) -> (exists Y (plant(Y) & eats(X,Y))))) # label(pel47_14a) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 29 -(exists X exists Y exists Z (animal(X) & animal(Y) & grain(Z) & eats(Y,Z) & eats(X,Y))) # label(pel47) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/0.99 30 -wolf(A) | -fox(B) | -eats(A,B) # label(pel47_11) # label(axiom). [clausify(23)].
% 0.69/0.99 31 wolf(c3) # label(wolf_type) # label(axiom). [clausify(4)].
% 0.69/0.99 32 -wolf(A) | -grain(B) | -eats(A,B) # label(pel47_11a) # label(axiom). [clausify(24)].
% 0.69/0.99 33 -wolf(A) | animal(A) # label(wolf_is_animal) # label(axiom). [clausify(5)].
% 0.69/0.99 34 -fox(A) | -wolf(B) | much_smaller(A,B) # label(pel47_10) # label(axiom). [clausify(22)].
% 0.69/0.99 35 -fox(A) | animal(A) # label(fox_is_animal) # label(axiom). [clausify(7)].
% 0.69/0.99 36 fox(c4) # label(fox_type) # label(axiom). [clausify(6)].
% 0.69/0.99 37 -bird(A) | -fox(B) | much_smaller(A,B) # label(pel47_9) # label(axiom). [clausify(21)].
% 0.69/0.99 38 -fox(A) | -eats(c3,A). [resolve(30,a,31,a)].
% 0.69/0.99 39 -fox(A) | much_smaller(A,c3). [resolve(34,b,31,a)].
% 0.69/0.99 40 -bird(A) | -snail(B) | -eats(A,B) # label(pel47_13) # label(axiom). [clausify(26)].
% 0.69/0.99 41 bird(c5) # label(bird_type) # label(axiom). [clausify(8)].
% 0.69/0.99 42 -bird(A) | animal(A) # label(bird_is_animal) # label(axiom). [clausify(9)].
% 0.69/0.99 43 -bird(A) | -snail(B) | much_smaller(B,A) # label(pel47_8) # label(axiom). [clausify(19)].
% 0.69/0.99 46 -bird(A) | much_smaller(A,c4). [resolve(37,b,36,a)].
% 0.69/0.99 53 -snail(A) | animal(A) # label(snail_is_animal) # label(axiom). [clausify(13)].
% 0.69/0.99 54 snail(c7) # label(snail_type) # label(axiom). [clausify(12)].
% 0.69/0.99 55 -snail(A) | plant(f2(A)) # label(pel47_14a) # label(axiom). [clausify(28)].
% 0.69/0.99 56 -snail(A) | eats(A,f2(A)) # label(pel47_14a) # label(axiom). [clausify(28)].
% 0.69/0.99 57 -snail(A) | -eats(c5,A). [resolve(40,a,41,a)].
% 0.69/0.99 58 -snail(A) | much_smaller(A,c5). [resolve(43,a,41,a)].
% 0.69/0.99 59 -animal(A) | -animal(B) | -grain(C) | -eats(B,C) | -eats(A,B) # label(pel47) # label(negated_conjecture). [clausify(29)].
% 0.69/0.99 60 grain(c9) # label(grain_type) # label(axiom). [clausify(16)].
% 0.69/0.99 61 -grain(A) | plant(A) # label(grain_is_plant) # label(axiom). [clausify(17)].
% 0.69/0.99 62 -grain(A) | -eats(c3,A). [resolve(32,a,31,a)].
% 0.69/0.99 63 much_smaller(c4,c3). [resolve(39,a,36,a)].
% 0.69/0.99 64 -animal(A) | -plant(B) | eats(A,B) | -animal(C) | -much_smaller(C,A) | -plant(D) | -eats(C,D) | eats(A,C) # label(pel47_7) # label(axiom). [clausify(18)].
% 0.69/0.99 65 much_smaller(c5,c4). [resolve(46,a,41,a)].
% 0.69/0.99 67 much_smaller(c7,c5). [resolve(58,a,54,a)].
% 0.69/0.99 70 animal(c3). [resolve(33,a,31,a)].
% 0.69/0.99 71 animal(c4). [resolve(35,a,36,a)].
% 0.69/0.99 72 -eats(c3,c4). [resolve(38,a,36,a)].
% 0.69/0.99 73 animal(c5). [resolve(42,a,41,a)].
% 0.69/0.99 78 animal(c7). [resolve(53,a,54,a)].
% 0.69/0.99 79 plant(f2(c7)). [resolve(55,a,54,a)].
% 0.69/0.99 80 eats(c7,f2(c7)). [resolve(56,a,54,a)].
% 0.69/0.99 81 -eats(c5,c7). [resolve(57,a,54,a)].
% 0.69/0.99 82 -animal(A) | -animal(B) | -eats(B,c9) | -eats(A,B). [resolve(59,c,60,a)].
% 0.69/0.99 83 plant(c9). [resolve(61,a,60,a)].
% 0.69/0.99 84 -eats(c3,c9). [resolve(62,a,60,a)].
% 0.69/0.99 85 -animal(c3) | -plant(A) | eats(c3,A) | -animal(c4) | -plant(B) | -eats(c4,B) | eats(c3,c4). [resolve(63,a,64,e)].
% 0.69/0.99 86 -plant(A) | eats(c3,A) | -plant(B) | -eats(c4,B). [copy(85),unit_del(a,70),unit_del(d,71),unit_del(g,72)].
% 0.69/0.99 87 -animal(c4) | -plant(A) | eats(c4,A) | -animal(c5) | -plant(B) | -eats(c5,B) | eats(c4,c5). [resolve(65,a,64,e)].
% 0.69/0.99 88 -plant(A) | eats(c4,A) | -plant(B) | -eats(c5,B) | eats(c4,c5). [copy(87),unit_del(a,71),unit_del(d,73)].
% 0.69/0.99 89 -animal(c5) | -plant(A) | eats(c5,A) | -animal(c7) | -plant(B) | -eats(c7,B) | eats(c5,c7). [resolve(67,a,64,e)].
% 0.69/0.99 90 -plant(A) | eats(c5,A) | -plant(B) | -eats(c7,B). [copy(89),unit_del(a,73),unit_del(d,78),unit_del(g,81)].
% 0.69/0.99 94 -plant(A) | eats(c4,A) | -eats(c5,A) | eats(c4,c5). [factor(88,a,c)].
% 0.69/0.99 101 -eats(c4,c9). [ur(86,a,83,a,b,84,a,c,83,a)].
% 0.69/0.99 108 -plant(A) | eats(c5,A). [resolve(90,d,80,a),unit_del(c,79)].
% 0.69/0.99 110 eats(c5,c9). [resolve(108,a,83,a)].
% 0.69/0.99 115 eats(c4,c5). [resolve(110,a,94,c),unit_del(a,83),unit_del(b,101)].
% 0.69/0.99 120 $F. [ur(82,a,71,a,b,73,a,c,110,a),unit_del(a,115)].
% 0.69/0.99
% 0.69/0.99 % SZS output end Refutation
% 0.69/0.99 ============================== end of proof ==========================
% 0.69/0.99
% 0.69/0.99 ============================== STATISTICS ============================
% 0.69/0.99
% 0.69/0.99 Given=33. Generated=61. Kept=49. proofs=1.
% 0.69/0.99 Usable=32. Sos=9. Demods=0. Limbo=6, Disabled=63. Hints=0.
% 0.69/0.99 Megabytes=0.09.
% 0.69/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.69/0.99
% 0.69/0.99 ============================== end of statistics =====================
% 0.69/0.99
% 0.69/0.99 ============================== end of search =========================
% 0.69/0.99
% 0.69/0.99 THEOREM PROVED
% 0.69/0.99 % SZS status Theorem
% 0.69/0.99
% 0.69/0.99 Exiting with 1 proof.
% 0.69/0.99
% 0.69/0.99 Process 12981 exit (max_proofs) Sat May 28 20:33:27 2022
% 0.69/0.99 Prover9 interrupted
%------------------------------------------------------------------------------