TSTP Solution File: PUZ031+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ031+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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.71s 1.00s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ031+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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 23:17:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 1732 was started by sandbox2 on n028.cluster.edu,
% 0.71/0.99 Sat May 28 23:17:33 2022
% 0.71/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1573_n028.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_1573_n028.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (21 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99
% 0.71/0.99 % Formulas that are not ordinary clauses:
% 0.71/0.99 1 (all X (wolf(X) -> animal(X))) # label(pel47_1_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 2 (exists X1 wolf(X1)) # label(pel47_1_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 3 (all X (fox(X) -> animal(X))) # label(pel47_2_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 4 (exists X1 fox(X1)) # label(pel47_2_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 5 (all X (bird(X) -> animal(X))) # label(pel47_3_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 6 (exists X1 bird(X1)) # label(pel47_3_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 7 (all X (caterpillar(X) -> animal(X))) # label(pel47_4_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 8 (exists X1 caterpillar(X1)) # label(pel47_4_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 9 (all X (snail(X) -> animal(X))) # label(pel47_5_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 10 (exists X1 snail(X1)) # label(pel47_5_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 11 (exists X grain(X)) # label(pel47_6_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 12 (all X1 (grain(X1) -> plant(X1))) # label(pel47_6_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 13 (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.71/0.99 14 (all X all Y (bird(Y) & (snail(X) | caterpillar(X)) -> much_smaller(X,Y))) # label(pel47_8) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 15 (all X all Y (bird(X) & fox(Y) -> much_smaller(X,Y))) # label(pel47_9) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 16 (all X all Y (fox(X) & wolf(Y) -> much_smaller(X,Y))) # label(pel47_10) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 17 (all X all Y (wolf(X) & (fox(Y) | grain(Y)) -> -eats(X,Y))) # label(pel47_11) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 18 (all X all Y (bird(X) & caterpillar(Y) -> eats(X,Y))) # label(pel47_12) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 19 (all X all Y (bird(X) & snail(Y) -> -eats(X,Y))) # label(pel47_13) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 20 (all X (caterpillar(X) | snail(X) -> (exists Y (plant(Y) & eats(X,Y))))) # label(pel47_14) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 21 -(exists X exists Y (animal(X) & animal(Y) & (exists Z (grain(Z) & eats(Y,Z) & eats(X,Y))))) # label(pel47) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/0.99
% 0.71/0.99 ============================== end of process non-clausal formulas ===
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99
% 0.71/0.99 ============================== PREDICATE ELIMINATION =================
% 0.71/0.99 22 -wolf(A) | -fox(B) | -eats(A,B) # label(pel47_11) # label(axiom). [clausify(17)].
% 0.71/0.99 23 wolf(c1) # label(pel47_1_2) # label(axiom). [clausify(2)].
% 0.71/0.99 Derived: -fox(A) | -eats(c1,A). [resolve(22,a,23,a)].
% 0.71/0.99 24 -wolf(A) | -grain(B) | -eats(A,B) # label(pel47_11) # label(axiom). [clausify(17)].
% 0.71/0.99 Derived: -grain(A) | -eats(c1,A). [resolve(24,a,23,a)].
% 0.71/0.99 25 -wolf(A) | animal(A) # label(pel47_1_1) # label(axiom). [clausify(1)].
% 0.71/0.99 Derived: animal(c1). [resolve(25,a,23,a)].
% 0.71/0.99 26 -fox(A) | -wolf(B) | much_smaller(A,B) # label(pel47_10) # label(axiom). [clausify(16)].
% 0.71/0.99 Derived: -fox(A) | much_smaller(A,c1). [resolve(26,b,23,a)].
% 0.71/0.99 27 -fox(A) | animal(A) # label(pel47_2_1) # label(axiom). [clausify(3)].
% 0.71/0.99 28 fox(c2) # label(pel47_2_2) # label(axiom). [clausify(4)].
% 0.71/0.99 Derived: animal(c2). [resolve(27,a,28,a)].
% 0.71/0.99 29 -bird(A) | -fox(B) | much_smaller(A,B) # label(pel47_9) # label(axiom). [clausify(15)].
% 0.71/0.99 Derived: -bird(A) | much_smaller(A,c2). [resolve(29,b,28,a)].
% 0.71/0.99 30 -fox(A) | -eats(c1,A). [resolve(22,a,23,a)].
% 0.71/0.99 Derived: -eats(c1,c2). [resolve(30,a,28,a)].
% 0.71/0.99 31 -fox(A) | much_smaller(A,c1). [resolve(26,b,23,a)].
% 0.71/0.99 Derived: much_smaller(c2,c1). [resolve(31,a,28,a)].
% 0.71/0.99 32 -bird(A) | -snail(B) | -eats(A,B) # label(pel47_13) # label(axiom). [clausify(19)].
% 0.71/0.99 33 bird(c3) # label(pel47_3_2) # label(axiom). [clausify(6)].
% 0.71/0.99 Derived: -snail(A) | -eats(c3,A). [resolve(32,a,33,a)].
% 0.71/0.99 34 -bird(A) | animal(A) # label(pel47_3_1) # label(axiom). [clausify(5)].
% 0.71/0.99 Derived: animal(c3). [resolve(34,a,33,a)].
% 0.71/0.99 35 -bird(A) | -snail(B) | much_smaller(B,A) # label(pel47_8) # label(axiom). [clausify(14)].
% 0.71/0.99 Derived: -snail(A) | much_smaller(A,c3). [resolve(35,a,33,a)].
% 0.71/0.99 36 -bird(A) | -caterpillar(B) | much_smaller(B,A) # label(pel47_8) # label(axiom). [clausify(14)].
% 0.71/0.99 Derived: -caterpillar(A) | much_smaller(A,c3). [resolve(36,a,33,a)].
% 0.71/0.99 37 -bird(A) | -caterpillar(B) | eats(A,B) # label(pel47_12) # label(axiom). [clausify(18)].
% 0.71/0.99 Derived: -caterpillar(A) | eats(c3,A). [resolve(37,a,33,a)].
% 0.71/0.99 38 -bird(A) | much_smaller(A,c2). [resolve(29,b,28,a)].
% 0.71/0.99 Derived: much_smaller(c3,c2). [resolve(38,a,33,a)].
% 0.71/0.99 39 -caterpillar(A) | animal(A) # label(pel47_4_1) # label(axiom). [clausify(7)].
% 0.71/0.99 40 caterpillar(c4) # label(pel47_4_2) # label(axiom). [clausify(8)].
% 0.71/0.99 Derived: animal(c4). [resolve(39,a,40,a)].
% 0.71/0.99 41 -caterpillar(A) | plant(f1(A)) # label(pel47_14) # label(axiom). [clausify(20)].
% 0.71/0.99 Derived: plant(f1(c4)). [resolve(41,a,40,a)].
% 0.71/0.99 42 -caterpillar(A) | eats(A,f1(A)) # label(pel47_14) # label(axiom). [clausify(20)].
% 0.71/0.99 Derived: eats(c4,f1(c4)). [resolve(42,a,40,a)].
% 0.71/0.99 43 -caterpillar(A) | much_smaller(A,c3). [resolve(36,a,33,a)].
% 0.71/0.99 Derived: much_smaller(c4,c3). [resolve(43,a,40,a)].
% 0.71/0.99 44 -caterpillar(A) | eats(c3,A). [resolve(37,a,33,a)].
% 0.71/0.99 Derived: eats(c3,c4). [resolve(44,a,40,a)].
% 0.71/0.99 45 -snail(A) | animal(A) # label(pel47_5_1) # label(axiom). [clausify(9)].
% 0.71/0.99 46 snail(c5) # label(pel47_5_2) # label(axiom). [clausify(10)].
% 0.71/0.99 Derived: animal(c5). [resolve(45,a,46,a)].
% 0.71/0.99 47 -snail(A) | plant(f1(A)) # label(pel47_14) # label(axiom). [clausify(20)].
% 0.71/0.99 Derived: plant(f1(c5)). [resolve(47,a,46,a)].
% 0.71/0.99 48 -snail(A) | eats(A,f1(A)) # label(pel47_14) # label(axiom). [clausify(20)].
% 0.71/0.99 Derived: eats(c5,f1(c5)). [resolve(48,a,46,a)].
% 0.71/0.99 49 -snail(A) | -eats(c3,A). [resolve(32,a,33,a)].
% 0.71/0.99 Derived: -eats(c3,c5). [resolve(49,a,46,a)].
% 0.71/0.99 50 -snail(A) | much_smaller(A,c3). [resolve(35,a,33,a)].
% 0.71/1.00 Derived: much_smaller(c5,c3). [resolve(50,a,46,a)].
% 0.71/1.00 51 -animal(A) | -animal(B) | -grain(C) | -eats(B,C) | -eats(A,B) # label(pel47) # label(negated_conjecture). [clausify(21)].
% 0.71/1.00 52 grain(c6) # label(pel47_6_1) # label(axiom). [clausify(11)].
% 0.71/1.00 Derived: -animal(A) | -animal(B) | -eats(B,c6) | -eats(A,B). [resolve(51,c,52,a)].
% 0.71/1.00 53 -grain(A) | plant(A) # label(pel47_6_2) # label(axiom). [clausify(12)].
% 0.71/1.00 Derived: plant(c6). [resolve(53,a,52,a)].
% 0.71/1.00 54 -grain(A) | -eats(c1,A). [resolve(24,a,23,a)].
% 0.71/1.00 Derived: -eats(c1,c6). [resolve(54,a,52,a)].
% 0.71/1.00 55 much_smaller(c2,c1). [resolve(31,a,28,a)].
% 0.71/1.00 56 -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(13)].
% 0.71/1.00 Derived: -animal(c1) | -plant(A) | eats(c1,A) | -animal(c2) | -plant(B) | -eats(c2,B) | eats(c1,c2). [resolve(55,a,56,e)].
% 0.71/1.00 57 much_smaller(c3,c2). [resolve(38,a,33,a)].
% 0.71/1.00 Derived: -animal(c2) | -plant(A) | eats(c2,A) | -animal(c3) | -plant(B) | -eats(c3,B) | eats(c2,c3). [resolve(57,a,56,e)].
% 0.71/1.00 58 much_smaller(c4,c3). [resolve(43,a,40,a)].
% 0.71/1.00 59 much_smaller(c5,c3). [resolve(50,a,46,a)].
% 0.71/1.00 Derived: -animal(c3) | -plant(A) | eats(c3,A) | -animal(c5) | -plant(B) | -eats(c5,B) | eats(c3,c5). [resolve(59,a,56,e)].
% 0.71/1.00
% 0.71/1.00 ============================== end predicate elimination =============
% 0.71/1.00
% 0.71/1.00 Auto_denials: (non-Horn, no changes).
% 0.71/1.00
% 0.71/1.00 Term ordering decisions:
% 0.71/1.00
% 0.71/1.00 % Assigning unary symbol f1 kb_weight 0 and highest precedence (10).
% 0.71/1.00 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. f1=0.
% 0.71/1.00
% 0.71/1.00 ============================== end of process initial clauses ========
% 0.71/1.00
% 0.71/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.00
% 0.71/1.00 ============================== end of clauses for search =============
% 0.71/1.00
% 0.71/1.00 ============================== SEARCH ================================
% 0.71/1.00
% 0.71/1.00 % Starting search at 0.01 seconds.
% 0.71/1.00
% 0.71/1.00 ============================== PROOF =================================
% 0.71/1.00 % SZS status Theorem
% 0.71/1.00 % SZS output start Refutation
% 0.71/1.00
% 0.71/1.00 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.71/1.00 % Length of proof is 70.
% 0.71/1.00 % Level of proof is 9.
% 0.71/1.00 % Maximum clause weight is 13.000.
% 0.71/1.00 % Given clauses 31.
% 0.71/1.00
% 0.71/1.00 1 (all X (wolf(X) -> animal(X))) # label(pel47_1_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 2 (exists X1 wolf(X1)) # label(pel47_1_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 3 (all X (fox(X) -> animal(X))) # label(pel47_2_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 4 (exists X1 fox(X1)) # label(pel47_2_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 5 (all X (bird(X) -> animal(X))) # label(pel47_3_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 6 (exists X1 bird(X1)) # label(pel47_3_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 9 (all X (snail(X) -> animal(X))) # label(pel47_5_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 10 (exists X1 snail(X1)) # label(pel47_5_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 11 (exists X grain(X)) # label(pel47_6_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 12 (all X1 (grain(X1) -> plant(X1))) # label(pel47_6_2) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 13 (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.71/1.00 14 (all X all Y (bird(Y) & (snail(X) | caterpillar(X)) -> much_smaller(X,Y))) # label(pel47_8) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 15 (all X all Y (bird(X) & fox(Y) -> much_smaller(X,Y))) # label(pel47_9) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 16 (all X all Y (fox(X) & wolf(Y) -> much_smaller(X,Y))) # label(pel47_10) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 17 (all X all Y (wolf(X) & (fox(Y) | grain(Y)) -> -eats(X,Y))) # label(pel47_11) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 19 (all X all Y (bird(X) & snail(Y) -> -eats(X,Y))) # label(pel47_13) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 20 (all X (caterpillar(X) | snail(X) -> (exists Y (plant(Y) & eats(X,Y))))) # label(pel47_14) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.00 21 -(exists X exists Y (animal(X) & animal(Y) & (exists Z (grain(Z) & eats(Y,Z) & eats(X,Y))))) # label(pel47) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/1.00 22 -wolf(A) | -fox(B) | -eats(A,B) # label(pel47_11) # label(axiom). [clausify(17)].
% 0.71/1.00 23 wolf(c1) # label(pel47_1_2) # label(axiom). [clausify(2)].
% 0.71/1.00 24 -wolf(A) | -grain(B) | -eats(A,B) # label(pel47_11) # label(axiom). [clausify(17)].
% 0.71/1.00 25 -wolf(A) | animal(A) # label(pel47_1_1) # label(axiom). [clausify(1)].
% 0.71/1.00 26 -fox(A) | -wolf(B) | much_smaller(A,B) # label(pel47_10) # label(axiom). [clausify(16)].
% 0.71/1.00 27 -fox(A) | animal(A) # label(pel47_2_1) # label(axiom). [clausify(3)].
% 0.71/1.00 28 fox(c2) # label(pel47_2_2) # label(axiom). [clausify(4)].
% 0.71/1.00 29 -bird(A) | -fox(B) | much_smaller(A,B) # label(pel47_9) # label(axiom). [clausify(15)].
% 0.71/1.00 30 -fox(A) | -eats(c1,A). [resolve(22,a,23,a)].
% 0.71/1.00 31 -fox(A) | much_smaller(A,c1). [resolve(26,b,23,a)].
% 0.71/1.00 32 -bird(A) | -snail(B) | -eats(A,B) # label(pel47_13) # label(axiom). [clausify(19)].
% 0.71/1.00 33 bird(c3) # label(pel47_3_2) # label(axiom). [clausify(6)].
% 0.71/1.00 34 -bird(A) | animal(A) # label(pel47_3_1) # label(axiom). [clausify(5)].
% 0.71/1.00 35 -bird(A) | -snail(B) | much_smaller(B,A) # label(pel47_8) # label(axiom). [clausify(14)].
% 0.71/1.00 38 -bird(A) | much_smaller(A,c2). [resolve(29,b,28,a)].
% 0.71/1.00 45 -snail(A) | animal(A) # label(pel47_5_1) # label(axiom). [clausify(9)].
% 0.71/1.00 46 snail(c5) # label(pel47_5_2) # label(axiom). [clausify(10)].
% 0.71/1.00 47 -snail(A) | plant(f1(A)) # label(pel47_14) # label(axiom). [clausify(20)].
% 0.71/1.00 48 -snail(A) | eats(A,f1(A)) # label(pel47_14) # label(axiom). [clausify(20)].
% 0.71/1.00 49 -snail(A) | -eats(c3,A). [resolve(32,a,33,a)].
% 0.71/1.00 50 -snail(A) | much_smaller(A,c3). [resolve(35,a,33,a)].
% 0.71/1.00 51 -animal(A) | -animal(B) | -grain(C) | -eats(B,C) | -eats(A,B) # label(pel47) # label(negated_conjecture). [clausify(21)].
% 0.71/1.00 52 grain(c6) # label(pel47_6_1) # label(axiom). [clausify(11)].
% 0.71/1.00 53 -grain(A) | plant(A) # label(pel47_6_2) # label(axiom). [clausify(12)].
% 0.71/1.00 54 -grain(A) | -eats(c1,A). [resolve(24,a,23,a)].
% 0.71/1.00 55 much_smaller(c2,c1). [resolve(31,a,28,a)].
% 0.71/1.00 56 -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(13)].
% 0.71/1.00 57 much_smaller(c3,c2). [resolve(38,a,33,a)].
% 0.71/1.00 59 much_smaller(c5,c3). [resolve(50,a,46,a)].
% 0.71/1.00 60 animal(c1). [resolve(25,a,23,a)].
% 0.71/1.00 61 animal(c2). [resolve(27,a,28,a)].
% 0.71/1.00 62 -eats(c1,c2). [resolve(30,a,28,a)].
% 0.71/1.00 63 animal(c3). [resolve(34,a,33,a)].
% 0.71/1.00 68 animal(c5). [resolve(45,a,46,a)].
% 0.71/1.00 69 plant(f1(c5)). [resolve(47,a,46,a)].
% 0.71/1.00 70 eats(c5,f1(c5)). [resolve(48,a,46,a)].
% 0.71/1.00 71 -eats(c3,c5). [resolve(49,a,46,a)].
% 0.71/1.00 72 -animal(A) | -animal(B) | -eats(B,c6) | -eats(A,B). [resolve(51,c,52,a)].
% 0.71/1.00 73 plant(c6). [resolve(53,a,52,a)].
% 0.71/1.00 74 -eats(c1,c6). [resolve(54,a,52,a)].
% 0.71/1.00 75 -animal(c1) | -plant(A) | eats(c1,A) | -animal(c2) | -plant(B) | -eats(c2,B) | eats(c1,c2). [resolve(55,a,56,e)].
% 0.71/1.00 76 -plant(A) | eats(c1,A) | -plant(B) | -eats(c2,B). [copy(75),unit_del(a,60),unit_del(d,61),unit_del(g,62)].
% 0.71/1.00 77 -animal(c2) | -plant(A) | eats(c2,A) | -animal(c3) | -plant(B) | -eats(c3,B) | eats(c2,c3). [resolve(57,a,56,e)].
% 0.71/1.00 78 -plant(A) | eats(c2,A) | -plant(B) | -eats(c3,B) | eats(c2,c3). [copy(77),unit_del(a,61),unit_del(d,63)].
% 0.71/1.00 79 -animal(c3) | -plant(A) | eats(c3,A) | -animal(c5) | -plant(B) | -eats(c5,B) | eats(c3,c5). [resolve(59,a,56,e)].
% 0.71/1.00 80 -plant(A) | eats(c3,A) | -plant(B) | -eats(c5,B). [copy(79),unit_del(a,63),unit_del(d,68),unit_del(g,71)].
% 0.71/1.00 84 -plant(A) | eats(c2,A) | -eats(c3,A) | eats(c2,c3). [factor(78,a,c)].
% 0.71/1.00 91 -eats(c2,c6). [ur(76,a,73,a,b,74,a,c,73,a)].
% 0.71/1.00 97 -plant(A) | eats(c3,A). [resolve(80,d,70,a),unit_del(c,69)].
% 0.71/1.00 99 eats(c3,c6). [resolve(97,a,73,a)].
% 0.71/1.00 103 eats(c2,c3). [resolve(99,a,84,c),unit_del(a,73),unit_del(b,91)].
% 0.71/1.00 108 $F. [ur(72,a,61,a,b,63,a,c,99,a),unit_del(a,103)].
% 0.71/1.00
% 0.71/1.00 % SZS output end Refutation
% 0.71/1.00 ============================== end of proof ==========================
% 0.71/1.00
% 0.71/1.00 ============================== STATISTICS ============================
% 0.71/1.00
% 0.71/1.00 Given=31. Generated=57. Kept=45. proofs=1.
% 0.71/1.00 Usable=30. Sos=7. Demods=0. Limbo=6, Disabled=58. Hints=0.
% 0.71/1.00 Megabytes=0.08.
% 0.71/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.71/1.00
% 0.71/1.00 ============================== end of statistics =====================
% 0.71/1.00
% 0.71/1.00 ============================== end of search =========================
% 0.71/1.00
% 0.71/1.00 THEOREM PROVED
% 0.71/1.00 % SZS status Theorem
% 0.71/1.00
% 0.71/1.00 Exiting with 1 proof.
% 0.71/1.00
% 0.71/1.00 Process 1732 exit (max_proofs) Sat May 28 23:17:33 2022
% 0.71/1.00 Prover9 interrupted
%------------------------------------------------------------------------------