TSTP Solution File: NLP041-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : NLP041-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n015.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:52 EDT 2022

% Result   : Unknown 0.95s 1.18s
% Output   : None 
% Verified : 
% SZS Type : -

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