TSTP Solution File: NLP036-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP036-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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 05:05:49 EDT 2022
% Result : Unknown 0.81s 1.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NLP036-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n007.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 : Thu Jun 30 23:42:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.98 ============================== Prover9 ===============================
% 0.41/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.98 Process 27380 was started by sandbox2 on n007.cluster.edu,
% 0.41/0.98 Thu Jun 30 23:42:39 2022
% 0.41/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27227_n007.cluster.edu".
% 0.41/0.98 ============================== end of head ===========================
% 0.41/0.98
% 0.41/0.98 ============================== INPUT =================================
% 0.41/0.98
% 0.41/0.98 % Reading from file /tmp/Prover9_27227_n007.cluster.edu
% 0.41/0.98
% 0.41/0.98 set(prolog_style_variables).
% 0.41/0.98 set(auto2).
% 0.41/0.98 % set(auto2) -> set(auto).
% 0.41/0.98 % set(auto) -> set(auto_inference).
% 0.41/0.98 % set(auto) -> set(auto_setup).
% 0.41/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.98 % set(auto) -> set(auto_limits).
% 0.41/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.98 % set(auto) -> set(auto_denials).
% 0.41/0.98 % set(auto) -> set(auto_process).
% 0.41/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.98 % set(auto2) -> assign(stats, some).
% 0.41/0.98 % set(auto2) -> clear(echo_input).
% 0.41/0.98 % set(auto2) -> set(quiet).
% 0.41/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.98 % set(auto2) -> clear(print_given).
% 0.41/0.98 assign(lrs_ticks,-1).
% 0.41/0.98 assign(sos_limit,10000).
% 0.41/0.98 assign(order,kbo).
% 0.41/0.98 set(lex_order_vars).
% 0.41/0.98 clear(print_given).
% 0.41/0.98
% 0.41/0.98 % formulas(sos). % not echoed (66 formulas)
% 0.41/0.98
% 0.41/0.98 ============================== end of input ==========================
% 0.41/0.98
% 0.41/0.98 % From the command line: assign(max_seconds, 300).
% 0.41/0.98
% 0.41/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.98
% 0.41/0.98 % Formulas that are not ordinary clauses:
% 0.41/0.98
% 0.41/0.98 ============================== end of process non-clausal formulas ===
% 0.41/0.98
% 0.41/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.98
% 0.41/0.98 ============================== PREDICATE ELIMINATION =================
% 0.41/0.98 1 -group(A,B) | set(A,B) # label(clause15) # label(axiom). [assumption].
% 0.41/0.98 2 group(skc2,skc3) # label(clause54) # label(negated_conjecture). [assumption].
% 0.41/0.98 Derived: set(skc2,skc3). [resolve(1,a,2,a)].
% 0.41/0.98 3 -three(A,B) | group(A,B) # label(clause17) # label(axiom). [assumption].
% 0.41/0.98 Derived: -three(A,B) | set(A,B). [resolve(3,b,1,a)].
% 0.41/0.98 4 -member(skc2,A,skc3) | group(skc2,skf9(B)) # label(clause56) # label(negated_conjecture). [assumption].
% 0.41/0.98 Derived: -member(skc2,A,skc3) | set(skc2,skf9(B)). [resolve(4,b,1,a)].
% 0.41/0.98 5 -man(A,B) | male(A,B) # label(clause14) # label(axiom). [assumption].
% 0.41/0.98 6 -male(A,B) | -unisex(A,B) # label(clause37) # label(axiom). [assumption].
% 0.41/0.98 Derived: -man(A,B) | -unisex(A,B). [resolve(5,b,6,a)].
% 0.41/0.98 7 -set(A,B) | multiple(A,B) # label(clause16) # label(axiom). [assumption].
% 0.41/0.98 8 -multiple(A,B) | -singleton(A,B) # label(clause38) # label(axiom). [assumption].
% 0.41/0.98 Derived: -set(A,B) | -singleton(A,B). [resolve(7,b,8,a)].
% 0.41/0.98 9 -organism(A,B) | living(A,B) # label(clause11) # label(axiom). [assumption].
% 0.41/0.98 10 -living(A,B) | -nonliving(A,B) # label(clause39) # label(axiom). [assumption].
% 0.41/0.98 Derived: -organism(A,B) | -nonliving(A,B). [resolve(9,b,10,a)].
% 0.41/0.98 11 -eventuality(A,B) | nonexistent(A,B) # label(clause31) # label(axiom). [assumption].
% 0.41/0.98 12 -nonexistent(A,B) | -existent(A,B) # label(clause40) # label(axiom). [assumption].
% 0.41/0.98 Derived: -eventuality(A,B) | -existent(A,B). [resolve(11,b,12,a)].
% 0.41/0.98 13 -object(A,B) | nonliving(A,B) # label(clause24) # label(axiom). [assumption].
% 0.41/0.98 14 -nonliving(A,B) | -animate(A,B) # label(clause41) # label(axiom). [assumption].
% 0.41/0.98 Derived: -object(A,B) | -animate(A,B). [resolve(13,b,14,a)].
% 0.41/0.98 15 -organism(A,B) | -nonliving(A,B). [resolve(9,b,10,a)].
% 0.41/0.98 Derived: -organism(A,B) | -object(A,B). [resolve(15,b,13,b)].
% 0.41/0.98 16 -member(skc2,A,skc3) | three(skc2,skf9(B)) # label(clause57) # label(negated_conjecture). [assumption].
% 0.41/0.98 17 skf17(A,B) != skf13(A,B) | -three(B,A) # label(clause45) # label(axiom). [assumption].
% 0.41/0.98 18 skf17(A,B) != skf15(A,B) | -three(B,A) # label(clause46) # label(axiom). [assumption].
% 0.41/0.98 19 skf15(A,B) != skf13(A,B) | -three(B,A) # label(clause47) # label(axiom). [assumption].
% 0.41/0.98 Derived: -member(skc2,A,skc3) | skf17(skf9(B),skc2) != skf13(skf9(B),skc2). [resolve(16,b,17,b)].
% 0.41/0.98 Derived: -member(skc2,A,skc3) | skf17(skf9(B),skc2) != skf15(skf9(B),skc2). [resolve(16,b,18,b)].
% 0.41/0.98 Derived: -member(skc2,A,skc3) | skf15(skf9(B),skc2) != skf13(skf9(B),skc2). [resolve(16,b,19,b)].
% 0.41/0.98 20 -three(A,B) | member(A,skf17(B,A),B) # label(clause42) # label(axiom). [assumption].
% 0.41/0.98 Derived: member(skc2,skf17(skf9(A),skc2),skf9(A)) | -member(skc2,B,skc3). [resolve(20,a,16,b)].
% 0.41/0.98 21 -three(A,B) | member(A,skf15(B,A),B) # label(clause43) # label(axiom). [assumption].
% 0.41/0.98 Derived: member(skc2,skf15(skf9(A),skc2),skf9(A)) | -member(skc2,B,skc3). [resolve(21,a,16,b)].
% 0.41/0.98 22 -three(A,B) | member(A,skf13(B,A),B) # label(clause44) # label(axiom). [assumption].
% 0.41/0.98 Derived: member(skc2,skf13(skf9(A),skc2),skf9(A)) | -member(skc2,B,skc3). [resolve(22,a,16,b)].
% 0.41/0.98 23 -member(A,B,C) | -three(A,C) | B = skf13(C,A) | B = skf15(C,A) | B = skf17(C,A) # label(clause48) # label(axiom). [assumption].
% 0.41/0.98 Derived: -member(skc2,A,skf9(B)) | A = skf13(skf9(B),skc2) | A = skf15(skf9(B),skc2) | A = skf17(skf9(B),skc2) | -member(skc2,C,skc3). [resolve(23,b,16,b)].
% 0.41/0.98 24 skf18(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | three(F,V6) | A = V8 | A = V7 | V7 = V8 # label(clause49) # label(axiom). [assumption].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | skf17(V6,F) != skf13(V6,F). [resolve(24,e,17,b)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | skf17(V6,F) != skf15(V6,F). [resolve(24,e,18,b)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | skf15(V6,F) != skf13(V6,F). [resolve(24,e,19,b)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | member(F,skf17(V6,F),V6). [resolve(24,e,20,a)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | member(F,skf15(V6,F),V6). [resolve(24,e,21,a)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | member(F,skf13(V6,F),V6). [resolve(24,e,22,a)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | -member(F,V9,V6) | V9 = skf13(V6,F) | V9 = skf15(V6,F) | V9 = skf17(V6,F). [resolve(24,e,23,b)].
% 0.41/0.98 25 skf18(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | three(F,V6) | A = V7 | A = B | B = V7 # label(clause50) # label(axiom). [assumption].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | skf17(V6,F) != skf13(V6,F). [resolve(25,e,17,b)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | skf17(V6,F) != skf15(V6,F). [resolve(25,e,18,b)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | skf15(V6,F) != skf13(V6,F). [resolve(25,e,19,b)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | member(F,skf17(V6,F),V6). [resolve(25,e,20,a)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | member(F,skf15(V6,F),V6). [resolve(25,e,21,a)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | member(F,skf13(V6,F),V6). [resolve(25,e,22,a)].
% 0.41/0.98 Derived: skf18(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | -member(F,V8,V6) | V8 = skf13(V6,F) | V8 = skf15(V6,F) | V8 = skf17(V6,F). [resolve(25,e,23,b)].
% 0.41/0.99 26 skf18(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | three(F,V6) | A = C | A = B | B = C # label(clause51) # label(axiom). [assumption].
% 0.41/0.99 Derived: skf18(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | skf17(V6,F) != skf13(V6,F). [resolve(26,e,17,b)].
% 0.41/0.99 Derived: skf18(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | skf17(V6,F) != skf15(V6,F). [resolve(26,e,18,b)].
% 0.41/0.99 Derived: skf18(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | skf15(V6,F) != skf13(V6,F). [resolve(26,e,19,b)].
% 0.41/0.99 Derived: skf18(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | member(F,skf17(V6,F),V6). [resolve(26,e,20,a)].
% 0.41/0.99 Derived: skf18(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | member(F,skf15(V6,F),V6). [resolve(26,e,21,a)].
% 0.41/0.99 Derived: skf18(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | member(F,skf13(V6,F),V6). [resolve(26,e,22,a)].
% 0.41/0.99 Derived: skf18(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | -member(F,V7,V6) | V7 = skf13(V6,F) | V7 = skf15(V6,F) | V7 = skf17(V6,F). [resolve(26,e,23,b)].
% 0.41/0.99 27 -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | three(A,C) | member(A,skf18(B,D,E,C,A),C) | B = E | B = D | D = E # label(clause52) # label(axiom). [assumption].
% 0.41/0.99 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf18(B,D,E,C,A),C) | B = E | B = D | D = E | skf17(C,A) != skf13(C,A). [resolve(27,d,17,b)].
% 0.41/0.99 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf18(B,D,E,C,A),C) | B = E | B = D | D = E | skf17(C,A) != skf15(C,A). [resolve(27,d,18,b)].
% 0.41/0.99 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf18(B,D,E,C,A),C) | B = E | B = D | D = E | skf15(C,A) != skf13(C,A). [resolve(27,d,19,b)].
% 0.41/0.99 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf18(B,D,E,C,A),C) | B = E | B = D | D = E | member(A,skf17(C,A),C). [resolve(27,d,20,a)].
% 0.41/0.99 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf18(B,D,E,C,A),C) | B = E | B = D | D = E | member(A,skf15(C,A),C). [resolve(27,d,21,a)].
% 0.41/0.99 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf18(B,D,E,C,A),C) | B = E | B = D | D = E | member(A,skf13(C,A),C). [resolve(27,d,22,a)].
% 0.41/0.99 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf18(B,D,E,C,A),C) | B = E | B = D | D = E | -member(A,F,C) | F = skf13(C,A) | F = skf15(C,A) | F = skf17(C,A). [resolve(27,d,23,b)].
% 0.41/0.99 28 -three(A,B) | set(A,B). [resolve(3,b,1,a)].
% 0.41/0.99 Derived: set(A,B) | skf18(C,D,E,F,V6) != C | -member(A,C,B) | -member(A,V7,B) | -member(A,V8,B) | C = V8 | C = V7 | V7 = V8. [resolve(28,a,24,e)].
% 0.41/0.99 Derived: set(A,B) | skf18(C,D,E,F,V6) != D | -member(A,C,B) | -member(A,D,B) | -member(A,V7,B) | C = V7 | C = D | D = V7. [resolve(28,a,25,e)].
% 0.41/0.99 Derived: set(A,B) | skf18(C,D,E,F,V6) != E | -member(A,C,B) | -member(A,D,B) | -member(A,E,B) | C = E | C = D | D = E. [resolve(28,a,26,e)].
% 0.41/0.99 Derived: set(A,B) | -member(A,C,B) | -member(A,D,B) | -member(A,E,B) | member(A,skf18(C,D,E,B,A),B) | C = E | C = D | D = E. [resolve(28,a,27,d)].
% 0.41/0.99 29 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | guy(skc2,A) # label(clause58) # label(negated_conjecture). [assumption].
% 0.41/0.99 30 -guy(A,B) | man(A,B) # label(clause2) # label(axiom). [assumption].
% 0.41/0.99 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | man(skc2,A). [resolve(29,c,30,a)].
% 0.41/0.99 31 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | man(skc2,A). [resolve(29,c,30,a)].
% 0.41/0.99 32 -man(A,B) | human_person(A,B) # label(clause3) # label(axiom). [assumption].
% 0.41/0.99 33 -man(A,B) | -unisex(A,B). [resolve(5,b,6,a)].
% 0.41/0.99 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | human_person(skc2,A). [resolve(31,c,32,a)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | -unisex(skc2,A). [resolve(31,c,33,a)].
% 0.71/1.00 34 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | human_person(skc2,A). [resolve(31,c,32,a)].
% 0.71/1.00 35 -human_person(A,B) | organism(A,B) # label(clause4) # label(axiom). [assumption].
% 0.71/1.00 36 -human_person(A,B) | human(A,B) # label(clause12) # label(axiom). [assumption].
% 0.71/1.00 37 -human_person(A,B) | animate(A,B) # label(clause13) # label(axiom). [assumption].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | organism(skc2,A). [resolve(34,c,35,a)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | human(skc2,A). [resolve(34,c,36,a)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | animate(skc2,A). [resolve(34,c,37,a)].
% 0.71/1.00 38 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | organism(skc2,A). [resolve(34,c,35,a)].
% 0.71/1.00 39 -organism(A,B) | entity(A,B) # label(clause5) # label(axiom). [assumption].
% 0.71/1.00 40 -organism(A,B) | impartial(A,B) # label(clause10) # label(axiom). [assumption].
% 0.71/1.00 41 -organism(A,B) | -object(A,B). [resolve(15,b,13,b)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | entity(skc2,A). [resolve(38,c,39,a)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | impartial(skc2,A). [resolve(38,c,40,a)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | -object(skc2,A). [resolve(38,c,41,a)].
% 0.71/1.00 42 -object(A,B) | entity(A,B) # label(clause23) # label(axiom). [assumption].
% 0.71/1.00 43 -entity(A,B) | thing(A,B) # label(clause6) # label(axiom). [assumption].
% 0.71/1.00 44 -entity(A,B) | specific(A,B) # label(clause8) # label(axiom). [assumption].
% 0.71/1.00 45 -entity(A,B) | existent(A,B) # label(clause9) # label(axiom). [assumption].
% 0.71/1.00 Derived: -object(A,B) | thing(A,B). [resolve(42,b,43,a)].
% 0.71/1.00 Derived: -object(A,B) | specific(A,B). [resolve(42,b,44,a)].
% 0.71/1.00 Derived: -object(A,B) | existent(A,B). [resolve(42,b,45,a)].
% 0.71/1.00 46 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | entity(skc2,A). [resolve(38,c,39,a)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | thing(skc2,A). [resolve(46,c,43,a)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | specific(skc2,A). [resolve(46,c,44,a)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | existent(skc2,A). [resolve(46,c,45,a)].
% 0.71/1.00 47 -eventuality(A,B) | thing(A,B) # label(clause29) # label(axiom). [assumption].
% 0.71/1.00 48 -thing(A,B) | singleton(A,B) # label(clause7) # label(axiom). [assumption].
% 0.71/1.00 Derived: -eventuality(A,B) | singleton(A,B). [resolve(47,b,48,a)].
% 0.71/1.00 49 -object(A,B) | thing(A,B). [resolve(42,b,43,a)].
% 0.71/1.00 Derived: -object(A,B) | singleton(A,B). [resolve(49,b,48,a)].
% 0.71/1.00 50 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | thing(skc2,A). [resolve(46,c,43,a)].
% 0.71/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | singleton(skc2,A). [resolve(50,c,48,a)].
% 0.71/1.00 51 -member(skc2,A,skc3) | hamburger(skc2,A) # label(clause55) # label(negated_conjecture). [assumption].
% 0.71/1.00 52 -hamburger(A,B) | burger(A,B) # label(clause18) # label(axiom). [assumption].
% 0.71/1.00 Derived: -member(skc2,A,skc3) | burger(skc2,A). [resolve(51,b,52,a)].
% 0.71/1.00 53 -member(skc2,A,skc3) | burger(skc2,A). [resolve(51,b,52,a)].
% 0.71/1.00 54 -burger(A,B) | meat(A,B) # label(clause19) # label(axiom). [assumption].
% 0.71/1.00 Derived: -member(skc2,A,skc3) | meat(skc2,A). [resolve(53,b,54,a)].
% 0.71/1.00 55 -member(skc2,A,skc3) | meat(skc2,A). [resolve(53,b,54,a)].
% 0.71/1.00 56 -meat(A,B) | food(A,B) # label(clause20) # label(axiom). [assumption].
% 0.71/1.00 Derived: -member(skc2,A,skc3) | food(skc2,A). [resolve(55,b,56,a)].
% 0.71/1.00 57 -member(skc2,A,skc3) | food(skc2,A). [resolve(55,b,56,a)].
% 0.71/1.00 58 -food(A,B) | substance_matter(A,B) # label(clause21) # label(axiom). [assumption].
% 0.71/1.00 Derived: -member(skc2,A,skc3) | substance_matter(skc2,A). [resolve(57,b,58,a)].
% 0.71/1.00 59 -member(skc2,A,skc3) | substance_matter(skc2,A). [resolve(57,b,58,a)].
% 0.71/1.00 60 -substance_matter(A,B) | object(A,B) # label(clause22) # label(axiom). [assumption].
% 0.71/1.00 Derived: -member(skc2,A,skc3) | object(skc2,A). [resolve(59,b,60,a)].
% 0.71/1.00 61 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | sit(skc2,skf10(C,D)) # label(clause61) # label(negated_conjecture). [assumption].
% 0.71/1.00 62 -sit(A,B) | event(A,B) # label(clause27) # label(axiom). [assumption].
% 0.71/1.01 63 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | event(skc2,skf10(C,D)) # label(clause63) # label(negated_conjecture). [assumption].
% 0.71/1.01 64 -event(A,B) | eventuality(A,B) # label(clause28) # label(axiom). [assumption].
% 0.71/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | eventuality(skc2,skf10(C,D)). [resolve(63,c,64,a)].
% 0.71/1.01 65 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | eventuality(skc2,skf10(C,D)). [resolve(63,c,64,a)].
% 0.71/1.01 66 -eventuality(A,B) | specific(A,B) # label(clause30) # label(axiom). [assumption].
% 0.71/1.01 67 -eventuality(A,B) | unisex(A,B) # label(clause32) # label(axiom). [assumption].
% 0.71/1.01 68 -eventuality(A,B) | -existent(A,B). [resolve(11,b,12,a)].
% 0.71/1.01 69 -eventuality(A,B) | singleton(A,B). [resolve(47,b,48,a)].
% 0.71/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | specific(skc2,skf10(C,D)). [resolve(65,c,66,a)].
% 0.71/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | unisex(skc2,skf10(C,D)). [resolve(65,c,67,a)].
% 0.71/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | -existent(skc2,skf10(C,D)). [resolve(65,c,68,a)].
% 0.71/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | singleton(skc2,skf10(C,D)). [resolve(65,c,69,a)].
% 0.71/1.01 70 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | table(skc2,skf11(C,D)) # label(clause60) # label(negated_conjecture). [assumption].
% 0.71/1.01 71 -table(A,B) | furniture(A,B) # label(clause33) # label(axiom). [assumption].
% 0.71/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | furniture(skc2,skf11(C,D)). [resolve(70,c,71,a)].
% 0.71/1.01 72 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | furniture(skc2,skf11(C,D)). [resolve(70,c,71,a)].
% 0.71/1.01 73 -furniture(A,B) | instrumentality(A,B) # label(clause34) # label(axiom). [assumption].
% 0.71/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | instrumentality(skc2,skf11(C,D)). [resolve(72,c,73,a)].
% 0.71/1.01 74 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | instrumentality(skc2,skf11(C,D)). [resolve(72,c,73,a)].
% 0.71/1.01 75 -instrumentality(A,B) | artifact(A,B) # label(clause35) # label(axiom). [assumption].
% 0.71/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | artifact(skc2,skf11(C,D)). [resolve(74,c,75,a)].
% 0.71/1.01 76 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | artifact(skc2,skf11(C,D)). [resolve(74,c,75,a)].
% 0.71/1.01 77 -artifact(A,B) | object(A,B) # label(clause36) # label(axiom). [assumption].
% 0.71/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | object(skc2,skf11(C,D)). [resolve(76,c,77,a)].
% 0.71/1.01 78 -set(A,B) | -singleton(A,B). [resolve(7,b,8,a)].
% 0.71/1.01 79 set(skc2,skc3). [resolve(1,a,2,a)].
% 0.71/1.01 80 -member(skc2,A,skc3) | set(skc2,skf9(B)). [resolve(4,b,1,a)].
% 0.71/1.01 Derived: -singleton(skc2,skc3). [resolve(78,a,79,a)].
% 0.71/1.01 Derived: -singleton(skc2,skf9(A)) | -member(skc2,B,skc3). [resolve(78,a,80,b)].
% 0.71/1.01 81 set(A,B) | skf18(C,D,E,F,V6) != C | -member(A,C,B) | -member(A,V7,B) | -member(A,V8,B) | C = V8 | C = V7 | V7 = V8. [resolve(28,a,24,e)].
% 0.71/1.01 Derived: skf18(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | -singleton(F,V6). [resolve(81,a,78,a)].
% 0.71/1.01 82 set(A,B) | skf18(C,D,E,F,V6) != D | -member(A,C,B) | -member(A,D,B) | -member(A,V7,B) | C = V7 | C = D | D = V7. [resolve(28,a,25,e)].
% 0.71/1.01 Derived: skf18(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | -singleton(F,V6). [resolve(82,a,78,a)].
% 0.71/1.01 83 set(A,B) | skf18(C,D,E,F,V6) != E | -member(A,C,B) | -member(A,D,B) | -member(A,E,B) | C = E | C = D | D = E. [resolve(28,a,26,e)].
% 0.71/1.01 Derived: skf18(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | -singleton(F,V6). [resolve(83,a,78,a)].
% 0.71/1.01 84 set(A,B) | -member(A,C,B) | -member(A,D,B) | -member(A,E,B) | member(A,skf18(C,D,E,B,A),B) | C = E | C = D | D = E. [resolve(28,a,27,d)].
% 0.71/1.01 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf18(B,D,E,C,A),C) | B = E | B = D | D = E | -singleton(A,C). [resolve(84,a,78,a)].
% 0.71/1.01 85 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | animate(skc2,A). [resolve(34,c,37,a)].
% 0.71/1.01 86 -object(A,B) | -animate(A,B). [resolve(13,b,14,a)].
% 0.71/1.01
% 0.71/1.01 ============================== end predicate elimination =============
% 0.81/1.09
% 0.81/1.09 Auto_denials: (non-Horn, no changes).
% 0.81/1.09
% 0.81/1.09 Term ordering decisions:
% 0.81/1.09
% 0.81/1.09 % Assigning unary symbol skf9 kb_weight 0 and highest precedence (15).
% 0.81/1.09 Function symbol KB weights: skc2=1. skc3=1. skf13=1. skf15=1. skf17=1. skf10=1. skf11=1. skf18=1. skf9=0.
% 0.81/1.09
% 0.81/1.09 ============================== end of process initial clauses ========
% 0.81/1.09
% 0.81/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.09
% 0.81/1.09 ============================== end of clauses for search =============
% 0.81/1.09
% 0.81/1.09 ============================== SEARCH ================================
% 0.81/1.09
% 0.81/1.09 % Starting search at 0.07 seconds.
% 0.81/1.09
% 0.81/1.09 ============================== STATISTICS ============================
% 0.81/1.09
% 0.81/1.09 Given=127. Generated=836. Kept=127. proofs=0.
% 0.81/1.09 Usable=127. Sos=0. Demods=0. Limbo=0, Disabled=152. Hints=0.
% 0.81/1.09 Megabytes=0.26.
% 0.81/1.09 User_CPU=0.11, System_CPU=0.00, Wall_clock=0.
% 0.81/1.09
% 0.81/1.09 ============================== end of statistics =====================
% 0.81/1.09
% 0.81/1.09 ============================== end of search =========================
% 0.81/1.09
% 0.81/1.09 SEARCH FAILED
% 0.81/1.09
% 0.81/1.09 Exiting with failure.
% 0.81/1.09
% 0.81/1.09 Process 27380 exit (sos_empty) Thu Jun 30 23:42:39 2022
% 0.81/1.09 Prover9 interrupted
%------------------------------------------------------------------------------