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