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