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