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

View Problem - Process Solution

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

% Computer : n017.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:13 EDT 2022

% Result   : Theorem 0.77s 1.07s
% Output   : Refutation 0.77s
% Verified : 
% SZS Type : -

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