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