TSTP Solution File: NLP176+1 by Prover9---1109a

View Problem - Process Solution

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

% Computer : n014.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:07:33 EDT 2022

% Result   : Unknown 0.77s 1.10s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NLP176+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jun 30 23:08:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.77/1.03  ============================== Prover9 ===============================
% 0.77/1.03  Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.03  Process 27619 was started by sandbox on n014.cluster.edu,
% 0.77/1.03  Thu Jun 30 23:08:42 2022
% 0.77/1.03  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27466_n014.cluster.edu".
% 0.77/1.03  ============================== end of head ===========================
% 0.77/1.03  
% 0.77/1.03  ============================== INPUT =================================
% 0.77/1.03  
% 0.77/1.03  % Reading from file /tmp/Prover9_27466_n014.cluster.edu
% 0.77/1.03  
% 0.77/1.03  set(prolog_style_variables).
% 0.77/1.03  set(auto2).
% 0.77/1.03      % set(auto2) -> set(auto).
% 0.77/1.03      % set(auto) -> set(auto_inference).
% 0.77/1.03      % set(auto) -> set(auto_setup).
% 0.77/1.03      % set(auto_setup) -> set(predicate_elim).
% 0.77/1.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.03      % set(auto) -> set(auto_limits).
% 0.77/1.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.03      % set(auto) -> set(auto_denials).
% 0.77/1.03      % set(auto) -> set(auto_process).
% 0.77/1.03      % set(auto2) -> assign(new_constants, 1).
% 0.77/1.03      % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.03      % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.03      % set(auto2) -> assign(max_hours, 1).
% 0.77/1.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.03      % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.03      % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.03      % set(auto2) -> set(sort_initial_sos).
% 0.77/1.03      % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.03      % set(auto2) -> assign(max_megs, 400).
% 0.77/1.03      % set(auto2) -> assign(stats, some).
% 0.77/1.03      % set(auto2) -> clear(echo_input).
% 0.77/1.03      % set(auto2) -> set(quiet).
% 0.77/1.03      % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.03      % set(auto2) -> clear(print_given).
% 0.77/1.03  assign(lrs_ticks,-1).
% 0.77/1.03  assign(sos_limit,10000).
% 0.77/1.03  assign(order,kbo).
% 0.77/1.03  set(lex_order_vars).
% 0.77/1.03  clear(print_given).
% 0.77/1.03  
% 0.77/1.03  % formulas(sos).  % not echoed (67 formulas)
% 0.77/1.03  
% 0.77/1.03  ============================== end of input ==========================
% 0.77/1.03  
% 0.77/1.03  % From the command line: assign(max_seconds, 300).
% 0.77/1.03  
% 0.77/1.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.03  
% 0.77/1.03  % Formulas that are not ordinary clauses:
% 0.77/1.03  1 (all U all V (furniture(U,V) -> instrumentality(U,V))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  2 (all U all V (seat(U,V) -> furniture(U,V))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  3 (all U all V (frontseat(U,V) -> seat(U,V))) # label(ax3) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  4 (all U all V (instrumentality(U,V) -> artifact(U,V))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  5 (all U all V (transport(U,V) -> instrumentality(U,V))) # label(ax5) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  6 (all U all V (vehicle(U,V) -> transport(U,V))) # label(ax6) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  7 (all U all V (car(U,V) -> vehicle(U,V))) # label(ax7) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  8 (all U all V (chevy(U,V) -> car(U,V))) # label(ax8) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  9 (all U all V (location(U,V) -> object(U,V))) # label(ax9) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  10 (all U all V (city(U,V) -> location(U,V))) # label(ax10) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  11 (all U all V (hollywood_placename(U,V) -> placename(U,V))) # label(ax11) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  12 (all U all V (abstraction(U,V) -> unisex(U,V))) # label(ax12) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  13 (all U all V (abstraction(U,V) -> general(U,V))) # label(ax13) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  14 (all U all V (abstraction(U,V) -> nonhuman(U,V))) # label(ax14) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  15 (all U all V (abstraction(U,V) -> thing(U,V))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  16 (all U all V (relation(U,V) -> abstraction(U,V))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  17 (all U all V (relname(U,V) -> relation(U,V))) # label(ax17) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  18 (all U all V (placename(U,V) -> relname(U,V))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  19 (all U all V (way(U,V) -> artifact(U,V))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  20 (all U all V (street(U,V) -> way(U,V))) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  21 (all U all V (barrel(U,V) -> event(U,V))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  22 (all U all V (state(U,V) -> event(U,V))) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  23 (all U all V (state(U,V) -> eventuality(U,V))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  24 (all U all V (two(U,V) -> group(U,V))) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  25 (all U all V (man(U,V) -> male(U,V))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  26 (all U all V (human_person(U,V) -> animate(U,V))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  27 (all U all V (human_person(U,V) -> human(U,V))) # label(ax27) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  28 (all U all V (organism(U,V) -> living(U,V))) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  29 (all U all V (organism(U,V) -> impartial(U,V))) # label(ax29) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  30 (all U all V (organism(U,V) -> entity(U,V))) # label(ax30) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  31 (all U all V (human_person(U,V) -> organism(U,V))) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  32 (all U all V (man(U,V) -> human_person(U,V))) # label(ax32) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  33 (all U all V (fellow(U,V) -> man(U,V))) # label(ax33) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  34 (all U all V (eventuality(U,V) -> unisex(U,V))) # label(ax34) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  35 (all U all V (eventuality(U,V) -> nonexistent(U,V))) # label(ax35) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  36 (all U all V (eventuality(U,V) -> specific(U,V))) # label(ax36) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  37 (all U all V (eventuality(U,V) -> thing(U,V))) # label(ax37) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  38 (all U all V (event(U,V) -> eventuality(U,V))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  39 (all U all V (wear(U,V) -> event(U,V))) # label(ax39) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  40 (all U all V (set(U,V) -> multiple(U,V))) # label(ax40) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  41 (all U all V (group(U,V) -> set(U,V))) # label(ax41) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  42 (all U all V (object(U,V) -> unisex(U,V))) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  43 (all U all V (object(U,V) -> impartial(U,V))) # label(ax43) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  44 (all U all V (object(U,V) -> nonliving(U,V))) # label(ax44) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  45 (all U all V (entity(U,V) -> existent(U,V))) # label(ax45) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  46 (all U all V (entity(U,V) -> specific(U,V))) # label(ax46) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  47 (all U all V (thing(U,V) -> singleton(U,V))) # label(ax47) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  48 (all U all V (entity(U,V) -> thing(U,V))) # label(ax48) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  49 (all U all V (object(U,V) -> entity(U,V))) # label(ax49) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  50 (all U all V (artifact(U,V) -> object(U,V))) # label(ax50) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  51 (all U all V (clothes(U,V) -> artifact(U,V))) # label(ax51) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  52 (all U all V (coat(U,V) -> clothes(U,V))) # label(ax52) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  53 (all U all V (animate(U,V) -> -nonliving(U,V))) # label(ax53) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.03  54 (all U all V (existent(U,V) -> -nonexistent(U,V))) # label(ax54) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  55 (all U all V (nonhuman(U,V) -> -human(U,V))) # label(ax55) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  56 (all U all V (nonliving(U,V) -> -living(U,V))) # label(ax56) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  57 (all U all V (singleton(U,V) -> -multiple(U,V))) # label(ax57) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  58 (all U all V (specific(U,V) -> -general(U,V))) # label(ax58) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  59 (all U all V (unisex(U,V) -> -male(U,V))) # label(ax59) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  60 (all U all V (white(U,V) -> -black(U,V))) # label(ax60) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  61 (all U all V (young(U,V) -> -old(U,V))) # label(ax61) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  62 (all U all V all W (entity(U,V) & placename(U,W) & of(U,W,V) -> -(exists X (placename(U,X) & X != W & of(U,X,V))))) # label(ax62) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  63 (all U all V all W all X (be(U,V,W,X) -> W = X)) # label(ax63) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  64 (all U all V (two(U,V) <-> (exists W (member(U,W,V) & (exists X (member(U,X,V) & X != W & (all Y (member(U,Y,V) -> Y = X | Y = W)))))))) # label(ax64) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  65 (all U all V all W all X (nonreflexive(U,V) & agent(U,V,W) & patient(U,V,X) -> W != X)) # label(ax65) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  66 (all U -(exists V member(U,V,V))) # label(ax66) # label(axiom) # label(non_clause).  [assumption].
% 0.77/1.04  67 --(exists U (actual_world(U) & (exists V exists W exists X exists Y exists Z exists X1 exists X2 exists X3 (group(U,V) & frontseat(U,W) & of(U,X,Y) & city(U,Y) & hollywood_placename(U,X) & placename(U,X) & chevy(U,Y) & white(U,Y) & dirty(U,Y) & old(U,Y) & street(U,Z) & lonely(U,Z) & event(U,X1) & agent(U,X1,Y) & present(U,X1) & barrel(U,X1) & down(U,X1,Z) & in(U,X1,Y) & (all X4 (member(U,X4,X2) -> (exists X5 exists X6 (state(U,X5) & be(U,X5,X4,X6) & in(U,X6,W))))) & two(U,X2) & group(U,X2) & (all X7 (member(U,X7,X2) -> fellow(U,X7) & young(U,X7))) & (all X8 (member(U,X8,X3) -> (all X9 (member(U,X9,V) -> (exists X10 (event(U,X10) & agent(U,X10,X9) & patient(U,X10,X8) & present(U,X10) & nonreflexive(U,X10) & wear(U,X10))))))) & group(U,X3) & (all X11 (member(U,X11,X3) -> coat(U,X11) & black(U,X11) & cheap(U,X11))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.77/1.04  
% 0.77/1.04  ============================== end of process non-clausal formulas ===
% 0.77/1.04  
% 0.77/1.04  ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.04  
% 0.77/1.04  ============================== PREDICATE ELIMINATION =================
% 0.77/1.04  68 -seat(A,B) | furniture(A,B) # label(ax2) # label(axiom).  [clausify(2)].
% 0.77/1.04  69 -furniture(A,B) | instrumentality(A,B) # label(ax1) # label(axiom).  [clausify(1)].
% 0.77/1.04  Derived: -seat(A,B) | instrumentality(A,B).  [resolve(68,b,69,a)].
% 0.77/1.04  70 frontseat(c1,c3) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.04  71 -frontseat(A,B) | seat(A,B) # label(ax3) # label(axiom).  [clausify(3)].
% 0.77/1.04  Derived: seat(c1,c3).  [resolve(70,a,71,a)].
% 0.77/1.04  72 -transport(A,B) | instrumentality(A,B) # label(ax5) # label(axiom).  [clausify(5)].
% 0.77/1.04  73 -instrumentality(A,B) | artifact(A,B) # label(ax4) # label(axiom).  [clausify(4)].
% 0.77/1.04  Derived: -transport(A,B) | artifact(A,B).  [resolve(72,b,73,a)].
% 0.77/1.04  74 -seat(A,B) | instrumentality(A,B).  [resolve(68,b,69,a)].
% 0.77/1.04  Derived: -seat(A,B) | artifact(A,B).  [resolve(74,b,73,a)].
% 0.77/1.04  75 -car(A,B) | vehicle(A,B) # label(ax7) # label(axiom).  [clausify(7)].
% 0.77/1.04  76 -vehicle(A,B) | transport(A,B) # label(ax6) # label(axiom).  [clausify(6)].
% 0.77/1.04  Derived: -car(A,B) | transport(A,B).  [resolve(75,b,76,a)].
% 0.77/1.04  77 chevy(c1,c5) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.04  78 -chevy(A,B) | car(A,B) # label(ax8) # label(axiom).  [clausify(8)].
% 0.77/1.04  Derived: car(c1,c5).  [resolve(77,a,78,a)].
% 0.77/1.04  79 -city(A,B) | location(A,B) # label(ax10) # label(axiom).  [clausify(10)].
% 0.77/1.04  80 -location(A,B) | object(A,B) # label(ax9) # label(axiom).  [clausify(9)].
% 0.77/1.04  Derived: -city(A,B) | object(A,B).  [resolve(79,b,80,a)].
% 0.77/1.04  81 hollywood_placename(c1,c4) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.04  82 -hollywood_placename(A,B) | placename(A,B) # label(ax11) # label(axiom).  [clausify(11)].
% 0.77/1.04  83 -relation(A,B) | abstraction(A,B) # label(ax16) # label(axiom).  [clausify(16)].
% 0.77/1.04  84 -abstraction(A,B) | unisex(A,B) # label(ax12) # label(axiom).  [clausify(12)].
% 0.77/1.04  85 -abstraction(A,B) | general(A,B) # label(ax13) # label(axiom).  [clausify(13)].
% 0.77/1.04  86 -abstraction(A,B) | nonhuman(A,B) # label(ax14) # label(axiom).  [clausify(14)].
% 0.77/1.04  87 -abstraction(A,B) | thing(A,B) # label(ax15) # label(axiom).  [clausify(15)].
% 0.77/1.04  Derived: -relation(A,B) | unisex(A,B).  [resolve(83,b,84,a)].
% 0.77/1.04  Derived: -relation(A,B) | general(A,B).  [resolve(83,b,85,a)].
% 0.77/1.04  Derived: -relation(A,B) | nonhuman(A,B).  [resolve(83,b,86,a)].
% 0.77/1.04  Derived: -relation(A,B) | thing(A,B).  [resolve(83,b,87,a)].
% 0.77/1.04  88 -placename(A,B) | relname(A,B) # label(ax18) # label(axiom).  [clausify(18)].
% 0.77/1.04  89 -relname(A,B) | relation(A,B) # label(ax17) # label(axiom).  [clausify(17)].
% 0.77/1.04  Derived: -placename(A,B) | relation(A,B).  [resolve(88,b,89,a)].
% 0.77/1.04  90 -street(A,B) | way(A,B) # label(ax20) # label(axiom).  [clausify(20)].
% 0.77/1.04  91 -way(A,B) | artifact(A,B) # label(ax19) # label(axiom).  [clausify(19)].
% 0.77/1.04  Derived: -street(A,B) | artifact(A,B).  [resolve(90,b,91,a)].
% 0.77/1.04  92 barrel(c1,c7) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.04  93 -barrel(A,B) | event(A,B) # label(ax21) # label(axiom).  [clausify(21)].
% 0.77/1.04  Derived: event(c1,c7).  [resolve(92,a,93,a)].
% 0.77/1.04  94 -member(c1,A,c8) | state(c1,f4(A)) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.04  95 -state(A,B) | event(A,B) # label(ax22) # label(axiom).  [clausify(22)].
% 0.77/1.04  96 -state(A,B) | eventuality(A,B) # label(ax23) # label(axiom).  [clausify(23)].
% 0.77/1.04  Derived: -member(c1,A,c8) | event(c1,f4(A)).  [resolve(94,b,95,a)].
% 0.77/1.04  Derived: -member(c1,A,c8) | eventuality(c1,f4(A)).  [resolve(94,b,96,a)].
% 0.77/1.04  97 two(A,B) | -member(A,C,B) | -member(A,D,B) | D = C | member(A,f3(A,B,C,D),B) # label(ax64) # label(axiom).  [clausify(64)].
% 0.77/1.04  98 -two(A,B) | group(A,B) # label(ax24) # label(axiom).  [clausify(24)].
% 0.77/1.04  99 -two(A,B) | member(A,f1(A,B),B) # label(ax64) # label(axiom).  [clausify(64)].
% 0.77/1.04  100 -two(A,B) | member(A,f2(A,B),B) # label(ax64) # label(axiom).  [clausify(64)].
% 0.77/1.04  101 -two(A,B) | f2(A,B) != f1(A,B) # label(ax64) # label(axiom).  [clausify(64)].
% 0.77/1.04  102 -two(A,B) | -member(A,C,B) | C = f2(A,B) | C = f1(A,B) # label(ax64) # label(axiom).  [clausify(64)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | member(A,f3(A,C,B,D),C) | group(A,C).  [resolve(97,a,98,a)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | member(A,f3(A,C,B,D),C) | member(A,f1(A,C),C).  [resolve(97,a,99,a)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | member(A,f3(A,C,B,D),C) | member(A,f2(A,C),C).  [resolve(97,a,100,a)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | member(A,f3(A,C,B,D),C) | f2(A,C) != f1(A,C).  [resolve(97,a,101,a)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | member(A,f3(A,C,B,D),C) | -member(A,E,C) | E = f2(A,C) | E = f1(A,C).  [resolve(97,a,102,a)].
% 0.77/1.04  103 two(A,B) | -member(A,C,B) | -member(A,D,B) | D = C | f3(A,B,C,D) != D # label(ax64) # label(axiom).  [clausify(64)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != D | group(A,C).  [resolve(103,a,98,a)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != D | member(A,f1(A,C),C).  [resolve(103,a,99,a)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != D | member(A,f2(A,C),C).  [resolve(103,a,100,a)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != D | f2(A,C) != f1(A,C).  [resolve(103,a,101,a)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != D | -member(A,E,C) | E = f2(A,C) | E = f1(A,C).  [resolve(103,a,102,a)].
% 0.77/1.04  104 two(A,B) | -member(A,C,B) | -member(A,D,B) | D = C | f3(A,B,C,D) != C # label(ax64) # label(axiom).  [clausify(64)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != B | group(A,C).  [resolve(104,a,98,a)].
% 0.77/1.04  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != B | member(A,f1(A,C),C).  [resolve(104,a,99,a)].
% 0.77/1.05  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != B | member(A,f2(A,C),C).  [resolve(104,a,100,a)].
% 0.77/1.05  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != B | f2(A,C) != f1(A,C).  [resolve(104,a,101,a)].
% 0.77/1.05  Derived: -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != B | -member(A,E,C) | E = f2(A,C) | E = f1(A,C).  [resolve(104,a,102,a)].
% 0.77/1.05  105 two(c1,c8) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.05  Derived: member(c1,f1(c1,c8),c8).  [resolve(105,a,99,a)].
% 0.77/1.05  Derived: member(c1,f2(c1,c8),c8).  [resolve(105,a,100,a)].
% 0.77/1.05  Derived: f2(c1,c8) != f1(c1,c8).  [resolve(105,a,101,a)].
% 0.77/1.05  Derived: -member(c1,A,c8) | A = f2(c1,c8) | A = f1(c1,c8).  [resolve(105,a,102,a)].
% 0.77/1.05  106 -fellow(A,B) | man(A,B) # label(ax33) # label(axiom).  [clausify(33)].
% 0.77/1.05  107 -man(A,B) | male(A,B) # label(ax25) # label(axiom).  [clausify(25)].
% 0.77/1.05  108 -man(A,B) | human_person(A,B) # label(ax32) # label(axiom).  [clausify(32)].
% 0.77/1.05  Derived: -fellow(A,B) | male(A,B).  [resolve(106,b,107,a)].
% 0.77/1.05  Derived: -fellow(A,B) | human_person(A,B).  [resolve(106,b,108,a)].
% 0.77/1.05  109 -fellow(A,B) | human_person(A,B).  [resolve(106,b,108,a)].
% 0.77/1.05  110 -human_person(A,B) | animate(A,B) # label(ax26) # label(axiom).  [clausify(26)].
% 0.77/1.05  111 -human_person(A,B) | human(A,B) # label(ax27) # label(axiom).  [clausify(27)].
% 0.77/1.05  112 -human_person(A,B) | organism(A,B) # label(ax31) # label(axiom).  [clausify(31)].
% 0.77/1.05  Derived: -fellow(A,B) | animate(A,B).  [resolve(109,b,110,a)].
% 0.77/1.05  Derived: -fellow(A,B) | human(A,B).  [resolve(109,b,111,a)].
% 0.77/1.05  Derived: -fellow(A,B) | organism(A,B).  [resolve(109,b,112,a)].
% 0.77/1.05  113 -fellow(A,B) | organism(A,B).  [resolve(109,b,112,a)].
% 0.77/1.05  114 -organism(A,B) | living(A,B) # label(ax28) # label(axiom).  [clausify(28)].
% 0.77/1.05  115 -organism(A,B) | impartial(A,B) # label(ax29) # label(axiom).  [clausify(29)].
% 0.77/1.05  116 -organism(A,B) | entity(A,B) # label(ax30) # label(axiom).  [clausify(30)].
% 0.77/1.05  Derived: -fellow(A,B) | living(A,B).  [resolve(113,b,114,a)].
% 0.77/1.05  Derived: -fellow(A,B) | impartial(A,B).  [resolve(113,b,115,a)].
% 0.77/1.05  Derived: -fellow(A,B) | entity(A,B).  [resolve(113,b,116,a)].
% 0.77/1.05  117 -event(A,B) | eventuality(A,B) # label(ax38) # label(axiom).  [clausify(38)].
% 0.77/1.05  118 -eventuality(A,B) | unisex(A,B) # label(ax34) # label(axiom).  [clausify(34)].
% 0.77/1.05  119 -eventuality(A,B) | nonexistent(A,B) # label(ax35) # label(axiom).  [clausify(35)].
% 0.77/1.05  120 -eventuality(A,B) | specific(A,B) # label(ax36) # label(axiom).  [clausify(36)].
% 0.77/1.05  121 -eventuality(A,B) | thing(A,B) # label(ax37) # label(axiom).  [clausify(37)].
% 0.77/1.05  Derived: -event(A,B) | unisex(A,B).  [resolve(117,b,118,a)].
% 0.77/1.05  Derived: -event(A,B) | nonexistent(A,B).  [resolve(117,b,119,a)].
% 0.77/1.05  Derived: -event(A,B) | specific(A,B).  [resolve(117,b,120,a)].
% 0.77/1.05  Derived: -event(A,B) | thing(A,B).  [resolve(117,b,121,a)].
% 0.77/1.05  122 -member(c1,A,c8) | eventuality(c1,f4(A)).  [resolve(94,b,96,a)].
% 0.77/1.05  Derived: -member(c1,A,c8) | unisex(c1,f4(A)).  [resolve(122,b,118,a)].
% 0.77/1.05  Derived: -member(c1,A,c8) | nonexistent(c1,f4(A)).  [resolve(122,b,119,a)].
% 0.77/1.05  Derived: -member(c1,A,c8) | specific(c1,f4(A)).  [resolve(122,b,120,a)].
% 0.77/1.05  Derived: -member(c1,A,c8) | thing(c1,f4(A)).  [resolve(122,b,121,a)].
% 0.77/1.05  123 -member(c1,A,c9) | -member(c1,B,c2) | wear(c1,f6(A,B)) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.05  124 -wear(A,B) | event(A,B) # label(ax39) # label(axiom).  [clausify(39)].
% 0.77/1.05  Derived: -member(c1,A,c9) | -member(c1,B,c2) | event(c1,f6(A,B)).  [resolve(123,c,124,a)].
% 0.77/1.05  125 -group(A,B) | set(A,B) # label(ax41) # label(axiom).  [clausify(41)].
% 0.77/1.05  126 -set(A,B) | multiple(A,B) # label(ax40) # label(axiom).  [clausify(40)].
% 0.77/1.05  Derived: -group(A,B) | multiple(A,B).  [resolve(125,b,126,a)].
% 0.77/1.05  127 -artifact(A,B) | object(A,B) # label(ax50) # label(axiom).  [clausify(50)].
% 0.77/1.05  128 -object(A,B) | unisex(A,B) # label(ax42) # label(axiom).  [clausify(42)].
% 0.77/1.05  129 -object(A,B) | impartial(A,B) # label(ax43) # label(axiom).  [clausify(43)].
% 0.77/1.05  130 -object(A,B) | nonliving(A,B) # label(ax44) # label(axiom).  [clausify(44)].
% 0.77/1.05  131 -object(A,B) | entity(A,B) # label(ax49) # label(axiom).  [clausify(49)].
% 0.77/1.05  Derived: -artifact(A,B) | unisex(A,B).  [resolve(127,b,128,a)].
% 0.77/1.06  Derived: -artifact(A,B) | impartial(A,B).  [resolve(127,b,129,a)].
% 0.77/1.06  Derived: -artifact(A,B) | nonliving(A,B).  [resolve(127,b,130,a)].
% 0.77/1.06  Derived: -artifact(A,B) | entity(A,B).  [resolve(127,b,131,a)].
% 0.77/1.06  132 -city(A,B) | object(A,B).  [resolve(79,b,80,a)].
% 0.77/1.06  Derived: -city(A,B) | unisex(A,B).  [resolve(132,b,128,a)].
% 0.77/1.06  Derived: -city(A,B) | impartial(A,B).  [resolve(132,b,129,a)].
% 0.77/1.06  Derived: -city(A,B) | nonliving(A,B).  [resolve(132,b,130,a)].
% 0.77/1.06  Derived: -city(A,B) | entity(A,B).  [resolve(132,b,131,a)].
% 0.77/1.06  133 -fellow(A,B) | entity(A,B).  [resolve(113,b,116,a)].
% 0.77/1.06  134 -entity(A,B) | existent(A,B) # label(ax45) # label(axiom).  [clausify(45)].
% 0.77/1.06  135 -entity(A,B) | specific(A,B) # label(ax46) # label(axiom).  [clausify(46)].
% 0.77/1.06  136 -entity(A,B) | thing(A,B) # label(ax48) # label(axiom).  [clausify(48)].
% 0.77/1.06  137 -entity(A,B) | -placename(A,C) | -of(A,C,B) | -placename(A,D) | D = C | -of(A,D,B) # label(ax62) # label(axiom).  [clausify(62)].
% 0.77/1.06  Derived: -fellow(A,B) | existent(A,B).  [resolve(133,b,134,a)].
% 0.77/1.06  Derived: -fellow(A,B) | specific(A,B).  [resolve(133,b,135,a)].
% 0.77/1.06  Derived: -fellow(A,B) | thing(A,B).  [resolve(133,b,136,a)].
% 0.77/1.06  Derived: -fellow(A,B) | -placename(A,C) | -of(A,C,B) | -placename(A,D) | D = C | -of(A,D,B).  [resolve(133,b,137,a)].
% 0.77/1.06  138 -artifact(A,B) | entity(A,B).  [resolve(127,b,131,a)].
% 0.77/1.06  Derived: -artifact(A,B) | existent(A,B).  [resolve(138,b,134,a)].
% 0.77/1.06  Derived: -artifact(A,B) | specific(A,B).  [resolve(138,b,135,a)].
% 0.77/1.06  Derived: -artifact(A,B) | thing(A,B).  [resolve(138,b,136,a)].
% 0.77/1.06  Derived: -artifact(A,B) | -placename(A,C) | -of(A,C,B) | -placename(A,D) | D = C | -of(A,D,B).  [resolve(138,b,137,a)].
% 0.77/1.06  139 -city(A,B) | entity(A,B).  [resolve(132,b,131,a)].
% 0.77/1.06  Derived: -city(A,B) | existent(A,B).  [resolve(139,b,134,a)].
% 0.77/1.06  Derived: -city(A,B) | specific(A,B).  [resolve(139,b,135,a)].
% 0.77/1.06  Derived: -city(A,B) | thing(A,B).  [resolve(139,b,136,a)].
% 0.77/1.06  Derived: -city(A,B) | -placename(A,C) | -of(A,C,B) | -placename(A,D) | D = C | -of(A,D,B).  [resolve(139,b,137,a)].
% 0.77/1.06  140 -relation(A,B) | thing(A,B).  [resolve(83,b,87,a)].
% 0.77/1.06  141 -thing(A,B) | singleton(A,B) # label(ax47) # label(axiom).  [clausify(47)].
% 0.77/1.06  Derived: -relation(A,B) | singleton(A,B).  [resolve(140,b,141,a)].
% 0.77/1.06  142 -event(A,B) | thing(A,B).  [resolve(117,b,121,a)].
% 0.77/1.06  Derived: -event(A,B) | singleton(A,B).  [resolve(142,b,141,a)].
% 0.77/1.06  143 -member(c1,A,c8) | thing(c1,f4(A)).  [resolve(122,b,121,a)].
% 0.77/1.06  Derived: -member(c1,A,c8) | singleton(c1,f4(A)).  [resolve(143,b,141,a)].
% 0.77/1.06  144 -fellow(A,B) | thing(A,B).  [resolve(133,b,136,a)].
% 0.77/1.06  Derived: -fellow(A,B) | singleton(A,B).  [resolve(144,b,141,a)].
% 0.77/1.06  145 -artifact(A,B) | thing(A,B).  [resolve(138,b,136,a)].
% 0.77/1.06  Derived: -artifact(A,B) | singleton(A,B).  [resolve(145,b,141,a)].
% 0.77/1.06  146 -city(A,B) | thing(A,B).  [resolve(139,b,136,a)].
% 0.77/1.06  Derived: -city(A,B) | singleton(A,B).  [resolve(146,b,141,a)].
% 0.77/1.06  147 -coat(A,B) | clothes(A,B) # label(ax52) # label(axiom).  [clausify(52)].
% 0.77/1.06  148 -clothes(A,B) | artifact(A,B) # label(ax51) # label(axiom).  [clausify(51)].
% 0.77/1.06  Derived: -coat(A,B) | artifact(A,B).  [resolve(147,b,148,a)].
% 0.77/1.06  149 -fellow(A,B) | animate(A,B).  [resolve(109,b,110,a)].
% 0.77/1.06  150 -animate(A,B) | -nonliving(A,B) # label(ax53) # label(axiom).  [clausify(53)].
% 0.77/1.06  Derived: -fellow(A,B) | -nonliving(A,B).  [resolve(149,b,150,a)].
% 0.77/1.06  151 -fellow(A,B) | existent(A,B).  [resolve(133,b,134,a)].
% 0.77/1.06  152 -existent(A,B) | -nonexistent(A,B) # label(ax54) # label(axiom).  [clausify(54)].
% 0.77/1.06  Derived: -fellow(A,B) | -nonexistent(A,B).  [resolve(151,b,152,a)].
% 0.77/1.06  153 -artifact(A,B) | existent(A,B).  [resolve(138,b,134,a)].
% 0.77/1.06  Derived: -artifact(A,B) | -nonexistent(A,B).  [resolve(153,b,152,a)].
% 0.77/1.06  154 -city(A,B) | existent(A,B).  [resolve(139,b,134,a)].
% 0.77/1.06  Derived: -city(A,B) | -nonexistent(A,B).  [resolve(154,b,152,a)].
% 0.77/1.06  155 -relation(A,B) | nonhuman(A,B).  [resolve(83,b,86,a)].
% 0.77/1.06  156 -nonhuman(A,B) | -human(A,B) # label(ax55) # label(axiom).  [clausify(55)].
% 0.77/1.06  Derived: -relation(A,B) | -human(A,B).  [resolve(155,b,156,a)].
% 0.77/1.06  157 -artifact(A,B) | nonliving(A,B).  [resolve(127,b,130,a)].
% 0.77/1.06  158 -nonliving(A,B) | -living(A,B) # label(ax56) # label(axiom).  [clausify(56)].
% 0.77/1.06  Derived: -artifact(A,B) | -living(A,B).  [resolve(157,b,158,a)].
% 0.77/1.07  159 -city(A,B) | nonliving(A,B).  [resolve(132,b,130,a)].
% 0.77/1.07  Derived: -city(A,B) | -living(A,B).  [resolve(159,b,158,a)].
% 0.77/1.07  160 -fellow(A,B) | -nonliving(A,B).  [resolve(149,b,150,a)].
% 0.77/1.07  Derived: -fellow(A,B) | -artifact(A,B).  [resolve(160,b,157,b)].
% 0.77/1.07  Derived: -fellow(A,B) | -city(A,B).  [resolve(160,b,159,b)].
% 0.77/1.07  161 -relation(A,B) | singleton(A,B).  [resolve(140,b,141,a)].
% 0.77/1.07  162 -singleton(A,B) | -multiple(A,B) # label(ax57) # label(axiom).  [clausify(57)].
% 0.77/1.07  Derived: -relation(A,B) | -multiple(A,B).  [resolve(161,b,162,a)].
% 0.77/1.07  163 -event(A,B) | singleton(A,B).  [resolve(142,b,141,a)].
% 0.77/1.07  Derived: -event(A,B) | -multiple(A,B).  [resolve(163,b,162,a)].
% 0.77/1.07  164 -member(c1,A,c8) | singleton(c1,f4(A)).  [resolve(143,b,141,a)].
% 0.77/1.07  Derived: -member(c1,A,c8) | -multiple(c1,f4(A)).  [resolve(164,b,162,a)].
% 0.77/1.07  165 -fellow(A,B) | singleton(A,B).  [resolve(144,b,141,a)].
% 0.77/1.07  Derived: -fellow(A,B) | -multiple(A,B).  [resolve(165,b,162,a)].
% 0.77/1.07  166 -artifact(A,B) | singleton(A,B).  [resolve(145,b,141,a)].
% 0.77/1.07  Derived: -artifact(A,B) | -multiple(A,B).  [resolve(166,b,162,a)].
% 0.77/1.07  167 -city(A,B) | singleton(A,B).  [resolve(146,b,141,a)].
% 0.77/1.07  Derived: -city(A,B) | -multiple(A,B).  [resolve(167,b,162,a)].
% 0.77/1.07  168 -event(A,B) | specific(A,B).  [resolve(117,b,120,a)].
% 0.77/1.07  169 -specific(A,B) | -general(A,B) # label(ax58) # label(axiom).  [clausify(58)].
% 0.77/1.07  Derived: -event(A,B) | -general(A,B).  [resolve(168,b,169,a)].
% 0.77/1.07  170 -member(c1,A,c8) | specific(c1,f4(A)).  [resolve(122,b,120,a)].
% 0.77/1.07  Derived: -member(c1,A,c8) | -general(c1,f4(A)).  [resolve(170,b,169,a)].
% 0.77/1.07  171 -fellow(A,B) | specific(A,B).  [resolve(133,b,135,a)].
% 0.77/1.07  Derived: -fellow(A,B) | -general(A,B).  [resolve(171,b,169,a)].
% 0.77/1.07  172 -artifact(A,B) | specific(A,B).  [resolve(138,b,135,a)].
% 0.77/1.07  Derived: -artifact(A,B) | -general(A,B).  [resolve(172,b,169,a)].
% 0.77/1.07  173 -city(A,B) | specific(A,B).  [resolve(139,b,135,a)].
% 0.77/1.07  Derived: -city(A,B) | -general(A,B).  [resolve(173,b,169,a)].
% 0.77/1.07  174 -relation(A,B) | unisex(A,B).  [resolve(83,b,84,a)].
% 0.77/1.07  175 -unisex(A,B) | -male(A,B) # label(ax59) # label(axiom).  [clausify(59)].
% 0.77/1.07  Derived: -relation(A,B) | -male(A,B).  [resolve(174,b,175,a)].
% 0.77/1.07  176 -event(A,B) | unisex(A,B).  [resolve(117,b,118,a)].
% 0.77/1.07  Derived: -event(A,B) | -male(A,B).  [resolve(176,b,175,a)].
% 0.77/1.07  177 -member(c1,A,c8) | unisex(c1,f4(A)).  [resolve(122,b,118,a)].
% 0.77/1.07  Derived: -member(c1,A,c8) | -male(c1,f4(A)).  [resolve(177,b,175,a)].
% 0.77/1.07  178 -artifact(A,B) | unisex(A,B).  [resolve(127,b,128,a)].
% 0.77/1.07  Derived: -artifact(A,B) | -male(A,B).  [resolve(178,b,175,a)].
% 0.77/1.07  179 -city(A,B) | unisex(A,B).  [resolve(132,b,128,a)].
% 0.77/1.07  Derived: -city(A,B) | -male(A,B).  [resolve(179,b,175,a)].
% 0.77/1.07  180 white(c1,c5) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.07  181 -white(A,B) | -black(A,B) # label(ax60) # label(axiom).  [clausify(60)].
% 0.77/1.07  Derived: -black(c1,c5).  [resolve(180,a,181,a)].
% 0.77/1.07  182 -member(c1,A,c8) | young(c1,A) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.07  183 -young(A,B) | -old(A,B) # label(ax61) # label(axiom).  [clausify(61)].
% 0.77/1.07  Derived: -member(c1,A,c8) | -old(c1,A).  [resolve(182,b,183,a)].
% 0.77/1.07  184 -member(c1,A,c8) | be(c1,f4(A),A,f5(A)) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.07  185 -be(A,B,C,D) | D = C # label(ax63) # label(axiom).  [clausify(63)].
% 0.77/1.07  Derived: -member(c1,A,c8) | f5(A) = A.  [resolve(184,b,185,a)].
% 0.77/1.07  186 -member(c1,A,c9) | -member(c1,B,c2) | nonreflexive(c1,f6(A,B)) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.07  187 -nonreflexive(A,B) | -agent(A,B,C) | -patient(A,B,D) | D != C # label(ax65) # label(axiom).  [clausify(65)].
% 0.77/1.07  Derived: -member(c1,A,c9) | -member(c1,B,c2) | -agent(c1,f6(A,B),C) | -patient(c1,f6(A,B),D) | D != C.  [resolve(186,c,187,a)].
% 0.77/1.07  188 -group(A,B) | multiple(A,B).  [resolve(125,b,126,a)].
% 0.77/1.07  189 group(c1,c2) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.07  190 group(c1,c8) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.07  191 group(c1,c9) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.07  192 -member(A,B,C) | -member(A,D,C) | D = B | member(A,f3(A,C,B,D),C) | group(A,C).  [resolve(97,a,98,a)].
% 0.77/1.07  193 -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != D | group(A,C).  [resolve(103,a,98,a)].
% 0.77/1.08  194 -member(A,B,C) | -member(A,D,C) | D = B | f3(A,C,B,D) != B | group(A,C).  [resolve(104,a,98,a)].
% 0.77/1.08  Derived: multiple(c1,c2).  [resolve(188,a,189,a)].
% 0.77/1.08  Derived: multiple(c1,c8).  [resolve(188,a,190,a)].
% 0.77/1.08  Derived: multiple(c1,c9).  [resolve(188,a,191,a)].
% 0.77/1.08  Derived: multiple(A,B) | -member(A,C,B) | -member(A,D,B) | D = C | member(A,f3(A,B,C,D),B).  [resolve(188,a,192,e)].
% 0.77/1.08  Derived: multiple(A,B) | -member(A,C,B) | -member(A,D,B) | D = C | f3(A,B,C,D) != D.  [resolve(188,a,193,e)].
% 0.77/1.08  Derived: multiple(A,B) | -member(A,C,B) | -member(A,D,B) | D = C | f3(A,B,C,D) != C.  [resolve(188,a,194,e)].
% 0.77/1.08  195 -city(A,B) | impartial(A,B).  [resolve(132,b,129,a)].
% 0.77/1.08  196 city(c1,c5) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.08  Derived: impartial(c1,c5).  [resolve(195,a,196,a)].
% 0.77/1.08  197 -city(A,B) | -placename(A,C) | -of(A,C,B) | -placename(A,D) | D = C | -of(A,D,B).  [resolve(139,b,137,a)].
% 0.77/1.08  Derived: -placename(c1,A) | -of(c1,A,c5) | -placename(c1,B) | B = A | -of(c1,B,c5).  [resolve(197,a,196,a)].
% 0.77/1.08  198 -city(A,B) | -nonexistent(A,B).  [resolve(154,b,152,a)].
% 0.77/1.08  Derived: -nonexistent(c1,c5).  [resolve(198,a,196,a)].
% 0.77/1.08  199 -city(A,B) | -living(A,B).  [resolve(159,b,158,a)].
% 0.77/1.08  Derived: -living(c1,c5).  [resolve(199,a,196,a)].
% 0.77/1.08  200 -fellow(A,B) | -city(A,B).  [resolve(160,b,159,b)].
% 0.77/1.08  Derived: -fellow(c1,c5).  [resolve(200,b,196,a)].
% 0.77/1.08  201 -city(A,B) | -multiple(A,B).  [resolve(167,b,162,a)].
% 0.77/1.08  Derived: -multiple(c1,c5).  [resolve(201,a,196,a)].
% 0.77/1.08  202 -city(A,B) | -general(A,B).  [resolve(173,b,169,a)].
% 0.77/1.08  Derived: -general(c1,c5).  [resolve(202,a,196,a)].
% 0.77/1.08  203 -city(A,B) | -male(A,B).  [resolve(179,b,175,a)].
% 0.77/1.08  Derived: -male(c1,c5).  [resolve(203,a,196,a)].
% 0.77/1.08  204 -street(A,B) | artifact(A,B).  [resolve(90,b,91,a)].
% 0.77/1.08  205 street(c1,c6) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.08  Derived: artifact(c1,c6).  [resolve(204,a,205,a)].
% 0.77/1.08  206 -event(A,B) | nonexistent(A,B).  [resolve(117,b,119,a)].
% 0.77/1.08  207 event(c1,c7) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.08  208 -member(c1,A,c9) | -member(c1,B,c2) | event(c1,f6(A,B)) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.08  209 event(c1,c7).  [resolve(92,a,93,a)].
% 0.77/1.08  210 -member(c1,A,c8) | event(c1,f4(A)).  [resolve(94,b,95,a)].
% 0.77/1.08  Derived: nonexistent(c1,c7).  [resolve(206,a,207,a)].
% 0.77/1.08  Derived: nonexistent(c1,f6(A,B)) | -member(c1,A,c9) | -member(c1,B,c2).  [resolve(206,a,208,c)].
% 0.77/1.08  211 -member(c1,A,c9) | -member(c1,B,c2) | event(c1,f6(A,B)).  [resolve(123,c,124,a)].
% 0.77/1.08  212 -event(A,B) | -multiple(A,B).  [resolve(163,b,162,a)].
% 0.77/1.08  Derived: -multiple(c1,c7).  [resolve(212,a,207,a)].
% 0.77/1.08  Derived: -multiple(c1,f6(A,B)) | -member(c1,A,c9) | -member(c1,B,c2).  [resolve(212,a,208,c)].
% 0.77/1.08  213 -event(A,B) | -general(A,B).  [resolve(168,b,169,a)].
% 0.77/1.08  Derived: -general(c1,c7).  [resolve(213,a,207,a)].
% 0.77/1.08  Derived: -general(c1,f6(A,B)) | -member(c1,A,c9) | -member(c1,B,c2).  [resolve(213,a,208,c)].
% 0.77/1.08  214 -event(A,B) | -male(A,B).  [resolve(176,b,175,a)].
% 0.77/1.08  Derived: -male(c1,c7).  [resolve(214,a,207,a)].
% 0.77/1.08  Derived: -male(c1,f6(A,B)) | -member(c1,A,c9) | -member(c1,B,c2).  [resolve(214,a,208,c)].
% 0.77/1.08  215 -coat(A,B) | artifact(A,B).  [resolve(147,b,148,a)].
% 0.77/1.08  216 -member(c1,A,c9) | coat(c1,A) # label(co1) # label(negated_conjecture).  [clausify(67)].
% 0.77/1.08  Derived: artifact(c1,A) | -member(c1,A,c9).  [resolve(215,a,216,b)].
% 0.77/1.08  217 -seat(A,B) | artifact(A,B).  [resolve(74,b,73,a)].
% 0.77/1.08  218 seat(c1,c3).  [resolve(70,a,71,a)].
% 0.77/1.08  Derived: artifact(c1,c3).  [resolve(217,a,218,a)].
% 0.77/1.08  219 -car(A,B) | transport(A,B).  [resolve(75,b,76,a)].
% 0.77/1.08  220 -transport(A,B) | artifact(A,B).  [resolve(72,b,73,a)].
% 0.77/1.08  Derived: -car(A,B) | artifact(A,B).  [resolve(219,b,220,a)].
% 0.77/1.08  221 -car(A,B) | artifact(A,B).  [resolve(219,b,220,a)].
% 0.77/1.08  222 car(c1,c5).  [resolve(77,a,78,a)].
% 0.77/1.08  Derived: artifact(c1,c5).  [resolve(221,a,222,a)].
% 0.77/1.08  223 -placename(A,B) | relation(A,B).  [resolve(88,b,89,a)].
% 0.77/1.08  224 -relation(A,B) | general(A,B).  [resolve(83,b,85,a)].
% 0.77/1.08  Derived: -placename(A,B) | general(A,B).  [resolve(223,b,224,a)].
% 0.77/1.08  225 -relation(A,B) | -human(A,B).  [resolve(155,b,156,a)].
% 0.77/1.08  Derived: -human(A,B) | -placename(A,B).  [resolve(225,a,223,b)].
% 0.77/1.08  226 -relation(A,B) | -multiple(A,B).  [resolve(161,b,162,a)].
% 0.77/1.08  Derived: -multiple(A,B) | -placename(A,B).  [resolve(226,a,223,b)].
% 0.77/1.10  227 -relation(A,B) | -male(A,B).  [resolve(174,b,175,a)].
% 0.77/1.10  Derived: -male(A,B) | -placename(A,B).  [resolve(227,a,223,b)].
% 0.77/1.10  228 -human(A,B) | -placename(A,B).  [resolve(225,a,223,b)].
% 0.77/1.10  229 -fellow(A,B) | human(A,B).  [resolve(109,b,111,a)].
% 0.77/1.10  Derived: -placename(A,B) | -fellow(A,B).  [resolve(228,a,229,b)].
% 0.77/1.10  230 artifact(c1,c6).  [resolve(204,a,205,a)].
% 0.77/1.10  231 -artifact(A,B) | -placename(A,C) | -of(A,C,B) | -placename(A,D) | D = C | -of(A,D,B).  [resolve(138,b,137,a)].
% 0.77/1.10  232 -artifact(A,B) | -nonexistent(A,B).  [resolve(153,b,152,a)].
% 0.77/1.10  233 -artifact(A,B) | -living(A,B).  [resolve(157,b,158,a)].
% 0.77/1.10  234 -fellow(A,B) | -artifact(A,B).  [resolve(160,b,157,b)].
% 0.77/1.10  235 -artifact(A,B) | -multiple(A,B).  [resolve(166,b,162,a)].
% 0.77/1.10  236 -artifact(A,B) | -general(A,B).  [resolve(172,b,169,a)].
% 0.77/1.10  237 -artifact(A,B) | -male(A,B).  [resolve(178,b,175,a)].
% 0.77/1.10  Derived: -placename(c1,A) | -of(c1,A,c6) | -placename(c1,B) | B = A | -of(c1,B,c6).  [resolve(230,a,231,a)].
% 0.77/1.10  Derived: -nonexistent(c1,c6).  [resolve(230,a,232,a)].
% 0.77/1.10  Derived: -living(c1,c6).  [resolve(230,a,233,a)].
% 0.77/1.10  Derived: -fellow(c1,c6).  [resolve(230,a,234,b)].
% 0.77/1.10  Derived: -multiple(c1,c6).  [resolve(230,a,235,a)].
% 0.77/1.10  Derived: -general(c1,c6).  [resolve(230,a,236,a)].
% 0.77/1.10  Derived: -male(c1,c6).  [resolve(230,a,237,a)].
% 0.77/1.10  238 artifact(c1,A) | -member(c1,A,c9).  [resolve(215,a,216,b)].
% 0.77/1.10  Derived: -member(c1,A,c9) | -placename(c1,B) | -of(c1,B,A) | -placename(c1,C) | C = B | -of(c1,C,A).  [resolve(238,a,231,a)].
% 0.77/1.10  Derived: -member(c1,A,c9) | -nonexistent(c1,A).  [resolve(238,a,232,a)].
% 0.77/1.10  Derived: -member(c1,A,c9) | -living(c1,A).  [resolve(238,a,233,a)].
% 0.77/1.10  Derived: -member(c1,A,c9) | -fellow(c1,A).  [resolve(238,a,234,b)].
% 0.77/1.10  Derived: -member(c1,A,c9) | -multiple(c1,A).  [resolve(238,a,235,a)].
% 0.77/1.10  Derived: -member(c1,A,c9) | -general(c1,A).  [resolve(238,a,236,a)].
% 0.77/1.10  Derived: -member(c1,A,c9) | -male(c1,A).  [resolve(238,a,237,a)].
% 0.77/1.10  239 artifact(c1,c3).  [resolve(217,a,218,a)].
% 0.77/1.10  Derived: -placename(c1,A) | -of(c1,A,c3) | -placename(c1,B) | B = A | -of(c1,B,c3).  [resolve(239,a,231,a)].
% 0.77/1.10  Derived: -nonexistent(c1,c3).  [resolve(239,a,232,a)].
% 0.77/1.10  Derived: -living(c1,c3).  [resolve(239,a,233,a)].
% 0.77/1.10  Derived: -fellow(c1,c3).  [resolve(239,a,234,b)].
% 0.77/1.10  Derived: -multiple(c1,c3).  [resolve(239,a,235,a)].
% 0.77/1.10  Derived: -general(c1,c3).  [resolve(239,a,236,a)].
% 0.77/1.10  Derived: -male(c1,c3).  [resolve(239,a,237,a)].
% 0.77/1.10  240 artifact(c1,c5).  [resolve(221,a,222,a)].
% 0.77/1.10  Derived: -placename(c1,A) | -of(c1,A,c5) | -placename(c1,B) | B = A | -of(c1,B,c5).  [resolve(240,a,231,a)].
% 0.77/1.10  Derived: -nonexistent(c1,c5).  [resolve(240,a,232,a)].
% 0.77/1.10  Derived: -living(c1,c5).  [resolve(240,a,233,a)].
% 0.77/1.10  Derived: -fellow(c1,c5).  [resolve(240,a,234,b)].
% 0.77/1.10  Derived: -multiple(c1,c5).  [resolve(240,a,235,a)].
% 0.77/1.10  Derived: -general(c1,c5).  [resolve(240,a,236,a)].
% 0.77/1.10  Derived: -male(c1,c5).  [resolve(240,a,237,a)].
% 0.77/1.10  
% 0.77/1.10  ============================== end predicate elimination =============
% 0.77/1.10  
% 0.77/1.10  Auto_denials:  (non-Horn, no changes).
% 0.77/1.10  
% 0.77/1.10  Term ordering decisions:
% 0.77/1.10  Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. f1=1. f2=1. f6=1. f4=1. f5=1. f3=1.
% 0.77/1.10  
% 0.77/1.10  ============================== end of process initial clauses ========
% 0.77/1.10  
% 0.77/1.10  ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.10  
% 0.77/1.10  ============================== end of clauses for search =============
% 0.77/1.10  
% 0.77/1.10  ============================== SEARCH ================================
% 0.77/1.10  
% 0.77/1.10  % Starting search at 0.07 seconds.
% 0.77/1.10  
% 0.77/1.10  ============================== STATISTICS ============================
% 0.77/1.10  
% 0.77/1.10  Given=161. Generated=378. Kept=161. proofs=0.
% 0.77/1.10  Usable=161. Sos=0. Demods=2. Limbo=0, Disabled=277. Hints=0.
% 0.77/1.10  Megabytes=0.35.
% 0.77/1.10  User_CPU=0.08, System_CPU=0.00, Wall_clock=0.
% 0.77/1.10  
% 0.77/1.10  ============================== end of statistics =====================
% 0.77/1.10  
% 0.77/1.10  ============================== end of search =========================
% 0.77/1.10  
% 0.77/1.10  SEARCH FAILED
% 0.77/1.10  
% 0.77/1.10  Exiting with failure.
% 0.77/1.10  
% 0.77/1.10  Process 27619 exit (sos_empty) Thu Jun 30 23:08:42 2022
% 0.77/1.10  Prover9 interrupted
%------------------------------------------------------------------------------