TSTP Solution File: NLP208-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP208-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:53 EDT 2022
% Result : Unsatisfiable 0.82s 1.11s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP208-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 30 23:23:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.02 ============================== Prover9 ===============================
% 0.43/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.02 Process 13681 was started by sandbox on n025.cluster.edu,
% 0.43/1.02 Thu Jun 30 23:23:24 2022
% 0.43/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13527_n025.cluster.edu".
% 0.43/1.02 ============================== end of head ===========================
% 0.43/1.02
% 0.43/1.02 ============================== INPUT =================================
% 0.43/1.02
% 0.43/1.02 % Reading from file /tmp/Prover9_13527_n025.cluster.edu
% 0.43/1.02
% 0.43/1.02 set(prolog_style_variables).
% 0.43/1.02 set(auto2).
% 0.43/1.02 % set(auto2) -> set(auto).
% 0.43/1.02 % set(auto) -> set(auto_inference).
% 0.43/1.02 % set(auto) -> set(auto_setup).
% 0.43/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.02 % set(auto) -> set(auto_limits).
% 0.43/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.02 % set(auto) -> set(auto_denials).
% 0.43/1.02 % set(auto) -> set(auto_process).
% 0.43/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.02 % set(auto2) -> assign(stats, some).
% 0.43/1.02 % set(auto2) -> clear(echo_input).
% 0.43/1.02 % set(auto2) -> set(quiet).
% 0.43/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.02 % set(auto2) -> clear(print_given).
% 0.43/1.02 assign(lrs_ticks,-1).
% 0.43/1.02 assign(sos_limit,10000).
% 0.43/1.02 assign(order,kbo).
% 0.43/1.02 set(lex_order_vars).
% 0.43/1.02 clear(print_given).
% 0.43/1.02
% 0.43/1.02 % formulas(sos). % not echoed (120 formulas)
% 0.43/1.02
% 0.43/1.02 ============================== end of input ==========================
% 0.43/1.02
% 0.43/1.02 % From the command line: assign(max_seconds, 300).
% 0.43/1.02
% 0.43/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.02
% 0.43/1.02 % Formulas that are not ordinary clauses:
% 0.43/1.02
% 0.43/1.02 ============================== end of process non-clausal formulas ===
% 0.43/1.02
% 0.43/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.02
% 0.43/1.02 ============================== PREDICATE ELIMINATION =================
% 0.43/1.02 1 state(skc11,skc13) # label(clause97) # label(negated_conjecture). [assumption].
% 0.43/1.02 2 -state(A,B) | eventuality(A,B) # label(clause2) # label(axiom). [assumption].
% 0.43/1.02 3 -state(A,B) | event(A,B) # label(clause8) # label(axiom). [assumption].
% 0.43/1.02 Derived: eventuality(skc11,skc13). [resolve(1,a,2,a)].
% 0.43/1.02 Derived: event(skc11,skc13). [resolve(1,a,3,a)].
% 0.43/1.02 4 -member(skc11,A,skc17) | state(skc11,skf7(B)) # label(clause112) # label(negated_conjecture). [assumption].
% 0.43/1.02 Derived: -member(skc11,A,skc17) | eventuality(skc11,skf7(B)). [resolve(4,b,2,a)].
% 0.43/1.02 Derived: -member(skc11,A,skc17) | event(skc11,skf7(B)). [resolve(4,b,3,a)].
% 0.43/1.02 5 -event(A,B) | eventuality(A,B) # label(clause9) # label(axiom). [assumption].
% 0.43/1.02 6 -eventuality(A,B) | thing(A,B) # label(clause3) # label(axiom). [assumption].
% 0.43/1.02 7 -eventuality(A,B) | specific(A,B) # label(clause5) # label(axiom). [assumption].
% 0.43/1.02 8 -eventuality(A,B) | nonexistent(A,B) # label(clause6) # label(axiom). [assumption].
% 0.43/1.02 9 -eventuality(A,B) | unisex(A,B) # label(clause7) # label(axiom). [assumption].
% 0.43/1.02 Derived: -event(A,B) | thing(A,B). [resolve(5,b,6,a)].
% 0.43/1.02 Derived: -event(A,B) | specific(A,B). [resolve(5,b,7,a)].
% 0.43/1.02 Derived: -event(A,B) | nonexistent(A,B). [resolve(5,b,8,a)].
% 0.43/1.02 Derived: -event(A,B) | unisex(A,B). [resolve(5,b,9,a)].
% 0.43/1.02 10 eventuality(skc11,skc13). [resolve(1,a,2,a)].
% 0.43/1.02 Derived: thing(skc11,skc13). [resolve(10,a,6,a)].
% 0.43/1.02 Derived: specific(skc11,skc13). [resolve(10,a,7,a)].
% 0.43/1.02 Derived: nonexistent(skc11,skc13). [resolve(10,a,8,a)].
% 0.43/1.02 Derived: unisex(skc11,skc13). [resolve(10,a,9,a)].
% 0.43/1.02 11 -member(skc11,A,skc17) | eventuality(skc11,skf7(B)). [resolve(4,b,2,a)].
% 0.43/1.02 Derived: -member(skc11,A,skc17) | thing(skc11,skf7(B)). [resolve(11,b,6,a)].
% 0.43/1.02 Derived: -member(skc11,A,skc17) | specific(skc11,skf7(B)). [resolve(11,b,7,a)].
% 0.43/1.03 Derived: -member(skc11,A,skc17) | nonexistent(skc11,skf7(B)). [resolve(11,b,8,a)].
% 0.43/1.03 Derived: -member(skc11,A,skc17) | unisex(skc11,skf7(B)). [resolve(11,b,9,a)].
% 0.43/1.03 12 -entity(A,B) | thing(A,B) # label(clause15) # label(axiom). [assumption].
% 0.43/1.03 13 -thing(A,B) | singleton(A,B) # label(clause4) # label(axiom). [assumption].
% 0.43/1.03 Derived: -entity(A,B) | singleton(A,B). [resolve(12,b,13,a)].
% 0.43/1.03 14 -abstraction(A,B) | thing(A,B) # label(clause46) # label(axiom). [assumption].
% 0.43/1.03 Derived: -abstraction(A,B) | singleton(A,B). [resolve(14,b,13,a)].
% 0.43/1.03 15 -event(A,B) | thing(A,B). [resolve(5,b,6,a)].
% 0.43/1.03 Derived: -event(A,B) | singleton(A,B). [resolve(15,b,13,a)].
% 0.43/1.03 16 thing(skc11,skc13). [resolve(10,a,6,a)].
% 0.43/1.03 Derived: singleton(skc11,skc13). [resolve(16,a,13,a)].
% 0.43/1.03 17 -member(skc11,A,skc17) | thing(skc11,skf7(B)). [resolve(11,b,6,a)].
% 0.43/1.03 Derived: -member(skc11,A,skc17) | singleton(skc11,skf7(B)). [resolve(17,b,13,a)].
% 0.43/1.03 18 wheel(skc11,skc12) # label(clause98) # label(negated_conjecture). [assumption].
% 0.43/1.03 19 -wheel(A,B) | device(A,B) # label(clause10) # label(axiom). [assumption].
% 0.43/1.03 Derived: device(skc11,skc12). [resolve(18,a,19,a)].
% 0.43/1.03 20 device(skc11,skc12). [resolve(18,a,19,a)].
% 0.43/1.03 21 -device(A,B) | instrumentality(A,B) # label(clause11) # label(axiom). [assumption].
% 0.43/1.03 Derived: instrumentality(skc11,skc12). [resolve(20,a,21,a)].
% 0.43/1.03 22 -transport(A,B) | instrumentality(A,B) # label(clause42) # label(axiom). [assumption].
% 0.43/1.03 23 -instrumentality(A,B) | artifact(A,B) # label(clause12) # label(axiom). [assumption].
% 0.43/1.03 Derived: -transport(A,B) | artifact(A,B). [resolve(22,b,23,a)].
% 0.43/1.03 24 -furniture(A,B) | instrumentality(A,B) # label(clause55) # label(axiom). [assumption].
% 0.43/1.03 Derived: -furniture(A,B) | artifact(A,B). [resolve(24,b,23,a)].
% 0.43/1.03 25 instrumentality(skc11,skc12). [resolve(20,a,21,a)].
% 0.43/1.03 Derived: artifact(skc11,skc12). [resolve(25,a,23,a)].
% 0.43/1.03 26 -clothes(A,B) | artifact(A,B) # label(clause22) # label(axiom). [assumption].
% 0.43/1.03 27 -artifact(A,B) | object(A,B) # label(clause13) # label(axiom). [assumption].
% 0.43/1.03 Derived: -clothes(A,B) | object(A,B). [resolve(26,b,27,a)].
% 0.43/1.03 28 -way(A,B) | artifact(A,B) # label(clause38) # label(axiom). [assumption].
% 0.43/1.03 Derived: -way(A,B) | object(A,B). [resolve(28,b,27,a)].
% 0.43/1.03 29 -transport(A,B) | artifact(A,B). [resolve(22,b,23,a)].
% 0.43/1.03 Derived: -transport(A,B) | object(A,B). [resolve(29,b,27,a)].
% 0.43/1.03 30 -furniture(A,B) | artifact(A,B). [resolve(24,b,23,a)].
% 0.43/1.03 Derived: -furniture(A,B) | object(A,B). [resolve(30,b,27,a)].
% 0.43/1.03 31 artifact(skc11,skc12). [resolve(25,a,23,a)].
% 0.43/1.03 Derived: object(skc11,skc12). [resolve(31,a,27,a)].
% 0.43/1.03 32 -location(A,B) | object(A,B) # label(clause52) # label(axiom). [assumption].
% 0.43/1.03 33 -object(A,B) | entity(A,B) # label(clause14) # label(axiom). [assumption].
% 0.43/1.03 34 -object(A,B) | nonliving(A,B) # label(clause18) # label(axiom). [assumption].
% 0.43/1.03 35 -object(A,B) | impartial(A,B) # label(clause19) # label(axiom). [assumption].
% 0.43/1.03 36 -object(A,B) | unisex(A,B) # label(clause20) # label(axiom). [assumption].
% 0.43/1.03 Derived: -location(A,B) | entity(A,B). [resolve(32,b,33,a)].
% 0.43/1.03 Derived: -location(A,B) | nonliving(A,B). [resolve(32,b,34,a)].
% 0.43/1.03 Derived: -location(A,B) | impartial(A,B). [resolve(32,b,35,a)].
% 0.43/1.03 Derived: -location(A,B) | unisex(A,B). [resolve(32,b,36,a)].
% 0.43/1.03 37 -clothes(A,B) | object(A,B). [resolve(26,b,27,a)].
% 0.43/1.03 Derived: -clothes(A,B) | entity(A,B). [resolve(37,b,33,a)].
% 0.43/1.03 Derived: -clothes(A,B) | nonliving(A,B). [resolve(37,b,34,a)].
% 0.43/1.03 Derived: -clothes(A,B) | impartial(A,B). [resolve(37,b,35,a)].
% 0.43/1.03 Derived: -clothes(A,B) | unisex(A,B). [resolve(37,b,36,a)].
% 0.43/1.03 38 -way(A,B) | object(A,B). [resolve(28,b,27,a)].
% 0.43/1.03 Derived: -way(A,B) | entity(A,B). [resolve(38,b,33,a)].
% 0.43/1.03 Derived: -way(A,B) | nonliving(A,B). [resolve(38,b,34,a)].
% 0.43/1.03 Derived: -way(A,B) | impartial(A,B). [resolve(38,b,35,a)].
% 0.43/1.03 Derived: -way(A,B) | unisex(A,B). [resolve(38,b,36,a)].
% 0.43/1.03 39 -transport(A,B) | object(A,B). [resolve(29,b,27,a)].
% 0.43/1.03 Derived: -transport(A,B) | entity(A,B). [resolve(39,b,33,a)].
% 0.43/1.03 Derived: -transport(A,B) | nonliving(A,B). [resolve(39,b,34,a)].
% 0.43/1.03 Derived: -transport(A,B) | impartial(A,B). [resolve(39,b,35,a)].
% 0.43/1.03 Derived: -transport(A,B) | unisex(A,B). [resolve(39,b,36,a)].
% 0.43/1.03 40 -furniture(A,B) | object(A,B). [resolve(30,b,27,a)].
% 0.43/1.03 Derived: -furniture(A,B) | entity(A,B). [resolve(40,b,33,a)].
% 0.43/1.03 Derived: -furniture(A,B) | nonliving(A,B). [resolve(40,b,34,a)].
% 0.43/1.03 Derived: -furniture(A,B) | impartial(A,B). [resolve(40,b,35,a)].
% 0.43/1.03 Derived: -furniture(A,B) | unisex(A,B). [resolve(40,b,36,a)].
% 0.43/1.03 41 object(skc11,skc12). [resolve(31,a,27,a)].
% 0.43/1.03 Derived: entity(skc11,skc12). [resolve(41,a,33,a)].
% 0.43/1.03 Derived: nonliving(skc11,skc12). [resolve(41,a,34,a)].
% 0.43/1.03 Derived: impartial(skc11,skc12). [resolve(41,a,35,a)].
% 0.43/1.03 Derived: unisex(skc11,skc12). [resolve(41,a,36,a)].
% 0.43/1.03 42 -organism(A,B) | entity(A,B) # label(clause29) # label(axiom). [assumption].
% 0.43/1.03 43 -entity(A,B) | specific(A,B) # label(clause16) # label(axiom). [assumption].
% 0.43/1.03 44 -entity(A,B) | existent(A,B) # label(clause17) # label(axiom). [assumption].
% 0.43/1.03 Derived: -organism(A,B) | specific(A,B). [resolve(42,b,43,a)].
% 0.43/1.03 Derived: -organism(A,B) | existent(A,B). [resolve(42,b,44,a)].
% 0.43/1.03 45 -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.43/1.03 Derived: -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(45,e,42,b)].
% 0.43/1.03 46 -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.43/1.03 Derived: -forename(A,B) | -of(A,C,D) | -forename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(46,e,42,b)].
% 0.43/1.03 47 -entity(A,B) | singleton(A,B). [resolve(12,b,13,a)].
% 0.43/1.03 Derived: singleton(A,B) | -organism(A,B). [resolve(47,a,42,b)].
% 0.43/1.03 48 -location(A,B) | entity(A,B). [resolve(32,b,33,a)].
% 0.43/1.03 Derived: -location(A,B) | specific(A,B). [resolve(48,b,43,a)].
% 0.43/1.03 Derived: -location(A,B) | existent(A,B). [resolve(48,b,44,a)].
% 0.43/1.03 Derived: -location(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(48,b,45,e)].
% 0.43/1.03 Derived: -location(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(48,b,46,e)].
% 0.43/1.03 Derived: -location(A,B) | singleton(A,B). [resolve(48,b,47,a)].
% 0.43/1.03 49 -clothes(A,B) | entity(A,B). [resolve(37,b,33,a)].
% 0.43/1.03 Derived: -clothes(A,B) | specific(A,B). [resolve(49,b,43,a)].
% 0.43/1.03 Derived: -clothes(A,B) | existent(A,B). [resolve(49,b,44,a)].
% 0.43/1.03 Derived: -clothes(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(49,b,45,e)].
% 0.43/1.03 Derived: -clothes(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(49,b,46,e)].
% 0.43/1.03 Derived: -clothes(A,B) | singleton(A,B). [resolve(49,b,47,a)].
% 0.43/1.03 50 -way(A,B) | entity(A,B). [resolve(38,b,33,a)].
% 0.43/1.03 Derived: -way(A,B) | specific(A,B). [resolve(50,b,43,a)].
% 0.43/1.03 Derived: -way(A,B) | existent(A,B). [resolve(50,b,44,a)].
% 0.43/1.03 Derived: -way(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(50,b,45,e)].
% 0.43/1.03 Derived: -way(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(50,b,46,e)].
% 0.43/1.03 Derived: -way(A,B) | singleton(A,B). [resolve(50,b,47,a)].
% 0.43/1.03 51 -transport(A,B) | entity(A,B). [resolve(39,b,33,a)].
% 0.43/1.03 Derived: -transport(A,B) | specific(A,B). [resolve(51,b,43,a)].
% 0.43/1.03 Derived: -transport(A,B) | existent(A,B). [resolve(51,b,44,a)].
% 0.43/1.03 Derived: -transport(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(51,b,45,e)].
% 0.43/1.03 Derived: -transport(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(51,b,46,e)].
% 0.43/1.03 Derived: -transport(A,B) | singleton(A,B). [resolve(51,b,47,a)].
% 0.43/1.03 52 -furniture(A,B) | entity(A,B). [resolve(40,b,33,a)].
% 0.43/1.03 Derived: -furniture(A,B) | specific(A,B). [resolve(52,b,43,a)].
% 0.43/1.03 Derived: -furniture(A,B) | existent(A,B). [resolve(52,b,44,a)].
% 0.43/1.03 Derived: -furniture(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(52,b,45,e)].
% 0.43/1.03 Derived: -furniture(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(52,b,46,e)].
% 0.43/1.03 Derived: -furniture(A,B) | singleton(A,B). [resolve(52,b,47,a)].
% 0.43/1.03 53 entity(skc11,skc12). [resolve(41,a,33,a)].
% 0.43/1.03 Derived: specific(skc11,skc12). [resolve(53,a,43,a)].
% 0.43/1.03 Derived: existent(skc11,skc12). [resolve(53,a,44,a)].
% 0.75/1.04 Derived: -placename(skc11,A) | -of(skc11,B,skc12) | -placename(skc11,B) | -of(skc11,A,skc12) | B = A. [resolve(53,a,45,e)].
% 0.75/1.04 Derived: -forename(skc11,A) | -of(skc11,B,skc12) | -forename(skc11,B) | -of(skc11,A,skc12) | B = A. [resolve(53,a,46,e)].
% 0.75/1.04 Derived: singleton(skc11,skc12). [resolve(53,a,47,a)].
% 0.75/1.04 54 -member(skc11,A,skc16) | coat(skc11,A) # label(clause111) # label(negated_conjecture). [assumption].
% 0.75/1.04 55 -coat(A,B) | clothes(A,B) # label(clause21) # label(axiom). [assumption].
% 0.75/1.04 Derived: -member(skc11,A,skc16) | clothes(skc11,A). [resolve(54,b,55,a)].
% 0.75/1.04 56 -two(A,B) | group(A,B) # label(clause35) # label(axiom). [assumption].
% 0.75/1.04 57 -group(A,B) | set(A,B) # label(clause23) # label(axiom). [assumption].
% 0.75/1.04 Derived: -two(A,B) | set(A,B). [resolve(56,b,57,a)].
% 0.75/1.04 58 group(skc11,skc17) # label(clause93) # label(negated_conjecture). [assumption].
% 0.75/1.04 Derived: set(skc11,skc17). [resolve(58,a,57,a)].
% 0.75/1.04 59 group(skc11,skc16) # label(clause99) # label(negated_conjecture). [assumption].
% 0.75/1.04 Derived: set(skc11,skc16). [resolve(59,a,57,a)].
% 0.75/1.04 60 -two(A,B) | set(A,B). [resolve(56,b,57,a)].
% 0.75/1.04 61 -set(A,B) | multiple(A,B) # label(clause24) # label(axiom). [assumption].
% 0.75/1.04 Derived: -two(A,B) | multiple(A,B). [resolve(60,b,61,a)].
% 0.75/1.04 62 set(skc11,skc17). [resolve(58,a,57,a)].
% 0.75/1.04 Derived: multiple(skc11,skc17). [resolve(62,a,61,a)].
% 0.75/1.04 63 set(skc11,skc16). [resolve(59,a,57,a)].
% 0.75/1.04 Derived: multiple(skc11,skc16). [resolve(63,a,61,a)].
% 0.75/1.04 64 -member(skc11,A,skc17) | -member(skc11,B,skc16) | wear(skc11,skf8(C,D)) # label(clause118) # label(negated_conjecture). [assumption].
% 0.75/1.04 65 -wear(A,B) | event(A,B) # label(clause25) # label(axiom). [assumption].
% 0.75/1.04 Derived: -member(skc11,A,skc17) | -member(skc11,B,skc16) | event(skc11,skf8(C,D)). [resolve(64,c,65,a)].
% 0.75/1.04 66 -member(skc11,A,skc17) | fellow(skc11,A) # label(clause108) # label(negated_conjecture). [assumption].
% 0.75/1.04 67 -fellow(A,B) | man(A,B) # label(clause26) # label(axiom). [assumption].
% 0.75/1.04 Derived: -member(skc11,A,skc17) | man(skc11,A). [resolve(66,b,67,a)].
% 0.75/1.04 68 man(skc11,skc15) # label(clause94) # label(negated_conjecture). [assumption].
% 0.75/1.04 69 -man(A,B) | human_person(A,B) # label(clause27) # label(axiom). [assumption].
% 0.75/1.04 70 -man(A,B) | male(A,B) # label(clause34) # label(axiom). [assumption].
% 0.75/1.04 Derived: human_person(skc11,skc15). [resolve(68,a,69,a)].
% 0.75/1.04 Derived: male(skc11,skc15). [resolve(68,a,70,a)].
% 0.75/1.04 71 -member(skc11,A,skc17) | man(skc11,A). [resolve(66,b,67,a)].
% 0.75/1.04 Derived: -member(skc11,A,skc17) | human_person(skc11,A). [resolve(71,b,69,a)].
% 0.75/1.04 Derived: -member(skc11,A,skc17) | male(skc11,A). [resolve(71,b,70,a)].
% 0.75/1.04 72 human_person(skc11,skc15). [resolve(68,a,69,a)].
% 0.75/1.04 73 -human_person(A,B) | organism(A,B) # label(clause28) # label(axiom). [assumption].
% 0.75/1.04 74 -human_person(A,B) | human(A,B) # label(clause32) # label(axiom). [assumption].
% 0.75/1.04 75 -human_person(A,B) | animate(A,B) # label(clause33) # label(axiom). [assumption].
% 0.75/1.04 Derived: organism(skc11,skc15). [resolve(72,a,73,a)].
% 0.75/1.04 Derived: human(skc11,skc15). [resolve(72,a,74,a)].
% 0.75/1.04 Derived: animate(skc11,skc15). [resolve(72,a,75,a)].
% 0.75/1.04 76 -member(skc11,A,skc17) | human_person(skc11,A). [resolve(71,b,69,a)].
% 0.75/1.04 Derived: -member(skc11,A,skc17) | organism(skc11,A). [resolve(76,b,73,a)].
% 0.75/1.04 Derived: -member(skc11,A,skc17) | human(skc11,A). [resolve(76,b,74,a)].
% 0.75/1.04 Derived: -member(skc11,A,skc17) | animate(skc11,A). [resolve(76,b,75,a)].
% 0.75/1.04 77 organism(skc11,skc15). [resolve(72,a,73,a)].
% 0.75/1.04 78 -organism(A,B) | impartial(A,B) # label(clause30) # label(axiom). [assumption].
% 0.75/1.04 79 -organism(A,B) | living(A,B) # label(clause31) # label(axiom). [assumption].
% 0.75/1.04 80 -organism(A,B) | specific(A,B). [resolve(42,b,43,a)].
% 0.75/1.04 81 -organism(A,B) | existent(A,B). [resolve(42,b,44,a)].
% 0.75/1.04 82 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(45,e,42,b)].
% 0.75/1.04 83 -forename(A,B) | -of(A,C,D) | -forename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(46,e,42,b)].
% 0.75/1.04 84 singleton(A,B) | -organism(A,B). [resolve(47,a,42,b)].
% 0.75/1.04 Derived: impartial(skc11,skc15). [resolve(77,a,78,a)].
% 0.75/1.04 Derived: living(skc11,skc15). [resolve(77,a,79,a)].
% 0.75/1.04 Derived: specific(skc11,skc15). [resolve(77,a,80,a)].
% 0.75/1.06 Derived: existent(skc11,skc15). [resolve(77,a,81,a)].
% 0.75/1.06 Derived: -placename(skc11,A) | -of(skc11,B,skc15) | -placename(skc11,B) | -of(skc11,A,skc15) | B = A. [resolve(77,a,82,f)].
% 0.75/1.06 Derived: -forename(skc11,A) | -of(skc11,B,skc15) | -forename(skc11,B) | -of(skc11,A,skc15) | B = A. [resolve(77,a,83,f)].
% 0.75/1.06 Derived: singleton(skc11,skc15). [resolve(77,a,84,b)].
% 0.75/1.06 85 -member(skc11,A,skc17) | organism(skc11,A). [resolve(76,b,73,a)].
% 0.75/1.06 Derived: -member(skc11,A,skc17) | impartial(skc11,A). [resolve(85,b,78,a)].
% 0.75/1.06 Derived: -member(skc11,A,skc17) | living(skc11,A). [resolve(85,b,79,a)].
% 0.75/1.06 Derived: -member(skc11,A,skc17) | specific(skc11,A). [resolve(85,b,80,a)].
% 0.75/1.06 Derived: -member(skc11,A,skc17) | existent(skc11,A). [resolve(85,b,81,a)].
% 0.75/1.06 Derived: -member(skc11,A,skc17) | -placename(skc11,B) | -of(skc11,C,A) | -placename(skc11,C) | -of(skc11,B,A) | C = B. [resolve(85,b,82,f)].
% 0.75/1.06 Derived: -member(skc11,A,skc17) | -forename(skc11,B) | -of(skc11,C,A) | -forename(skc11,C) | -of(skc11,B,A) | C = B. [resolve(85,b,83,f)].
% 0.75/1.06 Derived: -member(skc11,A,skc17) | singleton(skc11,A). [resolve(85,b,84,b)].
% 0.75/1.06 86 barrel(skc11,skc18) # label(clause89) # label(negated_conjecture). [assumption].
% 0.75/1.06 87 -barrel(A,B) | event(A,B) # label(clause36) # label(axiom). [assumption].
% 0.75/1.06 88 street(skc11,skc19) # label(clause84) # label(negated_conjecture). [assumption].
% 0.75/1.06 89 -street(A,B) | way(A,B) # label(clause37) # label(axiom). [assumption].
% 0.75/1.06 Derived: way(skc11,skc19). [resolve(88,a,89,a)].
% 0.75/1.06 90 chevy(skc11,skc23) # label(clause79) # label(negated_conjecture). [assumption].
% 0.75/1.06 91 -chevy(A,B) | car(A,B) # label(clause39) # label(axiom). [assumption].
% 0.75/1.06 Derived: car(skc11,skc23). [resolve(90,a,91,a)].
% 0.75/1.06 92 car(skc11,skc23). [resolve(90,a,91,a)].
% 0.75/1.06 93 -car(A,B) | vehicle(A,B) # label(clause40) # label(axiom). [assumption].
% 0.75/1.06 Derived: vehicle(skc11,skc23). [resolve(92,a,93,a)].
% 0.75/1.06 94 vehicle(skc11,skc23). [resolve(92,a,93,a)].
% 0.75/1.06 95 -vehicle(A,B) | transport(A,B) # label(clause41) # label(axiom). [assumption].
% 0.75/1.06 Derived: transport(skc11,skc23). [resolve(94,a,95,a)].
% 0.75/1.06 96 -relname(A,B) | relation(A,B) # label(clause44) # label(axiom). [assumption].
% 0.75/1.06 97 -placename(A,B) | relname(A,B) # label(clause43) # label(axiom). [assumption].
% 0.75/1.06 Derived: relation(A,B) | -placename(A,B). [resolve(96,a,97,b)].
% 0.75/1.06 98 -forename(A,B) | relname(A,B) # label(clause56) # label(axiom). [assumption].
% 0.75/1.06 Derived: -forename(A,B) | relation(A,B). [resolve(98,b,96,a)].
% 0.75/1.06 99 relation(A,B) | -placename(A,B). [resolve(96,a,97,b)].
% 0.75/1.06 100 -relation(A,B) | abstraction(A,B) # label(clause45) # label(axiom). [assumption].
% 0.75/1.06 Derived: -placename(A,B) | abstraction(A,B). [resolve(99,a,100,a)].
% 0.75/1.06 101 -forename(A,B) | relation(A,B). [resolve(98,b,96,a)].
% 0.75/1.06 Derived: -forename(A,B) | abstraction(A,B). [resolve(101,b,100,a)].
% 0.75/1.06 102 -placename(A,B) | abstraction(A,B). [resolve(99,a,100,a)].
% 0.75/1.06 103 -abstraction(A,B) | nonhuman(A,B) # label(clause47) # label(axiom). [assumption].
% 0.75/1.06 104 -abstraction(A,B) | general(A,B) # label(clause48) # label(axiom). [assumption].
% 0.75/1.06 105 -abstraction(A,B) | unisex(A,B) # label(clause49) # label(axiom). [assumption].
% 0.75/1.06 106 -abstraction(A,B) | singleton(A,B). [resolve(14,b,13,a)].
% 0.75/1.06 Derived: -placename(A,B) | nonhuman(A,B). [resolve(102,b,103,a)].
% 0.75/1.06 Derived: -placename(A,B) | general(A,B). [resolve(102,b,104,a)].
% 0.75/1.06 Derived: -placename(A,B) | unisex(A,B). [resolve(102,b,105,a)].
% 0.75/1.06 Derived: -placename(A,B) | singleton(A,B). [resolve(102,b,106,a)].
% 0.75/1.06 107 -forename(A,B) | abstraction(A,B). [resolve(101,b,100,a)].
% 0.75/1.06 Derived: -forename(A,B) | nonhuman(A,B). [resolve(107,b,103,a)].
% 0.75/1.06 Derived: -forename(A,B) | general(A,B). [resolve(107,b,104,a)].
% 0.75/1.06 Derived: -forename(A,B) | unisex(A,B). [resolve(107,b,105,a)].
% 0.75/1.06 Derived: -forename(A,B) | singleton(A,B). [resolve(107,b,106,a)].
% 0.75/1.06 108 hollywood_placename(skc11,skc20) # label(clause81) # label(negated_conjecture). [assumption].
% 0.75/1.06 109 -hollywood_placename(A,B) | placename(A,B) # label(clause50) # label(axiom). [assumption].
% 0.75/1.06 Derived: placename(skc11,skc20). [resolve(108,a,109,a)].
% 0.75/1.06 110 city(skc11,skc19) # label(clause83) # label(negated_conjecture). [assumption].
% 0.75/1.07 111 -city(A,B) | location(A,B) # label(clause51) # label(axiom). [assumption].
% 0.75/1.07 Derived: location(skc11,skc19). [resolve(110,a,111,a)].
% 0.75/1.07 112 frontseat(skc11,skc19) # label(clause82) # label(negated_conjecture). [assumption].
% 0.75/1.07 113 -frontseat(A,B) | seat(A,B) # label(clause53) # label(axiom). [assumption].
% 0.75/1.07 Derived: seat(skc11,skc19). [resolve(112,a,113,a)].
% 0.75/1.07 114 seat(skc11,skc19). [resolve(112,a,113,a)].
% 0.75/1.07 115 -seat(A,B) | furniture(A,B) # label(clause54) # label(axiom). [assumption].
% 0.75/1.07 Derived: furniture(skc11,skc19). [resolve(114,a,115,a)].
% 0.75/1.07 116 jules_forename(skc11,skc14) # label(clause96) # label(negated_conjecture). [assumption].
% 0.75/1.07 117 -jules_forename(A,B) | forename(A,B) # label(clause57) # label(axiom). [assumption].
% 0.75/1.07 Derived: forename(skc11,skc14). [resolve(116,a,117,a)].
% 0.75/1.07 118 old(skc11,skc23) # label(clause88) # label(negated_conjecture). [assumption].
% 0.75/1.07 119 -old(A,B) | -young(A,B) # label(clause58) # label(axiom). [assumption].
% 0.75/1.07 Derived: -young(skc11,skc23). [resolve(118,a,119,a)].
% 0.75/1.07 120 -member(skc11,A,skc16) | black(skc11,A) # label(clause110) # label(negated_conjecture). [assumption].
% 0.75/1.07 121 -black(A,B) | -white(A,B) # label(clause59) # label(axiom). [assumption].
% 0.75/1.07 Derived: -member(skc11,A,skc16) | -white(skc11,A). [resolve(120,b,121,a)].
% 0.75/1.07 122 male(skc11,skc15). [resolve(68,a,70,a)].
% 0.75/1.07 123 -male(A,B) | -unisex(A,B) # label(clause60) # label(axiom). [assumption].
% 0.75/1.07 Derived: -unisex(skc11,skc15). [resolve(122,a,123,a)].
% 0.75/1.07 124 -member(skc11,A,skc17) | male(skc11,A). [resolve(71,b,70,a)].
% 0.75/1.07 Derived: -member(skc11,A,skc17) | -unisex(skc11,A). [resolve(124,b,123,a)].
% 0.75/1.07 125 -placename(A,B) | general(A,B). [resolve(102,b,104,a)].
% 0.75/1.07 126 -general(A,B) | -specific(A,B) # label(clause61) # label(axiom). [assumption].
% 0.75/1.07 Derived: -placename(A,B) | -specific(A,B). [resolve(125,b,126,a)].
% 0.75/1.07 127 -forename(A,B) | general(A,B). [resolve(107,b,104,a)].
% 0.75/1.07 Derived: -forename(A,B) | -specific(A,B). [resolve(127,b,126,a)].
% 0.75/1.07 128 -two(A,B) | multiple(A,B). [resolve(60,b,61,a)].
% 0.75/1.07 129 -multiple(A,B) | -singleton(A,B) # label(clause62) # label(axiom). [assumption].
% 0.75/1.07 Derived: -two(A,B) | -singleton(A,B). [resolve(128,b,129,a)].
% 0.75/1.07 130 multiple(skc11,skc17). [resolve(62,a,61,a)].
% 0.75/1.07 Derived: -singleton(skc11,skc17). [resolve(130,a,129,a)].
% 0.75/1.07 131 multiple(skc11,skc16). [resolve(63,a,61,a)].
% 0.75/1.07 Derived: -singleton(skc11,skc16). [resolve(131,a,129,a)].
% 0.75/1.07 132 living(skc11,skc15). [resolve(77,a,79,a)].
% 0.75/1.07 133 -living(A,B) | -nonliving(A,B) # label(clause63) # label(axiom). [assumption].
% 0.75/1.07 Derived: -nonliving(skc11,skc15). [resolve(132,a,133,a)].
% 0.75/1.07 134 -member(skc11,A,skc17) | living(skc11,A). [resolve(85,b,79,a)].
% 0.75/1.07 Derived: -member(skc11,A,skc17) | -nonliving(skc11,A). [resolve(134,b,133,a)].
% 0.75/1.07 135 human(skc11,skc15). [resolve(72,a,74,a)].
% 0.75/1.07 136 -human(A,B) | -nonhuman(A,B) # label(clause64) # label(axiom). [assumption].
% 0.75/1.07 Derived: -nonhuman(skc11,skc15). [resolve(135,a,136,a)].
% 0.75/1.07 137 -member(skc11,A,skc17) | human(skc11,A). [resolve(76,b,74,a)].
% 0.75/1.07 Derived: -member(skc11,A,skc17) | -nonhuman(skc11,A). [resolve(137,b,136,a)].
% 0.75/1.07 138 -event(A,B) | nonexistent(A,B). [resolve(5,b,8,a)].
% 0.75/1.07 139 -nonexistent(A,B) | -existent(A,B) # label(clause65) # label(axiom). [assumption].
% 0.75/1.07 Derived: -event(A,B) | -existent(A,B). [resolve(138,b,139,a)].
% 0.75/1.07 140 nonexistent(skc11,skc13). [resolve(10,a,8,a)].
% 0.75/1.07 Derived: -existent(skc11,skc13). [resolve(140,a,139,a)].
% 0.75/1.07 141 -member(skc11,A,skc17) | nonexistent(skc11,skf7(B)). [resolve(11,b,8,a)].
% 0.75/1.07 Derived: -member(skc11,A,skc17) | -existent(skc11,skf7(B)). [resolve(141,b,139,a)].
% 0.75/1.07 142 animate(skc11,skc15). [resolve(72,a,75,a)].
% 0.75/1.07 143 -nonliving(A,B) | -animate(A,B) # label(clause66) # label(axiom). [assumption].
% 0.75/1.07 144 -member(skc11,A,skc17) | animate(skc11,A). [resolve(76,b,75,a)].
% 0.75/1.07 145 be(skc11,skc13,skc15,skc12) # label(clause106) # label(negated_conjecture). [assumption].
% 0.75/1.07 146 -be(A,B,C,D) | C = D # label(clause67) # label(axiom). [assumption].
% 0.75/1.07 Derived: skc15 = skc12. [resolve(145,a,146,a)].
% 0.75/1.07 147 -member(skc11,A,skc17) | be(skc11,skf7(A),A,skf6(A)) # label(clause114) # label(negated_conjecture). [assumption].
% 0.75/1.07 Derived: -member(skc11,A,skc17) | A = skf6(A). [resolve(147,b,146,a)].
% 0.82/1.08 148 skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | two(E,F) | A = B # label(clause73) # label(axiom). [assumption].
% 0.82/1.08 149 -two(A,B) | member(A,skf12(B,A),B) # label(clause68) # label(axiom). [assumption].
% 0.82/1.08 150 -two(A,B) | member(A,skf10(B,A),B) # label(clause69) # label(axiom). [assumption].
% 0.82/1.08 151 skf12(A,B) != skf10(A,B) | -two(B,A) # label(clause70) # label(axiom). [assumption].
% 0.82/1.08 152 -member(A,B,C) | -two(A,C) | B = skf10(C,A) | B = skf12(C,A) # label(clause72) # label(axiom). [assumption].
% 0.82/1.08 Derived: skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | member(E,skf12(F,E),F). [resolve(148,d,149,a)].
% 0.82/1.08 Derived: skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | member(E,skf10(F,E),F). [resolve(148,d,150,a)].
% 0.82/1.08 Derived: skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | skf12(F,E) != skf10(F,E). [resolve(148,d,151,b)].
% 0.82/1.08 Derived: skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | -member(E,V6,F) | V6 = skf10(F,E) | V6 = skf12(F,E). [resolve(148,d,152,b)].
% 0.82/1.08 153 skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | two(E,F) | A = V6 # label(clause74) # label(axiom). [assumption].
% 0.82/1.08 Derived: skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | member(E,skf12(F,E),F). [resolve(153,d,149,a)].
% 0.82/1.08 Derived: skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | member(E,skf10(F,E),F). [resolve(153,d,150,a)].
% 0.82/1.08 Derived: skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | skf12(F,E) != skf10(F,E). [resolve(153,d,151,b)].
% 0.82/1.08 Derived: skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | -member(E,V7,F) | V7 = skf10(F,E) | V7 = skf12(F,E). [resolve(153,d,152,b)].
% 0.82/1.08 154 -member(A,B,C) | -member(A,D,C) | two(A,C) | member(A,skf13(B,D,C,A),C) | B = D # label(clause75) # label(axiom). [assumption].
% 0.82/1.08 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf13(B,D,C,A),C) | B = D | member(A,skf12(C,A),C). [resolve(154,c,149,a)].
% 0.82/1.08 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf13(B,D,C,A),C) | B = D | member(A,skf10(C,A),C). [resolve(154,c,150,a)].
% 0.82/1.08 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf13(B,D,C,A),C) | B = D | skf12(C,A) != skf10(C,A). [resolve(154,c,151,b)].
% 0.82/1.08 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf13(B,D,C,A),C) | B = D | -member(A,E,C) | E = skf10(C,A) | E = skf12(C,A). [resolve(154,c,152,b)].
% 0.82/1.08 155 two(skc11,skc17) # label(clause92) # label(negated_conjecture). [assumption].
% 0.82/1.08 Derived: member(skc11,skf12(skc17,skc11),skc17). [resolve(155,a,149,a)].
% 0.82/1.08 Derived: member(skc11,skf10(skc17,skc11),skc17). [resolve(155,a,150,a)].
% 0.82/1.08 Derived: skf12(skc17,skc11) != skf10(skc17,skc11). [resolve(155,a,151,b)].
% 0.82/1.08 Derived: -member(skc11,A,skc17) | A = skf10(skc17,skc11) | A = skf12(skc17,skc11). [resolve(155,a,152,b)].
% 0.82/1.08 156 -two(A,B) | -singleton(A,B). [resolve(128,b,129,a)].
% 0.82/1.08 Derived: -singleton(A,B) | skf13(C,D,E,F) != D | -member(A,C,B) | -member(A,D,B) | C = D. [resolve(156,a,148,d)].
% 0.82/1.08 Derived: -singleton(A,B) | skf13(C,D,E,F) != C | -member(A,C,B) | -member(A,V6,B) | C = V6. [resolve(156,a,153,d)].
% 0.82/1.08 Derived: -singleton(A,B) | -member(A,C,B) | -member(A,D,B) | member(A,skf13(C,D,B,A),B) | C = D. [resolve(156,a,154,c)].
% 0.82/1.08 157 -member(skc11,A,skc17) | -member(skc11,B,skc16) | nonreflexive(skc11,skf8(C,D)) # label(clause117) # label(negated_conjecture). [assumption].
% 0.82/1.08 158 -nonreflexive(A,B) | -patient(A,B,C) | -agent(A,B,C) # label(clause71) # label(axiom). [assumption].
% 0.82/1.08 Derived: -member(skc11,A,skc17) | -member(skc11,B,skc16) | -patient(skc11,skf8(C,D),E) | -agent(skc11,skf8(C,D),E). [resolve(157,c,158,a)].
% 0.82/1.08 159 -event(A,B) | specific(A,B). [resolve(5,b,7,a)].
% 0.82/1.08 160 event(skc11,skc18) # label(clause91) # label(negated_conjecture). [assumption].
% 0.82/1.08 161 -member(skc11,A,skc17) | -member(skc11,B,skc16) | event(skc11,skf8(C,D)) # label(clause115) # label(negated_conjecture). [assumption].
% 0.82/1.08 162 event(skc11,skc13). [resolve(1,a,3,a)].
% 0.82/1.08 163 -member(skc11,A,skc17) | event(skc11,skf7(B)). [resolve(4,b,3,a)].
% 0.82/1.08 Derived: specific(skc11,skc18). [resolve(159,a,160,a)].
% 0.82/1.08 Derived: specific(skc11,skf8(A,B)) | -member(skc11,C,skc17) | -member(skc11,D,skc16). [resolve(159,a,161,c)].
% 0.82/1.09 164 -event(A,B) | unisex(A,B). [resolve(5,b,9,a)].
% 0.82/1.09 Derived: unisex(skc11,skc18). [resolve(164,a,160,a)].
% 0.82/1.09 Derived: unisex(skc11,skf8(A,B)) | -member(skc11,C,skc17) | -member(skc11,D,skc16). [resolve(164,a,161,c)].
% 0.82/1.09 165 -event(A,B) | singleton(A,B). [resolve(15,b,13,a)].
% 0.82/1.09 Derived: singleton(skc11,skc18). [resolve(165,a,160,a)].
% 0.82/1.09 Derived: singleton(skc11,skf8(A,B)) | -member(skc11,C,skc17) | -member(skc11,D,skc16). [resolve(165,a,161,c)].
% 0.82/1.09 166 -member(skc11,A,skc17) | -member(skc11,B,skc16) | event(skc11,skf8(C,D)). [resolve(64,c,65,a)].
% 0.82/1.09 167 -event(A,B) | -existent(A,B). [resolve(138,b,139,a)].
% 0.82/1.09 Derived: -existent(skc11,skc18). [resolve(167,a,160,a)].
% 0.82/1.09 Derived: -existent(skc11,skf8(A,B)) | -member(skc11,C,skc17) | -member(skc11,D,skc16). [resolve(167,a,161,c)].
% 0.82/1.09 168 -placename(A,B) | -specific(A,B). [resolve(125,b,126,a)].
% 0.82/1.09 169 specific(skc11,skc13). [resolve(10,a,7,a)].
% 0.82/1.09 170 -member(skc11,A,skc17) | specific(skc11,skf7(B)). [resolve(11,b,7,a)].
% 0.82/1.09 171 -location(A,B) | specific(A,B). [resolve(48,b,43,a)].
% 0.82/1.09 172 -clothes(A,B) | specific(A,B). [resolve(49,b,43,a)].
% 0.82/1.09 173 -way(A,B) | specific(A,B). [resolve(50,b,43,a)].
% 0.82/1.09 174 -transport(A,B) | specific(A,B). [resolve(51,b,43,a)].
% 0.82/1.09 175 -furniture(A,B) | specific(A,B). [resolve(52,b,43,a)].
% 0.82/1.09 176 specific(skc11,skc12). [resolve(53,a,43,a)].
% 0.82/1.09 177 specific(skc11,skc15). [resolve(77,a,80,a)].
% 0.82/1.09 178 -member(skc11,A,skc17) | specific(skc11,A). [resolve(85,b,80,a)].
% 0.82/1.09 Derived: -placename(skc11,skc13). [resolve(168,b,169,a)].
% 0.82/1.09 Derived: -placename(skc11,skf7(A)) | -member(skc11,B,skc17). [resolve(168,b,170,b)].
% 0.82/1.09 Derived: -placename(A,B) | -location(A,B). [resolve(168,b,171,b)].
% 0.82/1.09 Derived: -placename(A,B) | -clothes(A,B). [resolve(168,b,172,b)].
% 0.82/1.09 Derived: -placename(A,B) | -way(A,B). [resolve(168,b,173,b)].
% 0.82/1.09 Derived: -placename(A,B) | -transport(A,B). [resolve(168,b,174,b)].
% 0.82/1.09 Derived: -placename(A,B) | -furniture(A,B). [resolve(168,b,175,b)].
% 0.82/1.09 Derived: -placename(skc11,skc12). [resolve(168,b,176,a)].
% 0.82/1.09 Derived: -placename(skc11,skc15). [resolve(168,b,177,a)].
% 0.82/1.09 Derived: -placename(skc11,A) | -member(skc11,A,skc17). [resolve(168,b,178,b)].
% 0.82/1.09 179 -forename(A,B) | -specific(A,B). [resolve(127,b,126,a)].
% 0.82/1.09 Derived: -forename(skc11,skc13). [resolve(179,b,169,a)].
% 0.82/1.09 Derived: -forename(skc11,skf7(A)) | -member(skc11,B,skc17). [resolve(179,b,170,b)].
% 0.82/1.09 Derived: -forename(A,B) | -location(A,B). [resolve(179,b,171,b)].
% 0.82/1.09 Derived: -forename(A,B) | -clothes(A,B). [resolve(179,b,172,b)].
% 0.82/1.09 Derived: -forename(A,B) | -way(A,B). [resolve(179,b,173,b)].
% 0.82/1.09 Derived: -forename(A,B) | -transport(A,B). [resolve(179,b,174,b)].
% 0.82/1.09 Derived: -forename(A,B) | -furniture(A,B). [resolve(179,b,175,b)].
% 0.82/1.09 Derived: -forename(skc11,skc12). [resolve(179,b,176,a)].
% 0.82/1.09 Derived: -forename(skc11,skc15). [resolve(179,b,177,a)].
% 0.82/1.09 Derived: -forename(skc11,A) | -member(skc11,A,skc17). [resolve(179,b,178,b)].
% 0.82/1.09 180 specific(skc11,skc18). [resolve(159,a,160,a)].
% 0.82/1.09 Derived: -placename(skc11,skc18). [resolve(180,a,168,b)].
% 0.82/1.09 Derived: -forename(skc11,skc18). [resolve(180,a,179,b)].
% 0.82/1.09 181 specific(skc11,skf8(A,B)) | -member(skc11,C,skc17) | -member(skc11,D,skc16). [resolve(159,a,161,c)].
% 0.82/1.09 Derived: -member(skc11,A,skc17) | -member(skc11,B,skc16) | -placename(skc11,skf8(C,D)). [resolve(181,a,168,b)].
% 0.82/1.09 Derived: -member(skc11,A,skc17) | -member(skc11,B,skc16) | -forename(skc11,skf8(C,D)). [resolve(181,a,179,b)].
% 0.82/1.09 182 location(skc11,skc19). [resolve(110,a,111,a)].
% 0.82/1.09 183 -location(A,B) | nonliving(A,B). [resolve(32,b,34,a)].
% 0.82/1.09 184 -location(A,B) | impartial(A,B). [resolve(32,b,35,a)].
% 0.82/1.09 185 -location(A,B) | unisex(A,B). [resolve(32,b,36,a)].
% 0.82/1.09 186 -location(A,B) | existent(A,B). [resolve(48,b,44,a)].
% 0.82/1.09 187 -location(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(48,b,45,e)].
% 0.82/1.09 188 -location(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(48,b,46,e)].
% 0.82/1.09 189 -location(A,B) | singleton(A,B). [resolve(48,b,47,a)].
% 0.82/1.09 Derived: nonliving(skc11,skc19). [resolve(182,a,183,a)].
% 0.82/1.09 Derived: impartial(skc11,skc19). [resolve(182,a,184,a)].
% 0.82/1.10 Derived: unisex(skc11,skc19). [resolve(182,a,185,a)].
% 0.82/1.10 Derived: existent(skc11,skc19). [resolve(182,a,186,a)].
% 0.82/1.10 Derived: -placename(skc11,A) | -of(skc11,B,skc19) | -placename(skc11,B) | -of(skc11,A,skc19) | B = A. [resolve(182,a,187,a)].
% 0.82/1.10 Derived: -forename(skc11,A) | -of(skc11,B,skc19) | -forename(skc11,B) | -of(skc11,A,skc19) | B = A. [resolve(182,a,188,a)].
% 0.82/1.10 Derived: singleton(skc11,skc19). [resolve(182,a,189,a)].
% 0.82/1.10 190 -placename(A,B) | -location(A,B). [resolve(168,b,171,b)].
% 0.82/1.10 Derived: -placename(skc11,skc19). [resolve(190,b,182,a)].
% 0.82/1.10 191 -forename(A,B) | -location(A,B). [resolve(179,b,171,b)].
% 0.82/1.10 Derived: -forename(skc11,skc19). [resolve(191,b,182,a)].
% 0.82/1.10 192 -member(skc11,A,skc16) | clothes(skc11,A). [resolve(54,b,55,a)].
% 0.82/1.10 193 -clothes(A,B) | nonliving(A,B). [resolve(37,b,34,a)].
% 0.82/1.10 194 -clothes(A,B) | impartial(A,B). [resolve(37,b,35,a)].
% 0.82/1.10 195 -clothes(A,B) | unisex(A,B). [resolve(37,b,36,a)].
% 0.82/1.10 196 -clothes(A,B) | existent(A,B). [resolve(49,b,44,a)].
% 0.82/1.10 197 -clothes(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(49,b,45,e)].
% 0.82/1.10 198 -clothes(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(49,b,46,e)].
% 0.82/1.10 199 -clothes(A,B) | singleton(A,B). [resolve(49,b,47,a)].
% 0.82/1.10 Derived: -member(skc11,A,skc16) | nonliving(skc11,A). [resolve(192,b,193,a)].
% 0.82/1.10 Derived: -member(skc11,A,skc16) | impartial(skc11,A). [resolve(192,b,194,a)].
% 0.82/1.10 Derived: -member(skc11,A,skc16) | unisex(skc11,A). [resolve(192,b,195,a)].
% 0.82/1.10 Derived: -member(skc11,A,skc16) | existent(skc11,A). [resolve(192,b,196,a)].
% 0.82/1.10 Derived: -member(skc11,A,skc16) | -placename(skc11,B) | -of(skc11,C,A) | -placename(skc11,C) | -of(skc11,B,A) | C = B. [resolve(192,b,197,a)].
% 0.82/1.10 Derived: -member(skc11,A,skc16) | -forename(skc11,B) | -of(skc11,C,A) | -forename(skc11,C) | -of(skc11,B,A) | C = B. [resolve(192,b,198,a)].
% 0.82/1.10 Derived: -member(skc11,A,skc16) | singleton(skc11,A). [resolve(192,b,199,a)].
% 0.82/1.10 200 -placename(A,B) | -clothes(A,B). [resolve(168,b,172,b)].
% 0.82/1.10 Derived: -placename(skc11,A) | -member(skc11,A,skc16). [resolve(200,b,192,b)].
% 0.82/1.10 201 -forename(A,B) | -clothes(A,B). [resolve(179,b,172,b)].
% 0.82/1.10 Derived: -forename(skc11,A) | -member(skc11,A,skc16). [resolve(201,b,192,b)].
% 0.82/1.10 202 way(skc11,skc19). [resolve(88,a,89,a)].
% 0.82/1.10 203 -way(A,B) | nonliving(A,B). [resolve(38,b,34,a)].
% 0.82/1.10 204 -way(A,B) | impartial(A,B). [resolve(38,b,35,a)].
% 0.82/1.10 205 -way(A,B) | unisex(A,B). [resolve(38,b,36,a)].
% 0.82/1.10 206 -way(A,B) | existent(A,B). [resolve(50,b,44,a)].
% 0.82/1.10 207 -way(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(50,b,45,e)].
% 0.82/1.10 208 -way(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(50,b,46,e)].
% 0.82/1.10 209 -way(A,B) | singleton(A,B). [resolve(50,b,47,a)].
% 0.82/1.10 210 -placename(A,B) | -way(A,B). [resolve(168,b,173,b)].
% 0.82/1.10 211 -forename(A,B) | -way(A,B). [resolve(179,b,173,b)].
% 0.82/1.10 212 transport(skc11,skc23). [resolve(94,a,95,a)].
% 0.82/1.10 213 -transport(A,B) | nonliving(A,B). [resolve(39,b,34,a)].
% 0.82/1.10 214 -transport(A,B) | impartial(A,B). [resolve(39,b,35,a)].
% 0.82/1.10 215 -transport(A,B) | unisex(A,B). [resolve(39,b,36,a)].
% 0.82/1.10 216 -transport(A,B) | existent(A,B). [resolve(51,b,44,a)].
% 0.82/1.10 217 -transport(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(51,b,45,e)].
% 0.82/1.10 218 -transport(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(51,b,46,e)].
% 0.82/1.10 219 -transport(A,B) | singleton(A,B). [resolve(51,b,47,a)].
% 0.82/1.10 Derived: nonliving(skc11,skc23). [resolve(212,a,213,a)].
% 0.82/1.10 Derived: impartial(skc11,skc23). [resolve(212,a,214,a)].
% 0.82/1.10 Derived: unisex(skc11,skc23). [resolve(212,a,215,a)].
% 0.82/1.10 Derived: existent(skc11,skc23). [resolve(212,a,216,a)].
% 0.82/1.10 Derived: -placename(skc11,A) | -of(skc11,B,skc23) | -placename(skc11,B) | -of(skc11,A,skc23) | B = A. [resolve(212,a,217,a)].
% 0.82/1.10 Derived: -forename(skc11,A) | -of(skc11,B,skc23) | -forename(skc11,B) | -of(skc11,A,skc23) | B = A. [resolve(212,a,218,a)].
% 0.82/1.10 Derived: singleton(skc11,skc23). [resolve(212,a,219,a)].
% 0.82/1.10 220 -placename(A,B) | -transport(A,B). [resolve(168,b,174,b)].
% 0.82/1.10 Derived: -placename(skc11,skc23). [resolve(220,b,212,a)].
% 0.82/1.11 221 -forename(A,B) | -transport(A,B). [resolve(179,b,174,b)].
% 0.82/1.11 Derived: -forename(skc11,skc23). [resolve(221,b,212,a)].
% 0.82/1.11 222 furniture(skc11,skc19). [resolve(114,a,115,a)].
% 0.82/1.11 223 -furniture(A,B) | nonliving(A,B). [resolve(40,b,34,a)].
% 0.82/1.11 224 -furniture(A,B) | impartial(A,B). [resolve(40,b,35,a)].
% 0.82/1.11 225 -furniture(A,B) | unisex(A,B). [resolve(40,b,36,a)].
% 0.82/1.11 226 -furniture(A,B) | existent(A,B). [resolve(52,b,44,a)].
% 0.82/1.11 227 -furniture(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(52,b,45,e)].
% 0.82/1.11 228 -furniture(A,B) | -forename(A,C) | -of(A,D,B) | -forename(A,D) | -of(A,C,B) | D = C. [resolve(52,b,46,e)].
% 0.82/1.11 229 -furniture(A,B) | singleton(A,B). [resolve(52,b,47,a)].
% 0.82/1.11 230 -placename(A,B) | -furniture(A,B). [resolve(168,b,175,b)].
% 0.82/1.11 231 -forename(A,B) | -furniture(A,B). [resolve(179,b,175,b)].
% 0.82/1.11
% 0.82/1.11 ============================== end predicate elimination =============
% 0.82/1.11
% 0.82/1.11 Auto_denials: (non-Horn, no changes).
% 0.82/1.11
% 0.82/1.11 Term ordering decisions:
% 0.82/1.11 Function symbol KB weights: skc11=1. skc17=1. skc16=1. skc23=1. skc12=1. skc19=1. skc15=1. skc14=1. skc18=1. skc20=1. skc13=1. skf10=1. skf12=1. skf8=1. skf7=1. skf6=1. skf13=1.
% 0.82/1.11
% 0.82/1.11 ============================== PROOF =================================
% 0.82/1.11 % SZS status Unsatisfiable
% 0.82/1.11 % SZS output start Refutation
% 0.82/1.11
% 0.82/1.11 % Proof 1 at 0.10 (+ 0.00) seconds.
% 0.82/1.11 % Length of proof is 24.
% 0.82/1.11 % Level of proof is 6.
% 0.82/1.11 % Maximum clause weight is 3.000.
% 0.82/1.11 % Given clauses 0.
% 0.82/1.11
% 0.82/1.11 18 wheel(skc11,skc12) # label(clause98) # label(negated_conjecture). [assumption].
% 0.82/1.11 19 -wheel(A,B) | device(A,B) # label(clause10) # label(axiom). [assumption].
% 0.82/1.11 20 device(skc11,skc12). [resolve(18,a,19,a)].
% 0.82/1.11 21 -device(A,B) | instrumentality(A,B) # label(clause11) # label(axiom). [assumption].
% 0.82/1.11 23 -instrumentality(A,B) | artifact(A,B) # label(clause12) # label(axiom). [assumption].
% 0.82/1.11 25 instrumentality(skc11,skc12). [resolve(20,a,21,a)].
% 0.82/1.11 27 -artifact(A,B) | object(A,B) # label(clause13) # label(axiom). [assumption].
% 0.82/1.11 31 artifact(skc11,skc12). [resolve(25,a,23,a)].
% 0.82/1.11 34 -object(A,B) | nonliving(A,B) # label(clause18) # label(axiom). [assumption].
% 0.82/1.11 41 object(skc11,skc12). [resolve(31,a,27,a)].
% 0.82/1.11 68 man(skc11,skc15) # label(clause94) # label(negated_conjecture). [assumption].
% 0.82/1.11 69 -man(A,B) | human_person(A,B) # label(clause27) # label(axiom). [assumption].
% 0.82/1.11 72 human_person(skc11,skc15). [resolve(68,a,69,a)].
% 0.82/1.11 73 -human_person(A,B) | organism(A,B) # label(clause28) # label(axiom). [assumption].
% 0.82/1.11 77 organism(skc11,skc15). [resolve(72,a,73,a)].
% 0.82/1.11 79 -organism(A,B) | living(A,B) # label(clause31) # label(axiom). [assumption].
% 0.82/1.11 132 living(skc11,skc15). [resolve(77,a,79,a)].
% 0.82/1.11 133 -living(A,B) | -nonliving(A,B) # label(clause63) # label(axiom). [assumption].
% 0.82/1.11 145 be(skc11,skc13,skc15,skc12) # label(clause106) # label(negated_conjecture). [assumption].
% 0.82/1.11 146 -be(A,B,C,D) | C = D # label(clause67) # label(axiom). [assumption].
% 0.82/1.11 246 nonliving(skc11,skc12). [resolve(41,a,34,a)].
% 0.82/1.11 272 -nonliving(skc11,skc15). [resolve(132,a,133,a)].
% 0.82/1.11 278 skc15 = skc12. [resolve(145,a,146,a)].
% 0.82/1.11 350 $F. [back_rewrite(272),rewrite([278(2)]),unit_del(a,246)].
% 0.82/1.11
% 0.82/1.11 % SZS output end Refutation
% 0.82/1.11 ============================== end of proof ==========================
% 0.82/1.11
% 0.82/1.11 ============================== STATISTICS ============================
% 0.82/1.11
% 0.82/1.11 Given=0. Generated=128. Kept=111. proofs=1.
% 0.82/1.11 Usable=0. Sos=44. Demods=1. Limbo=65, Disabled=363. Hints=0.
% 0.82/1.11 Megabytes=0.23.
% 0.82/1.11 User_CPU=0.10, System_CPU=0.00, Wall_clock=0.
% 0.82/1.11
% 0.82/1.11 ============================== end of statistics =====================
% 0.82/1.11
% 0.82/1.11 ============================== end of search =========================
% 0.82/1.11
% 0.82/1.11 THEOREM PROVED
% 0.82/1.11 % SZS status Unsatisfiable
% 0.82/1.11
% 0.82/1.11 Exiting with 1 proof.
% 0.82/1.11
% 0.82/1.11 Process 13681 exit (max_proofs) Thu Jun 30 23:23:24 2022
% 0.82/1.11 Prover9 interrupted
%------------------------------------------------------------------------------