TSTP Solution File: NLP147-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP147-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:15 EDT 2022
% Result : Unsatisfiable 0.73s 1.04s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NLP147-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 04:02:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.00 ============================== Prover9 ===============================
% 0.44/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00 Process 7250 was started by sandbox on n004.cluster.edu,
% 0.44/1.00 Fri Jul 1 04:02:08 2022
% 0.44/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7097_n004.cluster.edu".
% 0.44/1.00 ============================== end of head ===========================
% 0.44/1.00
% 0.44/1.00 ============================== INPUT =================================
% 0.44/1.00
% 0.44/1.00 % Reading from file /tmp/Prover9_7097_n004.cluster.edu
% 0.44/1.00
% 0.44/1.00 set(prolog_style_variables).
% 0.44/1.00 set(auto2).
% 0.44/1.00 % set(auto2) -> set(auto).
% 0.44/1.00 % set(auto) -> set(auto_inference).
% 0.44/1.00 % set(auto) -> set(auto_setup).
% 0.44/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.00 % set(auto) -> set(auto_limits).
% 0.44/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.00 % set(auto) -> set(auto_denials).
% 0.44/1.00 % set(auto) -> set(auto_process).
% 0.44/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.00 % set(auto2) -> assign(stats, some).
% 0.44/1.00 % set(auto2) -> clear(echo_input).
% 0.44/1.00 % set(auto2) -> set(quiet).
% 0.44/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.00 % set(auto2) -> clear(print_given).
% 0.44/1.00 assign(lrs_ticks,-1).
% 0.44/1.00 assign(sos_limit,10000).
% 0.44/1.00 assign(order,kbo).
% 0.44/1.00 set(lex_order_vars).
% 0.44/1.00 clear(print_given).
% 0.44/1.00
% 0.44/1.00 % formulas(sos). % not echoed (92 formulas)
% 0.44/1.00
% 0.44/1.00 ============================== end of input ==========================
% 0.44/1.00
% 0.44/1.00 % From the command line: assign(max_seconds, 300).
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.00
% 0.44/1.00 % Formulas that are not ordinary clauses:
% 0.44/1.00
% 0.44/1.00 ============================== end of process non-clausal formulas ===
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.00
% 0.44/1.00 ============================== PREDICATE ELIMINATION =================
% 0.44/1.00 1 -street(A,B) | way(A,B) # label(clause36) # label(axiom). [assumption].
% 0.44/1.00 2 street(skc6,skc13) # label(clause69) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: way(skc6,skc13). [resolve(1,a,2,a)].
% 0.44/1.00 3 -hollywood_placename(A,B) | placename(A,B) # label(clause45) # label(axiom). [assumption].
% 0.44/1.00 4 hollywood_placename(skc6,skc12) # label(clause71) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: placename(skc6,skc12). [resolve(3,a,4,a)].
% 0.44/1.00 5 -city(A,B) | location(A,B) # label(clause46) # label(axiom). [assumption].
% 0.44/1.00 6 city(skc6,skc11) # label(clause72) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: location(skc6,skc11). [resolve(5,a,6,a)].
% 0.44/1.00 7 -chevy(A,B) | car(A,B) # label(clause26) # label(axiom). [assumption].
% 0.44/1.00 8 chevy(skc6,skc11) # label(clause73) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: car(skc6,skc11). [resolve(7,a,8,a)].
% 0.44/1.00 9 -old(A,B) | -young(A,B) # label(clause51) # label(axiom). [assumption].
% 0.44/1.00 10 old(skc6,skc11) # label(clause76) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: -young(skc6,skc11). [resolve(9,a,10,a)].
% 0.44/1.00 11 skf10(A,B) != skf8(A,B) | -two(B,A) # label(clause62) # label(axiom). [assumption].
% 0.44/1.00 12 two(skc6,skc7) # label(clause77) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: skf10(skc7,skc6) != skf8(skc7,skc6). [resolve(11,b,12,a)].
% 0.44/1.00 13 -two(A,B) | group(A,B) # label(clause17) # label(axiom). [assumption].
% 0.44/1.00 Derived: group(skc6,skc7). [resolve(13,a,12,a)].
% 0.44/1.00 14 -two(A,B) | member(A,skf10(B,A),B) # label(clause60) # label(axiom). [assumption].
% 0.44/1.00 Derived: member(skc6,skf10(skc7,skc6),skc7). [resolve(14,a,12,a)].
% 0.44/1.00 15 -two(A,B) | member(A,skf8(B,A),B) # label(clause61) # label(axiom). [assumption].
% 0.44/1.00 Derived: member(skc6,skf8(skc7,skc6),skc7). [resolve(15,a,12,a)].
% 0.44/1.00 16 -member(A,B,C) | -two(A,C) | B = skf8(C,A) | B = skf10(C,A) # label(clause63) # label(axiom). [assumption].
% 0.44/1.00 Derived: -member(skc6,A,skc7) | A = skf8(skc7,skc6) | A = skf10(skc7,skc6). [resolve(16,b,12,a)].
% 0.44/1.00 17 skf11(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | two(E,F) | A = B # label(clause64) # label(axiom). [assumption].
% 0.44/1.00 Derived: skf11(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | skf10(F,E) != skf8(F,E). [resolve(17,d,11,b)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | group(E,F). [resolve(17,d,13,a)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | member(E,skf10(F,E),F). [resolve(17,d,14,a)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | member(E,skf8(F,E),F). [resolve(17,d,15,a)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | -member(E,V6,F) | V6 = skf8(F,E) | V6 = skf10(F,E). [resolve(17,d,16,b)].
% 0.44/1.00 18 skf11(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | two(E,F) | A = V6 # label(clause65) # label(axiom). [assumption].
% 0.44/1.00 Derived: skf11(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | skf10(F,E) != skf8(F,E). [resolve(18,d,11,b)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | group(E,F). [resolve(18,d,13,a)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | member(E,skf10(F,E),F). [resolve(18,d,14,a)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | member(E,skf8(F,E),F). [resolve(18,d,15,a)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | -member(E,V7,F) | V7 = skf8(F,E) | V7 = skf10(F,E). [resolve(18,d,16,b)].
% 0.44/1.00 19 -member(A,B,C) | -member(A,D,C) | two(A,C) | member(A,skf11(B,D,C,A),C) | B = D # label(clause66) # label(axiom). [assumption].
% 0.44/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf11(B,D,C,A),C) | B = D | skf10(C,A) != skf8(C,A). [resolve(19,c,11,b)].
% 0.44/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf11(B,D,C,A),C) | B = D | group(A,C). [resolve(19,c,13,a)].
% 0.44/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf11(B,D,C,A),C) | B = D | member(A,skf10(C,A),C). [resolve(19,c,14,a)].
% 0.44/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf11(B,D,C,A),C) | B = D | member(A,skf8(C,A),C). [resolve(19,c,15,a)].
% 0.44/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf11(B,D,C,A),C) | B = D | -member(A,E,C) | E = skf8(C,A) | E = skf10(C,A). [resolve(19,c,16,b)].
% 0.44/1.00 20 -group(A,B) | set(A,B) # label(clause15) # label(axiom). [assumption].
% 0.44/1.00 21 group(skc6,skc7) # label(clause78) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: set(skc6,skc7). [resolve(20,a,21,a)].
% 0.44/1.00 22 group(skc6,skc7). [resolve(13,a,12,a)].
% 0.44/1.00 23 skf11(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | group(E,F). [resolve(17,d,13,a)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | set(E,F). [resolve(23,e,20,a)].
% 0.44/1.00 24 skf11(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | group(E,F). [resolve(18,d,13,a)].
% 0.44/1.00 Derived: skf11(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | set(E,F). [resolve(24,e,20,a)].
% 0.44/1.00 25 -member(A,B,C) | -member(A,D,C) | member(A,skf11(B,D,C,A),C) | B = D | group(A,C). [resolve(19,c,13,a)].
% 0.44/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf11(B,D,C,A),C) | B = D | set(A,C). [resolve(25,e,20,a)].
% 0.44/1.00 26 -barrel(A,B) | event(A,B) # label(clause25) # label(axiom). [assumption].
% 0.44/1.00 27 barrel(skc6,skc10) # label(clause80) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: event(skc6,skc10). [resolve(26,a,27,a)].
% 0.44/1.00 28 -event(A,B) | eventuality(A,B) # label(clause24) # label(axiom). [assumption].
% 0.44/1.00 29 event(skc6,skc10) # label(clause82) # label(negated_conjecture). [assumption].
% 0.44/1.00 30 -state(A,B) | event(A,B) # label(clause23) # label(axiom). [assumption].
% 0.44/1.00 Derived: eventuality(skc6,skc10). [resolve(28,a,29,a)].
% 0.44/1.00 Derived: eventuality(A,B) | -state(A,B). [resolve(28,a,30,b)].
% 0.44/1.00 31 event(skc6,skc10). [resolve(26,a,27,a)].
% 0.44/1.00 32 -man(A,B) | male(A,B) # label(clause14) # label(axiom). [assumption].
% 0.44/1.00 33 -male(A,B) | -unisex(A,B) # label(clause52) # label(axiom). [assumption].
% 0.44/1.01 Derived: -man(A,B) | -unisex(A,B). [resolve(32,b,33,a)].
% 0.44/1.01 34 -abstraction(A,B) | general(A,B) # label(clause43) # label(axiom). [assumption].
% 0.44/1.01 35 -general(A,B) | -specific(A,B) # label(clause53) # label(axiom). [assumption].
% 0.44/1.01 Derived: -abstraction(A,B) | -specific(A,B). [resolve(34,b,35,a)].
% 0.44/1.01 36 -set(A,B) | multiple(A,B) # label(clause16) # label(axiom). [assumption].
% 0.44/1.01 37 -multiple(A,B) | -singleton(A,B) # label(clause54) # label(axiom). [assumption].
% 0.44/1.01 Derived: -set(A,B) | -singleton(A,B). [resolve(36,b,37,a)].
% 0.44/1.01 38 -organism(A,B) | living(A,B) # label(clause11) # label(axiom). [assumption].
% 0.44/1.01 39 -living(A,B) | -nonliving(A,B) # label(clause55) # label(axiom). [assumption].
% 0.44/1.01 Derived: -organism(A,B) | -nonliving(A,B). [resolve(38,b,39,a)].
% 0.44/1.01 40 -human_person(A,B) | human(A,B) # label(clause12) # label(axiom). [assumption].
% 0.44/1.01 41 -human(A,B) | -nonhuman(A,B) # label(clause56) # label(axiom). [assumption].
% 0.44/1.01 Derived: -human_person(A,B) | -nonhuman(A,B). [resolve(40,b,41,a)].
% 0.44/1.01 42 -eventuality(A,B) | nonexistent(A,B) # label(clause21) # label(axiom). [assumption].
% 0.44/1.01 43 -nonexistent(A,B) | -existent(A,B) # label(clause57) # label(axiom). [assumption].
% 0.44/1.01 Derived: -eventuality(A,B) | -existent(A,B). [resolve(42,b,43,a)].
% 0.44/1.01 44 -object(A,B) | nonliving(A,B) # label(clause33) # label(axiom). [assumption].
% 0.44/1.01 45 -nonliving(A,B) | -animate(A,B) # label(clause58) # label(axiom). [assumption].
% 0.44/1.01 Derived: -object(A,B) | -animate(A,B). [resolve(44,b,45,a)].
% 0.44/1.01 46 -organism(A,B) | -nonliving(A,B). [resolve(38,b,39,a)].
% 0.44/1.01 Derived: -organism(A,B) | -object(A,B). [resolve(46,b,44,b)].
% 0.44/1.01 47 -member(skc6,A,skc7) | fellow(skc6,A) # label(clause88) # label(negated_conjecture). [assumption].
% 0.44/1.01 48 -fellow(A,B) | man(A,B) # label(clause2) # label(axiom). [assumption].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | man(skc6,A). [resolve(47,b,48,a)].
% 0.44/1.01 49 -member(skc6,A,skc7) | man(skc6,A). [resolve(47,b,48,a)].
% 0.44/1.01 50 -man(A,B) | human_person(A,B) # label(clause3) # label(axiom). [assumption].
% 0.44/1.01 51 -man(A,B) | -unisex(A,B). [resolve(32,b,33,a)].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | human_person(skc6,A). [resolve(49,b,50,a)].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | -unisex(skc6,A). [resolve(49,b,51,a)].
% 0.44/1.01 52 -member(skc6,A,skc7) | human_person(skc6,A). [resolve(49,b,50,a)].
% 0.44/1.01 53 -human_person(A,B) | organism(A,B) # label(clause4) # label(axiom). [assumption].
% 0.44/1.01 54 -human_person(A,B) | animate(A,B) # label(clause13) # label(axiom). [assumption].
% 0.44/1.01 55 -human_person(A,B) | -nonhuman(A,B). [resolve(40,b,41,a)].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | organism(skc6,A). [resolve(52,b,53,a)].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | animate(skc6,A). [resolve(52,b,54,a)].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | -nonhuman(skc6,A). [resolve(52,b,55,a)].
% 0.44/1.01 56 -member(skc6,A,skc7) | organism(skc6,A). [resolve(52,b,53,a)].
% 0.44/1.01 57 -organism(A,B) | entity(A,B) # label(clause5) # label(axiom). [assumption].
% 0.44/1.01 58 -organism(A,B) | impartial(A,B) # label(clause10) # label(axiom). [assumption].
% 0.44/1.01 59 -organism(A,B) | -object(A,B). [resolve(46,b,44,b)].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | entity(skc6,A). [resolve(56,b,57,a)].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | impartial(skc6,A). [resolve(56,b,58,a)].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | -object(skc6,A). [resolve(56,b,59,a)].
% 0.44/1.01 60 -object(A,B) | entity(A,B) # label(clause32) # label(axiom). [assumption].
% 0.44/1.01 61 -entity(A,B) | thing(A,B) # label(clause6) # label(axiom). [assumption].
% 0.44/1.01 62 -entity(A,B) | specific(A,B) # label(clause8) # label(axiom). [assumption].
% 0.44/1.01 63 -entity(A,B) | existent(A,B) # label(clause9) # label(axiom). [assumption].
% 0.44/1.01 Derived: -object(A,B) | thing(A,B). [resolve(60,b,61,a)].
% 0.44/1.01 Derived: -object(A,B) | specific(A,B). [resolve(60,b,62,a)].
% 0.44/1.01 Derived: -object(A,B) | existent(A,B). [resolve(60,b,63,a)].
% 0.44/1.01 64 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | -entity(A,D) | C = B # label(clause67) # label(axiom). [assumption].
% 0.44/1.01 Derived: -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -object(A,D). [resolve(64,e,60,b)].
% 0.44/1.01 65 -member(skc6,A,skc7) | entity(skc6,A). [resolve(56,b,57,a)].
% 0.44/1.01 Derived: -member(skc6,A,skc7) | thing(skc6,A). [resolve(65,b,61,a)].
% 0.73/1.01 Derived: -member(skc6,A,skc7) | specific(skc6,A). [resolve(65,b,62,a)].
% 0.73/1.01 Derived: -member(skc6,A,skc7) | existent(skc6,A). [resolve(65,b,63,a)].
% 0.73/1.01 Derived: -member(skc6,A,skc7) | -placename(skc6,B) | -of(skc6,C,A) | -placename(skc6,C) | -of(skc6,B,A) | C = B. [resolve(65,b,64,e)].
% 0.73/1.01 66 -eventuality(A,B) | thing(A,B) # label(clause19) # label(axiom). [assumption].
% 0.73/1.01 67 -thing(A,B) | singleton(A,B) # label(clause7) # label(axiom). [assumption].
% 0.73/1.01 Derived: -eventuality(A,B) | singleton(A,B). [resolve(66,b,67,a)].
% 0.73/1.01 68 -abstraction(A,B) | thing(A,B) # label(clause41) # label(axiom). [assumption].
% 0.73/1.01 Derived: -abstraction(A,B) | singleton(A,B). [resolve(68,b,67,a)].
% 0.73/1.01 69 -object(A,B) | thing(A,B). [resolve(60,b,61,a)].
% 0.73/1.01 Derived: -object(A,B) | singleton(A,B). [resolve(69,b,67,a)].
% 0.73/1.01 70 -member(skc6,A,skc7) | thing(skc6,A). [resolve(65,b,61,a)].
% 0.73/1.01 Derived: -member(skc6,A,skc7) | singleton(skc6,A). [resolve(70,b,67,a)].
% 0.73/1.01 71 -member(skc6,A,skc7) | state(skc6,skf6(B)) # label(clause90) # label(negated_conjecture). [assumption].
% 0.73/1.01 72 -state(A,B) | eventuality(A,B) # label(clause18) # label(axiom). [assumption].
% 0.73/1.01 Derived: -member(skc6,A,skc7) | eventuality(skc6,skf6(B)). [resolve(71,b,72,a)].
% 0.73/1.01 73 eventuality(A,B) | -state(A,B). [resolve(28,a,30,b)].
% 0.73/1.01 74 eventuality(skc6,skc10). [resolve(28,a,29,a)].
% 0.73/1.01 75 -eventuality(A,B) | specific(A,B) # label(clause20) # label(axiom). [assumption].
% 0.73/1.01 76 -eventuality(A,B) | unisex(A,B) # label(clause22) # label(axiom). [assumption].
% 0.73/1.01 Derived: specific(skc6,skc10). [resolve(74,a,75,a)].
% 0.73/1.01 Derived: unisex(skc6,skc10). [resolve(74,a,76,a)].
% 0.73/1.01 77 -eventuality(A,B) | -existent(A,B). [resolve(42,b,43,a)].
% 0.73/1.01 Derived: -existent(skc6,skc10). [resolve(77,a,74,a)].
% 0.73/1.01 78 -eventuality(A,B) | singleton(A,B). [resolve(66,b,67,a)].
% 0.73/1.01 Derived: singleton(skc6,skc10). [resolve(78,a,74,a)].
% 0.73/1.01 79 -member(skc6,A,skc7) | eventuality(skc6,skf6(B)). [resolve(71,b,72,a)].
% 0.73/1.01 Derived: -member(skc6,A,skc7) | specific(skc6,skf6(B)). [resolve(79,b,75,a)].
% 0.73/1.01 Derived: -member(skc6,A,skc7) | unisex(skc6,skf6(B)). [resolve(79,b,76,a)].
% 0.73/1.01 Derived: -member(skc6,A,skc7) | -existent(skc6,skf6(B)). [resolve(79,b,77,a)].
% 0.73/1.01 Derived: -member(skc6,A,skc7) | singleton(skc6,skf6(B)). [resolve(79,b,78,a)].
% 0.73/1.01 80 car(skc6,skc11). [resolve(7,a,8,a)].
% 0.73/1.01 81 -car(A,B) | vehicle(A,B) # label(clause27) # label(axiom). [assumption].
% 0.73/1.01 Derived: vehicle(skc6,skc11). [resolve(80,a,81,a)].
% 0.73/1.01 82 vehicle(skc6,skc11). [resolve(80,a,81,a)].
% 0.73/1.01 83 -vehicle(A,B) | transport(A,B) # label(clause28) # label(axiom). [assumption].
% 0.73/1.01 Derived: transport(skc6,skc11). [resolve(82,a,83,a)].
% 0.73/1.01 84 transport(skc6,skc11). [resolve(82,a,83,a)].
% 0.73/1.01 85 -transport(A,B) | instrumentality(A,B) # label(clause29) # label(axiom). [assumption].
% 0.73/1.01 Derived: instrumentality(skc6,skc11). [resolve(84,a,85,a)].
% 0.73/1.01 86 -furniture(A,B) | instrumentality(A,B) # label(clause50) # label(axiom). [assumption].
% 0.73/1.01 87 -instrumentality(A,B) | artifact(A,B) # label(clause30) # label(axiom). [assumption].
% 0.73/1.01 Derived: -furniture(A,B) | artifact(A,B). [resolve(86,b,87,a)].
% 0.73/1.01 88 instrumentality(skc6,skc11). [resolve(84,a,85,a)].
% 0.73/1.01 Derived: artifact(skc6,skc11). [resolve(88,a,87,a)].
% 0.73/1.01 89 -way(A,B) | artifact(A,B) # label(clause37) # label(axiom). [assumption].
% 0.73/1.01 90 -artifact(A,B) | object(A,B) # label(clause31) # label(axiom). [assumption].
% 0.73/1.01 Derived: -way(A,B) | object(A,B). [resolve(89,b,90,a)].
% 0.73/1.01 91 -furniture(A,B) | artifact(A,B). [resolve(86,b,87,a)].
% 0.73/1.01 Derived: -furniture(A,B) | object(A,B). [resolve(91,b,90,a)].
% 0.73/1.01 92 artifact(skc6,skc11). [resolve(88,a,87,a)].
% 0.73/1.01 Derived: object(skc6,skc11). [resolve(92,a,90,a)].
% 0.73/1.01 93 -relname(A,B) | relation(A,B) # label(clause39) # label(axiom). [assumption].
% 0.73/1.01 94 -placename(A,B) | relname(A,B) # label(clause38) # label(axiom). [assumption].
% 0.73/1.01 Derived: relation(A,B) | -placename(A,B). [resolve(93,a,94,b)].
% 0.73/1.01 95 relation(A,B) | -placename(A,B). [resolve(93,a,94,b)].
% 0.73/1.01 96 -relation(A,B) | abstraction(A,B) # label(clause40) # label(axiom). [assumption].
% 0.73/1.01 Derived: -placename(A,B) | abstraction(A,B). [resolve(95,a,96,a)].
% 0.73/1.01 97 -placename(A,B) | abstraction(A,B). [resolve(95,a,96,a)].
% 0.73/1.01 98 -abstraction(A,B) | nonhuman(A,B) # label(clause42) # label(axiom). [assumption].
% 0.73/1.04 99 -abstraction(A,B) | unisex(A,B) # label(clause44) # label(axiom). [assumption].
% 0.73/1.04 100 -abstraction(A,B) | -specific(A,B). [resolve(34,b,35,a)].
% 0.73/1.04 101 -abstraction(A,B) | singleton(A,B). [resolve(68,b,67,a)].
% 0.73/1.04 Derived: -placename(A,B) | nonhuman(A,B). [resolve(97,b,98,a)].
% 0.73/1.04 Derived: -placename(A,B) | unisex(A,B). [resolve(97,b,99,a)].
% 0.73/1.04 Derived: -placename(A,B) | -specific(A,B). [resolve(97,b,100,a)].
% 0.73/1.04 Derived: -placename(A,B) | singleton(A,B). [resolve(97,b,101,a)].
% 0.73/1.04 102 location(skc6,skc11). [resolve(5,a,6,a)].
% 0.73/1.04 103 -location(A,B) | object(A,B) # label(clause47) # label(axiom). [assumption].
% 0.73/1.04 104 -member(skc6,A,skc7) | frontseat(skc6,skf5(B)) # label(clause89) # label(negated_conjecture). [assumption].
% 0.73/1.04 105 -frontseat(A,B) | seat(A,B) # label(clause48) # label(axiom). [assumption].
% 0.73/1.04 Derived: -member(skc6,A,skc7) | seat(skc6,skf5(B)). [resolve(104,b,105,a)].
% 0.73/1.04 106 -member(skc6,A,skc7) | seat(skc6,skf5(B)). [resolve(104,b,105,a)].
% 0.73/1.04 107 -seat(A,B) | furniture(A,B) # label(clause49) # label(axiom). [assumption].
% 0.73/1.04 Derived: -member(skc6,A,skc7) | furniture(skc6,skf5(B)). [resolve(106,b,107,a)].
% 0.73/1.04 108 -member(skc6,A,skc7) | be(skc6,skf6(A),A,skf5(A)) # label(clause92) # label(negated_conjecture). [assumption].
% 0.73/1.04 109 -be(A,B,C,D) | C = D # label(clause59) # label(axiom). [assumption].
% 0.73/1.04 Derived: -member(skc6,A,skc7) | A = skf5(A). [resolve(108,b,109,a)].
% 0.73/1.04 110 -way(A,B) | object(A,B). [resolve(89,b,90,a)].
% 0.73/1.04 111 way(skc6,skc13). [resolve(1,a,2,a)].
% 0.73/1.04 Derived: object(skc6,skc13). [resolve(110,a,111,a)].
% 0.73/1.04 112 -set(A,B) | -singleton(A,B). [resolve(36,b,37,a)].
% 0.73/1.04 113 set(skc6,skc7). [resolve(20,a,21,a)].
% 0.73/1.04 114 skf11(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | set(E,F). [resolve(23,e,20,a)].
% 0.73/1.04 115 skf11(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | set(E,F). [resolve(24,e,20,a)].
% 0.73/1.04 116 -member(A,B,C) | -member(A,D,C) | member(A,skf11(B,D,C,A),C) | B = D | set(A,C). [resolve(25,e,20,a)].
% 0.73/1.04 Derived: -singleton(skc6,skc7). [resolve(112,a,113,a)].
% 0.73/1.04 Derived: -singleton(A,B) | skf11(C,D,E,F) != D | -member(A,C,B) | -member(A,D,B) | C = D. [resolve(112,a,114,e)].
% 0.73/1.04 Derived: -singleton(A,B) | skf11(C,D,E,F) != C | -member(A,C,B) | -member(A,V6,B) | C = V6. [resolve(112,a,115,e)].
% 0.73/1.04 Derived: -singleton(A,B) | -member(A,C,B) | -member(A,D,B) | member(A,skf11(C,D,B,A),B) | C = D. [resolve(112,a,116,e)].
% 0.73/1.04 117 -member(skc6,A,skc7) | animate(skc6,A). [resolve(52,b,54,a)].
% 0.73/1.04 118 -object(A,B) | -animate(A,B). [resolve(44,b,45,a)].
% 0.73/1.04 119 -placename(A,B) | -specific(A,B). [resolve(97,b,100,a)].
% 0.73/1.04 120 -object(A,B) | specific(A,B). [resolve(60,b,62,a)].
% 0.73/1.04 121 -member(skc6,A,skc7) | specific(skc6,A). [resolve(65,b,62,a)].
% 0.73/1.04 122 specific(skc6,skc10). [resolve(74,a,75,a)].
% 0.73/1.04 123 -member(skc6,A,skc7) | specific(skc6,skf6(B)). [resolve(79,b,75,a)].
% 0.73/1.04 Derived: -placename(A,B) | -object(A,B). [resolve(119,b,120,b)].
% 0.73/1.04 Derived: -placename(skc6,A) | -member(skc6,A,skc7). [resolve(119,b,121,b)].
% 0.73/1.04 Derived: -placename(skc6,skc10). [resolve(119,b,122,a)].
% 0.73/1.04 Derived: -placename(skc6,skf6(A)) | -member(skc6,B,skc7). [resolve(119,b,123,b)].
% 0.73/1.04 124 -member(skc6,A,skc7) | furniture(skc6,skf5(B)). [resolve(106,b,107,a)].
% 0.73/1.04 125 -furniture(A,B) | object(A,B). [resolve(91,b,90,a)].
% 0.73/1.04 Derived: -member(skc6,A,skc7) | object(skc6,skf5(B)). [resolve(124,b,125,a)].
% 0.73/1.04
% 0.73/1.04 ============================== end predicate elimination =============
% 0.73/1.04
% 0.73/1.04 Auto_denials: (non-Horn, no changes).
% 0.73/1.04
% 0.73/1.04 Term ordering decisions:
% 0.73/1.04 Function symbol KB weights: skc6=1. skc7=1. skc12=1. skc10=1. skc11=1. skc13=1. skf10=1. skf8=1. skf5=1. skf6=1. skf11=1.
% 0.73/1.04
% 0.73/1.04 ============================== end of process initial clauses ========
% 0.73/1.04
% 0.73/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.04
% 0.73/1.04 ============================== end of clauses for search =============
% 0.73/1.04
% 0.73/1.04 ============================== SEARCH ================================
% 0.73/1.04
% 0.73/1.04 % Starting search at 0.05 seconds.
% 0.73/1.04
% 0.73/1.04 ============================== PROOF =================================
% 0.73/1.04 % SZS status Unsatisfiable
% 0.73/1.04 % SZS output start Refutation
% 0.73/1.04
% 0.73/1.04 % Proof 1 at 0.06 (+ 0.00) seconds.
% 0.73/1.04 % Length of proof is 42.
% 0.73/1.04 % Level of proof is 6.
% 0.73/1.04 % Maximum clause weight is 8.000.
% 0.73/1.04 % Given clauses 101.
% 0.73/1.04
% 0.73/1.04 11 skf10(A,B) != skf8(A,B) | -two(B,A) # label(clause62) # label(axiom). [assumption].
% 0.73/1.04 12 two(skc6,skc7) # label(clause77) # label(negated_conjecture). [assumption].
% 0.73/1.04 14 -two(A,B) | member(A,skf10(B,A),B) # label(clause60) # label(axiom). [assumption].
% 0.73/1.04 15 -two(A,B) | member(A,skf8(B,A),B) # label(clause61) # label(axiom). [assumption].
% 0.73/1.04 38 -organism(A,B) | living(A,B) # label(clause11) # label(axiom). [assumption].
% 0.73/1.04 39 -living(A,B) | -nonliving(A,B) # label(clause55) # label(axiom). [assumption].
% 0.73/1.04 44 -object(A,B) | nonliving(A,B) # label(clause33) # label(axiom). [assumption].
% 0.73/1.04 46 -organism(A,B) | -nonliving(A,B). [resolve(38,b,39,a)].
% 0.73/1.04 47 -member(skc6,A,skc7) | fellow(skc6,A) # label(clause88) # label(negated_conjecture). [assumption].
% 0.73/1.04 48 -fellow(A,B) | man(A,B) # label(clause2) # label(axiom). [assumption].
% 0.73/1.04 49 -member(skc6,A,skc7) | man(skc6,A). [resolve(47,b,48,a)].
% 0.73/1.04 50 -man(A,B) | human_person(A,B) # label(clause3) # label(axiom). [assumption].
% 0.73/1.04 52 -member(skc6,A,skc7) | human_person(skc6,A). [resolve(49,b,50,a)].
% 0.73/1.04 53 -human_person(A,B) | organism(A,B) # label(clause4) # label(axiom). [assumption].
% 0.73/1.04 56 -member(skc6,A,skc7) | organism(skc6,A). [resolve(52,b,53,a)].
% 0.73/1.04 59 -organism(A,B) | -object(A,B). [resolve(46,b,44,b)].
% 0.73/1.04 86 -furniture(A,B) | instrumentality(A,B) # label(clause50) # label(axiom). [assumption].
% 0.73/1.04 87 -instrumentality(A,B) | artifact(A,B) # label(clause30) # label(axiom). [assumption].
% 0.73/1.04 90 -artifact(A,B) | object(A,B) # label(clause31) # label(axiom). [assumption].
% 0.73/1.04 91 -furniture(A,B) | artifact(A,B). [resolve(86,b,87,a)].
% 0.73/1.04 104 -member(skc6,A,skc7) | frontseat(skc6,skf5(B)) # label(clause89) # label(negated_conjecture). [assumption].
% 0.73/1.04 105 -frontseat(A,B) | seat(A,B) # label(clause48) # label(axiom). [assumption].
% 0.73/1.04 106 -member(skc6,A,skc7) | seat(skc6,skf5(B)). [resolve(104,b,105,a)].
% 0.73/1.04 107 -seat(A,B) | furniture(A,B) # label(clause49) # label(axiom). [assumption].
% 0.73/1.04 108 -member(skc6,A,skc7) | be(skc6,skf6(A),A,skf5(A)) # label(clause92) # label(negated_conjecture). [assumption].
% 0.73/1.04 109 -be(A,B,C,D) | C = D # label(clause59) # label(axiom). [assumption].
% 0.73/1.04 124 -member(skc6,A,skc7) | furniture(skc6,skf5(B)). [resolve(106,b,107,a)].
% 0.73/1.04 125 -furniture(A,B) | object(A,B). [resolve(91,b,90,a)].
% 0.73/1.04 132 skf10(skc7,skc6) != skf8(skc7,skc6). [resolve(11,b,12,a)].
% 0.73/1.04 133 skf8(skc7,skc6) != skf10(skc7,skc6). [copy(132),flip(a)].
% 0.73/1.04 134 member(skc6,skf10(skc7,skc6),skc7). [resolve(14,a,12,a)].
% 0.73/1.04 135 member(skc6,skf8(skc7,skc6),skc7). [resolve(15,a,12,a)].
% 0.73/1.04 158 -member(skc6,A,skc7) | -object(skc6,A). [resolve(56,b,59,a)].
% 0.73/1.04 175 -member(skc6,A,skc7) | A = skf5(A). [resolve(108,b,109,a)].
% 0.73/1.04 176 -member(skc6,A,skc7) | skf5(A) = A. [copy(175),flip(b)].
% 0.73/1.04 186 -member(skc6,A,skc7) | object(skc6,skf5(B)). [resolve(124,b,125,a)].
% 0.73/1.04 187 skf8(skc7,skc6) = c_0. [new_symbol(133)].
% 0.73/1.04 201 member(skc6,c_0,skc7). [back_rewrite(135),rewrite([187(4)])].
% 0.73/1.04 235 object(skc6,skf5(A)). [resolve(186,a,134,a)].
% 0.73/1.04 237 skf5(c_0) = c_0. [resolve(201,a,176,a)].
% 0.73/1.04 240 -object(skc6,c_0). [resolve(201,a,158,a)].
% 0.73/1.04 251 $F. [para(237(a,1),235(a,2)),unit_del(a,240)].
% 0.73/1.04
% 0.73/1.04 % SZS output end Refutation
% 0.73/1.04 ============================== end of proof ==========================
% 0.73/1.04
% 0.73/1.04 ============================== STATISTICS ============================
% 0.73/1.04
% 0.73/1.04 Given=101. Generated=302. Kept=116. proofs=1.
% 0.73/1.04 Usable=96. Sos=12. Demods=3. Limbo=0, Disabled=197. Hints=0.
% 0.73/1.04 Megabytes=0.18.
% 0.73/1.04 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.73/1.04
% 0.73/1.04 ============================== end of statistics =====================
% 0.73/1.04
% 0.73/1.04 ============================== end of search =========================
% 0.73/1.04
% 0.73/1.04 THEOREM PROVED
% 0.73/1.04 % SZS status Unsatisfiable
% 0.73/1.04
% 0.73/1.04 Exiting with 1 proof.
% 0.73/1.04
% 0.73/1.04 Process 7250 exit (max_proofs) Fri Jul 1 04:02:08 2022
% 0.73/1.04 Prover9 interrupted
%------------------------------------------------------------------------------