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