TSTP Solution File: NLP040-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP040-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:05:51 EDT 2022
% Result : Unknown 0.71s 1.08s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NLP040-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 30 23:58:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.41/0.99 ============================== Prover9 ===============================
% 0.41/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.99 Process 348 was started by sandbox on n025.cluster.edu,
% 0.41/0.99 Thu Jun 30 23:58:39 2022
% 0.41/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32663_n025.cluster.edu".
% 0.41/0.99 ============================== end of head ===========================
% 0.41/0.99
% 0.41/0.99 ============================== INPUT =================================
% 0.41/0.99
% 0.41/0.99 % Reading from file /tmp/Prover9_32663_n025.cluster.edu
% 0.41/0.99
% 0.41/0.99 set(prolog_style_variables).
% 0.41/0.99 set(auto2).
% 0.41/0.99 % set(auto2) -> set(auto).
% 0.41/0.99 % set(auto) -> set(auto_inference).
% 0.41/0.99 % set(auto) -> set(auto_setup).
% 0.41/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.99 % set(auto) -> set(auto_limits).
% 0.41/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.99 % set(auto) -> set(auto_denials).
% 0.41/0.99 % set(auto) -> set(auto_process).
% 0.41/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.99 % set(auto2) -> assign(stats, some).
% 0.41/0.99 % set(auto2) -> clear(echo_input).
% 0.41/0.99 % set(auto2) -> set(quiet).
% 0.41/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.99 % set(auto2) -> clear(print_given).
% 0.41/0.99 assign(lrs_ticks,-1).
% 0.41/0.99 assign(sos_limit,10000).
% 0.41/0.99 assign(order,kbo).
% 0.41/0.99 set(lex_order_vars).
% 0.41/0.99 clear(print_given).
% 0.41/0.99
% 0.41/0.99 % formulas(sos). % not echoed (66 formulas)
% 0.41/0.99
% 0.41/0.99 ============================== end of input ==========================
% 0.41/0.99
% 0.41/0.99 % From the command line: assign(max_seconds, 300).
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.99
% 0.41/0.99 % Formulas that are not ordinary clauses:
% 0.41/0.99
% 0.41/0.99 ============================== end of process non-clausal formulas ===
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.99
% 0.41/0.99 ============================== PREDICATE ELIMINATION =================
% 0.41/0.99 1 -group(A,B) | set(A,B) # label(clause15) # label(axiom). [assumption].
% 0.41/0.99 2 group(skc2,skc3) # label(clause54) # label(negated_conjecture). [assumption].
% 0.41/0.99 Derived: set(skc2,skc3). [resolve(1,a,2,a)].
% 0.41/0.99 3 -three(A,B) | group(A,B) # label(clause17) # label(axiom). [assumption].
% 0.41/0.99 Derived: -three(A,B) | set(A,B). [resolve(3,b,1,a)].
% 0.41/0.99 4 -member(skc2,A,skc3) | group(skc2,skf9(B)) # label(clause57) # label(negated_conjecture). [assumption].
% 0.41/0.99 Derived: -member(skc2,A,skc3) | set(skc2,skf9(B)). [resolve(4,b,1,a)].
% 0.41/0.99 5 -man(A,B) | male(A,B) # label(clause14) # label(axiom). [assumption].
% 0.41/0.99 6 -male(A,B) | -unisex(A,B) # label(clause37) # label(axiom). [assumption].
% 0.41/0.99 Derived: -man(A,B) | -unisex(A,B). [resolve(5,b,6,a)].
% 0.41/0.99 7 -set(A,B) | multiple(A,B) # label(clause16) # label(axiom). [assumption].
% 0.41/0.99 8 -multiple(A,B) | -singleton(A,B) # label(clause38) # label(axiom). [assumption].
% 0.41/0.99 Derived: -set(A,B) | -singleton(A,B). [resolve(7,b,8,a)].
% 0.41/0.99 9 -organism(A,B) | living(A,B) # label(clause11) # label(axiom). [assumption].
% 0.41/0.99 10 -living(A,B) | -nonliving(A,B) # label(clause39) # label(axiom). [assumption].
% 0.41/0.99 Derived: -organism(A,B) | -nonliving(A,B). [resolve(9,b,10,a)].
% 0.41/0.99 11 -eventuality(A,B) | nonexistent(A,B) # label(clause31) # label(axiom). [assumption].
% 0.41/0.99 12 -nonexistent(A,B) | -existent(A,B) # label(clause40) # label(axiom). [assumption].
% 0.41/0.99 Derived: -eventuality(A,B) | -existent(A,B). [resolve(11,b,12,a)].
% 0.41/0.99 13 -object(A,B) | nonliving(A,B) # label(clause24) # label(axiom). [assumption].
% 0.41/0.99 14 -nonliving(A,B) | -animate(A,B) # label(clause41) # label(axiom). [assumption].
% 0.41/0.99 Derived: -object(A,B) | -animate(A,B). [resolve(13,b,14,a)].
% 0.41/0.99 15 -organism(A,B) | -nonliving(A,B). [resolve(9,b,10,a)].
% 0.41/0.99 Derived: -organism(A,B) | -object(A,B). [resolve(15,b,13,b)].
% 0.41/0.99 16 -member(skc2,A,skc3) | three(skc2,skf9(B)) # label(clause56) # label(negated_conjecture). [assumption].
% 0.41/0.99 17 skf18(A,B) != skf14(A,B) | -three(B,A) # label(clause45) # label(axiom). [assumption].
% 0.41/0.99 18 skf18(A,B) != skf16(A,B) | -three(B,A) # label(clause46) # label(axiom). [assumption].
% 0.41/0.99 19 skf16(A,B) != skf14(A,B) | -three(B,A) # label(clause47) # label(axiom). [assumption].
% 0.41/0.99 Derived: -member(skc2,A,skc3) | skf18(skf9(B),skc2) != skf14(skf9(B),skc2). [resolve(16,b,17,b)].
% 0.41/0.99 Derived: -member(skc2,A,skc3) | skf18(skf9(B),skc2) != skf16(skf9(B),skc2). [resolve(16,b,18,b)].
% 0.41/0.99 Derived: -member(skc2,A,skc3) | skf16(skf9(B),skc2) != skf14(skf9(B),skc2). [resolve(16,b,19,b)].
% 0.41/0.99 20 -three(A,B) | member(A,skf18(B,A),B) # label(clause42) # label(axiom). [assumption].
% 0.41/0.99 Derived: member(skc2,skf18(skf9(A),skc2),skf9(A)) | -member(skc2,B,skc3). [resolve(20,a,16,b)].
% 0.41/0.99 21 -three(A,B) | member(A,skf16(B,A),B) # label(clause43) # label(axiom). [assumption].
% 0.41/0.99 Derived: member(skc2,skf16(skf9(A),skc2),skf9(A)) | -member(skc2,B,skc3). [resolve(21,a,16,b)].
% 0.41/0.99 22 -three(A,B) | member(A,skf14(B,A),B) # label(clause44) # label(axiom). [assumption].
% 0.41/0.99 Derived: member(skc2,skf14(skf9(A),skc2),skf9(A)) | -member(skc2,B,skc3). [resolve(22,a,16,b)].
% 0.41/0.99 23 -member(A,B,C) | -three(A,C) | B = skf14(C,A) | B = skf16(C,A) | B = skf18(C,A) # label(clause48) # label(axiom). [assumption].
% 0.41/0.99 Derived: -member(skc2,A,skf9(B)) | A = skf14(skf9(B),skc2) | A = skf16(skf9(B),skc2) | A = skf18(skf9(B),skc2) | -member(skc2,C,skc3). [resolve(23,b,16,b)].
% 0.41/0.99 24 skf19(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | three(F,V6) | A = V8 | A = V7 | V7 = V8 # label(clause49) # label(axiom). [assumption].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | skf18(V6,F) != skf14(V6,F). [resolve(24,e,17,b)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | skf18(V6,F) != skf16(V6,F). [resolve(24,e,18,b)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | skf16(V6,F) != skf14(V6,F). [resolve(24,e,19,b)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | member(F,skf18(V6,F),V6). [resolve(24,e,20,a)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | member(F,skf16(V6,F),V6). [resolve(24,e,21,a)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | member(F,skf14(V6,F),V6). [resolve(24,e,22,a)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | -member(F,V9,V6) | V9 = skf14(V6,F) | V9 = skf16(V6,F) | V9 = skf18(V6,F). [resolve(24,e,23,b)].
% 0.41/0.99 25 skf19(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | three(F,V6) | A = V7 | A = B | B = V7 # label(clause50) # label(axiom). [assumption].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | skf18(V6,F) != skf14(V6,F). [resolve(25,e,17,b)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | skf18(V6,F) != skf16(V6,F). [resolve(25,e,18,b)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | skf16(V6,F) != skf14(V6,F). [resolve(25,e,19,b)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | member(F,skf18(V6,F),V6). [resolve(25,e,20,a)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | member(F,skf16(V6,F),V6). [resolve(25,e,21,a)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | member(F,skf14(V6,F),V6). [resolve(25,e,22,a)].
% 0.41/0.99 Derived: skf19(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | -member(F,V8,V6) | V8 = skf14(V6,F) | V8 = skf16(V6,F) | V8 = skf18(V6,F). [resolve(25,e,23,b)].
% 0.41/1.00 26 skf19(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | three(F,V6) | A = C | A = B | B = C # label(clause51) # label(axiom). [assumption].
% 0.41/1.00 Derived: skf19(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | skf18(V6,F) != skf14(V6,F). [resolve(26,e,17,b)].
% 0.41/1.00 Derived: skf19(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | skf18(V6,F) != skf16(V6,F). [resolve(26,e,18,b)].
% 0.41/1.00 Derived: skf19(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | skf16(V6,F) != skf14(V6,F). [resolve(26,e,19,b)].
% 0.41/1.00 Derived: skf19(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | member(F,skf18(V6,F),V6). [resolve(26,e,20,a)].
% 0.41/1.00 Derived: skf19(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | member(F,skf16(V6,F),V6). [resolve(26,e,21,a)].
% 0.41/1.00 Derived: skf19(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | member(F,skf14(V6,F),V6). [resolve(26,e,22,a)].
% 0.41/1.00 Derived: skf19(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | -member(F,V7,V6) | V7 = skf14(V6,F) | V7 = skf16(V6,F) | V7 = skf18(V6,F). [resolve(26,e,23,b)].
% 0.41/1.00 27 -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | three(A,C) | member(A,skf19(B,D,E,C,A),C) | B = E | B = D | D = E # label(clause52) # label(axiom). [assumption].
% 0.41/1.00 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf19(B,D,E,C,A),C) | B = E | B = D | D = E | skf18(C,A) != skf14(C,A). [resolve(27,d,17,b)].
% 0.41/1.00 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf19(B,D,E,C,A),C) | B = E | B = D | D = E | skf18(C,A) != skf16(C,A). [resolve(27,d,18,b)].
% 0.41/1.00 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf19(B,D,E,C,A),C) | B = E | B = D | D = E | skf16(C,A) != skf14(C,A). [resolve(27,d,19,b)].
% 0.41/1.00 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf19(B,D,E,C,A),C) | B = E | B = D | D = E | member(A,skf18(C,A),C). [resolve(27,d,20,a)].
% 0.41/1.00 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf19(B,D,E,C,A),C) | B = E | B = D | D = E | member(A,skf16(C,A),C). [resolve(27,d,21,a)].
% 0.41/1.00 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf19(B,D,E,C,A),C) | B = E | B = D | D = E | member(A,skf14(C,A),C). [resolve(27,d,22,a)].
% 0.41/1.00 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf19(B,D,E,C,A),C) | B = E | B = D | D = E | -member(A,F,C) | F = skf14(C,A) | F = skf16(C,A) | F = skf18(C,A). [resolve(27,d,23,b)].
% 0.41/1.00 28 -three(A,B) | set(A,B). [resolve(3,b,1,a)].
% 0.41/1.00 Derived: set(A,B) | skf19(C,D,E,F,V6) != C | -member(A,C,B) | -member(A,V7,B) | -member(A,V8,B) | C = V8 | C = V7 | V7 = V8. [resolve(28,a,24,e)].
% 0.41/1.00 Derived: set(A,B) | skf19(C,D,E,F,V6) != D | -member(A,C,B) | -member(A,D,B) | -member(A,V7,B) | C = V7 | C = D | D = V7. [resolve(28,a,25,e)].
% 0.41/1.00 Derived: set(A,B) | skf19(C,D,E,F,V6) != E | -member(A,C,B) | -member(A,D,B) | -member(A,E,B) | C = E | C = D | D = E. [resolve(28,a,26,e)].
% 0.41/1.00 Derived: set(A,B) | -member(A,C,B) | -member(A,D,B) | -member(A,E,B) | member(A,skf19(C,D,E,B,A),B) | C = E | C = D | D = E. [resolve(28,a,27,d)].
% 0.41/1.00 29 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | guy(skc2,A) # label(clause59) # label(negated_conjecture). [assumption].
% 0.41/1.00 30 -guy(A,B) | man(A,B) # label(clause2) # label(axiom). [assumption].
% 0.41/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | man(skc2,A). [resolve(29,c,30,a)].
% 0.41/1.00 31 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | man(skc2,A). [resolve(29,c,30,a)].
% 0.41/1.00 32 -man(A,B) | human_person(A,B) # label(clause3) # label(axiom). [assumption].
% 0.41/1.00 33 -man(A,B) | -unisex(A,B). [resolve(5,b,6,a)].
% 0.41/1.00 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | human_person(skc2,A). [resolve(31,c,32,a)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | -unisex(skc2,A). [resolve(31,c,33,a)].
% 0.41/1.01 34 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | human_person(skc2,A). [resolve(31,c,32,a)].
% 0.41/1.01 35 -human_person(A,B) | organism(A,B) # label(clause4) # label(axiom). [assumption].
% 0.41/1.01 36 -human_person(A,B) | human(A,B) # label(clause12) # label(axiom). [assumption].
% 0.41/1.01 37 -human_person(A,B) | animate(A,B) # label(clause13) # label(axiom). [assumption].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | organism(skc2,A). [resolve(34,c,35,a)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | human(skc2,A). [resolve(34,c,36,a)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | animate(skc2,A). [resolve(34,c,37,a)].
% 0.41/1.01 38 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | organism(skc2,A). [resolve(34,c,35,a)].
% 0.41/1.01 39 -organism(A,B) | entity(A,B) # label(clause5) # label(axiom). [assumption].
% 0.41/1.01 40 -organism(A,B) | impartial(A,B) # label(clause10) # label(axiom). [assumption].
% 0.41/1.01 41 -organism(A,B) | -object(A,B). [resolve(15,b,13,b)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | entity(skc2,A). [resolve(38,c,39,a)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | impartial(skc2,A). [resolve(38,c,40,a)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | -object(skc2,A). [resolve(38,c,41,a)].
% 0.41/1.01 42 -object(A,B) | entity(A,B) # label(clause23) # label(axiom). [assumption].
% 0.41/1.01 43 -entity(A,B) | thing(A,B) # label(clause6) # label(axiom). [assumption].
% 0.41/1.01 44 -entity(A,B) | specific(A,B) # label(clause8) # label(axiom). [assumption].
% 0.41/1.01 45 -entity(A,B) | existent(A,B) # label(clause9) # label(axiom). [assumption].
% 0.41/1.01 Derived: -object(A,B) | thing(A,B). [resolve(42,b,43,a)].
% 0.41/1.01 Derived: -object(A,B) | specific(A,B). [resolve(42,b,44,a)].
% 0.41/1.01 Derived: -object(A,B) | existent(A,B). [resolve(42,b,45,a)].
% 0.41/1.01 46 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | entity(skc2,A). [resolve(38,c,39,a)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | thing(skc2,A). [resolve(46,c,43,a)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | specific(skc2,A). [resolve(46,c,44,a)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | existent(skc2,A). [resolve(46,c,45,a)].
% 0.41/1.01 47 -eventuality(A,B) | thing(A,B) # label(clause29) # label(axiom). [assumption].
% 0.41/1.01 48 -thing(A,B) | singleton(A,B) # label(clause7) # label(axiom). [assumption].
% 0.41/1.01 Derived: -eventuality(A,B) | singleton(A,B). [resolve(47,b,48,a)].
% 0.41/1.01 49 -object(A,B) | thing(A,B). [resolve(42,b,43,a)].
% 0.41/1.01 Derived: -object(A,B) | singleton(A,B). [resolve(49,b,48,a)].
% 0.41/1.01 50 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | thing(skc2,A). [resolve(46,c,43,a)].
% 0.41/1.01 Derived: -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | singleton(skc2,A). [resolve(50,c,48,a)].
% 0.41/1.01 51 -member(skc2,A,skc3) | hamburger(skc2,A) # label(clause55) # label(negated_conjecture). [assumption].
% 0.41/1.01 52 -hamburger(A,B) | burger(A,B) # label(clause18) # label(axiom). [assumption].
% 0.41/1.01 Derived: -member(skc2,A,skc3) | burger(skc2,A). [resolve(51,b,52,a)].
% 0.41/1.01 53 -member(skc2,A,skc3) | burger(skc2,A). [resolve(51,b,52,a)].
% 0.41/1.01 54 -burger(A,B) | meat(A,B) # label(clause19) # label(axiom). [assumption].
% 0.41/1.01 Derived: -member(skc2,A,skc3) | meat(skc2,A). [resolve(53,b,54,a)].
% 0.41/1.01 55 -member(skc2,A,skc3) | meat(skc2,A). [resolve(53,b,54,a)].
% 0.41/1.01 56 -meat(A,B) | food(A,B) # label(clause20) # label(axiom). [assumption].
% 0.41/1.01 Derived: -member(skc2,A,skc3) | food(skc2,A). [resolve(55,b,56,a)].
% 0.41/1.01 57 -member(skc2,A,skc3) | food(skc2,A). [resolve(55,b,56,a)].
% 0.41/1.01 58 -food(A,B) | substance_matter(A,B) # label(clause21) # label(axiom). [assumption].
% 0.41/1.01 Derived: -member(skc2,A,skc3) | substance_matter(skc2,A). [resolve(57,b,58,a)].
% 0.41/1.01 59 -member(skc2,A,skc3) | substance_matter(skc2,A). [resolve(57,b,58,a)].
% 0.41/1.01 60 -substance_matter(A,B) | object(A,B) # label(clause22) # label(axiom). [assumption].
% 0.41/1.01 Derived: -member(skc2,A,skc3) | object(skc2,A). [resolve(59,b,60,a)].
% 0.41/1.01 61 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | sit(skc2,skf12(C,D)) # label(clause63) # label(negated_conjecture). [assumption].
% 0.41/1.01 62 -sit(A,B) | event(A,B) # label(clause27) # label(axiom). [assumption].
% 0.41/1.02 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | event(skc2,skf12(C,D)). [resolve(61,c,62,a)].
% 0.41/1.02 63 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | event(skc2,skf12(C,D)) # label(clause61) # label(negated_conjecture). [assumption].
% 0.41/1.02 64 -event(A,B) | eventuality(A,B) # label(clause28) # label(axiom). [assumption].
% 0.41/1.02 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | eventuality(skc2,skf12(C,D)). [resolve(63,c,64,a)].
% 0.41/1.02 65 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | event(skc2,skf12(C,D)). [resolve(61,c,62,a)].
% 0.41/1.02 66 -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | eventuality(skc2,skf12(C,D)). [resolve(63,c,64,a)].
% 0.41/1.02 67 -eventuality(A,B) | specific(A,B) # label(clause30) # label(axiom). [assumption].
% 0.41/1.02 68 -eventuality(A,B) | unisex(A,B) # label(clause32) # label(axiom). [assumption].
% 0.41/1.02 69 -eventuality(A,B) | -existent(A,B). [resolve(11,b,12,a)].
% 0.41/1.02 70 -eventuality(A,B) | singleton(A,B). [resolve(47,b,48,a)].
% 0.41/1.02 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | specific(skc2,skf12(C,D)). [resolve(66,c,67,a)].
% 0.41/1.02 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | unisex(skc2,skf12(C,D)). [resolve(66,c,68,a)].
% 0.41/1.02 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | -existent(skc2,skf12(C,D)). [resolve(66,c,69,a)].
% 0.41/1.02 Derived: -member(skc2,A,skf9(B)) | -member(skc2,B,skc3) | singleton(skc2,skf12(C,D)). [resolve(66,c,70,a)].
% 0.41/1.02 71 -member(skc2,A,skc3) | table(skc2,skf11(B)) # label(clause58) # label(negated_conjecture). [assumption].
% 0.41/1.02 72 -table(A,B) | furniture(A,B) # label(clause33) # label(axiom). [assumption].
% 0.41/1.02 Derived: -member(skc2,A,skc3) | furniture(skc2,skf11(B)). [resolve(71,b,72,a)].
% 0.41/1.02 73 -member(skc2,A,skc3) | furniture(skc2,skf11(B)). [resolve(71,b,72,a)].
% 0.41/1.02 74 -furniture(A,B) | instrumentality(A,B) # label(clause34) # label(axiom). [assumption].
% 0.41/1.02 Derived: -member(skc2,A,skc3) | instrumentality(skc2,skf11(B)). [resolve(73,b,74,a)].
% 0.41/1.02 75 -member(skc2,A,skc3) | instrumentality(skc2,skf11(B)). [resolve(73,b,74,a)].
% 0.41/1.02 76 -instrumentality(A,B) | artifact(A,B) # label(clause35) # label(axiom). [assumption].
% 0.41/1.02 Derived: -member(skc2,A,skc3) | artifact(skc2,skf11(B)). [resolve(75,b,76,a)].
% 0.41/1.02 77 -member(skc2,A,skc3) | artifact(skc2,skf11(B)). [resolve(75,b,76,a)].
% 0.41/1.02 78 -artifact(A,B) | object(A,B) # label(clause36) # label(axiom). [assumption].
% 0.41/1.02 Derived: -member(skc2,A,skc3) | object(skc2,skf11(B)). [resolve(77,b,78,a)].
% 0.41/1.02 79 -set(A,B) | -singleton(A,B). [resolve(7,b,8,a)].
% 0.41/1.02 80 set(skc2,skc3). [resolve(1,a,2,a)].
% 0.41/1.02 81 -member(skc2,A,skc3) | set(skc2,skf9(B)). [resolve(4,b,1,a)].
% 0.41/1.02 Derived: -singleton(skc2,skc3). [resolve(79,a,80,a)].
% 0.41/1.02 Derived: -singleton(skc2,skf9(A)) | -member(skc2,B,skc3). [resolve(79,a,81,b)].
% 0.41/1.02 82 set(A,B) | skf19(C,D,E,F,V6) != C | -member(A,C,B) | -member(A,V7,B) | -member(A,V8,B) | C = V8 | C = V7 | V7 = V8. [resolve(28,a,24,e)].
% 0.41/1.02 Derived: skf19(A,B,C,D,E) != A | -member(F,A,V6) | -member(F,V7,V6) | -member(F,V8,V6) | A = V8 | A = V7 | V7 = V8 | -singleton(F,V6). [resolve(82,a,79,a)].
% 0.41/1.02 83 set(A,B) | skf19(C,D,E,F,V6) != D | -member(A,C,B) | -member(A,D,B) | -member(A,V7,B) | C = V7 | C = D | D = V7. [resolve(28,a,25,e)].
% 0.41/1.02 Derived: skf19(A,B,C,D,E) != B | -member(F,A,V6) | -member(F,B,V6) | -member(F,V7,V6) | A = V7 | A = B | B = V7 | -singleton(F,V6). [resolve(83,a,79,a)].
% 0.41/1.02 84 set(A,B) | skf19(C,D,E,F,V6) != E | -member(A,C,B) | -member(A,D,B) | -member(A,E,B) | C = E | C = D | D = E. [resolve(28,a,26,e)].
% 0.41/1.02 Derived: skf19(A,B,C,D,E) != C | -member(F,A,V6) | -member(F,B,V6) | -member(F,C,V6) | A = C | A = B | B = C | -singleton(F,V6). [resolve(84,a,79,a)].
% 0.41/1.02 85 set(A,B) | -member(A,C,B) | -member(A,D,B) | -member(A,E,B) | member(A,skf19(C,D,E,B,A),B) | C = E | C = D | D = E. [resolve(28,a,27,d)].
% 0.41/1.02 Derived: -member(A,B,C) | -member(A,D,C) | -member(A,E,C) | member(A,skf19(B,D,E,C,A),C) | B = E | B = D | D = E | -singleton(A,C). [resolve(85,a,79,a)].
% 0.41/1.02 86 -member(skc2,A,skf9(B)) | -member(skc2,C,skc3) | animate(skc2,A). [resolve(34,c,37,a)].
% 0.41/1.02 87 -object(A,B) | -animate(A,B). [resolve(13,b,14,a)].
% 0.41/1.02
% 0.41/1.02 ============================== end predicate elimination =============
% 0.71/1.08
% 0.71/1.08 Auto_denials: (non-Horn, no changes).
% 0.71/1.08
% 0.71/1.08 Term ordering decisions:
% 0.71/1.08 Function symbol KB weights: skc2=1. skc3=1. skf14=1. skf16=1. skf18=1. skf12=1. skf9=1. skf11=1. skf19=1.
% 0.71/1.08
% 0.71/1.08 ============================== end of process initial clauses ========
% 0.71/1.08
% 0.71/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.08
% 0.71/1.08 ============================== end of clauses for search =============
% 0.71/1.08
% 0.71/1.08 ============================== SEARCH ================================
% 0.71/1.08
% 0.71/1.08 % Starting search at 0.07 seconds.
% 0.71/1.08
% 0.71/1.08 ============================== STATISTICS ============================
% 0.71/1.08
% 0.71/1.08 Given=127. Generated=836. Kept=127. proofs=0.
% 0.71/1.08 Usable=127. Sos=0. Demods=0. Limbo=0, Disabled=153. Hints=0.
% 0.71/1.08 Megabytes=0.26.
% 0.71/1.08 User_CPU=0.11, System_CPU=0.00, Wall_clock=0.
% 0.71/1.08
% 0.71/1.08 ============================== end of statistics =====================
% 0.71/1.08
% 0.71/1.08 ============================== end of search =========================
% 0.71/1.08
% 0.71/1.08 SEARCH FAILED
% 0.71/1.08
% 0.71/1.08 Exiting with failure.
% 0.71/1.08
% 0.71/1.08 Process 348 exit (sos_empty) Thu Jun 30 23:58:39 2022
% 0.71/1.08 Prover9 interrupted
%------------------------------------------------------------------------------