TSTP Solution File: NLP215-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP215-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:58 EDT 2022
% Result : Unknown 0.89s 1.44s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NLP215-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 00:11:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.85/1.20 ============================== Prover9 ===============================
% 0.85/1.20 Prover9 (32) version 2009-11A, November 2009.
% 0.85/1.20 Process 10281 was started by sandbox on n020.cluster.edu,
% 0.85/1.20 Fri Jul 1 00:11:46 2022
% 0.85/1.20 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10095_n020.cluster.edu".
% 0.85/1.20 ============================== end of head ===========================
% 0.85/1.20
% 0.85/1.20 ============================== INPUT =================================
% 0.85/1.20
% 0.85/1.20 % Reading from file /tmp/Prover9_10095_n020.cluster.edu
% 0.85/1.20
% 0.85/1.20 set(prolog_style_variables).
% 0.85/1.20 set(auto2).
% 0.85/1.20 % set(auto2) -> set(auto).
% 0.85/1.20 % set(auto) -> set(auto_inference).
% 0.85/1.20 % set(auto) -> set(auto_setup).
% 0.85/1.20 % set(auto_setup) -> set(predicate_elim).
% 0.85/1.20 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.85/1.20 % set(auto) -> set(auto_limits).
% 0.85/1.20 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.85/1.20 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.85/1.20 % set(auto) -> set(auto_denials).
% 0.85/1.20 % set(auto) -> set(auto_process).
% 0.85/1.20 % set(auto2) -> assign(new_constants, 1).
% 0.85/1.20 % set(auto2) -> assign(fold_denial_max, 3).
% 0.85/1.20 % set(auto2) -> assign(max_weight, "200.000").
% 0.85/1.20 % set(auto2) -> assign(max_hours, 1).
% 0.85/1.20 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.85/1.20 % set(auto2) -> assign(max_seconds, 0).
% 0.85/1.20 % set(auto2) -> assign(max_minutes, 5).
% 0.85/1.20 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.85/1.20 % set(auto2) -> set(sort_initial_sos).
% 0.85/1.20 % set(auto2) -> assign(sos_limit, -1).
% 0.85/1.20 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.85/1.20 % set(auto2) -> assign(max_megs, 400).
% 0.85/1.20 % set(auto2) -> assign(stats, some).
% 0.85/1.20 % set(auto2) -> clear(echo_input).
% 0.85/1.20 % set(auto2) -> set(quiet).
% 0.85/1.20 % set(auto2) -> clear(print_initial_clauses).
% 0.85/1.20 % set(auto2) -> clear(print_given).
% 0.85/1.20 assign(lrs_ticks,-1).
% 0.85/1.20 assign(sos_limit,10000).
% 0.85/1.20 assign(order,kbo).
% 0.85/1.20 set(lex_order_vars).
% 0.85/1.20 clear(print_given).
% 0.85/1.20
% 0.85/1.20 % formulas(sos). % not echoed (124 formulas)
% 0.85/1.20
% 0.85/1.20 ============================== end of input ==========================
% 0.85/1.20
% 0.85/1.20 % From the command line: assign(max_seconds, 300).
% 0.85/1.20
% 0.85/1.20 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.85/1.20
% 0.85/1.20 % Formulas that are not ordinary clauses:
% 0.85/1.20
% 0.85/1.20 ============================== end of process non-clausal formulas ===
% 0.85/1.20
% 0.85/1.20 ============================== PROCESS INITIAL CLAUSES ===============
% 0.85/1.20
% 0.85/1.20 ============================== PREDICATE ELIMINATION =================
% 0.85/1.20 1 -member(A,B,C) | -ssSkP1(D,C,A) | state(A,skf14(A,E,F)) # label(clause112) # label(negated_conjecture). [assumption].
% 0.85/1.20 2 -state(A,B) | eventuality(A,B) # label(clause2) # label(axiom). [assumption].
% 0.85/1.20 3 -state(A,B) | event(A,B) # label(clause8) # label(axiom). [assumption].
% 0.85/1.20 Derived: -member(A,B,C) | -ssSkP1(D,C,A) | eventuality(A,skf14(A,E,F)). [resolve(1,c,2,a)].
% 0.85/1.20 Derived: -member(A,B,C) | -ssSkP1(D,C,A) | event(A,skf14(A,E,F)). [resolve(1,c,3,a)].
% 0.85/1.20 4 -in(A,B,C) | -be(A,D,skf17(C,A,E),B) | -state(A,D) | ssSkP1(C,F,A) # label(clause120) # label(negated_conjecture). [assumption].
% 0.85/1.20 Derived: -in(A,B,C) | -be(A,skf14(A,D,E),skf17(C,A,F),B) | ssSkP1(C,V6,A) | -member(A,V7,V8) | -ssSkP1(V9,V8,A). [resolve(4,c,1,c)].
% 0.85/1.20 5 -group(A,B) | -two(A,C) | -group(A,C) | -ssSkP0(C,A) | -ssSkP2(C,B,A) | -barrel(A,D) | -present(A,D) | -event(A,D) | -chevy(A,E) | -white(A,E) | -dirty(A,E) | -old(A,E) | -agent(A,D,E) | -frontseat(A,F) | -city(A,F) | -street(A,F) | -lonely(A,F) | -down(A,D,F) | -in(A,D,F) | -ssSkP1(F,C,A) | -placename(A,V6) | -hollywood_placename(A,V6) | -of(A,V6,F) | -behind(A,V7,V8) | -wheel(A,V8) | -jules_forename(A,V9) | -forename(A,V9) | -be(A,V10,V11,V7) | -man(A,V11) | -of(A,V9,V11) | -state(A,V10) | -actual_world(A) | member(A,skf11(A,B),B) # label(clause123) # label(negated_conjecture). [assumption].
% 0.85/1.20 Derived: -group(A,B) | -two(A,C) | -group(A,C) | -ssSkP0(C,A) | -ssSkP2(C,B,A) | -barrel(A,D) | -present(A,D) | -event(A,D) | -chevy(A,E) | -white(A,E) | -dirty(A,E) | -old(A,E) | -agent(A,D,E) | -frontseat(A,F) | -city(A,F) | -street(A,F) | -lonely(A,F) | -down(A,D,F) | -in(A,D,F) | -ssSkP1(F,C,A) | -placename(A,V6) | -hollywood_placename(A,V6) | -of(A,V6,F) | -behind(A,V7,V8) | -wheel(A,V8) | -jules_forename(A,V9) | -forename(A,V9) | -be(A,skf14(A,V10,V11),V12,V7) | -man(A,V12) | -of(A,V9,V12) | -actual_world(A) | member(A,skf11(A,B),B) | -member(A,V13,V14) | -ssSkP1(V15,V14,A). [resolve(5,E,1,c)].
% 0.85/1.20 6 -cheap(A,skf11(A,B)) | -black(A,skf11(A,B)) | -coat(A,skf11(A,B)) | -group(A,C) | -two(A,D) | -group(A,D) | -ssSkP0(D,A) | -ssSkP2(D,C,A) | -barrel(A,E) | -present(A,E) | -event(A,E) | -chevy(A,F) | -white(A,F) | -dirty(A,F) | -old(A,F) | -agent(A,E,F) | -frontseat(A,V6) | -city(A,V6) | -street(A,V6) | -lonely(A,V6) | -down(A,E,V6) | -in(A,E,V6) | -ssSkP1(V6,D,A) | -placename(A,V7) | -hollywood_placename(A,V7) | -of(A,V7,V6) | -behind(A,V8,V9) | -wheel(A,V9) | -jules_forename(A,V10) | -forename(A,V10) | -be(A,V11,V12,V8) | -man(A,V12) | -of(A,V10,V12) | -state(A,V11) | -actual_world(A) # label(clause124) # label(negated_conjecture). [assumption].
% 0.85/1.20 Derived: -cheap(A,skf11(A,B)) | -black(A,skf11(A,B)) | -coat(A,skf11(A,B)) | -group(A,C) | -two(A,D) | -group(A,D) | -ssSkP0(D,A) | -ssSkP2(D,C,A) | -barrel(A,E) | -present(A,E) | -event(A,E) | -chevy(A,F) | -white(A,F) | -dirty(A,F) | -old(A,F) | -agent(A,E,F) | -frontseat(A,V6) | -city(A,V6) | -street(A,V6) | -lonely(A,V6) | -down(A,E,V6) | -in(A,E,V6) | -ssSkP1(V6,D,A) | -placename(A,V7) | -hollywood_placename(A,V7) | -of(A,V7,V6) | -behind(A,V8,V9) | -wheel(A,V9) | -jules_forename(A,V10) | -forename(A,V10) | -be(A,skf14(A,V11,V12),V13,V8) | -man(A,V13) | -of(A,V10,V13) | -actual_world(A) | -member(A,V14,V15) | -ssSkP1(V16,V15,A). [resolve(6,H,1,c)].
% 0.85/1.20 7 -event(A,B) | eventuality(A,B) # label(clause9) # label(axiom). [assumption].
% 0.85/1.20 8 -eventuality(A,B) | thing(A,B) # label(clause3) # label(axiom). [assumption].
% 0.85/1.20 9 -eventuality(A,B) | specific(A,B) # label(clause5) # label(axiom). [assumption].
% 0.85/1.20 10 -eventuality(A,B) | nonexistent(A,B) # label(clause6) # label(axiom). [assumption].
% 0.85/1.20 11 -eventuality(A,B) | unisex(A,B) # label(clause7) # label(axiom). [assumption].
% 0.85/1.20 Derived: -event(A,B) | thing(A,B). [resolve(7,b,8,a)].
% 0.85/1.20 Derived: -event(A,B) | specific(A,B). [resolve(7,b,9,a)].
% 0.85/1.20 Derived: -event(A,B) | nonexistent(A,B). [resolve(7,b,10,a)].
% 0.85/1.20 Derived: -event(A,B) | unisex(A,B). [resolve(7,b,11,a)].
% 0.85/1.20 12 -member(A,B,C) | -ssSkP1(D,C,A) | eventuality(A,skf14(A,E,F)). [resolve(1,c,2,a)].
% 0.85/1.20 Derived: -member(A,B,C) | -ssSkP1(D,C,A) | thing(A,skf14(A,E,F)). [resolve(12,c,8,a)].
% 0.85/1.20 Derived: -member(A,B,C) | -ssSkP1(D,C,A) | specific(A,skf14(A,E,F)). [resolve(12,c,9,a)].
% 0.85/1.20 Derived: -member(A,B,C) | -ssSkP1(D,C,A) | nonexistent(A,skf14(A,E,F)). [resolve(12,c,10,a)].
% 0.85/1.20 Derived: -member(A,B,C) | -ssSkP1(D,C,A) | unisex(A,skf14(A,E,F)). [resolve(12,c,11,a)].
% 0.85/1.20 13 -entity(A,B) | thing(A,B) # label(clause15) # label(axiom). [assumption].
% 0.85/1.20 14 -thing(A,B) | singleton(A,B) # label(clause4) # label(axiom). [assumption].
% 0.85/1.20 Derived: -entity(A,B) | singleton(A,B). [resolve(13,b,14,a)].
% 0.85/1.20 15 -abstraction(A,B) | thing(A,B) # label(clause46) # label(axiom). [assumption].
% 0.85/1.20 Derived: -abstraction(A,B) | singleton(A,B). [resolve(15,b,14,a)].
% 0.85/1.20 16 -event(A,B) | thing(A,B). [resolve(7,b,8,a)].
% 0.85/1.20 Derived: -event(A,B) | singleton(A,B). [resolve(16,b,14,a)].
% 0.85/1.20 17 -member(A,B,C) | -ssSkP1(D,C,A) | thing(A,skf14(A,E,F)). [resolve(12,c,8,a)].
% 0.85/1.20 Derived: -member(A,B,C) | -ssSkP1(D,C,A) | singleton(A,skf14(A,E,F)). [resolve(17,c,14,a)].
% 0.85/1.20 18 -transport(A,B) | instrumentality(A,B) # label(clause42) # label(axiom). [assumption].
% 0.85/1.20 19 -instrumentality(A,B) | artifact(A,B) # label(clause12) # label(axiom). [assumption].
% 0.85/1.20 Derived: -transport(A,B) | artifact(A,B). [resolve(18,b,19,a)].
% 0.85/1.20 20 -furniture(A,B) | instrumentality(A,B) # label(clause55) # label(axiom). [assumption].
% 0.85/1.20 Derived: -furniture(A,B) | artifact(A,B). [resolve(20,b,19,a)].
% 0.85/1.20 21 -clothes(A,B) | artifact(A,B) # label(clause22) # label(axiom). [assumption].
% 0.85/1.20 22 -artifact(A,B) | object(A,B) # label(clause13) # label(axiom). [assumption].
% 0.85/1.20 Derived: -clothes(A,B) | object(A,B). [resolve(21,b,22,a)].
% 0.85/1.20 23 -way(A,B) | artifact(A,B) # label(clause38) # label(axiom). [assumption].
% 0.85/1.20 Derived: -way(A,B) | object(A,B). [resolve(23,b,22,a)].
% 0.85/1.20 24 -transport(A,B) | artifact(A,B). [resolve(18,b,19,a)].
% 0.85/1.20 Derived: -transport(A,B) | object(A,B). [resolve(24,b,22,a)].
% 0.89/1.21 25 -furniture(A,B) | artifact(A,B). [resolve(20,b,19,a)].
% 0.89/1.21 Derived: -furniture(A,B) | object(A,B). [resolve(25,b,22,a)].
% 0.89/1.21 26 -location(A,B) | object(A,B) # label(clause52) # label(axiom). [assumption].
% 0.89/1.21 27 -object(A,B) | entity(A,B) # label(clause14) # label(axiom). [assumption].
% 0.89/1.21 28 -object(A,B) | nonliving(A,B) # label(clause18) # label(axiom). [assumption].
% 0.89/1.21 29 -object(A,B) | impartial(A,B) # label(clause19) # label(axiom). [assumption].
% 0.89/1.21 30 -object(A,B) | unisex(A,B) # label(clause20) # label(axiom). [assumption].
% 0.89/1.21 Derived: -location(A,B) | entity(A,B). [resolve(26,b,27,a)].
% 0.89/1.21 Derived: -location(A,B) | nonliving(A,B). [resolve(26,b,28,a)].
% 0.89/1.21 Derived: -location(A,B) | impartial(A,B). [resolve(26,b,29,a)].
% 0.89/1.21 Derived: -location(A,B) | unisex(A,B). [resolve(26,b,30,a)].
% 0.89/1.21 31 -clothes(A,B) | object(A,B). [resolve(21,b,22,a)].
% 0.89/1.21 Derived: -clothes(A,B) | entity(A,B). [resolve(31,b,27,a)].
% 0.89/1.21 Derived: -clothes(A,B) | nonliving(A,B). [resolve(31,b,28,a)].
% 0.89/1.21 Derived: -clothes(A,B) | impartial(A,B). [resolve(31,b,29,a)].
% 0.89/1.21 Derived: -clothes(A,B) | unisex(A,B). [resolve(31,b,30,a)].
% 0.89/1.21 32 -way(A,B) | object(A,B). [resolve(23,b,22,a)].
% 0.89/1.21 Derived: -way(A,B) | entity(A,B). [resolve(32,b,27,a)].
% 0.89/1.21 Derived: -way(A,B) | nonliving(A,B). [resolve(32,b,28,a)].
% 0.89/1.21 Derived: -way(A,B) | impartial(A,B). [resolve(32,b,29,a)].
% 0.89/1.21 Derived: -way(A,B) | unisex(A,B). [resolve(32,b,30,a)].
% 0.89/1.21 33 -transport(A,B) | object(A,B). [resolve(24,b,22,a)].
% 0.89/1.21 Derived: -transport(A,B) | entity(A,B). [resolve(33,b,27,a)].
% 0.89/1.21 Derived: -transport(A,B) | nonliving(A,B). [resolve(33,b,28,a)].
% 0.89/1.21 Derived: -transport(A,B) | impartial(A,B). [resolve(33,b,29,a)].
% 0.89/1.21 Derived: -transport(A,B) | unisex(A,B). [resolve(33,b,30,a)].
% 0.89/1.21 34 -furniture(A,B) | object(A,B). [resolve(25,b,22,a)].
% 0.89/1.21 Derived: -furniture(A,B) | entity(A,B). [resolve(34,b,27,a)].
% 0.89/1.21 Derived: -furniture(A,B) | nonliving(A,B). [resolve(34,b,28,a)].
% 0.89/1.21 Derived: -furniture(A,B) | impartial(A,B). [resolve(34,b,29,a)].
% 0.89/1.21 Derived: -furniture(A,B) | unisex(A,B). [resolve(34,b,30,a)].
% 0.89/1.21 35 -organism(A,B) | entity(A,B) # label(clause29) # label(axiom). [assumption].
% 0.89/1.21 36 -entity(A,B) | specific(A,B) # label(clause16) # label(axiom). [assumption].
% 0.89/1.21 37 -entity(A,B) | existent(A,B) # label(clause17) # label(axiom). [assumption].
% 0.89/1.21 Derived: -organism(A,B) | specific(A,B). [resolve(35,b,36,a)].
% 0.89/1.21 Derived: -organism(A,B) | existent(A,B). [resolve(35,b,37,a)].
% 0.89/1.21 38 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | -entity(A,D) | C = B # label(clause76) # label(axiom). [assumption].
% 0.89/1.21 Derived: -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(38,e,35,b)].
% 0.89/1.21 39 -forename(A,B) | -of(A,C,D) | -forename(A,C) | -of(A,B,D) | -entity(A,D) | C = B # label(clause77) # label(axiom). [assumption].
% 0.89/1.21 Derived: -forename(A,B) | -of(A,C,D) | -forename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(39,e,35,b)].
% 0.89/1.21 40 -entity(A,B) | singleton(A,B). [resolve(13,b,14,a)].
% 0.89/1.21 Derived: singleton(A,B) | -organism(A,B). [resolve(40,a,35,b)].
% 0.89/1.21 41 -location(A,B) | entity(A,B). [resolve(26,b,27,a)].
% 0.89/1.21 Derived: -location(A,B) | specific(A,B). [resolve(41,b,36,a)].
% 0.89/1.21 Derived: -location(A,B) | existent(A,B). [resolve(41,b,37,a)].
% 0.89/1.21 Derived: -location(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(41,b,38,e)].
% 0.89/1.21 Derived: -location(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(41,b,39,e)].
% 0.89/1.21 Derived: -location(A,B) | singleton(A,B). [resolve(41,b,40,a)].
% 0.89/1.21 42 -clothes(A,B) | entity(A,B). [resolve(31,b,27,a)].
% 0.89/1.21 Derived: -clothes(A,B) | specific(A,B). [resolve(42,b,36,a)].
% 0.89/1.21 Derived: -clothes(A,B) | existent(A,B). [resolve(42,b,37,a)].
% 0.89/1.21 Derived: -clothes(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(42,b,38,e)].
% 0.89/1.21 Derived: -clothes(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(42,b,39,e)].
% 0.89/1.21 Derived: -clothes(A,B) | singleton(A,B). [resolve(42,b,40,a)].
% 0.89/1.21 43 -way(A,B) | entity(A,B). [resolve(32,b,27,a)].
% 0.89/1.21 Derived: -way(A,B) | specific(A,B). [resolve(43,b,36,a)].
% 0.89/1.22 Derived: -way(A,B) | existent(A,B). [resolve(43,b,37,a)].
% 0.89/1.22 Derived: -way(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(43,b,38,e)].
% 0.89/1.22 Derived: -way(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(43,b,39,e)].
% 0.89/1.22 Derived: -way(A,B) | singleton(A,B). [resolve(43,b,40,a)].
% 0.89/1.22 44 -transport(A,B) | entity(A,B). [resolve(33,b,27,a)].
% 0.89/1.22 Derived: -transport(A,B) | specific(A,B). [resolve(44,b,36,a)].
% 0.89/1.22 Derived: -transport(A,B) | existent(A,B). [resolve(44,b,37,a)].
% 0.89/1.22 Derived: -transport(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(44,b,38,e)].
% 0.89/1.22 Derived: -transport(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(44,b,39,e)].
% 0.89/1.22 Derived: -transport(A,B) | singleton(A,B). [resolve(44,b,40,a)].
% 0.89/1.22 45 -furniture(A,B) | entity(A,B). [resolve(34,b,27,a)].
% 0.89/1.22 Derived: -furniture(A,B) | specific(A,B). [resolve(45,b,36,a)].
% 0.89/1.22 Derived: -furniture(A,B) | existent(A,B). [resolve(45,b,37,a)].
% 0.89/1.22 Derived: -furniture(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(45,b,38,e)].
% 0.89/1.22 Derived: -furniture(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(45,b,39,e)].
% 0.89/1.22 Derived: -furniture(A,B) | singleton(A,B). [resolve(45,b,40,a)].
% 0.89/1.22 46 -member(skc7,A,skc8) | coat(skc7,A) # label(clause104) # label(negated_conjecture). [assumption].
% 0.89/1.22 47 -coat(A,B) | clothes(A,B) # label(clause21) # label(axiom). [assumption].
% 0.89/1.22 Derived: -member(skc7,A,skc8) | clothes(skc7,A). [resolve(46,b,47,a)].
% 0.89/1.22 48 -two(A,B) | group(A,B) # label(clause35) # label(axiom). [assumption].
% 0.89/1.22 49 -group(A,B) | set(A,B) # label(clause23) # label(axiom). [assumption].
% 0.89/1.22 Derived: -two(A,B) | set(A,B). [resolve(48,b,49,a)].
% 0.89/1.22 50 group(skc7,skc9) # label(clause93) # label(negated_conjecture). [assumption].
% 0.89/1.22 Derived: set(skc7,skc9). [resolve(50,a,49,a)].
% 0.89/1.22 51 group(skc7,skc8) # label(clause95) # label(negated_conjecture). [assumption].
% 0.89/1.22 Derived: set(skc7,skc8). [resolve(51,a,49,a)].
% 0.89/1.22 52 -two(A,B) | set(A,B). [resolve(48,b,49,a)].
% 0.89/1.22 53 -set(A,B) | multiple(A,B) # label(clause24) # label(axiom). [assumption].
% 0.89/1.22 Derived: -two(A,B) | multiple(A,B). [resolve(52,b,53,a)].
% 0.89/1.22 54 set(skc7,skc9). [resolve(50,a,49,a)].
% 0.89/1.22 Derived: multiple(skc7,skc9). [resolve(54,a,53,a)].
% 0.89/1.22 55 set(skc7,skc8). [resolve(51,a,49,a)].
% 0.89/1.22 Derived: multiple(skc7,skc8). [resolve(55,a,53,a)].
% 0.89/1.22 56 -member(A,B,C) | -member(A,D,E) | -ssSkP2(C,E,A) | wear(A,skf18(A,F,V6)) # label(clause115) # label(negated_conjecture). [assumption].
% 0.89/1.22 57 -wear(A,B) | event(A,B) # label(clause25) # label(axiom). [assumption].
% 0.89/1.22 58 -wear(A,B) | -nonreflexive(A,B) | -present(A,B) | -patient(A,B,skf20(C,A,D)) | -agent(A,B,skf22(C,A,D)) | -event(A,B) | ssSkP2(C,E,A) # label(clause122) # label(negated_conjecture). [assumption].
% 0.89/1.22 Derived: -nonreflexive(A,skf18(A,B,C)) | -present(A,skf18(A,B,C)) | -patient(A,skf18(A,B,C),skf20(D,A,E)) | -agent(A,skf18(A,B,C),skf22(D,A,E)) | -event(A,skf18(A,B,C)) | ssSkP2(D,F,A) | -member(A,V6,V7) | -member(A,V8,V9) | -ssSkP2(V7,V9,A). [resolve(58,a,56,d)].
% 0.89/1.22 59 -man(A,B) | human_person(A,B) # label(clause27) # label(axiom). [assumption].
% 0.89/1.22 60 -fellow(A,B) | man(A,B) # label(clause26) # label(axiom). [assumption].
% 0.89/1.22 Derived: human_person(A,B) | -fellow(A,B). [resolve(59,a,60,b)].
% 0.89/1.22 61 -man(A,B) | male(A,B) # label(clause34) # label(axiom). [assumption].
% 0.89/1.22 Derived: male(A,B) | -fellow(A,B). [resolve(61,a,60,b)].
% 0.89/1.22 62 human_person(A,B) | -fellow(A,B). [resolve(59,a,60,b)].
% 0.89/1.22 63 -human_person(A,B) | organism(A,B) # label(clause28) # label(axiom). [assumption].
% 0.89/1.22 64 -human_person(A,B) | human(A,B) # label(clause32) # label(axiom). [assumption].
% 0.89/1.22 65 -human_person(A,B) | animate(A,B) # label(clause33) # label(axiom). [assumption].
% 0.89/1.22 Derived: -fellow(A,B) | organism(A,B). [resolve(62,a,63,a)].
% 0.89/1.22 Derived: -fellow(A,B) | human(A,B). [resolve(62,a,64,a)].
% 0.89/1.22 Derived: -fellow(A,B) | animate(A,B). [resolve(62,a,65,a)].
% 0.89/1.22 66 -fellow(A,B) | organism(A,B). [resolve(62,a,63,a)].
% 0.89/1.22 67 -organism(A,B) | impartial(A,B) # label(clause30) # label(axiom). [assumption].
% 0.89/1.23 68 -organism(A,B) | living(A,B) # label(clause31) # label(axiom). [assumption].
% 0.89/1.23 69 -organism(A,B) | specific(A,B). [resolve(35,b,36,a)].
% 0.89/1.23 70 -organism(A,B) | existent(A,B). [resolve(35,b,37,a)].
% 0.89/1.23 71 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(38,e,35,b)].
% 0.89/1.23 72 -forename(A,B) | -of(A,C,D) | -forename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(39,e,35,b)].
% 0.89/1.23 73 singleton(A,B) | -organism(A,B). [resolve(40,a,35,b)].
% 0.89/1.23 Derived: -fellow(A,B) | impartial(A,B). [resolve(66,b,67,a)].
% 0.89/1.23 Derived: -fellow(A,B) | living(A,B). [resolve(66,b,68,a)].
% 0.89/1.23 Derived: -fellow(A,B) | specific(A,B). [resolve(66,b,69,a)].
% 0.89/1.23 Derived: -fellow(A,B) | existent(A,B). [resolve(66,b,70,a)].
% 0.89/1.23 Derived: -fellow(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(66,b,71,f)].
% 0.89/1.23 Derived: -fellow(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(66,b,72,f)].
% 0.89/1.23 Derived: -fellow(A,B) | singleton(A,B). [resolve(66,b,73,b)].
% 0.89/1.23 74 barrel(skc7,skc10) # label(clause89) # label(negated_conjecture). [assumption].
% 0.89/1.23 75 -barrel(A,B) | event(A,B) # label(clause36) # label(axiom). [assumption].
% 0.89/1.23 76 street(skc7,skc11) # label(clause84) # label(negated_conjecture). [assumption].
% 0.89/1.23 77 -street(A,B) | way(A,B) # label(clause37) # label(axiom). [assumption].
% 0.89/1.23 Derived: way(skc7,skc11). [resolve(76,a,77,a)].
% 0.89/1.23 78 chevy(skc7,skc13) # label(clause79) # label(negated_conjecture). [assumption].
% 0.89/1.23 79 -chevy(A,B) | car(A,B) # label(clause39) # label(axiom). [assumption].
% 0.89/1.23 Derived: car(skc7,skc13). [resolve(78,a,79,a)].
% 0.89/1.23 80 car(skc7,skc13). [resolve(78,a,79,a)].
% 0.89/1.23 81 -car(A,B) | vehicle(A,B) # label(clause40) # label(axiom). [assumption].
% 0.89/1.23 Derived: vehicle(skc7,skc13). [resolve(80,a,81,a)].
% 0.89/1.23 82 vehicle(skc7,skc13). [resolve(80,a,81,a)].
% 0.89/1.23 83 -vehicle(A,B) | transport(A,B) # label(clause41) # label(axiom). [assumption].
% 0.89/1.23 Derived: transport(skc7,skc13). [resolve(82,a,83,a)].
% 0.89/1.23 84 -relname(A,B) | relation(A,B) # label(clause44) # label(axiom). [assumption].
% 0.89/1.23 85 -placename(A,B) | relname(A,B) # label(clause43) # label(axiom). [assumption].
% 0.89/1.23 Derived: relation(A,B) | -placename(A,B). [resolve(84,a,85,b)].
% 0.89/1.23 86 -forename(A,B) | relname(A,B) # label(clause56) # label(axiom). [assumption].
% 0.89/1.23 Derived: -forename(A,B) | relation(A,B). [resolve(86,b,84,a)].
% 0.89/1.23 87 relation(A,B) | -placename(A,B). [resolve(84,a,85,b)].
% 0.89/1.23 88 -relation(A,B) | abstraction(A,B) # label(clause45) # label(axiom). [assumption].
% 0.89/1.23 Derived: -placename(A,B) | abstraction(A,B). [resolve(87,a,88,a)].
% 0.89/1.23 89 -forename(A,B) | relation(A,B). [resolve(86,b,84,a)].
% 0.89/1.23 Derived: -forename(A,B) | abstraction(A,B). [resolve(89,b,88,a)].
% 0.89/1.23 90 -placename(A,B) | abstraction(A,B). [resolve(87,a,88,a)].
% 0.89/1.23 91 -abstraction(A,B) | nonhuman(A,B) # label(clause47) # label(axiom). [assumption].
% 0.89/1.23 92 -abstraction(A,B) | general(A,B) # label(clause48) # label(axiom). [assumption].
% 0.89/1.23 93 -abstraction(A,B) | unisex(A,B) # label(clause49) # label(axiom). [assumption].
% 0.89/1.23 94 -abstraction(A,B) | singleton(A,B). [resolve(15,b,14,a)].
% 0.89/1.23 Derived: -placename(A,B) | nonhuman(A,B). [resolve(90,b,91,a)].
% 0.89/1.23 Derived: -placename(A,B) | general(A,B). [resolve(90,b,92,a)].
% 0.89/1.23 Derived: -placename(A,B) | unisex(A,B). [resolve(90,b,93,a)].
% 0.89/1.23 Derived: -placename(A,B) | singleton(A,B). [resolve(90,b,94,a)].
% 0.89/1.23 95 -forename(A,B) | abstraction(A,B). [resolve(89,b,88,a)].
% 0.89/1.23 Derived: -forename(A,B) | nonhuman(A,B). [resolve(95,b,91,a)].
% 0.89/1.23 Derived: -forename(A,B) | general(A,B). [resolve(95,b,92,a)].
% 0.89/1.23 Derived: -forename(A,B) | unisex(A,B). [resolve(95,b,93,a)].
% 0.89/1.23 Derived: -forename(A,B) | singleton(A,B). [resolve(95,b,94,a)].
% 0.89/1.23 96 hollywood_placename(skc7,skc12) # label(clause81) # label(negated_conjecture). [assumption].
% 0.89/1.23 97 -hollywood_placename(A,B) | placename(A,B) # label(clause50) # label(axiom). [assumption].
% 0.89/1.23 Derived: placename(skc7,skc12). [resolve(96,a,97,a)].
% 0.89/1.23 98 city(skc7,skc11) # label(clause83) # label(negated_conjecture). [assumption].
% 0.89/1.23 99 -city(A,B) | location(A,B) # label(clause51) # label(axiom). [assumption].
% 0.89/1.23 Derived: location(skc7,skc11). [resolve(98,a,99,a)].
% 0.89/1.24 100 frontseat(skc7,skc11) # label(clause82) # label(negated_conjecture). [assumption].
% 0.89/1.24 101 -frontseat(A,B) | seat(A,B) # label(clause53) # label(axiom). [assumption].
% 0.89/1.24 Derived: seat(skc7,skc11). [resolve(100,a,101,a)].
% 0.89/1.24 102 seat(skc7,skc11). [resolve(100,a,101,a)].
% 0.89/1.24 103 -seat(A,B) | furniture(A,B) # label(clause54) # label(axiom). [assumption].
% 0.89/1.24 Derived: furniture(skc7,skc11). [resolve(102,a,103,a)].
% 0.89/1.24 104 old(skc7,skc13) # label(clause88) # label(negated_conjecture). [assumption].
% 0.89/1.24 105 -old(A,B) | -young(A,B) # label(clause58) # label(axiom). [assumption].
% 0.89/1.24 Derived: -young(skc7,skc13). [resolve(104,a,105,a)].
% 0.89/1.24 106 -member(skc7,A,skc8) | black(skc7,A) # label(clause103) # label(negated_conjecture). [assumption].
% 0.89/1.24 107 -black(A,B) | -white(A,B) # label(clause59) # label(axiom). [assumption].
% 0.89/1.24 Derived: -member(skc7,A,skc8) | -white(skc7,A). [resolve(106,b,107,a)].
% 0.89/1.24 108 male(A,B) | -fellow(A,B). [resolve(61,a,60,b)].
% 0.89/1.24 109 -male(A,B) | -unisex(A,B) # label(clause60) # label(axiom). [assumption].
% 0.89/1.24 Derived: -fellow(A,B) | -unisex(A,B). [resolve(108,a,109,a)].
% 0.89/1.24 110 -placename(A,B) | general(A,B). [resolve(90,b,92,a)].
% 0.89/1.24 111 -general(A,B) | -specific(A,B) # label(clause61) # label(axiom). [assumption].
% 0.89/1.24 Derived: -placename(A,B) | -specific(A,B). [resolve(110,b,111,a)].
% 0.89/1.24 112 -forename(A,B) | general(A,B). [resolve(95,b,92,a)].
% 0.89/1.24 Derived: -forename(A,B) | -specific(A,B). [resolve(112,b,111,a)].
% 0.89/1.24 113 -two(A,B) | multiple(A,B). [resolve(52,b,53,a)].
% 0.89/1.24 114 -multiple(A,B) | -singleton(A,B) # label(clause62) # label(axiom). [assumption].
% 0.89/1.24 Derived: -two(A,B) | -singleton(A,B). [resolve(113,b,114,a)].
% 0.89/1.24 115 multiple(skc7,skc9). [resolve(54,a,53,a)].
% 0.89/1.24 Derived: -singleton(skc7,skc9). [resolve(115,a,114,a)].
% 0.89/1.24 116 multiple(skc7,skc8). [resolve(55,a,53,a)].
% 0.89/1.24 Derived: -singleton(skc7,skc8). [resolve(116,a,114,a)].
% 0.89/1.24 117 -fellow(A,B) | living(A,B). [resolve(66,b,68,a)].
% 0.89/1.24 118 -living(A,B) | -nonliving(A,B) # label(clause63) # label(axiom). [assumption].
% 0.89/1.24 Derived: -fellow(A,B) | -nonliving(A,B). [resolve(117,b,118,a)].
% 0.89/1.24 119 -fellow(A,B) | human(A,B). [resolve(62,a,64,a)].
% 0.89/1.24 120 -human(A,B) | -nonhuman(A,B) # label(clause64) # label(axiom). [assumption].
% 0.89/1.24 Derived: -fellow(A,B) | -nonhuman(A,B). [resolve(119,b,120,a)].
% 0.89/1.24 121 -event(A,B) | nonexistent(A,B). [resolve(7,b,10,a)].
% 0.89/1.24 122 -nonexistent(A,B) | -existent(A,B) # label(clause65) # label(axiom). [assumption].
% 0.89/1.24 Derived: -event(A,B) | -existent(A,B). [resolve(121,b,122,a)].
% 0.89/1.24 123 -member(A,B,C) | -ssSkP1(D,C,A) | nonexistent(A,skf14(A,E,F)). [resolve(12,c,10,a)].
% 0.89/1.24 Derived: -member(A,B,C) | -ssSkP1(D,C,A) | -existent(A,skf14(A,E,F)). [resolve(123,c,122,a)].
% 0.89/1.24 124 -location(A,B) | nonliving(A,B). [resolve(26,b,28,a)].
% 0.89/1.24 125 -nonliving(A,B) | -animate(A,B) # label(clause66) # label(axiom). [assumption].
% 0.89/1.24 Derived: -location(A,B) | -animate(A,B). [resolve(124,b,125,a)].
% 0.89/1.24 126 -clothes(A,B) | nonliving(A,B). [resolve(31,b,28,a)].
% 0.89/1.24 Derived: -clothes(A,B) | -animate(A,B). [resolve(126,b,125,a)].
% 0.89/1.24 127 -way(A,B) | nonliving(A,B). [resolve(32,b,28,a)].
% 0.89/1.24 Derived: -way(A,B) | -animate(A,B). [resolve(127,b,125,a)].
% 0.89/1.24 128 -transport(A,B) | nonliving(A,B). [resolve(33,b,28,a)].
% 0.89/1.24 Derived: -transport(A,B) | -animate(A,B). [resolve(128,b,125,a)].
% 0.89/1.24 129 -furniture(A,B) | nonliving(A,B). [resolve(34,b,28,a)].
% 0.89/1.24 Derived: -furniture(A,B) | -animate(A,B). [resolve(129,b,125,a)].
% 0.89/1.24 130 -fellow(A,B) | -nonliving(A,B). [resolve(117,b,118,a)].
% 0.89/1.24 Derived: -fellow(A,B) | -location(A,B). [resolve(130,b,124,b)].
% 0.89/1.24 Derived: -fellow(A,B) | -clothes(A,B). [resolve(130,b,126,b)].
% 0.89/1.24 Derived: -fellow(A,B) | -way(A,B). [resolve(130,b,127,b)].
% 0.89/1.24 Derived: -fellow(A,B) | -transport(A,B). [resolve(130,b,128,b)].
% 0.89/1.24 Derived: -fellow(A,B) | -furniture(A,B). [resolve(130,b,129,b)].
% 0.89/1.24 131 -member(A,B,C) | -member(A,D,C) | two(A,C) | member(A,skf27(B,D,C,A),C) | B = D # label(clause73) # label(axiom). [assumption].
% 0.89/1.24 132 -two(A,B) | member(A,skf26(B,A),B) # label(clause68) # label(axiom). [assumption].
% 0.89/1.24 133 -two(A,B) | member(A,skf24(B,A),B) # label(clause69) # label(axiom). [assumption].
% 0.89/1.24 134 skf26(A,B) != skf24(A,B) | -two(B,A) # label(clause70) # label(axiom). [assumption].
% 0.89/1.24 135 -member(A,B,C) | -two(A,C) | B = skf24(C,A) | B = skf26(C,A) # label(clause72) # label(axiom). [assumption].
% 0.89/1.24 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf27(B,D,C,A),C) | B = D | member(A,skf26(C,A),C). [resolve(131,c,132,a)].
% 0.89/1.24 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf27(B,D,C,A),C) | B = D | member(A,skf24(C,A),C). [resolve(131,c,133,a)].
% 0.89/1.24 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf27(B,D,C,A),C) | B = D | skf26(C,A) != skf24(C,A). [resolve(131,c,134,b)].
% 0.89/1.24 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf27(B,D,C,A),C) | B = D | -member(A,E,C) | E = skf24(C,A) | E = skf26(C,A). [resolve(131,c,135,b)].
% 0.89/1.24 136 skf27(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | two(E,F) | A = B # label(clause74) # label(axiom). [assumption].
% 0.89/1.24 Derived: skf27(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | member(E,skf26(F,E),F). [resolve(136,d,132,a)].
% 0.89/1.24 Derived: skf27(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | member(E,skf24(F,E),F). [resolve(136,d,133,a)].
% 0.89/1.24 Derived: skf27(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | skf26(F,E) != skf24(F,E). [resolve(136,d,134,b)].
% 0.89/1.24 Derived: skf27(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | -member(E,V6,F) | V6 = skf24(F,E) | V6 = skf26(F,E). [resolve(136,d,135,b)].
% 0.89/1.24 137 skf27(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | two(E,F) | A = V6 # label(clause75) # label(axiom). [assumption].
% 0.89/1.24 Derived: skf27(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | member(E,skf26(F,E),F). [resolve(137,d,132,a)].
% 0.89/1.24 Derived: skf27(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | member(E,skf24(F,E),F). [resolve(137,d,133,a)].
% 0.89/1.24 Derived: skf27(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | skf26(F,E) != skf24(F,E). [resolve(137,d,134,b)].
% 0.89/1.24 Derived: skf27(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | -member(E,V7,F) | V7 = skf24(F,E) | V7 = skf26(F,E). [resolve(137,d,135,b)].
% 0.89/1.24 138 two(skc7,skc9) # label(clause92) # label(negated_conjecture). [assumption].
% 0.89/1.24 Derived: member(skc7,skf26(skc9,skc7),skc9). [resolve(138,a,132,a)].
% 0.89/1.24 Derived: member(skc7,skf24(skc9,skc7),skc9). [resolve(138,a,133,a)].
% 0.89/1.24 Derived: skf26(skc9,skc7) != skf24(skc9,skc7). [resolve(138,a,134,b)].
% 0.89/1.24 Derived: -member(skc7,A,skc9) | A = skf24(skc9,skc7) | A = skf26(skc9,skc7). [resolve(138,a,135,b)].
% 0.89/1.24 139 -two(A,B) | -singleton(A,B). [resolve(113,b,114,a)].
% 0.89/1.24 Derived: -singleton(A,B) | -member(A,C,B) | -member(A,D,B) | member(A,skf27(C,D,B,A),B) | C = D. [resolve(139,a,131,c)].
% 0.89/1.24 Derived: -singleton(A,B) | skf27(C,D,E,F) != D | -member(A,C,B) | -member(A,D,B) | C = D. [resolve(139,a,136,d)].
% 0.89/1.24 Derived: -singleton(A,B) | skf27(C,D,E,F) != C | -member(A,C,B) | -member(A,V6,B) | C = V6. [resolve(139,a,137,d)].
% 0.89/1.24 140 -member(A,B,C) | -ssSkP0(C,A) | fellow(A,B) # label(clause109) # label(negated_conjecture). [assumption].
% 0.89/1.24 141 ssSkP0(skc9,skc7) # label(clause94) # label(negated_conjecture). [assumption].
% 0.89/1.24 142 ssSkP0(A,B) | member(B,skf12(B,A),A) # label(clause105) # label(negated_conjecture). [assumption].
% 0.89/1.24 Derived: -member(skc7,A,skc9) | fellow(skc7,A). [resolve(140,b,141,a)].
% 0.89/1.24 Derived: -member(A,B,C) | fellow(A,B) | member(A,skf12(A,C),C). [resolve(140,b,142,a)].
% 0.89/1.24 143 -member(A,B,C) | -ssSkP0(C,A) | young(A,B) # label(clause110) # label(negated_conjecture). [assumption].
% 0.89/1.24 Derived: -member(skc7,A,skc9) | young(skc7,A). [resolve(143,b,141,a)].
% 0.89/1.24 Derived: -member(A,B,C) | young(A,B) | member(A,skf12(A,C),C). [resolve(143,b,142,a)].
% 0.89/1.24 144 -young(A,skf12(A,B)) | -fellow(A,skf12(A,B)) | ssSkP0(C,A) # label(clause111) # label(negated_conjecture). [assumption].
% 0.89/1.24 Derived: -young(A,skf12(A,B)) | -fellow(A,skf12(A,B)) | -member(A,C,D) | fellow(A,C). [resolve(144,c,140,b)].
% 0.89/1.24 Derived: -young(A,skf12(A,B)) | -fellow(A,skf12(A,B)) | -member(A,C,D) | young(A,C). [resolve(144,c,143,b)].
% 0.89/1.24 145 -in(A,B,C) | -be(A,skf14(A,D,E),skf17(C,A,F),B) | ssSkP1(C,V6,A) | -member(A,V7,V8) | -ssSkP1(V9,V8,A). [resolve(4,c,1,c)].
% 0.89/1.24 146 in(skc7,skc10,skc11) # label(clause98) # label(negated_conjecture). [assumption].
% 0.89/1.24 147 -member(A,B,C) | -ssSkP1(D,C,A) | in(A,skf13(B,A,D),D) # label(clause113) # label(negated_conjecture). [assumption].
% 0.89/1.25 Derived: -be(skc7,skf14(skc7,A,B),skf17(skc11,skc7,C),skc10) | ssSkP1(skc11,D,skc7) | -member(skc7,E,F) | -ssSkP1(V6,F,skc7). [resolve(145,a,146,a)].
% 0.89/1.25 Derived: -be(A,skf14(A,B,C),skf17(D,A,E),skf13(F,A,D)) | ssSkP1(D,V6,A) | -member(A,V7,V8) | -ssSkP1(V9,V8,A) | -member(A,F,V10) | -ssSkP1(D,V10,A). [resolve(145,a,147,c)].
% 0.89/1.25 148 -placename(A,B) | -specific(A,B). [resolve(110,b,111,a)].
% 0.89/1.25 149 -event(A,B) | specific(A,B). [resolve(7,b,9,a)].
% 0.89/1.25 150 -member(A,B,C) | -ssSkP1(D,C,A) | specific(A,skf14(A,E,F)). [resolve(12,c,9,a)].
% 0.89/1.25 151 -location(A,B) | specific(A,B). [resolve(41,b,36,a)].
% 0.89/1.25 152 -clothes(A,B) | specific(A,B). [resolve(42,b,36,a)].
% 0.89/1.25 153 -way(A,B) | specific(A,B). [resolve(43,b,36,a)].
% 0.89/1.25 154 -transport(A,B) | specific(A,B). [resolve(44,b,36,a)].
% 0.89/1.25 155 -furniture(A,B) | specific(A,B). [resolve(45,b,36,a)].
% 0.89/1.25 156 -fellow(A,B) | specific(A,B). [resolve(66,b,69,a)].
% 0.89/1.25 Derived: -placename(A,B) | -event(A,B). [resolve(148,b,149,b)].
% 0.89/1.25 Derived: -placename(A,skf14(A,B,C)) | -member(A,D,E) | -ssSkP1(F,E,A). [resolve(148,b,150,c)].
% 0.89/1.25 Derived: -placename(A,B) | -location(A,B). [resolve(148,b,151,b)].
% 0.89/1.25 Derived: -placename(A,B) | -clothes(A,B). [resolve(148,b,152,b)].
% 0.89/1.25 Derived: -placename(A,B) | -way(A,B). [resolve(148,b,153,b)].
% 0.89/1.25 Derived: -placename(A,B) | -transport(A,B). [resolve(148,b,154,b)].
% 0.89/1.25 Derived: -placename(A,B) | -furniture(A,B). [resolve(148,b,155,b)].
% 0.89/1.25 Derived: -placename(A,B) | -fellow(A,B). [resolve(148,b,156,b)].
% 0.89/1.25 157 -forename(A,B) | -specific(A,B). [resolve(112,b,111,a)].
% 0.89/1.25 Derived: -forename(A,B) | -event(A,B). [resolve(157,b,149,b)].
% 0.89/1.25 Derived: -forename(A,skf14(A,B,C)) | -member(A,D,E) | -ssSkP1(F,E,A). [resolve(157,b,150,c)].
% 0.89/1.25 Derived: -forename(A,B) | -location(A,B). [resolve(157,b,151,b)].
% 0.89/1.25 Derived: -forename(A,B) | -clothes(A,B). [resolve(157,b,152,b)].
% 0.89/1.25 Derived: -forename(A,B) | -way(A,B). [resolve(157,b,153,b)].
% 0.89/1.25 Derived: -forename(A,B) | -transport(A,B). [resolve(157,b,154,b)].
% 0.89/1.25 Derived: -forename(A,B) | -furniture(A,B). [resolve(157,b,155,b)].
% 0.89/1.25 Derived: -forename(A,B) | -fellow(A,B). [resolve(157,b,156,b)].
% 0.89/1.25 158 -fellow(A,B) | -unisex(A,B). [resolve(108,a,109,a)].
% 0.89/1.25 159 -event(A,B) | unisex(A,B). [resolve(7,b,11,a)].
% 0.89/1.25 160 -member(A,B,C) | -ssSkP1(D,C,A) | unisex(A,skf14(A,E,F)). [resolve(12,c,11,a)].
% 0.89/1.25 161 -location(A,B) | unisex(A,B). [resolve(26,b,30,a)].
% 0.89/1.25 162 -clothes(A,B) | unisex(A,B). [resolve(31,b,30,a)].
% 0.89/1.25 163 -way(A,B) | unisex(A,B). [resolve(32,b,30,a)].
% 0.89/1.25 164 -transport(A,B) | unisex(A,B). [resolve(33,b,30,a)].
% 0.89/1.25 165 -furniture(A,B) | unisex(A,B). [resolve(34,b,30,a)].
% 0.89/1.25 166 -placename(A,B) | unisex(A,B). [resolve(90,b,93,a)].
% 0.89/1.25 167 -forename(A,B) | unisex(A,B). [resolve(95,b,93,a)].
% 0.89/1.25 Derived: -fellow(A,B) | -event(A,B). [resolve(158,b,159,b)].
% 0.89/1.25 Derived: -fellow(A,skf14(A,B,C)) | -member(A,D,E) | -ssSkP1(F,E,A). [resolve(158,b,160,c)].
% 0.89/1.25 168 location(skc7,skc11). [resolve(98,a,99,a)].
% 0.89/1.25 169 -location(A,B) | impartial(A,B). [resolve(26,b,29,a)].
% 0.89/1.25 170 -location(A,B) | existent(A,B). [resolve(41,b,37,a)].
% 0.89/1.25 171 -location(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(41,b,38,e)].
% 0.89/1.25 172 -location(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(41,b,39,e)].
% 0.89/1.25 173 -location(A,B) | singleton(A,B). [resolve(41,b,40,a)].
% 0.89/1.25 Derived: impartial(skc7,skc11). [resolve(168,a,169,a)].
% 0.89/1.25 Derived: existent(skc7,skc11). [resolve(168,a,170,a)].
% 0.89/1.25 Derived: -placename(skc7,A) | -of(skc7,B,skc11) | -placename(skc7,B) | -of(skc7,A,skc11) | B = A. [resolve(168,a,171,a)].
% 0.89/1.25 Derived: -forename(skc7,A) | -of(skc7,B,skc11) | -forename(skc7,B) | -of(skc7,A,skc11) | B = A. [resolve(168,a,172,a)].
% 0.89/1.25 Derived: singleton(skc7,skc11). [resolve(168,a,173,a)].
% 0.89/1.25 174 -location(A,B) | -animate(A,B). [resolve(124,b,125,a)].
% 0.89/1.25 Derived: -animate(skc7,skc11). [resolve(174,a,168,a)].
% 0.89/1.25 175 -fellow(A,B) | -location(A,B). [resolve(130,b,124,b)].
% 0.89/1.25 Derived: -fellow(skc7,skc11). [resolve(175,b,168,a)].
% 0.89/1.25 176 -placename(A,B) | -location(A,B). [resolve(148,b,151,b)].
% 0.89/1.25 Derived: -placename(skc7,skc11). [resolve(176,b,168,a)].
% 0.89/1.25 177 -forename(A,B) | -location(A,B). [resolve(157,b,151,b)].
% 0.89/1.25 Derived: -forename(skc7,skc11). [resolve(177,b,168,a)].
% 0.89/1.25 178 -member(skc7,A,skc8) | clothes(skc7,A). [resolve(46,b,47,a)].
% 0.89/1.25 179 -clothes(A,B) | impartial(A,B). [resolve(31,b,29,a)].
% 0.89/1.25 180 -clothes(A,B) | existent(A,B). [resolve(42,b,37,a)].
% 0.89/1.25 181 -clothes(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(42,b,38,e)].
% 0.89/1.25 182 -clothes(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(42,b,39,e)].
% 0.89/1.25 183 -clothes(A,B) | singleton(A,B). [resolve(42,b,40,a)].
% 0.89/1.25 Derived: -member(skc7,A,skc8) | impartial(skc7,A). [resolve(178,b,179,a)].
% 0.89/1.25 Derived: -member(skc7,A,skc8) | existent(skc7,A). [resolve(178,b,180,a)].
% 0.89/1.25 Derived: -member(skc7,A,skc8) | -placename(skc7,B) | -of(skc7,C,A) | -placename(skc7,C) | -of(skc7,B,A) | C = B. [resolve(178,b,181,a)].
% 0.89/1.25 Derived: -member(skc7,A,skc8) | -forename(skc7,B) | -of(skc7,C,A) | -forename(skc7,C) | -of(skc7,B,A) | C = B. [resolve(178,b,182,a)].
% 0.89/1.25 Derived: -member(skc7,A,skc8) | singleton(skc7,A). [resolve(178,b,183,a)].
% 0.89/1.25 184 -clothes(A,B) | -animate(A,B). [resolve(126,b,125,a)].
% 0.89/1.25 Derived: -animate(skc7,A) | -member(skc7,A,skc8). [resolve(184,a,178,b)].
% 0.89/1.25 185 -fellow(A,B) | -clothes(A,B). [resolve(130,b,126,b)].
% 0.89/1.25 Derived: -fellow(skc7,A) | -member(skc7,A,skc8). [resolve(185,b,178,b)].
% 0.89/1.25 186 -placename(A,B) | -clothes(A,B). [resolve(148,b,152,b)].
% 0.89/1.25 Derived: -placename(skc7,A) | -member(skc7,A,skc8). [resolve(186,b,178,b)].
% 0.89/1.25 187 -forename(A,B) | -clothes(A,B). [resolve(157,b,152,b)].
% 0.89/1.25 Derived: -forename(skc7,A) | -member(skc7,A,skc8). [resolve(187,b,178,b)].
% 0.89/1.25 188 way(skc7,skc11). [resolve(76,a,77,a)].
% 0.89/1.25 189 -way(A,B) | impartial(A,B). [resolve(32,b,29,a)].
% 0.89/1.25 190 -way(A,B) | existent(A,B). [resolve(43,b,37,a)].
% 0.89/1.25 191 -way(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(43,b,38,e)].
% 0.89/1.25 192 -way(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(43,b,39,e)].
% 0.89/1.25 193 -way(A,B) | singleton(A,B). [resolve(43,b,40,a)].
% 0.89/1.25 194 -way(A,B) | -animate(A,B). [resolve(127,b,125,a)].
% 0.89/1.25 195 -fellow(A,B) | -way(A,B). [resolve(130,b,127,b)].
% 0.89/1.25 196 -placename(A,B) | -way(A,B). [resolve(148,b,153,b)].
% 0.89/1.25 197 -forename(A,B) | -way(A,B). [resolve(157,b,153,b)].
% 0.89/1.25 198 transport(skc7,skc13). [resolve(82,a,83,a)].
% 0.89/1.25 199 -transport(A,B) | impartial(A,B). [resolve(33,b,29,a)].
% 0.89/1.25 200 -transport(A,B) | existent(A,B). [resolve(44,b,37,a)].
% 0.89/1.25 201 -transport(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(44,b,38,e)].
% 0.89/1.25 202 -transport(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(44,b,39,e)].
% 0.89/1.25 203 -transport(A,B) | singleton(A,B). [resolve(44,b,40,a)].
% 0.89/1.25 Derived: impartial(skc7,skc13). [resolve(198,a,199,a)].
% 0.89/1.25 Derived: existent(skc7,skc13). [resolve(198,a,200,a)].
% 0.89/1.25 Derived: -placename(skc7,A) | -of(skc7,B,skc13) | -placename(skc7,B) | -of(skc7,A,skc13) | B = A. [resolve(198,a,201,a)].
% 0.89/1.25 Derived: -forename(skc7,A) | -of(skc7,B,skc13) | -forename(skc7,B) | -of(skc7,A,skc13) | B = A. [resolve(198,a,202,a)].
% 0.89/1.25 Derived: singleton(skc7,skc13). [resolve(198,a,203,a)].
% 0.89/1.25 204 -transport(A,B) | -animate(A,B). [resolve(128,b,125,a)].
% 0.89/1.25 Derived: -animate(skc7,skc13). [resolve(204,a,198,a)].
% 0.89/1.25 205 -fellow(A,B) | -transport(A,B). [resolve(130,b,128,b)].
% 0.89/1.25 Derived: -fellow(skc7,skc13). [resolve(205,b,198,a)].
% 0.89/1.25 206 -placename(A,B) | -transport(A,B). [resolve(148,b,154,b)].
% 0.89/1.25 Derived: -placename(skc7,skc13). [resolve(206,b,198,a)].
% 0.89/1.25 207 -forename(A,B) | -transport(A,B). [resolve(157,b,154,b)].
% 0.89/1.25 Derived: -forename(skc7,skc13). [resolve(207,b,198,a)].
% 0.89/1.25 208 furniture(skc7,skc11). [resolve(102,a,103,a)].
% 0.89/1.25 209 -furniture(A,B) | impartial(A,B). [resolve(34,b,29,a)].
% 0.89/1.25 210 -furniture(A,B) | existent(A,B). [resolve(45,b,37,a)].
% 0.89/1.25 211 -furniture(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(45,b,38,e)].
% 0.89/1.25 212 -furniture(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(45,b,39,e)].
% 0.89/1.25 213 -furniture(A,B) | singleton(A,B). [resolve(45,b,40,a)].
% 0.89/1.44 214 -furniture(A,B) | -animate(A,B). [resolve(129,b,125,a)].
% 0.89/1.44 215 -fellow(A,B) | -furniture(A,B). [resolve(130,b,129,b)].
% 0.89/1.44 216 -placename(A,B) | -furniture(A,B). [resolve(148,b,155,b)].
% 0.89/1.44 217 -forename(A,B) | -furniture(A,B). [resolve(157,b,155,b)].
% 0.89/1.44 218 -fellow(A,B) | -nonhuman(A,B). [resolve(119,b,120,a)].
% 0.89/1.44 219 -placename(A,B) | nonhuman(A,B). [resolve(90,b,91,a)].
% 0.89/1.44 220 -forename(A,B) | nonhuman(A,B). [resolve(95,b,91,a)].
% 0.89/1.44
% 0.89/1.44 ============================== end predicate elimination =============
% 0.89/1.44
% 0.89/1.44 Auto_denials: (non-Horn, no changes).
% 0.89/1.44
% 0.89/1.44 Term ordering decisions:
% 0.89/1.44 Function symbol KB weights: skc7=1. skc9=1. skc11=1. skc13=1. skc8=1. skc10=1. skc12=1. skf24=1. skf26=1. skf12=1. skf18=1. skf14=1. skf17=1. skf13=1. skf20=1. skf22=1. skf27=1.
% 0.89/1.44
% 0.89/1.44 ============================== end of process initial clauses ========
% 0.89/1.44
% 0.89/1.44 ============================== CLAUSES FOR SEARCH ====================
% 0.89/1.44
% 0.89/1.44 ============================== end of clauses for search =============
% 0.89/1.44
% 0.89/1.44 ============================== SEARCH ================================
% 0.89/1.44
% 0.89/1.44 % Starting search at 0.08 seconds.
% 0.89/1.44
% 0.89/1.44 ============================== STATISTICS ============================
% 0.89/1.44
% 0.89/1.44 Given=460. Generated=3400. Kept=928. proofs=0.
% 0.89/1.44 Usable=325. Sos=0. Demods=4. Limbo=0, Disabled=934. Hints=0.
% 0.89/1.44 Megabytes=1.23.
% 0.89/1.44 User_CPU=0.25, System_CPU=0.01, Wall_clock=0.
% 0.89/1.44
% 0.89/1.44 ============================== end of statistics =====================
% 0.89/1.44
% 0.89/1.44 ============================== end of search =========================
% 0.89/1.44
% 0.89/1.44 SEARCH FAILED
% 0.89/1.44
% 0.89/1.44 Exiting with failure.
% 0.89/1.44
% 0.89/1.44 Process 10281 exit (sos_empty) Fri Jul 1 00:11:46 2022
% 0.89/1.44 Prover9 interrupted
%------------------------------------------------------------------------------